CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/graphColoring/
myciel/normalized-myciel3-4.xml

Jump to solvers results

General information on the benchmark

Namecsp/graphColoring/
myciel/normalized-myciel3-4.xml
MD5SUM3e11cf8d9e2677203fe6bb5c2c9d85fe
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.005998
Satisfiable
(Un)Satisfiability was proved
Number of variables11
Number of constraints20
Maximum constraint arity2
Maximum domain size4
Number of constraints which are defined in extension0
Number of constraints which are defined in intension20
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271088583SAT 0.005998 0.013008
Mistral-prime 1.3131088593SAT 0.006998 0.012903
Mistral-option 1.3141088592SAT 0.006998 0.0128491
MDG-probe 2008-06-271088582SAT 0.006998 0.0134769
casper zao1088594SAT 0.007998 0.0157631
casper zito1088595SAT 0.007998 0.015033
cpHydra k_101088598SAT 0.017996 0.0241339
cpHydra k_401088599SAT 0.017997 0.02453
bpsolver 2008-06-271088587SAT 0.026995 0.0341301
Minion/Tailor 2008-07-041105714SAT 0.281957 0.327785
Concrete + CSP4J - WMC Engine 2008-05-301088580SAT 0.447931 0.479592
Concrete + CPS4J 2008-05-301088581SAT 0.460929 0.491571
Concrete + CSP4J - Tabu Engine 2008-05-301088579SAT 0.468928 0.497457
choco2_dwdeg 2008-06-261088589SAT 0.475927 0.51984
Sugar v1.13+picosat1088585SAT 0.503922 0.558567
Sugar v1.13+minisat1088586SAT 0.506922 0.555106
choco2_impwdeg 2008-06-261088588SAT 0.51992 0.578755
Abscon 112v4 ESAC1088597SAT 0.674896 0.729986
Abscon 112v4 AC1088596SAT 0.735887 0.78679
galac E1088591SAT 0.871866 0.910952
galac M1088590SAT 0.880865 0.958104
SAT4J CSP 2008-06-131088584SAT 0.910861 0.977511

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