mirror of
https://github.com/Z3Prover/z3
synced 2025-08-19 09:40:20 +00:00
porting more
Signed-off-by: Nikolaj Bjorner <nbjorner@microsoft.com>
This commit is contained in:
parent
bfb3db8b13
commit
d08e61219b
5 changed files with 65 additions and 53 deletions
|
@ -126,7 +126,7 @@ def_module_params('sat',
|
|||
# Each reward function also comes with its own variant of "mix_diff", which
|
||||
# is the function for combining reward metrics for the positive and negative variant of a literal.
|
||||
# Xor parameters
|
||||
('xor.enable', BOOL, False, 'enable xor solver plugin in combination with pure SAT solving'))
|
||||
('xor.enable', BOOL, False, 'enable xor solver plugin in combination with pure SAT solving'),
|
||||
|
||||
# Pull in other xor parameters as they are determined to be relevant
|
||||
# ('xor.max_to_find', UINT, 'tbd'),
|
||||
|
@ -135,13 +135,13 @@ def_module_params('sat',
|
|||
# ('xor.allow_elim_vars', BOOL, 'tbd'),
|
||||
# ('xor.var_per_cut', UINT, 'tbd'),
|
||||
# ('xor.force_preserve_xors', BOOL, 'tbd'),
|
||||
# ('xor.gauss.max_matrix_columns', UINT, 'tbd'),
|
||||
# ('xor.gauss.max_matrix_rows', UINT, 'The maximum matrix size -- no. of rows'),
|
||||
# ('xor.gauss.min_matrix_rows', UINT, 'The minimum matrix size -- no. of rows'),
|
||||
# ('xor.gauss.max_num_matrices', UINT, 'Maximum number of matrices'),
|
||||
('xor.gauss.max_matrix_columns', UINT, UINT_MAX, 'tbd'),
|
||||
('xor.gauss.max_matrix_rows', UINT, UINT_MAX, 'The maximum matrix size -- no. of rows'),
|
||||
('xor.gauss.min_matrix_rows', UINT, 0, 'The minimum matrix size -- no. of rows'),
|
||||
('xor.gauss.max_num_matrices', UINT, UINT_MAX, 'Maximum number of matrices'),
|
||||
# ('xor.gauss.autodisable', BOOL, False, 'tbd'),
|
||||
# ('xor.gauss.min_usefulness_cutoff', DOUBLE, 0, 'tbd'),
|
||||
# ('xor.gauss.do_matrix_find', BOOL, True, 'tbd'),
|
||||
# ('xor.gauss.min_xor_clauses', UINT, 2, 'tbd'),
|
||||
# ('xor.gauss.max_xor_clauses, UINT, 500000, 'tbd')
|
||||
)
|
||||
))
|
||||
|
|
Loading…
Add table
Add a link
Reference in a new issue