mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2026-03-06 05:14:55 +00:00
Code Activity

update function that propagates bounds on x*y = 0 to be more comprehensive

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2022-12-05 01:19:26 -08:00
parent 1d440ac871
commit f2c228f160
4 changed files with 81 additions and 22 deletions
Download patch file Download diff file Expand all files Collapse all files

14
src/math/polysat/conflict.cpp
View file

@ -74,12 +74,11 @@ namespace polysat {
// If they create propagations or conflict lemmas we select the
// tightest propagation as part of backjumping.
//
bool try_resolve_value(pvar v, conflict& core) {
void try_resolve_value(pvar v, conflict& core) {
if (m_poly_sup.perform(v, core))
return true;
return;
if (m_saturation.perform(v, core))
return true;
return false;
return;
}
// Analyse current conflict core to extract additional lemmas
@ -402,7 +401,7 @@ namespace polysat {
logger().log(inf_resolve_with_assignment(s, lit, c));
}
bool conflict::resolve_value(pvar v) {
void conflict::resolve_value(pvar v) {
SASSERT(contains_pvar(v));
SASSERT(s.m_justification[v].is_propagation());
@ -422,10 +421,7 @@ namespace polysat {
// the return value should not influence resolution. Indeed the code in solver.cpp
// just ignores the return value. It seems this function should not have a return value.
//
if (m_resolver->try_resolve_value(v, *this))
return true;
return false;
m_resolver->try_resolve_value(v, *this);
}
clause_ref conflict::build_lemma() {