CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/dag-half/
normalized-half-n25-d5-e56-r7-4.xml
MD5SUMdd44b0f4bc1fc8c91b1c88651ddbad3c
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 benchmark32.4351
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
Concrete + CSP4J - Tabu Engine 2008-05-301093182SAT 32.4351 32.3627
mddc-solv 2008-06-091093185SAT 671.545 674.337
bpsolver 2008-06-271093192? (problem) 165.867 167.407
Sugar v1.13+picosat1093190? (MO) 14.1447 15.6555
Sugar v1.13+minisat1093191? (MO) 14.74 15.0767
Minion/Tailor 2008-07-041105451? (MO) 45.15 46.8134
Concrete + CPS4J 2008-05-301093184? (TO) 1800 1812.92
Concrete + CSP4J - WMC Engine 2008-05-301093183? (TO) 1800.01 1809.43
galac M1093195? (TO) 1800.04 1803.92
MDG-probe 2008-06-271093187? (TO) 1800.05 1805.52
casper zito1093200? (TO) 1800.05 1813.13
cpHydra k_401093204? (TO) 1800.06 1815.53
Mistral-prime 1.3131093198? (TO) 1800.06 1819.22
casper zao1093199? (TO) 1800.08 1814.33
galac E1093196? (TO) 1800.08 1813.31
MDG-noprobe 2008-06-271093188? (TO) 1800.08 1804.82
Mistral-option 1.3141093197? (TO) 1800.09 1804.32
cpHydra k_101093203? (TO) 1800.1 1816.93
spider 2008-06-141093186? (TO) 1800.1 1807.43
Abscon 112v4 ESAC1093202? (TO) 1800.16 1811.5
Abscon 112v4 AC1093201? (TO) 1800.18 1810.1
choco2_dwdeg 2008-06-261093194? (TO) 1800.18 1803.11
SAT4J CSP 2008-06-131093189? (TO) 1800.18 1804.94
choco2_impwdeg 2008-06-261093193? (TO) 1800.19 1800.74

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