CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/bddSmall/
normalized-bdd-21-133-18-78-34_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/bddSmall/
normalized-bdd-21-133-18-78-34_ext.xml
MD5SUM22a586c5b6aeb407afb20e0b44d634b4
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark4.65829
Satisfiable
(Un)Satisfiability was proved
Number of variables21
Number of constraints133
Maximum constraint arity18
Maximum domain size2
Number of constraints which are defined in extension133
Number of constraints which are defined in intension0
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral-option 1.3141052728SAT 4.65829 4.67971
spider 2008-06-141052717SAT 7.00793 7.01354
MDG-noprobe 2008-06-271052719SAT 8.5357 8.57458
Mistral-prime 1.3131052729SAT 9.60954 9.61519
MDG-probe 2008-06-271052718SAT 9.67853 9.729
Concrete + CSP4J - Tabu Engine 2008-05-301052713SAT 9.8865 10.0357
mddc-solv 2008-06-091052716SAT 11.3563 11.4717
cpHydra k_401052735SAT 18.6972 19.0354
cpHydra k_101052734SAT 18.7841 19.0431
Abscon 112v4 AC1052732SAT 33.2149 33.5924
Abscon 112v4 ESAC1052733SAT 35.7786 36.1572
Concrete + CPS4J 2008-05-301052715SAT 55.5736 55.6391
bpsolver 2008-06-271052723SAT 153.264 153.327
Concrete + CSP4J - WMC Engine 2008-05-301052714SAT 180.709 181.621
choco2_dwdeg 2008-06-261052725SAT 900.01 901.476
SAT4J CSP 2008-06-131052720? 93.9577 91.4627
Sugar v1.13+picosat1052721? 109.337 110.042
Sugar v1.13+minisat1052722? 119.179 122.824
Minion/Tailor 2008-07-041104985? (MO) 7.31 7.4196
galac M1052726? (MO) 597.19 603.315
galac E1052727? (MO) 607.36 613.514
casper zito1052731? (TO) 1800.06 1809.01
casper zao1052730? (TO) 1800.07 1805.91
choco2_impwdeg 2008-06-261052724? (TO) 1800.08 1802.94

Additionnal information

This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).

Solution found:
1 1 1 1 1 1 1 1 1 0 0 0 0 0 0 0 0 0 0 0 0