mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-10-16 20:40:27 +00:00
Code Activity

added updated bounds propagation

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2022-12-23 12:47:17 -08:00
parent 6f8fb39bc9
commit 9fefa0040f
3 changed files with 59 additions and 2 deletions
Download patch file Download diff file Expand all files Collapse all files

37
src/math/polysat/viable.cpp
View file

@ -643,6 +643,43 @@ namespace polysat {
return query<query_t::max_viable>(v, hi);
}
bool viable::has_upper_bound(pvar v, rational& out_hi, signed_constraint& out_c) {
entry const* first = m_units[v];
entry const* e = first;
do {
if (!e->refined) {
verbose_stream() << "has-upper-bound " << e->src << " " << e->interval << "\n";
auto const& lo = e->interval.lo();
auto const& hi = e->interval.hi();
if (lo.is_val() && hi.is_val() && lo.val() > hi.val()) {
out_c = e->src;
out_hi = lo.val() - 1;
return true;
}
}
e = e->next();
}
while (e != first);
return false;
}
bool viable::has_lower_bound(pvar v, rational& out_hi, signed_constraint& out_c) {
entry const* first = m_units[v];
entry const* e = first;
do {
if (!e->refined) {
verbose_stream() << "has-upper-bound " << e->src << " " << e->interval << "\n";
}
e = e->next();
}
while (e != first);
return false;
return false;
}
template <query_t mode>
lbool viable::query(pvar v, typename query_result<mode>::result_t& result) {
// max number of interval refinements before falling back to the univariate solver