CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/
chessboardColoration/normalized-cc-5-5-3.xml

Jump to solvers results

General information on the benchmark

Namecsp/
chessboardColoration/normalized-cc-5-5-3.xml
MD5SUM3dec7e92a1c2c031864b0fcebdcaa49a
Bench CategoryN-ARY-INT (n-ary 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 variables25
Number of constraints100
Maximum constraint arity4
Maximum domain size3
Number of constraints which are defined in extension0
Number of constraints which are defined in intension100
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
MDG-noprobe 2008-06-271071503SAT 0.011997 0.0205
MDG-probe 2008-06-271071502SAT 0.012997 0.0206581
Mistral-prime 1.3131071513SAT 0.013997 0.0144971
Mistral-option 1.3141071512SAT 0.014997 0.015337
cpHydra k_401071519SAT 0.022996 0.0238479
cpHydra k_101071518SAT 0.024995 0.110997
casper zito1071515SAT 0.024996 0.0251209
bpsolver 2008-06-271071507SAT 0.064989 0.111943
Minion/Tailor 2008-07-041105352SAT 0.547916 0.577609
choco2_dwdeg 2008-06-261071509SAT 0.684895 0.675513
Concrete + CPS4J 2008-05-301071501SAT 0.71389 0.734099
Concrete + CSP4J - WMC Engine 2008-05-301071500SAT 0.722889 0.730878
choco2_impwdeg 2008-06-261071508SAT 0.748885 0.794184
Concrete + CSP4J - Tabu Engine 2008-05-301071499SAT 0.819874 0.844956
Abscon 112v4 ESAC1071517SAT 0.864868 0.885563
Sugar v1.13+minisat1071506SAT 0.866867 0.950006
Sugar v1.13+picosat1071505SAT 0.877865 0.860202
Abscon 112v4 AC1071516SAT 0.91386 0.953121
galac M1071510SAT 1.3418 1.2088
galac E1071511SAT 1.35479 1.1548
SAT4J CSP 2008-06-131071504SAT 1.53677 1.57709
casper zao1071514SAT 29.9894 30.1099

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