A simple SAT solver which uses Tseytin Transformation for conversion of expressions to CNF and uses the following algorithms to find a satisfying assignment for the expression
- 2-SAT: O(N)
- HORN-SAT: O(N)
- DPLL: O(2N)
- Testing code
- Unit propagation during assignments
- CDCL algorithm