I have a very complicated formula logical (CNF) in the file DIMACS.
The question is as follows. The formula has hundreds of millions of clauses (assume billion) and a lot of variables.
It is a reconstruction of a logic circuit.
MiniSAT returns me the result for the SAT problem very quickly (a few seconds).
Can I increase the amount of input logic circuit but time solving logical formula does not increase exponentially. It increases very slowly (and sometimes completely not increasing).
Is there any ready-made software / scripts that can help me understand why the SAT solver solves the problem so quickly?
For example, if there is the software that the input file will DIMACS, and writes the output if the formula is P class (and at which the condition?) of Schaefer's theorem dichotomy?
Schaefer's theorem dichotomy conditions:
all relations which are not constantly false are true when all its arguments are true;
all relations which are not constantly false are true when all its arguments are false;
all relations are equivalent to a conjunction of binary clauses;
all relations are equivalent to a conjunction of Horn clauses;
all relations are equivalent to a conjunction of dual-Horn clauses;
all relations are equivalent to a conjunction of affine formulae.
