mirrors/z3
3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2026-01-19 00:38:57 +00:00
Code Activity

optionally limit linearization

Browse source
This commit is contained in:
Arie Gurfinkel 2025-10-06 16:40:06 -04:00
parent 5846570012
commit 599e9da8a9
4 changed files with 26 additions and 21 deletions
Download patch file Download diff file Expand all files Collapse all files

30
src/math/lp/nla_core.cpp
View file

@ -313,7 +313,7 @@ bool core::explain_by_equiv(const lp::lar_term& t, lp::explanation& e) const {
return false;
m_evars.explain(signed_var(i, false), signed_var(j, sign), e);
TRACE(nla_solver, tout << "explained :"; lra.print_term_as_indices(t, tout););
TRACE(nla_solver, tout << "explained :"; lra.print_term_as_indices(t, tout) << "\n";);
return true;
}
@ -1342,7 +1342,7 @@ lbool core::check() {
if (no_effect())
m_basics.basic_lemma(true);
if (no_effect())
if (no_effect() && m_params.arith_nl_linearize())
m_basics.basic_lemma(false);
if (no_effect())
@ -1358,21 +1358,19 @@ lbool core::check() {
if (!conflict_found() && params().arith_nl_nra() && num_calls % 50 == 0 && num_calls > 500)
ret = bounded_nlsat();
// both tangent and monotonicity are expensive
std::function<void(void)> check1 = [&]() { m_monotone.monotonicity_lemma();
};
std::function<void(void)> check2 = [&]() { m_tangents.tangent_lemma();
};
std::pair<unsigned, std::function<void(void)>> checks[] =
{
{ 2, check1 },
{ 1, check2 }};
check_weighted(2, checks);
if (m_params.arith_nl_linearize()) {
// both tangent and monotonicity are expensive
std::function<void(void)> check1 = [&]() { m_monotone.monotonicity_lemma();
};
std::function<void(void)> check2 = [&]() { m_tangents.tangent_lemma();
};
std::pair<unsigned, std::function<void(void)>> checks[] =
{
{ 2, check1 },
{ 1, check2 }};
check_weighted(2, checks);
}
}
if (no_effect() && params().arith_nl_nra()) {