Crates.io | rsat-cli |
lib.rs | rsat-cli |
version | 0.1.0 |
source | src |
created_at | 2019-11-22 12:26:27.4816 |
updated_at | 2019-11-22 12:26:27.4816 |
description | SolHOP SAT Solver |
homepage | https://solhop.github.io/rsat/ |
repository | https://github.com/solhop/rsat-cli |
max_upload_size | |
id | 183474 |
size | 30,620 |
SolHop SAT Solver.
Currently, a stochastic local search based on probSAT and a CDCL solver based on MiniSAT has been implemented. More algorithms will be available soon.
This projetct is still in development. The APIs can change a lot before the first stable release v1.0.0.
cargo install rsat-cli
$ rsat --help
rsat 0.1.0
SolHOP SAT Solver
USAGE:
rsat [FLAGS] [OPTIONS] <file>
FLAGS:
-h, --help Prints help information
-p, --parallel Enables data parallelism (currently only for sls solver)
-V, --version Prints version information
OPTIONS:
-a, --alg <alg> Algorithm to use (1 -> CDCL, 2 -> SLS) [default: 1]
--max-flips <max-flips> Maxinum number of flips in each try of SLS [default: 1000]
--max-tries <max-tries> Maximum number of tries for SLS [default: 100]
ARGS:
<file> Input file in DIMACS format
rsat input.cnf -a 1
where input.cnf
is the input SAT instance in DIMACS format.
Use -a 2
to invoke the SLS solver.
Also see help for some options.
Below are some examples:
Input
c comment
p cnf 3 4
1 0
-1 -2 0
2 -3 0
-3 0
Output
SAT
1 -2 -3 0
Input
c comment
p cnf 3 4
1 0
-1 -2 0
2 -3 0
3 0
Output
UNSAT
Note: The SLS solver will never be available to prove UNSAT. It will give the best model that has been found so far.
UNKNOWN
-1 2 3 0