1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
|
//! Checker tests, that require a Solver instance, so they cannot be unit tests of the
//! varisat-checker crate.
use anyhow::Error;
use proptest::prelude::*;
use varisat::{
checker::{Checker, ProofTranscriptProcessor, ProofTranscriptStep},
dimacs::write_dimacs,
CnfFormula, ExtendFormula, Lit, ProofFormat, Solver, Var,
};
use varisat_formula::test::{conditional_pigeon_hole, sgen_unsat_formula};
proptest! {
#[test]
fn checked_unsat_via_dimacs(formula in sgen_unsat_formula(1..7usize)) {
let mut dimacs = vec![];
let mut proof = vec![];
let mut solver = Solver::new();
write_dimacs(&mut dimacs, &formula).unwrap();
solver.write_proof(&mut proof, ProofFormat::Varisat);
solver.add_dimacs_cnf(&mut &dimacs[..]).unwrap();
prop_assert_eq!(solver.solve().ok(), Some(false));
solver.close_proof().map_err(|e| TestCaseError::fail(e.to_string()))?;
drop(solver);
let mut checker = Checker::new();
checker.add_dimacs_cnf(&mut &dimacs[..]).unwrap();
checker.check_proof(&mut &proof[..]).unwrap();
}
#[test]
fn sgen_checked_unsat_incremental_clauses(formula in sgen_unsat_formula(1..7usize)) {
let mut proof = vec![];
let mut solver = Solver::new();
solver.write_proof(&mut proof, ProofFormat::Varisat);
let mut expected_models = 0;
// Add all clauses incrementally so they are recorded in the proof
solver.solve().unwrap();
expected_models += 1;
let mut last_state = Some(true);
for clause in formula.iter() {
solver.add_clause(clause);
let state = solver.solve().ok();
if state != last_state {
prop_assert_eq!(state, Some(false));
prop_assert_eq!(last_state, Some(true));
last_state = state;
}
if state == Some(true) {
expected_models += 1;
}
}
prop_assert_eq!(last_state, Some(false));
drop(solver);
#[derive(Default)]
struct FoundModels {
counter: usize,
unsat: bool,
}
impl ProofTranscriptProcessor for FoundModels {
fn process_step(
&mut self,
step: &ProofTranscriptStep,
) -> Result<(), Error> {
if let ProofTranscriptStep::Model { .. } = step {
self.counter += 1;
} else if let ProofTranscriptStep::Unsat = step {
self.unsat = true;
}
Ok(())
}
}
let mut found_models = FoundModels::default();
let mut checker = Checker::new();
checker.add_transcript(&mut found_models);
checker.check_proof(&mut &proof[..]).unwrap();
prop_assert_eq!(found_models.counter, expected_models);
prop_assert!(found_models.unsat);
}
#[test]
fn pigeon_hole_checked_unsat_assumption_core(
(enable_row, columns, formula) in conditional_pigeon_hole(1..5usize, 1..5usize),
) {
let mut proof = vec![];
let mut solver = Solver::new();
solver.write_proof(&mut proof, ProofFormat::Varisat);
let mut expected_sat = 0;
let mut expected_unsat = 0;
solver.solve().unwrap();
expected_sat += 1;
solver.add_formula(&formula);
prop_assert_eq!(solver.solve().ok(), Some(true));
expected_sat += 1;
let mut assumptions = enable_row;
assumptions.push(Lit::positive(Var::from_index(formula.var_count() + 10)));
solver.assume(&assumptions);
prop_assert_eq!(solver.solve().ok(), Some(false));
expected_unsat += 1;
let mut candidates = solver.failed_core().unwrap().to_owned();
let mut core: Vec<Lit> = vec![];
while !candidates.is_empty() {
solver.assume(&candidates[0..candidates.len() - 1]);
match solver.solve() {
Err(_) => unreachable!(),
Ok(true) => {
expected_sat += 1;
let skipped = *candidates.last().unwrap();
core.push(skipped);
let single_clause = CnfFormula::from(Some([skipped]));
solver.add_formula(&single_clause);
},
Ok(false) => {
expected_unsat += 1;
candidates = solver.failed_core().unwrap().to_owned();
}
}
}
prop_assert_eq!(core.len(), columns + 1);
drop(solver);
#[derive(Default)]
struct CountResults {
sat: usize,
unsat: usize,
}
impl ProofTranscriptProcessor for CountResults {
fn process_step(
&mut self,
step: &ProofTranscriptStep,
) -> Result<(), Error> {
match step {
ProofTranscriptStep::Model { .. } => {
self.sat += 1;
}
ProofTranscriptStep::Unsat
| ProofTranscriptStep::FailedAssumptions { .. } => {
self.unsat += 1;
}
_ => (),
}
Ok(())
}
}
let mut count_results = CountResults::default();
let mut checker = Checker::new();
checker.add_transcript(&mut count_results);
checker.check_proof(&mut &proof[..]).unwrap();
prop_assert_eq!(count_results.sat, expected_sat);
prop_assert_eq!(count_results.unsat, expected_unsat);
}
}
|
