Here is my earlier question. But there was no full answer.
I've decided to include specific DIMACS files:
http://jarvis2.hmcloud.pl/sat/cnf.formula.10 (15.8MB)
http://jarvis2.hmcloud.pl/sat/cnf.formula.15 (53.5MB)
http://jarvis2.hmcloud.pl/sat/cnf.formula.20 (134.6MB)
Are these CNF formulas fulfilling a condition of Schaefer's theorem dichotomy?
If so, what kind?
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.
