CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/bddLarge/
normalized-bdd-21-2713-15-79-32_ext.xml
MD5SUM5e3fa5f378874955ce09140c39f4ffa1
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 benchmark3.02654
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-141047231SAT 1.88771 1.90099
mddc-solv 2008-06-091047230SAT 3.02654 3.06207
Concrete + CSP4J - WMC Engine 2008-05-301047228SAT 5.2842 5.40203
Abscon 112v4 AC1047246SAT 11.1713 11.3153
Abscon 112v4 ESAC1047247SAT 17.6873 17.8865
Mistral-option 1.3141047242SAT 25.5471 25.7691
MDG-noprobe 2008-06-271047233SAT 27.4348 27.4563
Mistral-prime 1.3131047243SAT 27.9278 28.045
cpHydra k_401047249SAT 34.6007 34.9355
cpHydra k_101047248SAT 36.9664 37.4218
casper zito1047245SAT 82.2435 82.9622
Concrete + CPS4J 2008-05-301047229SAT 116.036 117.193
MDG-probe 2008-06-271047232SAT 128.792 129.109
Concrete + CSP4J - Tabu Engine 2008-05-301047227SAT 156.758 158.663
choco2_impwdeg 2008-06-261047238SAT 402.452 403.414
choco2_dwdeg 2008-06-261047239SAT 626.32 627.051
casper zao1047244SAT 730.293 735.914
SAT4J CSP 2008-06-131047234? 90.1153 89.9838
Sugar v1.13+picosat1047235? 136.284 137.366
Sugar v1.13+minisat1047236? 151.479 152.5
bpsolver 2008-06-271047237? (problem) 557.038 561.372
Minion/Tailor 2008-07-041104923? (MO) 7.2 7.32186
galac E1047241? (MO) 1684.51 1694.91
galac M1047240? (MO) 1764.72 1785.01

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