mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-09-07 02:11:08 +00:00
Code Activity

bugfix in parity code, add try_infer_parity_equality per status notes

Browse source 
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
Nikolaj Bjorner 2023-01-02 15:01:05 -08:00
parent 0301686856
commit 56bda59de9
2 changed files with 128 additions and 60 deletions
Download patch file Download diff file Expand all files Collapse all files

8
src/math/polysat/saturation.h
View file

@ -41,6 +41,7 @@ namespace polysat {
void log_lemma(pvar v, conflict& core);
bool propagate(pvar v, conflict& core, signed_constraint const& crit1, signed_constraint c);
bool propagate(pvar v, conflict& core, inequality const& crit1, signed_constraint c);
bool propagate(pvar v, conflict& core, signed_constraint c);
bool add_conflict(pvar v, conflict& core, inequality const& crit1, signed_constraint c);
bool add_conflict(pvar v, conflict& core, inequality const& crit1, inequality const& crit2, signed_constraint c);
@ -68,6 +69,7 @@ namespace polysat {
bool try_add_overflow_bound(pvar x, conflict& core, inequality const& axb_l_y);
bool try_add_mul_bound(pvar x, conflict& core, inequality const& axb_l_y);
bool try_add_mul_bound2(pvar x, conflict& core, inequality const& axb_l_y);
bool try_infer_parity_equality(pvar x, conflict& core, inequality const& a_l_b);
rational round(rational const& N, rational const& x);
bool extract_linear_form(pdd const& q, pvar& y, rational& a, rational& b);
@ -142,8 +144,10 @@ namespace polysat {
bool has_lower_bound(pvar x, conflict& core, rational& bound, vector<signed_constraint>& x_le_bound);
// determine min/max parity of polynomial
unsigned min_parity(pdd const& p);
unsigned max_parity(pdd const& p);
unsigned min_parity(pdd const& p, vector<signed_constraint>& explain);
unsigned max_parity(pdd const& p, vector<signed_constraint>& explain);
unsigned min_parity(pdd const& p) { vector<signed_constraint> ex; return min_parity(p, ex); }
unsigned max_parity(pdd const& p) { vector<signed_constraint> ex; return max_parity(p, ex); }
lbool get_multiple(const pdd& p1, const pdd& p2, pdd& out);