CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/dag-half/
normalized-half-n25-d5-e56-r7-12.xml

Jump to solvers results

General information on the benchmark

Namecsp/dag-half/
normalized-half-n25-d5-e56-r7-12.xml
MD5SUMccf341648ea4c9765316041a04d071c1
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 benchmark75.6735
Satisfiable
(Un)Satisfiability was proved
Number of variables25
Number of constraints56
Maximum constraint arity7
Maximum domain size5
Number of constraints which are defined in extension56
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-prime 1.3131093106SAT 75.6735 75.9989
MDG-noprobe 2008-06-271093096SAT 83.6723 84.6041
cpHydra k_101093111SAT 91.848 92.5278
MDG-probe 2008-06-271093095SAT 107.342 108.194
mddc-solv 2008-06-091093093SAT 124.697 125.883
Mistral-option 1.3141093105SAT 239.786 240.015
Concrete + CSP4J - Tabu Engine 2008-05-301093090SAT 371.047 383.39
cpHydra k_401093112SAT 378.19 380.181
bpsolver 2008-06-271093100? (problem) 167.205 168.616
Sugar v1.13+picosat1093098? (MO) 13.6588 14.3858
Sugar v1.13+minisat1093099? (MO) 13.8608 14.3567
Minion/Tailor 2008-07-041105441? (MO) 45.71 46.313
Concrete + CSP4J - WMC Engine 2008-05-301093091? (TO) 1800.01 1806.22
Concrete + CPS4J 2008-05-301093092? (TO) 1800.02 1804.42
galac E1093104? (TO) 1800.08 1806.22
galac M1093103? (TO) 1800.1 1802.92
casper zito1093108? (TO) 1800.1 1808.03
Abscon 112v4 AC1093109? (TO) 1800.1 1812.08
spider 2008-06-141093094? (TO) 1800.11 1806.23
casper zao1093107? (TO) 1800.12 1815.04
choco2_dwdeg 2008-06-261093102? (TO) 1800.15 1810.3
Abscon 112v4 ESAC1093110? (TO) 1800.17 1804.38
SAT4J CSP 2008-06-131093097? (TO) 1800.22 1811.94
choco2_impwdeg 2008-06-261093101? (TO) 1800.49 1807.91

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 0 1 0 4 1 3 1 4 2 1 0 2 3 0 0 4 1 0 0 2 0 3 4 1