CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/graphColoring/sgb/book/
normalized-jean-5.xml

Jump to solvers results

General information on the benchmark

Namecsp/graphColoring/sgb/book/
normalized-jean-5.xml
MD5SUM62dbe0d67a23451e5c27bd591f583d30
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.014997
Satisfiable
(Un)Satisfiability was proved
Number of variables80
Number of constraints254
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension0
Number of constraints which are defined in intension254
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral-option 1.3141090041UNSAT 0.014997 0.0153051
MDG-noprobe 2008-06-271090032UNSAT 0.014997 0.0150961
Mistral-prime 1.3131090042UNSAT 0.014997 0.01513
casper zito1090044UNSAT 0.014997 0.0168241
MDG-probe 2008-06-271090031UNSAT 0.014997 0.0153781
cpHydra k_401090048UNSAT 0.024996 0.0266049
casper zao1090043UNSAT 0.025995 0.0276001
cpHydra k_101090047UNSAT 0.027995 0.0341211
bpsolver 2008-06-271090036UNSAT 0.052991 0.0582349
Minion/Tailor 2008-07-041105767UNSAT 0.508921 0.550184
choco2_dwdeg 2008-06-261090038UNSAT 0.747885 0.792339
choco2_impwdeg 2008-06-261090037UNSAT 0.756884 0.807226
Sugar v1.13+minisat1090035UNSAT 0.817874 0.938586
Abscon 112v4 ESAC1090046UNSAT 0.823873 0.831744
galac M1090039UNSAT 0.835872 0.871593
Sugar v1.13+picosat1090034UNSAT 0.839872 0.956181
Concrete + CPS4J 2008-05-301090030UNSAT 0.872866 0.889148
Abscon 112v4 AC1090045UNSAT 0.901862 0.951895
galac E1090040UNSAT 1.11183 1.17119
SAT4J CSP 2008-06-131090033UNSAT 1.77073 1.81194
Concrete + CSP4J - Tabu Engine 2008-05-301090028? (TO) 1800.02 1806.82
Concrete + CSP4J - WMC Engine 2008-05-301090029? (TO) 1800.07 1808.12

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: