mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-08-08 04:01:22 +00:00
Code Activity

speed up consequence finding by avoiding local search whenver assumption level is reached during the initial phase

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2016-10-27 08:15:39 -07:00
parent 485372ec2a
commit 24fc19ed58
6 changed files with 29 additions and 9 deletions
Download patch file Download diff file Expand all files Collapse all files

18
src/sat/sat_solver.cpp
View file

@ -3168,8 +3168,8 @@ namespace sat {
++num_iterations;
checkpoint();
literal_set::iterator it = vars.begin(), end = vars.end();
unsigned chunk_size = 100;
for (; it != end && chunk_size > 0; ++it) {
unsigned num_resolves = 0;
for (; it != end; ++it) {
literal lit = *it;
if (value(lit) != l_undef) {
continue;
@ -3182,16 +3182,22 @@ namespace sat {
TRACE("sat", tout << "inconsistent\n";);
return l_false;
}
propagate(false);
--chunk_size;
propagate(false);
++num_resolves;
}
if (scope_lvl() == 1) {
break;
}
}
lbool is_sat;
while (true) {
if (scope_lvl() == 1 && num_resolves > 0) {
is_sat = l_undef;
break;
}
is_sat = bounded_search();
if (is_sat == l_undef) {
restart();
continue;
restart();
}
break;
}