mirror of
https://github.com/Z3Prover/z3
synced 2025-04-12 12:08:18 +00:00
tidy
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
da805f6016
commit
0c972b8bee
|
@ -2306,21 +2306,6 @@ namespace smt {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
#if 0
|
|
||||||
/**
|
|
||||||
\brief Return true if it was possible to patch all variables in m_to_patch.
|
|
||||||
*/
|
|
||||||
template<typename Ext>
|
|
||||||
bool theory_arith<Ext>::reduce_feasible() {
|
|
||||||
for (theory_vars v : sort_by_coefficients()) {
|
|
||||||
|
|
||||||
}
|
|
||||||
m_value[v] += delta;
|
|
||||||
if (is_base(v) && !m_to_patch.contains(v) && (below_lower(v) || above_upper(v))) {
|
|
||||||
m_value[v] -= delta;
|
|
||||||
}
|
|
||||||
}
|
|
||||||
#endif
|
|
||||||
|
|
||||||
/**
|
/**
|
||||||
\brief Return true if it was possible to patch all variables in m_to_patch.
|
\brief Return true if it was possible to patch all variables in m_to_patch.
|
||||||
|
|
|
@ -500,7 +500,6 @@ class solve_eqs_tactic : public tactic {
|
||||||
|
|
||||||
bool is_compatible(goal const& g, unsigned idx, vector<nnf_context> const & path, expr* v, expr* eq) {
|
bool is_compatible(goal const& g, unsigned idx, vector<nnf_context> const & path, expr* v, expr* eq) {
|
||||||
expr_mark occ;
|
expr_mark occ;
|
||||||
//std::cout << mk_pp(v, m()) << "\n";
|
|
||||||
mark_occurs(occ, g, v);
|
mark_occurs(occ, g, v);
|
||||||
return is_goal_compatible(g, occ, idx, v, eq) && is_path_compatible(occ, path, v, eq);
|
return is_goal_compatible(g, occ, idx, v, eq) && is_path_compatible(occ, path, v, eq);
|
||||||
}
|
}
|
||||||
|
|
Loading…
Reference in a new issue