CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/ukVg/
normalized-crossword-m1c-uk-vg4-7_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/ukVg/
normalized-crossword-m1c-uk-vg4-7_ext.xml
MD5SUMbd26f5840f71dcc169d4a8f9be43f01f
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkSAT
Best CPU time to get the best result obtained on this benchmark0.175973
Satisfiable
(Un)Satisfiability was proved
Number of variables28
Number of constraints11
Maximum constraint arity7
Maximum domain size26
Number of constraints which are defined in extension11
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-probe 2008-06-271068682SAT 0.099984 0.101962
mddc-solv 2008-06-091068680SAT 0.175973 0.1763
Mistral-option 1.3141068692SAT 0.216966 0.223664
spider 2008-06-141068681SAT 0.301953 0.324795
MDG-noprobe 2008-06-271068683SAT 0.359945 0.70331
cpHydra k_101068698SAT 0.458929 0.467139
cpHydra k_401068699SAT 0.461929 0.468508
Mistral-prime 1.3131068693SAT 0.466928 0.480104
Abscon 112v4 AC1068696SAT 0.944855 0.99377
Abscon 112v4 ESAC1068697SAT 1.18282 1.21211
Concrete + CPS4J 2008-05-301068679SAT 1.51377 1.52602
casper zao1068694SAT 2.41663 2.44751
choco2_impwdeg 2008-06-261068688SAT 2.87756 2.93999
casper zito1068695SAT 2.88156 2.91613
choco2_dwdeg 2008-06-261068689SAT 3.41748 3.50995
Minion/Tailor 2008-07-041107335SAT 3.50247 3.5693
bpsolver 2008-06-271068687SAT 4.03139 4.04881
galac E1068691SAT 51.2232 51.9978
galac M1068690SAT 76.3734 76.6944
Sugar v1.13+minisat1068686SAT 279.089 279.394
Sugar v1.13+picosat1068685SAT 291.974 292.196
SAT4J CSP 2008-06-131068684? 79.239 79.2681
Concrete + CSP4J - Tabu Engine 2008-05-301068677? (TO) 1800 1804.92
Concrete + CSP4J - WMC Engine 2008-05-301068678? (TO) 1800.1 1812.32

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:
2 0 1 1 0 11 0 0 1 17 0 7 0 12 12 0 17 17 0 13 14 18 2 17 8 1 4 18