mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-08-26 13:06:05 +00:00
Code Activity

First try to generalize variable elimination

Browse source
This commit is contained in:
Clemens Eisenhofer 2022-11-20 11:04:12 +01:00
parent adc9f7abe4
commit 98d572b48b
9 changed files with 218 additions and 31 deletions
Download patch file Download diff file Expand all files Collapse all files

10
src/math/polysat/constraint_manager.cpp
View file

@ -277,10 +277,12 @@ namespace polysat {
auto& m = a.manager();
unsigned sz = m.power_of_2();
if (a.is_val() && b.is_val()) {
// TODO: just evaluate?
rational r;
rational q = machine_div_rem(a.val(), b.val(), r);
return { m.mk_val(r), m.mk_val(q) };
}
constraint_dedup::quot_rem_args args({a, b});
constraint_dedup::quot_rem_args args({ a, b });
auto it = m_dedup.quot_rem_expr.find_iterator(args);
if (it != m_dedup.quot_rem_expr.end())
return { m.mk_var(it->m_value.first), m.mk_var(it->m_value.second) };
@ -297,13 +299,13 @@ namespace polysat {
// b = 0 ==> q = -1
s.add_eq(a, b * q + r);
s.add_umul_noovfl(b, q);
s.add_ule(r, b*q+r);
s.add_ule(r, b * q + r);
auto c_eq = eq(b);
s.add_clause(c_eq, ult(r, b), false);
s.add_clause(~c_eq, eq(q + 1), false);
return {q, r};
return { q, r };
}
pdd constraint_manager::bnot(pdd const& p) {