CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/dag-half/
normalized-half-n25-d5-e56-r7-24.xml
MD5SUM68e37f47824782d24eace7f47c23235b
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 benchmark149.569
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-probe 2008-06-271093026SAT 118.905 119.837
Mistral-option 1.3141093036SAT 149.569 150.742
Concrete + CSP4J - Tabu Engine 2008-05-301093021SAT 173.449 175.044
MDG-noprobe 2008-06-271093027SAT 301.341 303.985
cpHydra k_101093042SAT 310.33 330.713
Mistral-prime 1.3131093037SAT 319.349 322.115
mddc-solv 2008-06-091093024SAT 398.592 398.759
cpHydra k_401093043SAT 624.338 627.896
Abscon 112v4 AC1093040SAT 864.025 864.511
Abscon 112v4 ESAC1093041SAT 870.579 875.364
bpsolver 2008-06-271093031? (problem) 164.349 165.193
Sugar v1.13+minisat1093030? (MO) 13.8698 14.2314
Sugar v1.13+picosat1093029? (MO) 14.74 15.0292
Minion/Tailor 2008-07-041105447? (MO) 48.92 49.5208
Concrete + CSP4J - WMC Engine 2008-05-301093022? (TO) 1800.01 1816.22
Concrete + CPS4J 2008-05-301093023? (TO) 1800.02 1805.22
galac M1093034? (TO) 1800.04 1804.51
spider 2008-06-141093025? (TO) 1800.06 1812.33
galac E1093035? (TO) 1800.08 1814.81
casper zito1093039? (TO) 1800.11 1813.94
casper zao1093038? (TO) 1800.12 1813.94
SAT4J CSP 2008-06-131093028? (TO) 1800.16 1800.1
choco2_impwdeg 2008-06-261093032? (TO) 1800.19 1811.73
choco2_dwdeg 2008-06-261093033? (TO) 1800.2 1801.11

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