This is an online demo of SAT solver - to solve boolean satisfiability problems.

For now, you have enter your expression in JSON format representing the conjunctive normal form - a list of list of terms. Each term is a string name optinally proceeded by "-".

See the examples.