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

Simplify constraint evaluation

Browse source
This commit is contained in:
Jakob Rath 2022-11-23 12:19:03 +01:00
parent e4999b07aa
commit fdc186b204
10 changed files with 95 additions and 113 deletions
Download patch file Download diff file Expand all files Collapse all files

14
src/math/polysat/smul_fl_constraint.cpp
View file

@ -40,7 +40,7 @@ namespace polysat {
case l_true: return display(out);
case l_false: return display(out << "~");
case l_undef: return display(out << "?");
}
}
return out;
}
@ -48,12 +48,12 @@ namespace polysat {
if (m_is_overflow)
return out << "sovfl*(" << m_p << ", " << m_q << ")";
else
return out << "sudfl*(" << m_p << ", " << m_q << ")";
return out << "sudfl*(" << m_p << ", " << m_q << ")";
}
/**
* TODO - verify the rules for small bit-widths.
*
*
* sovfl(p,q) => p >= 2, q >= 2
* sovfl(p,q) => p >s 0 <=> q >s 0
* sovfl(p,q) & p >s 0 => p*q < 0 or ovfl(p,q)
@ -67,8 +67,8 @@ namespace polysat {
* sudfl(p, q) & p >s 0 => p*q > 0 or ovfl(p, -q)
* sudfl(p, q) & q >s 0 => p*q > 0 or ovfl(-p, q)
*
* ~sudfl(p, q) & p >s 0 & q <s 0 => ~ovfl(p, -q) & p*q <s 0
* ~sudfl(p, q) & p <s 0 & q >s 0 => ~ovfl(-p, q) & p*q <s 0
* ~sudfl(p, q) & p >s 0 & q <s 0 => ~ovfl(p, -q) & p*q <s 0
* ~sudfl(p, q) & p <s 0 & q >s 0 => ~ovfl(-p, q) & p*q <s 0
*/
void smul_fl_constraint::narrow(solver& s, bool is_positive, bool first) {
if (!first)
@ -103,8 +103,8 @@ namespace polysat {
s.add_clause(sc, ~s.sgt(p(), 0), ~s.slt(q(), 0), s.umul_ovfl(p(), -q()), false);
s.add_clause(sc, ~s.sgt(p(), 0), ~s.slt(q(), 0), s.slt(p()*q(), 0), false);
s.add_clause(sc, ~s.slt(p(), 0), ~s.sgt(q(), 0), s.umul_ovfl(-p(), q()), false);
s.add_clause(sc, ~s.slt(p(), 0), ~s.sgt(q(), 0), s.slt(p()*q(), 0), false);
}
s.add_clause(sc, ~s.slt(p(), 0), ~s.sgt(q(), 0), s.slt(p()*q(), 0), false);
}
}
}