CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/bddSmall/
normalized-bdd-21-133-18-78-10_ext.xml
MD5SUMc5b8b02c8b97ccddd1a9c359efeb6b23
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 benchmark0.713891
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
MDG-probe 2008-06-271052212SAT 0.703892 0.715157
cpHydra k_401052229SAT 0.713891 0.721304
MDG-noprobe 2008-06-271052213SAT 0.769882 0.781347
cpHydra k_101052228SAT 0.78588 0.791235
Mistral-prime 1.3131052223SAT 0.786879 0.798439
Mistral-option 1.3141052222SAT 0.792879 0.800283
spider 2008-06-141052211SAT 0.998847 1.01705
Concrete + CSP4J - WMC Engine 2008-05-301052208SAT 1.99969 2.04554
Abscon 112v4 ESAC1052227SAT 4.43633 4.49634
choco2_dwdeg 2008-06-261052219SAT 6.573 6.62622
choco2_impwdeg 2008-06-261052218SAT 6.79696 7.14453
mddc-solv 2008-06-091052210SAT 8.11377 8.1962
Concrete + CSP4J - Tabu Engine 2008-05-301052207SAT 9.58054 9.71371
Concrete + CPS4J 2008-05-301052209SAT 12.5621 12.6616
Abscon 112v4 AC1052226SAT 31.4172 31.7338
bpsolver 2008-06-271052217SAT 143.153 144.297
Sugar v1.13+minisat1052216? 95.1105 96.1107
SAT4J CSP 2008-06-131052214? 100.094 99.5674
Sugar v1.13+picosat1052215? 108.712 110.431
Minion/Tailor 2008-07-041104963? (MO) 6.9 7.02296
galac M1052220? (MO) 557.11 560.813
galac E1052221? (MO) 597.44 603.616
casper zao1052224? (TO) 1800.03 1807.61
casper zito1052225? (TO) 1800.1 1809.31

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:
0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0