CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/bddLarge/
normalized-bdd-21-2713-15-79-19_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/bddLarge/
normalized-bdd-21-2713-15-79-19_ext.xml
MD5SUM08364e2411145e54ad7f71bfc9c7cf25
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 benchmark12.7061
Satisfiable
(Un)Satisfiability was proved
Number of variables21
Number of constraints2713
Maximum constraint arity15
Maximum domain size2
Number of constraints which are defined in extension2713
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
spider 2008-06-141047530SAT 1.79873 1.82155
mddc-solv 2008-06-091047529SAT 12.7061 12.7111
Concrete + CSP4J - Tabu Engine 2008-05-301047526SAT 13.143 13.2964
Abscon 112v4 AC1047545SAT 24.2353 24.5009
MDG-noprobe 2008-06-271047532SAT 26.447 26.5755
Mistral-prime 1.3131047542SAT 27.7598 28.0134
Abscon 112v4 ESAC1047546SAT 28.3887 28.7321
Mistral-option 1.3141047541SAT 31.0603 31.3508
cpHydra k_401047548SAT 36.2945 36.7456
cpHydra k_101047547SAT 36.8544 37.2838
Concrete + CSP4J - WMC Engine 2008-05-301047527SAT 39.9349 40.3539
Concrete + CPS4J 2008-05-301047528SAT 119.394 120.586
MDG-probe 2008-06-271047531SAT 143.58 144.819
choco2_dwdeg 2008-06-261047538SAT 393.514 395.508
casper zao1047543SAT 562.963 568.11
casper zito1047544SAT 941.565 946.73
choco2_impwdeg 2008-06-261047537SAT 1001.32 1006.35
SAT4J CSP 2008-06-131047533? 95.2665 94.5345
Sugar v1.13+minisat1047535? 143.301 144.129
Sugar v1.13+picosat1047534? 151.378 153.059
bpsolver 2008-06-271047536? (problem) 521.08 521.299
Minion/Tailor 2008-07-041104936? (MO) 6.89 6.92288
galac M1047539? (MO) 1766.44 1780.91
galac E1047540? (TO) 1800.01 1814.93

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