CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/graphColoring/insertion/full-insertion/
normalized-2-fullins-3-5.xml

Jump to solvers results

General information on the benchmark

Namecsp/graphColoring/insertion/full-insertion/
normalized-2-fullins-3-5.xml
MD5SUM050e7fa83eceba86fbd6515c69578124
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.011997
Satisfiable
(Un)Satisfiability was proved
Number of variables52
Number of constraints201
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension0
Number of constraints which are defined in intension201
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
Mistral-option 1.3141090755SAT 0.011997 0.014232
Mistral-prime 1.3131090756SAT 0.012997 0.019466
MDG-noprobe 2008-06-271090746SAT 0.013997 0.0134279
MDG-probe 2008-06-271090745SAT 0.013997 0.0139369
casper zito1090758SAT 0.016997 0.022667
casper zao1090757SAT 0.022995 0.027732
cpHydra k_401090762SAT 0.023995 0.030875
cpHydra k_101090761SAT 0.023996 0.0307549
bpsolver 2008-06-271090750SAT 0.047992 0.048167
Minion/Tailor 2008-07-041105660SAT 0.463928 0.494886
Sugar v1.13+minisat1090749SAT 0.778881 0.885148
Concrete + CSP4J - WMC Engine 2008-05-301090743SAT 0.793878 0.837058
Abscon 112v4 ESAC1090760SAT 0.803877 0.843088
Sugar v1.13+picosat1090748SAT 0.813875 0.962464
Abscon 112v4 AC1090759SAT 0.814875 0.839163
choco2_dwdeg 2008-06-261090752SAT 0.823874 0.837997
choco2_impwdeg 2008-06-261090751SAT 0.831872 0.889788
Concrete + CSP4J - Tabu Engine 2008-05-301090742SAT 0.833872 0.85251
Concrete + CPS4J 2008-05-301090744SAT 0.833872 0.899395
galac M1090753SAT 1.35079 1.42166
galac E1090754SAT 1.44578 1.65838
SAT4J CSP 2008-06-131090747SAT 1.53977 1.55668

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