-
Notifications
You must be signed in to change notification settings - Fork 7
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
compatability to 0.5.1 and solvertests implemented
- Loading branch information
Showing
4 changed files
with
29 additions
and
127 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,86 +1 @@ | ||
use rustsat::{ | ||
instances::{BasicVarManager, SatInstance}, | ||
lit, | ||
solvers::{SolveIncremental, SolverResult}, | ||
}; | ||
use rustsat_batsat::BatsatBasicSolver; | ||
|
||
fn test_assumption_sequence<S: SolveIncremental>(mut solver: S) { | ||
let inst: SatInstance<BasicVarManager> = | ||
SatInstance::from_dimacs_path("./data/small.cnf").unwrap(); | ||
solver.add_cnf(inst.as_cnf().0).unwrap(); | ||
let res = solver.solve().unwrap(); | ||
assert_eq!(res, SolverResult::Sat); | ||
let res = solver.solve_assumps(&[!lit![0], !lit![1]]).unwrap(); | ||
assert_eq!(res, SolverResult::Unsat); | ||
let res = solver | ||
.solve_assumps(&[lit![0], lit![1], lit![2], lit![3]]) | ||
.unwrap(); | ||
assert_eq!(res, SolverResult::Unsat); | ||
let res = solver | ||
.solve_assumps(&[lit![0], lit![1], lit![2], !lit![3]]) | ||
.unwrap(); | ||
assert_eq!(res, SolverResult::Unsat); | ||
let res = solver | ||
.solve_assumps(&[lit![0], lit![1], !lit![2], lit![3]]) | ||
.unwrap(); | ||
assert_eq!(res, SolverResult::Unsat); | ||
let res = solver | ||
.solve_assumps(&[lit![0], lit![1], !lit![2], !lit![3]]) | ||
.unwrap(); | ||
assert_eq!(res, SolverResult::Sat); | ||
let res = solver | ||
.solve_assumps(&[lit![0], !lit![1], lit![2], lit![3]]) | ||
.unwrap(); | ||
assert_eq!(res, SolverResult::Unsat); | ||
let res = solver | ||
.solve_assumps(&[lit![0], !lit![1], lit![2], !lit![3]]) | ||
.unwrap(); | ||
assert_eq!(res, SolverResult::Sat); | ||
let res = solver | ||
.solve_assumps(&[lit![0], !lit![1], !lit![2], lit![3]]) | ||
.unwrap(); | ||
assert_eq!(res, SolverResult::Unsat); | ||
let res = solver | ||
.solve_assumps(&[lit![0], !lit![1], !lit![2], !lit![3]]) | ||
.unwrap(); | ||
assert_eq!(res, SolverResult::Unsat); | ||
let res = solver | ||
.solve_assumps(&[!lit![0], lit![1], lit![2], lit![3]]) | ||
.unwrap(); | ||
assert_eq!(res, SolverResult::Unsat); | ||
let res = solver | ||
.solve_assumps(&[!lit![0], lit![1], lit![2], !lit![3]]) | ||
.unwrap(); | ||
assert_eq!(res, SolverResult::Unsat); | ||
let res = solver | ||
.solve_assumps(&[!lit![0], lit![1], !lit![2], lit![3]]) | ||
.unwrap(); | ||
assert_eq!(res, SolverResult::Sat); | ||
let res = solver | ||
.solve_assumps(&[!lit![0], lit![1], !lit![2], !lit![3]]) | ||
.unwrap(); | ||
assert_eq!(res, SolverResult::Sat); | ||
let res = solver | ||
.solve_assumps(&[!lit![0], !lit![1], lit![2], lit![3]]) | ||
.unwrap(); | ||
assert_eq!(res, SolverResult::Unsat); | ||
let res = solver | ||
.solve_assumps(&[!lit![0], !lit![1], lit![2], !lit![3]]) | ||
.unwrap(); | ||
assert_eq!(res, SolverResult::Unsat); | ||
let res = solver | ||
.solve_assumps(&[!lit![0], !lit![1], !lit![2], lit![3]]) | ||
.unwrap(); | ||
assert_eq!(res, SolverResult::Unsat); | ||
let res = solver | ||
.solve_assumps(&[!lit![0], !lit![1], !lit![2], !lit![3]]) | ||
.unwrap(); | ||
assert_eq!(res, SolverResult::Unsat); | ||
} | ||
|
||
#[test] | ||
fn assumption_sequence() { | ||
let solver = BatsatBasicSolver::default(); | ||
test_assumption_sequence(solver); | ||
} | ||
rustsat_solvertests::incremental_tests!(rustsat_batsat::BatsatBasicSolver); |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,38 +1,3 @@ | ||
use rustsat::{ | ||
instances::{BasicVarManager, SatInstance}, | ||
solvers::{Solve, SolverResult}, | ||
}; | ||
use rustsat_batsat::BatsatBasicSolver; | ||
|
||
#[test] | ||
fn ms_segfault() { | ||
let mut solver = BatsatBasicSolver::default(); | ||
let inst: SatInstance<BasicVarManager> = | ||
SatInstance::from_dimacs_path("./data/minisat-segfault.cnf").unwrap(); | ||
solver.add_cnf(inst.as_cnf().0).unwrap(); | ||
let res = solver.solve().unwrap(); | ||
assert_eq!(res, SolverResult::Unsat); | ||
} | ||
|
||
#[test] | ||
fn small_sat() { | ||
let mut solver = BatsatBasicSolver::default(); | ||
let inst: SatInstance<BasicVarManager> = | ||
SatInstance::from_dimacs_path("./data/AProVE11-12.cnf").unwrap(); | ||
solver.add_cnf(inst.as_cnf().0).unwrap(); | ||
let res = solver.solve().unwrap(); | ||
assert_eq!(res, SolverResult::Sat); | ||
} | ||
|
||
// Note: this instance seems too hard for batsat to solve | ||
#[test] | ||
#[ignore] | ||
fn small_unsat() { | ||
let mut solver = BatsatBasicSolver::default(); | ||
let inst: SatInstance<BasicVarManager> = | ||
SatInstance::from_dimacs_path("./data/smtlib-qfbv-aigs-ext_con_032_008_0256-tseitin.cnf") | ||
.unwrap(); | ||
solver.add_cnf(inst.as_cnf().0).unwrap(); | ||
let res = solver.solve().unwrap(); | ||
assert_eq!(res, SolverResult::Unsat); | ||
mod base { | ||
rustsat_solvertests::base_tests!(rustsat_batsat::BatsatBasicSolver, false, true); | ||
} |