Implementation of a SAT solver that i have done as a part of my programming internship at institute for discrete mathematics at University of Bonn. Based on the paper written by Danstin, Goerdt et al.
run the build.sh script to compile
the software takes inputs in the DIMACS format
Sample usage:
./solve INSTANCE_NAME
where INSTANCE_NAME is the name of the file containing the SAT problem in the DIMACS format.
Paper by Danstin Goerdt et al:
Evgeny Dantsin, Andreas Goerdt, Edward A Hirsch, Ravi Kannan, Jon Kleinberg, Christos Papadimitriou, Prabhakar Raghavan, Uwe Schöning, A deterministic (2−2/(k+1))n algorithm for k-SAT based on local search, Theoretical Computer Science, Volume 289, Issue 1, 2002, Pages 69-83, ISSN 0304-3975, https://doi.org/10.1016/S0304-3975(01)00174-8. (https://www.sciencedirect.com/science/article/pii/S0304397501001748)