CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/coloring/
normalized-myciel-5g-6-ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/coloring/
normalized-myciel-5g-6-ext.xml
MD5SUMec173b5797939f23d4e425754445bde7
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.010997
Satisfiable
(Un)Satisfiability was proved
Number of variables47
Number of constraints236
Maximum constraint arity2
Maximum domain size6
Number of constraints which are defined in extension236
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
Mistral-prime 1.3131038485SAT 0.010997 0.0178969
MDG-noprobe 2008-06-271038475SAT 0.010997 0.0177499
Mistral-option 1.3141038484SAT 0.011997 0.0180651
MDG-probe 2008-06-271038474SAT 0.012997 0.018362
spider 2008-06-141038471SAT 0.016997 0.0260039
cpHydra k_401046185SAT 0.022995 0.0227301
cpHydra k_101045556SAT 0.022996 0.025812
casper zito1043669SAT 0.024995 0.0311949
casper zao1043040SAT 0.037993 0.045541
bpsolver 2008-06-271038479SAT 0.048991 0.054814
Concrete + CPS4J 2008-05-301038470SAT 0.415936 0.430878
Concrete + CSP4J - WMC Engine 2008-05-301038469SAT 0.416936 0.426353
Concrete + CSP4J - Tabu Engine 2008-05-301038468SAT 0.477927 0.493182
Minion/Tailor 2008-07-041104368SAT 0.482925 0.495008
choco2_impwdeg 2008-06-261038480SAT 0.548915 0.576264
choco2_dwdeg 2008-06-261038481SAT 0.662898 0.682253
Sugar v1.13+minisat1038478SAT 0.721889 0.856852
Abscon 112v4 ESAC1044927SAT 0.789879 0.834575
Sugar v1.13+picosat1038477SAT 0.791878 0.892886
Abscon 112v4 AC1044298SAT 0.84687 0.886312
SAT4J CSP 2008-06-131038476SAT 0.878866 0.923149
galac M1038482SAT 1.22281 1.29477
galac E1038483SAT 1.3168 1.40536

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