Create main method that runs a SAT solver given certain properties (n,m, graph properties, axioms). The following features would be useful:
- Outputs solutions/number of solutions in case of satisfiability, otherwise outputs MUS
- Methods/arguments for a "sweep" in case of unsatisfiability (seeing how removing subsets of axioms will affect results)
- An indication of progress would be useful if possible
- save graph subset and solution graphs as image files
Create main method that runs a SAT solver given certain properties (n,m, graph properties, axioms). The following features would be useful: