polynomial sat solver — 10 techniques + uniform walk — zero dependencies
Submit
Gallery
Unsolved
Detail
Submit a SAT Instance
or try:
The P / NP / P Sandwich
P-Left
NP Strip
P-Right
P-Left — low clause/variable ratio — under-constrained, BCP + pure literals solve it NP Strip — phase transition (~4.267 for 3-SAT) — isomorphism + rephrase + uniform walk P-Right — high ratio — over-constrained, probe + eliminate prove UNSAT fast
11 polynomial techniques chain until fixpoint. The isomorphic transform learns implied clauses.
Rephrase substitutes complex clauses with shorter equivalents, then uniformizes to k-SAT for the walk.