CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/ukVg/
normalized-crossword-m1c-uk-vg14-18_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/ukVg/
normalized-crossword-m1c-uk-vg14-18_ext.xml
MD5SUMca72fd363ec754292e0c02a94b9a6a57
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark3.54946
Satisfiable
(Un)Satisfiability was proved
Number of variables252
Number of constraints32
Maximum constraint arity18
Maximum domain size26
Number of constraints which are defined in extension32
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
Abscon 112v4 AC1068305UNSAT 3.54946 3.60313
MDG-noprobe 2008-06-271068292UNSAT 4.51031 4.56031
Mistral-prime 1.3131068302UNSAT 4.91325 4.96269
cpHydra k_101068307UNSAT 10.6994 10.8777
cpHydra k_401068308UNSAT 11.0183 11.2633
mddc-solv 2008-06-091068289UNSAT 13.268 13.3939
Concrete + CPS4J 2008-05-301068288UNSAT 13.385 13.5281
Abscon 112v4 ESAC1068306UNSAT 42.9425 43.3975
casper zito1068304UNSAT 45.1571 45.5699
Mistral-option 1.3141068301UNSAT 47.3348 47.7104
choco2_impwdeg 2008-06-261068297UNSAT 65.483 66.1223
choco2_dwdeg 2008-06-261068298UNSAT 66.7139 67.0992
MDG-probe 2008-06-271068291UNSAT 75.6005 75.9369
casper zao1068303UNSAT 102.556 103.067
Minion/Tailor 2008-07-041107325UNSAT 103.107 104.122
galac M1068299UNSAT 132.575 133.283
galac E1068300UNSAT 146.397 147.894
SAT4J CSP 2008-06-131068293? 77.2513 74.3536
spider 2008-06-141068290? (TO) 1800.04 1807.31
Sugar v1.13+picosat1068294? (TO) 1800.07 1813.04
Concrete + CSP4J - Tabu Engine 2008-05-301068286? (TO) 1800.08 1817.52
Concrete + CSP4J - WMC Engine 2008-05-301068287? (TO) 1800.09 1804.22
Sugar v1.13+minisat1068295? (TO) 1800.12 1814.81
bpsolver 2008-06-271068296? (TO) 1800.14 1817.07

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: