CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/graphColoring/
myciel/normalized-myciel4-5.xml

Jump to solvers results

General information on the benchmark

Namecsp/graphColoring/
myciel/normalized-myciel4-5.xml
MD5SUM7b6d99849b82f1dfb8302995e390a295
Bench Category2-ARY-INT (binary constraints in intension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.006998
Satisfiable
(Un)Satisfiability was proved
Number of variables23
Number of constraints71
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension0
Number of constraints which are defined in intension71
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271088499SAT 0.006998 0.014617
Mistral-option 1.3141088508SAT 0.006998 0.0143591
MDG-probe 2008-06-271088498SAT 0.007998 0.0149729
casper zito1088511SAT 0.008998 0.0170249
Mistral-prime 1.3131088509SAT 0.008998 0.0146679
casper zao1088510SAT 0.013997 0.0283039
cpHydra k_101088514SAT 0.019996 0.0258919
cpHydra k_401088515SAT 0.020996 0.0263121
bpsolver 2008-06-271088503SAT 0.034993 0.0403671
Minion/Tailor 2008-07-041105716SAT 0.349945 0.397774
choco2_impwdeg 2008-06-261088504SAT 0.570913 0.623898
Concrete + CSP4J - Tabu Engine 2008-05-301088495SAT 0.600908 0.633736
Concrete + CSP4J - WMC Engine 2008-05-301088496SAT 0.608907 0.633801
Sugar v1.13+minisat1088502SAT 0.613905 0.748526
choco2_dwdeg 2008-06-261088505SAT 0.625904 0.685769
Sugar v1.13+picosat1088501SAT 0.658899 0.695594
Concrete + CPS4J 2008-05-301088497SAT 0.687895 0.59348
Abscon 112v4 ESAC1088513SAT 0.714891 0.729497
Abscon 112v4 AC1088512SAT 0.746886 0.797631
galac M1088506SAT 1.01884 1.13379
SAT4J CSP 2008-06-131088500SAT 1.06284 1.08673
galac E1088507SAT 1.16582 1.23377

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