CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/graphColoring/insertion/full-insertion/
normalized-1-fullins-4-5.xml

Jump to solvers results

General information on the benchmark

Namecsp/graphColoring/insertion/full-insertion/
normalized-1-fullins-4-5.xml
MD5SUM7d13359b8b863ad9ea56a4b6911a400a
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.025995
Satisfiable
(Un)Satisfiability was proved
Number of variables93
Number of constraints593
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension0
Number of constraints which are defined in intension593
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271090578SAT 0.025995 0.0266691
Mistral-prime 1.3131090588SAT 0.026995 0.0337421
Mistral-option 1.3141090587SAT 0.027994 0.0365539
MDG-probe 2008-06-271090577SAT 0.029994 0.040196
casper zito1090590SAT 0.031994 0.038692
cpHydra k_401090594SAT 0.037994 0.037667
cpHydra k_101090593SAT 0.039993 0.0460131
casper zao1090589SAT 0.055991 0.05596
bpsolver 2008-06-271090582SAT 0.096984 0.0955439
Minion/Tailor 2008-07-041105657SAT 0.682895 0.713112
Abscon 112v4 AC1090591SAT 1.02984 1.10085
Abscon 112v4 ESAC1090592SAT 1.08283 1.12865
Concrete + CSP4J - WMC Engine 2008-05-301090575SAT 1.13083 1.14645
Concrete + CPS4J 2008-05-301090576SAT 1.21981 1.28199
choco2_impwdeg 2008-06-261090583SAT 1.22181 1.26307
Concrete + CSP4J - Tabu Engine 2008-05-301090574SAT 1.23381 1.26559
Sugar v1.13+picosat1090580SAT 1.2868 1.36248
Sugar v1.13+minisat1090581SAT 1.3128 1.45448
choco2_dwdeg 2008-06-261090584SAT 1.35379 1.41887
galac M1090585SAT 1.65275 1.96576
galac E1090586SAT 1.81772 1.90377
SAT4J CSP 2008-06-131090579SAT 2.07268 2.08396

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