CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/dag-half/
normalized-half-n25-d5-e56-r7-2.xml
MD5SUM1e34438cc0e5de5e28f463b21d13f8f7
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 benchmark13.322
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-option 1.3141093013SAT 13.322 13.4471
MDG-probe 2008-06-271093003SAT 23.7934 23.8966
MDG-noprobe 2008-06-271093004SAT 24.8092 25.0402
Mistral-prime 1.3131093014SAT 25.0072 25.1372
cpHydra k_101093019SAT 36.6114 37.0474
mddc-solv 2008-06-091093001SAT 133.317 133.754
Concrete + CSP4J - Tabu Engine 2008-05-301092998SAT 243.163 245.551
cpHydra k_401093020SAT 323.933 325.429
galac E1093012SAT 868.906 877.292
Concrete + CPS4J 2008-05-301093000SAT 1700.02 1708.26
bpsolver 2008-06-271093008? (problem) 166.396 168.067
Sugar v1.13+minisat1093007? (MO) 13.84 14.1768
Sugar v1.13+picosat1093006? (MO) 13.8837 14.5255
Minion/Tailor 2008-07-041105449? (MO) 43.51 43.6131
Concrete + CSP4J - WMC Engine 2008-05-301092999? (TO) 1800.02 1808.12
galac M1093011? (TO) 1800.05 1813.41
spider 2008-06-141093002? (TO) 1800.09 1800.93
casper zao1093015? (TO) 1800.09 1809.93
choco2_dwdeg 2008-06-261093010? (TO) 1800.11 1812.09
choco2_impwdeg 2008-06-261093009? (TO) 1800.12 1810.62
Abscon 112v4 AC1093017? (TO) 1800.13 1803.06
casper zito1093016? (TO) 1800.13 1806.43
SAT4J CSP 2008-06-131093005? (TO) 1800.14 1807.72
Abscon 112v4 ESAC1093018? (TO) 1800.16 1814.4

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