mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-05-04 06:15:46 +00:00
Code Activity

prepare for diseq_lin viable

Browse source
This commit is contained in:
Nikolaj Bjorner 2021-12-13 12:00:19 -08:00
parent 651b41f8c0
commit 8c2735e68b
3 changed files with 30 additions and 9 deletions
Download patch file Download diff file Expand all files Collapse all files

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

@ -178,6 +178,10 @@ namespace polysat {
return true;
}
bool viable::refine_viable(pvar v, rational const& val) {
return refine_equal_lin(v, val) && refine_disequal_lin(v, val);
}
/**
* Traverse all interval constraints with coefficients to check whether current value 'val' for
* 'v' is feasible. If not, extract a (maximal) interval to block 'v' from being assigned val.
@ -187,7 +191,7 @@ namespace polysat {
* be precisely the assigned values. This is to ensure that lo/hi that are computed based on lo_val
* and division with coeff are valid. Is there a more relaxed scheme?
*/
bool viable::refine_viable(pvar v, rational const& val) {
bool viable::refine_equal_lin(pvar v, rational const& val) {
auto* e = m_equal_lin[v];
if (!e)
return true;
@ -268,6 +272,14 @@ namespace polysat {
return true;
}
bool viable::refine_disequal_lin(pvar v, rational const& val) {
auto* e = m_diseq_lin[v];
if (!e)
return true;
LOG("refine-disequal-lin is TBD");
return true;
}
bool viable::has_viable(pvar v) {
refined:
auto* e = m_units[v];
@ -460,6 +472,7 @@ namespace polysat {
while (e != first);
// core.set_bailout();
// TODO - review this; c is true under current assignment?
for (auto c : core) {
if (c.bvalue(s) == l_false) {
core.reset();
@ -506,6 +519,7 @@ namespace polysat {
std::ostream& viable::display(std::ostream& out, pvar v) const {
display(out, v, m_units[v]);
display(out, v, m_equal_lin[v]);
display(out, v, m_diseq_lin[v]);
return out;
}