CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/coloring/
normalized-geom-40-6-ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/coloring/
normalized-geom-40-6-ext.xml
MD5SUMe7fb6babb2b58367b36640bca885e427
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.005998
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints78
Maximum constraint arity2
Maximum domain size6
Number of constraints which are defined in extension78
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
MDG-noprobe 2008-06-271038727SAT 0.005998 0.014181
Mistral-option 1.3141038736SAT 0.007998 0.014445
Mistral-prime 1.3131038737SAT 0.007998 0.0145129
MDG-probe 2008-06-271038726SAT 0.008997 0.014681
spider 2008-06-141038723SAT 0.010998 0.014773
casper zito1043683SAT 0.011997 0.0192711
cpHydra k_101045570SAT 0.018997 0.025988
cpHydra k_401046199SAT 0.019996 0.0257911
casper zao1043054SAT 0.021996 0.0284899
bpsolver 2008-06-271038731SAT 0.033994 0.040996
Concrete + CSP4J - WMC Engine 2008-05-301038721SAT 0.32195 0.365137
Minion/Tailor 2008-07-041104382SAT 0.338947 0.359533
Concrete + CPS4J 2008-05-301038722SAT 0.339948 0.37276
Concrete + CSP4J - Tabu Engine 2008-05-301038720SAT 0.340947 0.374568
choco2_impwdeg 2008-06-261038732SAT 0.475927 0.501066
Sugar v1.13+minisat1038730SAT 0.544917 0.57682
choco2_dwdeg 2008-06-261038733SAT 0.545916 0.573267
Sugar v1.13+picosat1038729SAT 0.612906 0.70371
Abscon 112v4 AC1044312SAT 0.711891 0.739612
SAT4J CSP 2008-06-131038728SAT 0.725888 0.762233
Abscon 112v4 ESAC1044941SAT 0.729888 0.784592
galac E1038735SAT 0.871866 0.934735
galac M1038734SAT 1.05284 1.10342

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