mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-12 20:18:18 +00:00
Code Activity

minor simplification of terms during internalization.

Browse source
This commit is contained in:
Nikolaj Bjorner 2023-12-03 12:43:14 -08:00
parent f06e07ad0a
commit 36725383d3
1 changed files with 12 additions and 5 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

15
src/sat/smt/arith_internalize.cpp
View file

@ -291,6 +291,13 @@ namespace arith {
internalize_term(n->get_arg(1)->get_expr()); internalize_term(n->get_arg(1)->get_expr());
} }
expr* solver::mk_sub(expr* x, expr* y) {
rational r;
if (a.is_numeral(y, r) && r == 0)
return x;
return a.mk_sub(x, y);
}
bool solver::internalize_atom(expr* atom) { bool solver::internalize_atom(expr* atom) {
TRACE("arith", tout << mk_pp(atom, m) << "\n";); TRACE("arith", tout << mk_pp(atom, m) << "\n";);
expr* n1, *n2; expr* n1, *n2;
@ -319,26 +326,26 @@ namespace arith {
k = lp_api::upper_t; k = lp_api::upper_t;
} }
else if (a.is_le(atom, n1, n2)) { else if (a.is_le(atom, n1, n2)) {
expr_ref n3(a.mk_sub(n1, n2), m); expr_ref n3(mk_sub(n1, n2), m);
v = internalize_def(n3); v = internalize_def(n3);
k = lp_api::upper_t; k = lp_api::upper_t;
r = 0; r = 0;
} }
else if (a.is_ge(atom, n1, n2)) { else if (a.is_ge(atom, n1, n2)) {
expr_ref n3(a.mk_sub(n1, n2), m); expr_ref n3(mk_sub(n1, n2), m);
v = internalize_def(n3); v = internalize_def(n3);
k = lp_api::lower_t; k = lp_api::lower_t;
r = 0; r = 0;
} }
else if (a.is_lt(atom, n1, n2)) { else if (a.is_lt(atom, n1, n2)) {
expr_ref n3(a.mk_sub(n1, n2), m); expr_ref n3(mk_sub(n1, n2), m);
v = internalize_def(n3); v = internalize_def(n3);
k = lp_api::lower_t; k = lp_api::lower_t;
r = 0; r = 0;
lit.neg(); lit.neg();
} }
else if (a.is_gt(atom, n1, n2)) { else if (a.is_gt(atom, n1, n2)) {
expr_ref n3(a.mk_sub(n1, n2), m); expr_ref n3(mk_sub(n1, n2), m);
v = internalize_def(n3); v = internalize_def(n3);
k = lp_api::upper_t; k = lp_api::upper_t;
r = 0; r = 0;