From 23c12b75af91eb430e55f4622fcd40b266a488da Mon Sep 17 00:00:00 2001 From: Lev Nachmanson Date: Sat, 13 Jun 2020 10:03:19 -0700 Subject: [PATCH] remove a duplicate option gb==grobner Signed-off-by: Lev Nachmanson --- src/smt/params/smt_params_helper.pyg | 1 - src/smt/params/theory_arith_params.cpp | 2 +- 2 files changed, 1 insertion(+), 2 deletions(-) diff --git a/src/smt/params/smt_params_helper.pyg b/src/smt/params/smt_params_helper.pyg index 8027f5540..c0d8548ca 100644 --- a/src/smt/params/smt_params_helper.pyg +++ b/src/smt/params/smt_params_helper.pyg @@ -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'), diff --git a/src/smt/params/theory_arith_params.cpp b/src/smt/params/theory_arith_params.cpp index 22de881fa..5c0a7fe11 100644 --- a/src/smt/params/theory_arith_params.cpp +++ b/src/smt/params/theory_arith_params.cpp @@ -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(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();