CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/coloring/
normalized-geom-30a-6-ext.xml
MD5SUM23948995bccd5483bc394fbac5577b6d
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.005999
Satisfiable
(Un)Satisfiability was proved
Number of variables30
Number of constraints81
Maximum constraint arity2
Maximum domain size6
Number of constraints which are defined in extension81
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-271038799SAT 0.005999 0.00835493
MDG-probe 2008-06-271038798SAT 0.007998 0.014886
Mistral-prime 1.3131038809SAT 0.007998 0.00848205
Mistral-option 1.3141038808SAT 0.008998 0.014238
spider 2008-06-141038795SAT 0.009998 0.0187771
casper zito1043687SAT 0.011997 0.012173
casper zao1043058SAT 0.014997 0.021911
cpHydra k_101045574SAT 0.019996 0.0257461
cpHydra k_401046203SAT 0.020995 0.0208149
bpsolver 2008-06-271038803SAT 0.031994 0.041166
Minion/Tailor 2008-07-041104386SAT 0.301953 0.33386
Concrete + CSP4J - Tabu Engine 2008-05-301038792SAT 0.334948 0.373257
Concrete + CSP4J - WMC Engine 2008-05-301038793SAT 0.338947 0.371948
Concrete + CPS4J 2008-05-301038794SAT 0.356945 0.37637
choco2_dwdeg 2008-06-261038805SAT 0.443932 0.467279
choco2_impwdeg 2008-06-261038804SAT 0.45293 0.467447
Sugar v1.13+picosat1038801SAT 0.565913 0.626097
Sugar v1.13+minisat1038802SAT 0.591909 0.70778
Abscon 112v4 ESAC1044945SAT 0.718889 0.730869
Abscon 112v4 AC1044316SAT 0.736887 0.784503
SAT4J CSP 2008-06-131038800SAT 0.743886 0.772542
galac M1038806SAT 0.881865 0.927477
galac E1038807SAT 0.917859 1.00034

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