CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/dag-half/
normalized-half-n25-d5-e56-r7-11.xml
MD5SUMbe265c4c7616125513fb29148c5bf38d
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 benchmark308.316
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
mddc-solv 2008-06-091093070SAT 308.316 310.974
MDG-probe 2008-06-271093072SAT 484.025 485.387
Mistral-prime 1.3131093083SAT 505.038 508.895
MDG-noprobe 2008-06-271093073SAT 509.482 513.913
cpHydra k_101093088SAT 513.531 516.784
Mistral-option 1.3141093082SAT 520.44 524.725
Concrete + CSP4J - Tabu Engine 2008-05-301093067SAT 676.028 681.476
cpHydra k_401093089SAT 781.989 790.264
Concrete + CPS4J 2008-05-301093069SAT 1582.53 1583.23
bpsolver 2008-06-271093077? (problem) 162.158 164.703
Sugar v1.13+minisat1093076? (MO) 12.94 13.0835
Sugar v1.13+picosat1093075? (MO) 13.9008 14.4121
Minion/Tailor 2008-07-041105440? (MO) 42.83 42.9188
galac E1093081? (TO) 1800.01 1824.32
galac M1093080? (TO) 1800.03 1809.52
Concrete + CSP4J - WMC Engine 2008-05-301093068? (TO) 1800.06 1813.32
spider 2008-06-141093071? (TO) 1800.07 1805.33
Abscon 112v4 ESAC1093087? (TO) 1800.08 1807.87
Abscon 112v4 AC1093086? (TO) 1800.09 1804.86
casper zito1093085? (TO) 1800.1 1806.03
casper zao1093084? (TO) 1800.13 1813.43
choco2_impwdeg 2008-06-261093078? (TO) 1800.18 1817.2
choco2_dwdeg 2008-06-261093079? (TO) 1800.21 1801.75
SAT4J CSP 2008-06-131093074? (TO) 1800.24 1808.15

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