mirror of
https://github.com/Z3Prover/z3
synced 2026-08-04 13:13:35 +00:00
63 lines
2.1 KiB
C++
63 lines
2.1 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, lpvar r);
|
|
void add_rdivision(lpvar q, lpvar x, lpvar y, lpvar r);
|
|
void add_bounded_division(lpvar q, lpvar x, lpvar y, lpvar r);
|
|
void add_divisibility(lpvar r, lpvar x, lpvar y, lpvar d);
|
|
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);
|
|
bool propagate();
|
|
bool incremental_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;
|
|
|
|
};
|
|
}
|