CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/
chessboardColoration/normalized-cc-7-7-2.xml

Jump to solvers results

General information on the benchmark

Namecsp/
chessboardColoration/normalized-cc-7-7-2.xml
MD5SUM1f8c8222dee021c25c644cdfea44a70e
Bench CategoryN-ARY-INT (n-ary constraints in intension)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark0.25996
Satisfiable
(Un)Satisfiability was proved
Number of variables49
Number of constraints441
Maximum constraint arity4
Maximum domain size2
Number of constraints which are defined in extension0
Number of constraints which are defined in intension441
Global constraints used (with number of constraints)

Results of the different solvers on this benchmark

Solver NameTraceIDAnswerCPU timeWall clock time
casper zao1071619UNSAT 0.25996 0.269036
bpsolver 2008-06-271071612UNSAT 0.303953 0.310501
cpHydra k_101071623UNSAT 0.530918 0.542834
cpHydra k_401071624UNSAT 0.535918 0.542951
MDG-noprobe 2008-06-271071608UNSAT 0.619905 0.62794
Mistral-option 1.3141071617UNSAT 0.880865 0.887341
Mistral-prime 1.3131071618UNSAT 0.901862 0.90719
MDG-probe 2008-06-271071607UNSAT 1.26381 1.27279
Abscon 112v4 ESAC1071622UNSAT 1.2918 1.30678
Abscon 112v4 AC1071621UNSAT 1.38879 1.46607
Sugar v1.13+minisat1071611UNSAT 1.42378 1.48932
galac E1071616UNSAT 1.62375 1.67357
galac M1071615UNSAT 1.72274 1.7556
Sugar v1.13+picosat1071610UNSAT 1.83172 1.9294
Concrete + CPS4J 2008-05-301071606UNSAT 2.35264 2.4242
SAT4J CSP 2008-06-131071609UNSAT 2.55261 2.5879
casper zito1071620UNSAT 3.3145 3.33571
choco2_impwdeg 2008-06-261071613UNSAT 5.15121 5.22737
choco2_dwdeg 2008-06-261071614UNSAT 5.21121 5.25105
Minion/Tailor 2008-07-041105354UNSAT 26.355 26.5114
Concrete + CSP4J - WMC Engine 2008-05-301071605? (TO) 1800.01 1807.62
Concrete + CSP4J - Tabu Engine 2008-05-301071604? (TO) 1800.08 1802.22

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: