CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/ukVg/
normalized-crossword-m1c-uk-vg15-19_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/ukVg/
normalized-crossword-m1c-uk-vg15-19_ext.xml
MD5SUM5b614ca3797813e4aab919808e9965e8
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 benchmark0.887864
Satisfiable
(Un)Satisfiability was proved
Number of variables285
Number of constraints34
Maximum constraint arity19
Maximum domain size26
Number of constraints which are defined in extension34
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-271069051UNSAT 0.887864 0.889364
cpHydra k_401069067UNSAT 1.13383 1.13286
Mistral-prime 1.3131069061UNSAT 1.19382 1.20748
cpHydra k_101069066UNSAT 1.20781 1.22461
Abscon 112v4 AC1069064UNSAT 1.37179 1.40667
Abscon 112v4 ESAC1069065UNSAT 1.58476 1.6238
Mistral-option 1.3141069060UNSAT 1.86371 1.88452
Concrete + CPS4J 2008-05-301069047UNSAT 2.6246 2.66417
mddc-solv 2008-06-091069048UNSAT 3.67444 3.69147
choco2_dwdeg 2008-06-261069057UNSAT 6.14206 6.21278
choco2_impwdeg 2008-06-261069056UNSAT 6.51701 6.62173
Minion/Tailor 2008-07-041107328UNSAT 11.2103 11.3754
casper zito1069063UNSAT 15.9126 16.0776
MDG-probe 2008-06-271069050UNSAT 27.6188 27.7368
casper zao1069062UNSAT 33.4629 33.6123
galac M1069058UNSAT 64.0123 64.3798
galac E1069059UNSAT 75.5765 75.9531
Sugar v1.13+minisat1069054UNSAT 844.553 851.941
SAT4J CSP 2008-06-131069052? 104.661 101.987
Concrete + CSP4J - Tabu Engine 2008-05-301069045? (TO) 1800.01 1817.23
spider 2008-06-141069049? (TO) 1800.02 1809.91
bpsolver 2008-06-271069055? (TO) 1800.08 1801.97
Concrete + CSP4J - WMC Engine 2008-05-301069046? (TO) 1800.08 1811.32
Sugar v1.13+picosat1069053? (TO) 1800.1 1802.14

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: