Boolean satisfiability problem
Input
c quinn.cnf c p cnf 16 18 1 2 0 -2 -4 0 3 4 0 -4 -5 0 5 -6 0 6 -7 0 6 7 0 7 -16 0 8 -9 0 -8 -14 0 9 10 0 9 -10 0 -10 -11 0 10 12 0 11 12 0 13 14 0 14 -15 0 15 16 0
Solve it!
Options
Display statistics
(decisions, propagations, execution time, ...)
Algorithm
Auto
Conflict-driven clause learning
Apsvall's algorithm for 2-CNF
Sample problems
aim-100-1_6-no-1.cnf
aim-50-1_6-yes1-4.cnf
bf0432-007.cnf
dubois20.cnf
dubois21.cnf
dubois22.cnf
hole6.cnf
par8-1-c.cnf
quinn.cnf
simple_v3_c2.cnf
zebra_v155_c1135.cnf