1- def_module_params('sat',
1+ def_module_params('sat',
22 export=True,
33 description='propositional SAT solver',
44 params=(max_memory_param(),
55 ('phase', SYMBOL, 'caching', 'phase selection strategy: always_false, always_true, basic_caching, random, caching'),
6- ('phase.sticky', BOOL, True, 'use sticky phase caching'),
6+ ('phase.sticky', BOOL, True, 'use sticky phase caching'),
77 ('search.unsat.conflicts', UINT, 400, 'period for solving for unsat (in number of conflicts)'),
88 ('search.sat.conflicts', UINT, 400, 'period for solving for sat (in number of conflicts)'),
9- ('rephase.base', UINT, 1000, 'number of conflicts per rephase '),
10- ('reorder.base', UINT, UINT_MAX, 'number of conflicts per random reorder '),
11- ('reorder.itau', DOUBLE, 4.0, 'inverse temperature for softmax'),
12- ('reorder.activity_scale', UINT, 100, 'scaling factor for activity update'),
9+ ('rephase.base', UINT, 1000, 'number of conflicts per rephase '),
10+ ('reorder.base', UINT, UINT_MAX, 'number of conflicts per random reorder '),
11+ ('reorder.itau', DOUBLE, 4.0, 'inverse temperature for softmax'),
12+ ('reorder.activity_scale', UINT, 100, 'scaling factor for activity update'),
1313 ('propagate.prefetch', BOOL, True, 'prefetch watch lists for assigned literals'),
1414 ('restart', SYMBOL, 'ema', 'restart strategy: static, luby, ema or geometric'),
1515 ('restart.initial', UINT, 2, 'initial restart (number of conflicts)'),
16- ('restart.max', UINT, UINT_MAX, 'maximal number of restarts.'),
16+ ('restart.max', UINT, UINT_MAX, 'maximal number of restarts.'),
1717 ('restart.fast', BOOL, True, 'use fast restart approach only removing less active literals.'),
1818 ('restart.factor', DOUBLE, 1.5, 'restart increment factor for geometric strategy'),
1919 ('restart.margin', DOUBLE, 1.1, 'margin between fast and slow restart factors. For ema'),
2020 ('restart.emafastglue', DOUBLE, 3e-2, 'ema alpha factor for fast moving average'),
2121 ('restart.emaslowglue', DOUBLE, 1e-5, 'ema alpha factor for slow moving average'),
22- ('variable_decay', UINT, 110, 'multiplier (divided by 100) for the VSIDS activity increment'),
22+ ('variable_decay', UINT, 110, 'multiplier (divided by 100) for the VSIDS activity increment'),
2323 ('inprocess.max', UINT, UINT_MAX, 'maximal number of inprocessing passes'),
2424 ('branching.heuristic', SYMBOL, 'vsids', 'branching heuristic vsids, lrb or chb'),
2525 ('branching.anti_exploration', BOOL, False, 'apply anti-exploration heuristic for branch selection'),
@@ -40,8 +40,8 @@ def_module_params('sat',
4040 ('dyn_sub_res', BOOL, True, 'dynamic subsumption resolution for minimizing learned clauses'),
4141 ('core.minimize', BOOL, False, 'minimize computed core'),
4242 ('core.minimize_partial', BOOL, False, 'apply partial (cheap) core minimization'),
43- ('backtrack.scopes', UINT, 100, 'number of scopes to enable chronological backtracking'),
44- ('backtrack.conflicts', UINT, 4000, 'number of conflicts before enabling chronological backtracking'),
43+ ('backtrack.scopes', UINT, 100, 'number of scopes to enable chronological backtracking'),
44+ ('backtrack.conflicts', UINT, 4000, 'number of conflicts before enabling chronological backtracking'),
4545 ('threads', UINT, 1, 'number of parallel threads to use'),
4646 ('dimacs.core', BOOL, False, 'extract core from DIMACS benchmarks'),
4747 ('drat.file', SYMBOL, '', 'file to dump DRAT proofs'),
@@ -51,7 +51,7 @@ def_module_params('sat',
5151 ('cardinality.solver', BOOL, True, 'use cardinality solver'),
5252 ('pb.solver', SYMBOL, 'solver', 'method for handling Pseudo-Boolean constraints: circuit (arithmetical circuit), sorting (sorting circuit), totalizer (use totalizer encoding), binary_merge, segmented, solver (use native solver)'),
5353 ('pb.min_arity', UINT, 9, 'minimal arity to compile pb/cardinality constraints to CNF'),
54- ('xor.solver', BOOL, False, 'use xor solver'),
54+ ('xor.solver', BOOL, False, 'use xor solver'),
5555 ('cardinality.encoding', SYMBOL, 'grouped', 'encoding used for at-most-k constraints: grouped, bimander, ordered, unate, circuit'),
5656 ('pb.resolve', SYMBOL, 'cardinality', 'resolution strategy for boolean algebra solver: cardinality, rounding'),
5757 ('pb.lemma_format', SYMBOL, 'cardinality', 'generate either cardinality or pb lemmas'),
@@ -60,19 +60,19 @@ def_module_params('sat',
6060 ('ddfw.use_reward_pct', UINT, 15, 'percentage to pick highest reward variable when it has reward 0'),
6161 ('ddfw.restart_base', UINT, 100000, 'number of flips used a starting point for hessitant restart backoff'),
6262 ('ddfw.reinit_base', UINT, 10000, 'increment basis for geometric backoff scheme of re-initialization of weights'),
63- ('ddfw.threads', UINT, 0, 'number of ddfw threads to run in parallel with sat solver'),
63+ ('ddfw.threads', UINT, 0, 'number of ddfw threads to run in parallel with sat solver'),
6464 ('prob_search', BOOL, False, 'use probsat local search instead of CDCL'),
6565 ('local_search', BOOL, False, 'use local search instead of CDCL'),
6666 ('local_search_threads', UINT, 0, 'number of local search threads to find satisfiable solution'),
6767 ('local_search_mode', SYMBOL, 'wsat', 'local search algorithm, either default wsat or qsat'),
6868 ('local_search_dbg_flips', BOOL, False, 'write debug information for number of flips'),
69- ('unit_walk', BOOL, False, 'use unit-walk search instead of CDCL'),
69+ ('unit_walk', BOOL, False, 'use unit-walk search instead of CDCL'),
7070 ('unit_walk_threads', UINT, 0, 'number of unit-walk search threads to find satisfiable solution'),
7171 ('binspr', BOOL, False, 'enable SPR inferences of binary propagation redundant clauses. This inprocessing step eliminates models'),
7272 ('lookahead.cube.cutoff', SYMBOL, 'depth', 'cutoff type used to create lookahead cubes: depth, freevars, psat, adaptive_freevars, adaptive_psat'),
73- # - depth: the maximal cutoff is fixed to the value of lookahead.cube.depth.
73+ # - depth: the maximal cutoff is fixed to the value of lookahead.cube.depth.
7474 # So if the value is 10, at most 1024 cubes will be generated of length 10.
75- # - freevars: cutoff based on a variable fraction of lookahead.cube.freevars.
75+ # - freevars: cutoff based on a variable fraction of lookahead.cube.freevars.
7676 # Cut if the number of current unassigned variables drops below a fraction of number of initial variables.
7777 # - psat: Let psat_heur := (Sum_{clause C} (psat.clause_base ^ {-|C|+1})) / |freevars|^psat.var_exp
7878 # Cut if the value of psat_heur exceeds psat.trigger
@@ -98,15 +98,15 @@ def_module_params('sat',
9898 # reward function used to determine which literal to cube on.
9999 # - ternary: reward function useful for random 3-SAT instances. Used by Heule and Knuth in March.
100100 # - heule_schur: reward function based on "Schur Number 5", Heule, AAAI 2018
101- # The score of a literal lit is:
101+ # The score of a literal lit is:
102102 # Sum_{C in Clauses | lit in C} 2 ^ (- |C|+1)
103103 # * Sum_{lit' in C | lit' != lit} lit_occs(~lit')
104104 # / | C |
105105 # where lit_occs(lit) is the number of clauses containing lit.
106106 # - heuleu: The score of a literal lit is: Sum_{C in Clauses | lit in C} 2 ^ (-|C| + 1)
107107 # - unit: heule_schur + also counts number of unit clauses.
108108 # - march_cu: default reward function used in a version of March
109- # Each reward function also comes with its own variant of "mix_diff", which
110- # is the function for combining reward metrics for the positive and negative variant of a literal.
109+ # Each reward function also comes with its own variant of "mix_diff", which
110+ # is the function for combining reward metrics for the positive and negative variant of a literal.
111111 )
112112
0 commit comments