mirror of
https://github.com/Z3Prover/z3
synced 2025-04-23 09:05:31 +00:00
enable cuts from proofs
Signed-off-by: Lev Nachmanson <levnach@hotmail.com>
This commit is contained in:
parent
44fd0e48a8
commit
2ebb957cc8
5 changed files with 51 additions and 16 deletions
|
@ -57,7 +57,9 @@ def_module_params(module_name='smt',
|
|||
('bv.solver', UINT, 0, 'bit-vector solver engine: 0 - bit-blasting, 1 - polysat, 2 - intblast, requires sat.smt=true'),
|
||||
('arith.random_initial_value', BOOL, False, 'use random initial values in the simplex-based procedure for linear arithmetic'),
|
||||
('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.lp.dioph_eq', BOOL, True, 'use Diophantine equalities'),
|
||||
('arith.lp.dio_eqs', BOOL, True, 'use Diophantine equalities'),
|
||||
('arith.lp.dio_cut_from_proof_period', UINT, 3, 'Period of creating a cut from proof in dioph equations'),
|
||||
('arith.lp.dio_cuts', BOOL, True, 'use cuts from Diophantine equalities conflics instead of Gomory cuts, only works when dioph_eq is true'),
|
||||
('arith.nl', BOOL, True, '(incomplete) nonlinear arithmetic support based on Groebner basis and interval propagation, relevant only if smt.arith.solver=2'),
|
||||
('arith.nl.nra', BOOL, True, 'call nra_solver when incremental linearization 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'),
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue