A SAT solver by Marko Prelevikj and Luka Zlatečan
These instructions will get you a copy of the project up and running on your local machine for development and testing purposes.
For running this project you need to have Python installed on your local machine.
Download project with git clone command.
git clone https://github.com/pr3mar/SATsolver.git
Run test with following comand:
python solver.py -i inputs/input2 -o outputs/output2 -m max
[not applicable since issue #1] The output is going to be stored in a file named by the following convention:
<output file directory>/out_<method>_<provided file name with suffix>
where method is:
greedy, shuffle, max_occ, bin_max_occ
To show strength of our solver we found an input with 497 variables and 5727 clauses which our solver managed to solve it under 3 seconds. Mentioned input is stored in /inputs folder and is named input3.txt. We run this test with method bin-max-occ (-m bin), since this is our fastest method.
Run this test with this command:
python solver.py -i inputs/input3.txt -o outputs/output3.txt -m bin
- -i/--input [required] -> Input file name
- -o/--output [required] -> Output file name
- -m/--method [optional] -> Method to solve the problem. Available options: (all|greedy|shuffle|max|bin). Default is
all
There are some prepared input files inside /inputs folder.
- Marko Prelevikj
- Luka Zlatečan