CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/graphColoring/
myciel/normalized-myciel5-6.xml

Jump to solvers results

General information on the benchmark

Namecsp/graphColoring/
myciel/normalized-myciel5-6.xml
MD5SUM0a0be2fdd09e2bc3026e029c207fdedb
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.011998
Satisfiable
(Un)Satisfiability was proved
Number of variables47
Number of constraints236
Maximum constraint arity2
Maximum domain size6
Number of constraints which are defined in extension0
Number of constraints which are defined in intension236
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271088331SAT 0.011998 0.0146239
Mistral-option 1.3141088340SAT 0.013997 0.0143019
Mistral-prime 1.3131088341SAT 0.013997 0.0550011
MDG-probe 2008-06-271088330SAT 0.013997 0.018317
casper zito1088343SAT 0.016997 0.017597
cpHydra k_101088346SAT 0.024995 0.057287
cpHydra k_401088347SAT 0.027995 0.0320919
casper zao1088342SAT 0.028995 0.034791
bpsolver 2008-06-271088335SAT 0.052991 0.062293
Minion/Tailor 2008-07-041105719SAT 0.460929 0.504818
choco2_dwdeg 2008-06-261088337SAT 0.805876 0.837179
choco2_impwdeg 2008-06-261088336SAT 0.811876 0.833275
Sugar v1.13+minisat1088334SAT 0.817875 0.702254
Sugar v1.13+picosat1088333SAT 0.825874 0.960799
Concrete + CSP4J - Tabu Engine 2008-05-301088327SAT 0.839871 0.637269
Abscon 112v4 AC1088344SAT 0.84987 0.732879
Concrete + CSP4J - WMC Engine 2008-05-301088328SAT 0.878866 0.984066
Abscon 112v4 ESAC1088345SAT 0.899862 0.956091
Concrete + CPS4J 2008-05-301088329SAT 1.07483 0.957778
galac M1088338SAT 1.3098 1.10552
galac E1088339SAT 1.41678 1.53237
SAT4J CSP 2008-06-131088332SAT 1.65575 1.78

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