3
0
Fork 0
mirror of https://github.com/Z3Prover/z3 synced 2025-08-22 11:07:51 +00:00

move tactic_params to params

This commit is contained in:
Nikolaj Bjorner 2022-11-03 05:50:46 -07:00
parent 203652da74
commit 06eb460c75
12 changed files with 40 additions and 21 deletions

View file

@ -19,6 +19,4 @@ z3_add_component(tactic
TACTIC_HEADERS
probe.h
tactic.h
PYG_FILES
tactic_params.pyg
)

View file

@ -20,7 +20,7 @@ Notes:
#include "ast/rewriter/rewriter_def.h"
#include "ast/scoped_proof.h"
#include "tactic/tactical.h"
#include "tactic/tactic_params.hpp"
#include "params/tactic_params.hpp"

View file

@ -24,7 +24,7 @@ Revision History:
#include "ast/ast_pp.h"
#include "ast/expr_substitution.h"
#include "tactic/goal_shared_occs.h"
#include "tactic/tactic_params.hpp"
#include "params/tactic_params.hpp"
namespace {
class propagate_values_tactic : public tactic {

View file

@ -28,7 +28,7 @@ Revision History:
#include "tactic/goal_shared_occs.h"
#include "tactic/tactical.h"
#include "ast/converters/generic_model_converter.h"
#include "tactic/tactic_params.hpp"
#include "params/tactic_params.hpp"
class solve_eqs_tactic : public tactic {
struct imp {

View file

@ -83,7 +83,7 @@ public:
m_simp->reduce();
m_goal->inc_depth();
if (in->models_enabled())
in->set(m_simp->get_model_converter());
in->set(m_simp->get_model_converter().get());
result.push_back(in.get());
}

View file

@ -44,7 +44,7 @@ Notes:
#include "solver/solver2tactic.h"
#include "solver/parallel_tactic.h"
#include "solver/parallel_params.hpp"
#include "tactic/tactic_params.hpp"
#include "params/tactic_params.hpp"
#include "parsers/smt2/smt2parser.h"

View file

@ -1,22 +0,0 @@
def_module_params('tactic',
description='tactic parameters',
export=True,
params=(('solve_eqs.context_solve', BOOL, True, "solve equalities within disjunctions."),
('solve_eqs.theory_solver', BOOL, True, "use theory solvers."),
('solve_eqs.ite_solver', BOOL, True, "use if-then-else solvers."),
('solve_eqs.max_occs', UINT, UINT_MAX, "maximum number of occurrences for considering a variable for gaussian eliminations."),
('blast_term_ite.max_inflation', UINT, UINT_MAX, "multiplicative factor of initial term size."),
('blast_term_ite.max_steps', UINT, UINT_MAX, "maximal number of steps allowed for tactic."),
('propagate_values.max_rounds', UINT, 4, "maximal number of rounds to propagate values."),
('default_tactic', SYMBOL, '', "overwrite default tactic in strategic solver"),
# ('aig.per_assertion', BOOL, True, "process one assertion at a time"),
# ('add_bounds.lower, INT, -2, "lower bound to be added to unbounded variables."),
# ('add_bounds.upper, INT, 2, "upper bound to be added to unbounded variables."),
# ('fm.real_only', BOOL, True, "consider only real variables for FM"),
# ('fm.occ', BOOL, False, "consider inequalities occurring in clauses for FM."),
# ('fm.limit', UINT, 5000000, "maximal number of constraints, monomials, clauses visited during FM."),
# etc: lia2card, factor, nla2bv, normalize_bounds, pb2bv, purify_arith, bit_blaster, bv_bounds
))