mirror of
https://github.com/Z3Prover/z3
synced 2026-02-19 23:14:40 +00:00
e4697fe18e
Issue #7502 shows that running nlsat eagerly during final check can block quantifier instantiation. To give space for quantifier instances we introduce two levels for final check such that nlsat is only applied in the second and final level.
61 lines
2 KiB
C++
61 lines
2 KiB
C++
/*++
|
|
Copyright (c) 2017 Microsoft Corporation
|
|
|
|
Author:
|
|
Lev Nachmanson (levnach)
|
|
Nikolaj Bjorner (nbjorner)
|
|
|
|
--*/
|
|
#pragma once
|
|
#include "util/vector.h"
|
|
#include "math/lp/lp_settings.h"
|
|
#include "util/rlimit.h"
|
|
#include "util/params.h"
|
|
#include "math/lp/lar_solver.h"
|
|
#include "math/lp/monic.h"
|
|
#include "math/lp/nla_core.h"
|
|
namespace nra {
|
|
class solver;
|
|
}
|
|
namespace nla {
|
|
class core;
|
|
// nonlinear integer incremental linear solver
|
|
class solver {
|
|
core* m_core;
|
|
public:
|
|
|
|
solver(lp::lar_solver& s, params_ref const& p, reslimit& limit);
|
|
~solver();
|
|
const auto& monics_with_changed_bounds() const { return m_core->monics_with_changed_bounds(); }
|
|
void add_monic(lpvar v, unsigned sz, lpvar const* vs);
|
|
void add_idivision(lpvar q, lpvar x, lpvar y);
|
|
void add_rdivision(lpvar q, lpvar x, lpvar y);
|
|
void add_bounded_division(lpvar q, lpvar x, lpvar y);
|
|
void check_bounded_divisions();
|
|
void set_relevant(std::function<bool(lpvar)>& is_relevant);
|
|
void updt_params(params_ref const& p);
|
|
void push();
|
|
void pop(unsigned scopes);
|
|
bool need_check();
|
|
lbool check(unsigned level);
|
|
void propagate();
|
|
void simplify() { m_core->simplify(); }
|
|
lbool check_power(lpvar r, lpvar x, lpvar y);
|
|
bool is_monic_var(lpvar) const;
|
|
bool influences_nl_var(lpvar) const;
|
|
std::ostream& display(std::ostream& out) const;
|
|
bool use_nra_model() const;
|
|
core& get_core();
|
|
nlsat::anum_manager& am();
|
|
nlsat::anum const& am_value(lp::lpvar v) const;
|
|
scoped_anum& tmp1();
|
|
scoped_anum& tmp2();
|
|
vector<nla::ineq> const& literals() const;
|
|
vector<lp::fixed_equality> const& fixed_equalities() const;
|
|
vector<lp::equality> const& equalities() const;
|
|
bool should_check_feasible() const { return m_core->should_check_feasible(); }
|
|
|
|
const vector<nla::lemma>& lemmas() const;
|
|
|
|
};
|
|
}
|