Welcome to RegSTAB Home Page!

RegSTAB is a SAT-Solver able to deal with formulae patterns.

e.g. any SAT-Solver can tell you that each of the following formulae is unsatisfiable:

P 1 ∧ (P 1 ⇒ P 2 ) ∧ ¬P 2

∧ (P ⇒ P ) ∧ ¬P P 1 ∧ (P 1 ⇒ P 2 ) ∧ (P 2 ⇒ P 3 ) ∧ ¬P 3

∧ (P ⇒ P ) ∧ (P ⇒ P ) ∧ ¬P P 1 ∧ (P 1 ⇒ P 2 ) ∧ (P 2 ⇒ P 3 ) ∧ (P 3 ⇒ P 4 ) ∧ ¬P 4

∧ (P ⇒ P ) ∧ (P ⇒ P ) ∧ (P ⇒ P ) ∧ ¬P …