Sat Solver--Minisat & sat4j Usage Report

CNF File Download: http://people.sc.fsu.edu/~jburkardt/data/cnf/cnf.html

First, Minisat

Introduction: Minisat is a minimalist solver, open source Boolean can meet the problem solver. To the SAT solver a logical proposition containing or not logical symbols as well as a number of Boolean variables, the SAT solver determines whether the logic proposition is satisfied by this expression and decides whether the proposition is tenable or not.

Download: Https://github.com/niklasso/minisat

Compile:

1. exportmroot=<minisat-dir>

2. cd {core | simp}

3. Gmake RS (or make RS)

4. CP minisat_static<minisat-dir>

Run:

Input file	Output file	of satisfaction
Simple_v3_c2.cnf	Simple_v3_c2.out	Satisfiable

Input file	Output file	of satisfaction
Aim-50-1_6-yes1-4.cnf	Aim-50-1_6-yes1-4.out	Satisfiable

Input file	Output file	of satisfaction
Aim-100-1_6-no-1.cnf	Aim-100-1_6-no-1.out	Unsatisfiable

Second, sat4j

Introduction: sat4j Based on Minisat, is a Java implementation of the SAT solver, its support to meet the problem, some of the most satisfying problems and the great problem with the right to meet.

Download: http://www.sat4j.org/

Run: Java-jar org.sat4j.core.jar <cnf file>

Input file	of satisfaction
Simple_v3_c2.cnf	Satisfiable

Input file	of satisfaction
Aim-50-1_6-yes1-4.cnf	Satisfiable

Input file	of satisfaction
Aim-100-1_6-no-1.cnf	Unsatisfiable