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

try_eval constraints when adding clause

Browse source 
(fix assertion in bench15)
This commit is contained in:
Jakob Rath 2023-01-31 15:15:08 +01:00
parent e8163b1769
commit 9916a76543
2 changed files with 2 additions and 4 deletions
Download patch file Download diff file Expand all files Collapse all files

4
src/math/polysat/op_constraint.cpp
View file

@ -183,8 +183,6 @@ namespace polysat {
case code::lshr_op:
break;
case code::shl_op:
// TODO: if shift amount is constant p << k, then add p << k == p*2^k
// NOTE: we do that now as simplification in constraint_manager::shl
break;
case code::and_op:
// handle masking of high order bits
@ -643,7 +641,7 @@ namespace polysat {
if (rv.is_zero())
return s.mk_clause(~invc, ~s.eq(r()), s.eq(p()), true);
// p assigned ==> r = pseudo_inverse(eval(p))
// forward propagation: p assigned ==> r = pseudo_inverse(eval(p))
// TODO: (later) this should be propagated instead of adding a clause
if (pv.is_val() && !rv.is_val())
return s.mk_clause(~invc, ~s.eq(p(), pv), s.eq(r(), pv.val().pseudo_inverse(m.power_of_2())), true);

2
src/math/polysat/solver.cpp
View file

@ -1229,7 +1229,7 @@ namespace polysat {
clause_ref solver::mk_clause(unsigned n, signed_constraint const* cs, bool is_redundant) {
clause_builder cb(*this);
for (unsigned i = 0; i < n; ++i)
cb.insert(cs[i]);
cb.insert_try_eval(cs[i]);
cb.set_redundant(is_redundant);
return cb.build();
}