CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/graphColoring/leighton/leighton-15/
normalized-lei450-15a-05.xml

Jump to solvers results

General information on the benchmark

Namecsp/graphColoring/leighton/leighton-15/
normalized-lei450-15a-05.xml
MD5SUM288e2e637633a3a2322cfb8a57245cb8
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark0.313952
Satisfiable
(Un)Satisfiability was proved
Number of variables450
Number of constraints8168
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension0
Number of constraints which are defined in intension8168
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271089612UNSAT 0.313952 0.320948
MDG-probe 2008-06-271089611UNSAT 0.314951 0.322856
Mistral-prime 1.3131089622UNSAT 0.319951 0.326245
Mistral-option 1.3141089621UNSAT 0.32095 0.327668
cpHydra k_101089627UNSAT 0.329949 0.337292
cpHydra k_401089628UNSAT 0.331949 0.3388
bpsolver 2008-06-271089616UNSAT 1.13383 1.14656
Minion/Tailor 2008-07-041105680UNSAT 2.16867 2.24967
Abscon 112v4 ESAC1089626UNSAT 2.55461 2.81139
Abscon 112v4 AC1089625UNSAT 2.66059 2.72588
Sugar v1.13+minisat1089615UNSAT 2.81857 2.9267
choco2_impwdeg 2008-06-261089617UNSAT 3.61445 3.658
Sugar v1.13+picosat1089614UNSAT 3.83442 3.95382
choco2_dwdeg 2008-06-261089618UNSAT 3.9344 3.98287
galac M1089619UNSAT 3.9564 4.24188
galac E1089620UNSAT 4.20036 4.32542
SAT4J CSP 2008-06-131089613UNSAT 6.61199 6.7388
Concrete + CPS4J 2008-05-301089610UNSAT 21.0348 21.2883
casper zao1089623UNSAT 25.9181 25.9349
casper zito1089624UNSAT 36.7884 36.9545
Concrete + CSP4J - WMC Engine 2008-05-301089609? (TO) 1800.04 1800.92
Concrete + CSP4J - Tabu Engine 2008-05-301089608? (TO) 1800.04 1812.22

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: