CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/dag-half/
normalized-half-n25-d5-e56-r7-1.xml
MD5SUMe314bdf1882217984545160cbeb01d02
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 benchmark40.5718
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
MDG-noprobe 2008-06-271093257SAT 40.5718 40.7515
Mistral-prime 1.3131093267SAT 42.8925 43.2879
cpHydra k_101093272SAT 55.2346 57.0514
mddc-solv 2008-06-091093254SAT 91.1781 92.0079
MDG-probe 2008-06-271093256SAT 110.799 112.031
Concrete + CSP4J - Tabu Engine 2008-05-301093251SAT 126.456 127.784
Mistral-option 1.3141093266SAT 215.803 216.719
Concrete + CPS4J 2008-05-301093253SAT 338.648 340.349
cpHydra k_401093273SAT 346.12 347.119
bpsolver 2008-06-271093261? (problem) 167.782 169.294
Sugar v1.13+minisat1093260? (MO) 13.73 14.0808
Sugar v1.13+picosat1093259? (MO) 14.86 15.1337
Minion/Tailor 2008-07-041105445? (MO) 46.59 46.7146
Concrete + CSP4J - WMC Engine 2008-05-301093252? (TO) 1800.01 1815.72
galac M1093264? (TO) 1800.04 1810.52
galac E1093265? (TO) 1800.05 1817.61
spider 2008-06-141093255? (TO) 1800.07 1805.93
casper zito1093269? (TO) 1800.08 1800.93
casper zao1093268? (TO) 1800.09 1807.53
Abscon 112v4 AC1093270? (TO) 1800.14 1808.1
Abscon 112v4 ESAC1093271? (TO) 1800.16 1807.29
choco2_impwdeg 2008-06-261093262? (TO) 1800.16 1816.4
choco2_dwdeg 2008-06-261093263? (TO) 1800.17 1801.69
SAT4J CSP 2008-06-131093258? (TO) 1800.2 1807.61

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