mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-04-23 17:15:31 +00:00
Code Activity

accumulate scalars when simplifying

Browse source 
Signed-off-by: Lev Nachmanson <levnach@hotmail.com>
This commit is contained in:
Lev Nachmanson 2019-09-26 10:11:22 -07:00
parent 4e2cd2c8de
commit c076c17df9
3 changed files with 46 additions and 18 deletions
Download patch file Download diff file Expand all files Collapse all files

35
src/math/lp/nex.cpp
View file

@ -83,18 +83,33 @@ void promote_children_of_sum(ptr_vector<nex> & children, nex_lt lt ) {
}
}
void promote_children_of_mul(vector<nex_pow> & children, nex_lt lt) {
bool eat_scalar(nex_scalar *& r, nex_pow& p) {
if (!p.e()->is_scalar())
return false;
nex_scalar *pe = to_scalar(p.e());
if (r == nullptr) {
r = pe;
r->value() = r->value().expt(p.pow());
} else {
r->value() *= pe->value().expt(p.pow());
}
return true;
}
void simplify_children_of_mul(vector<nex_pow> & children, nex_lt lt) {
nex_scalar* r = nullptr;
TRACE("nla_cn_details", print_vector(children, tout););
vector<nex_pow> to_promote;
int skipped = 0;
for(unsigned j = 0; j < children.size(); j++) {
for(unsigned j = 0; j < children.size(); j++) {
nex_pow& p = children[j];
if (eat_scalar(r, p)) {
skipped++;
continue;
}
(p.e())->simplify(p.ee(), lt);
if ((p.e())->is_mul()) {
to_promote.push_back(p);
} else if (ignored_child(p.e(), expr_type::MUL)) {
skipped ++;
continue;
} else {
unsigned offset = to_promote.size() + skipped;
if (offset) {
@ -104,14 +119,18 @@ void promote_children_of_mul(vector<nex_pow> & children, nex_lt lt) {
}
children.shrink(children.size() - to_promote.size() - skipped);
for (nex_pow & p : to_promote) {
for (nex_pow& pp : to_mul(p.e())->children()) {
SASSERT(!ignored_child(pp.e(), expr_type::MUL));
children.push_back(nex_pow(pp.e(), pp.pow() * p.pow()));
if (!eat_scalar(r, pp))
children.push_back(nex_pow(pp.e(), pp.pow() * p.pow()));
}
}
if (r != nullptr) {
children.push_back(nex_pow(r));
}
mul_to_powers(children, lt);
TRACE("nla_cn_details", print_vector(children, tout););

11
src/math/lp/nex.h
View file

@ -108,7 +108,7 @@ public:
lpvar var() const { return m_j; }
lpvar& var() { return m_j; } // the setter
std::ostream & print(std::ostream& out) const {
out << 'v' << m_j;
out << (char)('a' + m_j);
return out;
}
@ -141,7 +141,7 @@ const nex_sum* to_sum(const nex*a);
void promote_children_of_sum(ptr_vector<nex> & children, nex_lt);
class nex_pow;
void promote_children_of_mul(vector<nex_pow> & children, nex_lt);
void simplify_children_of_mul(vector<nex_pow> & children, nex_lt);
class nex_pow {
nex* m_e;
@ -243,7 +243,7 @@ public:
TRACE("nla_cn_details", tout << "**e = " << **e << "\n";);
*e = this;
TRACE("nla_cn_details", tout << *this << "\n";);
promote_children_of_mul(m_children, lt);
simplify_children_of_mul(m_children, lt);
if (size() == 1 && m_children[0].pow() == 1)
*e = m_children[0].e();
TRACE("nla_cn_details", tout << *this << "\n";);
@ -424,6 +424,11 @@ inline const nex_scalar* to_scalar(const nex*a) {
return static_cast<const nex_scalar*>(a);
}
inline nex_scalar* to_scalar(nex*a) {
SASSERT(a->is_scalar());
return static_cast<nex_scalar*>(a);
}
inline const nex_mul* to_mul(const nex*a) {
SASSERT(a->is_mul());
return static_cast<const nex_mul*>(a);