SATSolver

A basic implementation of the DPLL algorithm with unit propagation and backtracking to check if a given set of clauses is Satisfiable and also provide a satisfying assigment if that's the case.

Input file format: DIMACS

To run the SAT Solver:

(Reqd. C++17)

Step 1 ./build.sh
Step 2 ./solve.sh <input-filename>

Output format:

SAT: outputs sat and returns with exit code 10. UNSAT: outputs unsat and returns with exit code 20.