mirror of
https://github.com/Z3Prover/z3
synced 2025-04-06 09:34:08 +00:00
79 lines
2.7 KiB
C++
79 lines
2.7 KiB
C++
/*++
|
|
Copyright (c) 2017 Microsoft Corporation
|
|
|
|
Author:
|
|
Nikolaj Bjorner (nbjorner)
|
|
Lev Nachmanson (levnach)
|
|
|
|
--*/
|
|
#pragma once
|
|
|
|
#include "math/lp/nla_common.h"
|
|
#include "math/lp/nla_intervals.h"
|
|
#include "math/lp/nex.h"
|
|
#include "math/lp/cross_nested.h"
|
|
#include "util/uint_set.h"
|
|
#include "math/grobner/pdd_solver.h"
|
|
|
|
namespace nla {
|
|
class core;
|
|
|
|
class grobner : common {
|
|
dd::pdd_manager m_pdd_manager;
|
|
dd::solver m_solver;
|
|
lp::lar_solver& lra;
|
|
indexed_uint_set m_rows;
|
|
unsigned m_quota = 0;
|
|
unsigned m_delay_base = 0;
|
|
unsigned m_delay = 0;
|
|
bool m_add_all_eqs = false;
|
|
std::unordered_map<unsigned_vector, lpvar, hash_svector> m_mon2var;
|
|
|
|
lp::lp_settings& lp_settings();
|
|
|
|
// solving
|
|
bool is_conflicting();
|
|
bool is_conflicting(dd::solver::equation const& eq);
|
|
|
|
bool propagate_eqs();
|
|
bool propagate_fixed(dd::solver::equation const& eq);
|
|
|
|
bool propagate_factorization();
|
|
bool propagate_factorization(dd::solver::equation const& eq);
|
|
|
|
bool propagate_linear_equations();
|
|
bool propagate_linear_equations(dd::solver::equation const& eq);
|
|
|
|
void add_dependencies(new_lemma& lemma, dd::solver::equation const& eq);
|
|
void explain(dd::solver::equation const& eq, lp::explanation& exp);
|
|
|
|
bool add_horner_conflict(dd::solver::equation const& eq);
|
|
bool is_nla_conflict(dd::solver::equation const& eq);
|
|
bool add_nla_conflict(dd::solver::equation const& eq);
|
|
void check_missing_propagation(dd::solver::equation const& eq);
|
|
|
|
bool equation_is_true(dd::solver::equation const& eq);
|
|
|
|
// setup
|
|
bool configure();
|
|
void set_level2var();
|
|
void find_nl_cluster();
|
|
void prepare_rows_and_active_vars();
|
|
void add_var_and_its_factors_to_q_and_collect_new_rows(lpvar j, svector<lpvar>& q);
|
|
void add_row(const vector<lp::row_cell<rational>>& row);
|
|
void add_fixed_monic(unsigned j);
|
|
bool is_solved(dd::pdd const& p, unsigned& v, dd::pdd& r);
|
|
void add_eq(dd::pdd& p, u_dependency* dep);
|
|
const rational& val_of_fixed_var_with_deps(lpvar j, u_dependency*& dep);
|
|
dd::pdd pdd_expr(const rational& c, lpvar j, u_dependency*& dep);
|
|
|
|
void display_matrix_of_m_rows(std::ostream& out) const;
|
|
std::ostream& diagnose_pdd_miss(std::ostream& out);
|
|
|
|
public:
|
|
grobner(core *core);
|
|
void operator()();
|
|
dd::solver::equation_vector const& core_equations(bool all_eqs);
|
|
};
|
|
}
|