accelerating futures
Platform
Infrastructure
Solutions
orthogona
L
abs
ACI
Contact
Login
Early access
Boolean SAT
op: sat.solve
CNF clauses → satisfying assignment. 100% at N=10, ~90% at N=25 (known failure mode).
cnf input (one clause per line, integers, negative = negated)
1 -2 3 -1 2 -3 1 2 4 -2 3 -5 -3 4 5 2 -3 5 -1 -4 5 1 -3 -5
n_vars
clauses
8
detected n_vars
5
Solve
examples
3-SAT trivial (SAT)
N=3
3-SAT N=5 phase transition
N=5
Pigeonhole (UNSAT, N=4)
N=4