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

rename to try_congruence and add conditions

Browse source
This commit is contained in:
Jakob Rath 2023-08-18 17:11:46 +02:00
parent 1316e1c881
commit d567d3b7f2
2 changed files with 13 additions and 7 deletions
Download patch file Download diff file Expand all files Collapse all files

18
src/math/polysat/saturation.cpp
View file

@ -76,7 +76,7 @@ namespace polysat {
return false;
if (try_nonzero_upper_extract(v, core, i))
prop = true;
if (try_ugt_eq(v, core, i))
if (try_congruence(v, core, i))
prop = true;
if (try_mul_bounds(v, core, i))
prop = true;
@ -111,20 +111,26 @@ namespace polysat {
return prop;
}
bool saturation::try_ugt_eq(pvar x, conflict& core, inequality const& i) {
set_rule("egraph(x == y) & p(x,y) > q(x,y) ==> p(y,y) > q(y,y)");
if (!i.is_strict())
return false;
bool saturation::try_congruence(pvar x, conflict& core, inequality const& i) {
set_rule("egraph(x == y) & C(x,y) ==> C(y,y)");
// TODO: generalize to other constraint types?
// if (!i.is_strict())
// return false;
// if (!core.vars().contains(x))
// return false;
if (!i.as_signed_constraint().contains_var(x))
return false;
for (pvar y : s.m_slicing.equivalent_vars(x)) {
if (x == y)
continue;
if (!s.is_assigned(y))
continue;
if (!core.vars().contains(y))
continue;
if (!i.as_signed_constraint().contains_var(y))
continue;
// does inequality become false by plugging in x = y?
SASSERT_EQ(s.get_level(y), s.get_level(x)); // propagated by slicing egraph since they are equivalent
SASSERT(s.m_search.get_pvar_index(y) < s.m_search.get_pvar_index(x)); // y was the earlier one since we are currently resolving x
pdd const lhs = i.lhs().subst_pdd(x, s.var(y));
pdd const rhs = i.rhs().subst_pdd(x, s.var(y));
signed_constraint c = ineq(true, lhs, rhs);

2
src/math/polysat/saturation.h
View file

@ -122,7 +122,7 @@ namespace polysat {
bool try_div_monotonicity(conflict& core);
bool try_nonzero_upper_extract(pvar v, conflict& core, inequality const& i);
bool try_ugt_eq(pvar v, conflict& core, inequality const& i);
bool try_congruence(pvar v, conflict& core, inequality const& i);
rational round(rational const& M, rational const& x);