SAT Solver with Conflict Optimizer

Example of use of the conflict optimizer for solving a SAT problem.

  1. x1 ∨ x2 ∨ x3 ∨ x4 ∨ x5
  2. ¬x1 ∨ ¬x2 ∨ ¬x3 ∨ ¬x4 ∨ ¬x5
  3. x1
  4. x3 ∨ ¬x4 ∨ x5
  5. x5
  6. ¬x1 ∨ x2



Queue and count: [0,0] [1,0] [2,0] [3,0] [4,0] [5,0]