mirror of
https://github.com/Z3Prover/z3
synced 2025-04-11 03:33:35 +00:00
remove a duplicate option gb==grobner
Signed-off-by: Lev Nachmanson <levnach@hotmail.com>
This commit is contained in:
parent
e5632736d2
commit
23c12b75af
|
@ -44,7 +44,6 @@ def_module_params(module_name='smt',
|
|||
('arith.cheap_eqs', UINT, 0, '0 - do not run, 1 - use tree, 2 - use table'),
|
||||
('arith.solver', UINT, 6, 'arithmetic solver: 0 - no solver, 1 - bellman-ford based solver (diff. logic only), 2 - simplex based solver, 3 - floyd-warshall based solver (diff. logic only) and no theory combination 4 - utvpi, 5 - infinitary lra, 6 - lra solver'),
|
||||
('arith.nl', BOOL, True, '(incomplete) nonlinear arithmetic support based on Groebner basis and interval propagation, relevant only if smt.arith.solver=2'),
|
||||
('arith.nl.gb', BOOL, True, 'groebner Basis computation, this option is ignored when arith.nl=false, relevant only if smt.arith.solver=2'),
|
||||
('arith.nl.nra', BOOL, True, 'call nra_solver when incremental lianirization does not produce a lemma, this option is ignored when arith.nl=false, relevant only if smt.arith.solver=6'),
|
||||
('arith.nl.branching', BOOL, True, 'branching on integer variables in non linear clusters, relevant only if smt.arith.solver=2'),
|
||||
('arith.nl.rounds', UINT, 1024, 'threshold for number of (nested) final checks for non linear arithmetic, relevant only if smt.arith.solver=2'),
|
||||
|
|
|
@ -26,7 +26,7 @@ void theory_arith_params::updt_params(params_ref const & _p) {
|
|||
m_arith_random_seed = p.random_seed();
|
||||
m_arith_mode = static_cast<arith_solver_id>(p.arith_solver());
|
||||
m_nl_arith = p.arith_nl();
|
||||
m_nl_arith_gb = p.arith_nl_gb();
|
||||
m_nl_arith_gb = p.arith_nl_grobner();
|
||||
m_nl_arith_branching = p.arith_nl_branching();
|
||||
m_nl_arith_rounds = p.arith_nl_rounds();
|
||||
m_arith_propagate_eqs = p.arith_propagate_eqs();
|
||||
|
|
Loading…
Reference in a new issue