this repo has no description
at develop 4.1 kB view raw
1{ 2 "id": "org.chuffed.chuffed", 3 "name": "Chuffed", 4 "description": "Chuffed FlatZinc executable", 5 "version": "${chuffed_VERSION_MAJOR}.${chuffed_VERSION_MINOR}.${chuffed_VERSION_PATCH}", 6 "mznlib": "../chuffed", 7 "executable": "${REL_INSTALL_BINARY}", 8 "tags": ["cp","lcg","int"], 9 "stdFlags": ["-a","-f","-n","-r","-s","-v","--cp-profiler"], 10 "extraFlags": [ 11 ["--prop-fifo", "Use FIFO queues for propagation", "bool", "false"], 12 ["--vsids", "Use activity-based search on the Boolean variables", "bool", "false"], 13 ["--toggle-vsids", "Alternate search between user-specified and activity-based one", "bool", "false"], 14 ["--restart", "Restart sequence type", "opt:chuffed:none:constant:linear:luby:geometric", "chuffed"], 15 ["--restart-base", "Base for geometric restart sequence", "float", "1.5"], 16 ["--restart-scale", "Scale factor for restart sequence", "int", "1000000000"], 17 ["--switch-to-vsids-after", "Search starts with the user-specified one and switches to the activity-based one after a specified number of conflicts", "int", "1000000000"], 18 ["--branch-random", "Use random variable selection for tie breaking instead of input order", "bool", "false"], 19 ["--sat-polarity", "Selection of the polarity of Boolean variables (0 = default, 1 = same, 2 = anti, 3 = random)", "int", "0"], 20 ["--lazy", "Allow clause generation for domain update", "bool:on:off", "true"], 21 ["--finesse", "Try to generated stronger clauses", "bool:on:off", "true"], 22 ["--learn", "Compute nogoods when a conflict is encountered", "bool:on:off", "true"], 23 ["--eager-limit", "The maximal domain size of eager integer variables", "int", "1000"], 24 ["--sat-var-limit", "The maximal number of Boolean variables", "int", "2000000"], 25 ["--n-of-learnts", "The maximal number of learnt clauses", "int", "100000"], 26 ["--learnts-mlimit", "The maximal memory limit for learnt clauses in Bytes", "int", "500000000"], 27 ["--sort-learnt-level", "Sort literals in a learnt clause based on their decision level", "bool", "false"], 28 ["--one-watch", "Watch only one literal in a learn clause", "bool:on:off", "true"], 29 ["--bin-clause-opt", "Optimise learnt clauses of length 2", "bool:on:off", "true"], 30 ["--introduced-heuristic", "Decide if variable is introduced based on its name", "bool", "false"], 31 ["--use-var-is-introduced", "Decide if variable is introduced based on var_is_introduced annotation", "bool", "false"], 32 ["--exclude-introduced", "Exclude introduced variables from learnt clauses", "bool", "false"], 33 ["--decide-introduced", "Allow search decisions on introduced variables and their derived internal variables", "bool:on:off", "true"], 34 ["--fd-simplify", "Remove FD propagators that are satisfied globally", "bool:on:off", "true"], 35 ["--sat-simplify", "Remove of clauses that are satisfied globally", "bool:on:off", "true"], 36 ["--cumu-global", "Use the global cumulative propagator if possible", "bool:on:off", "true"], 37 ["--disj-edge-find", "Use the edge-finding propagator for disjunctive constraints", "bool:on:off", "true"], 38 ["--disj-set-bp", "Use the set bounds propagator for disjunctive constraints", "bool:on:off", "true"], 39 ["--mdd", "Use the MDD propagator if possible", "bool", "false"], 40 ["--mip", "Use the MIP propagator if possible", "bool", "false"], 41 ["--mip-branch", "Use MIP branching as the branching strategy", "bool", "false"], 42 ["--sym-static", "Use static symmetry breaking constraints", "bool", "false"], 43 ["--ldsb", "Use lightweight dynamic symmetry breaking constraints '1UIP crippled'", "bool", "false"], 44 ["--ldsbta", "Use lightweight dynamic symmetry breaking constraints '1UIP'", "bool", "false"], 45 ["--ldsbad", "Use lightweight dynamic symmetry breaking constraints 'all decision clause'", "bool", "false"], 46 ], 47 "supportsMzn": false, 48 "supportsFzn": true, 49 "needsSolns2Out": true, 50 "needsMznExecutable": false, 51 "needsStdlibDir": false, 52 "isGUIApplication": false 53}