CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/ukVg/
normalized-crossword-m1c-uk-vg14-15_ext.xml
MD5SUMaca7198b8bad2de4793a977967afcafb
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 benchmark29.2046
Satisfiable
(Un)Satisfiability was proved
Number of variables210
Number of constraints29
Maximum constraint arity15
Maximum domain size26
Number of constraints which are defined in extension29
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 ESAC1068950UNSAT 29.2046 29.2462
Abscon 112v4 AC1068949UNSAT 34.9847 35.3318
cpHydra k_401068952UNSAT 40.6158 40.9279
cpHydra k_101068951UNSAT 40.8728 41.005
Mistral-prime 1.3131068946UNSAT 68.1466 68.678
MDG-noprobe 2008-06-271068936UNSAT 68.4196 68.9536
Concrete + CPS4J 2008-05-301068932UNSAT 80.2688 81.8916
Mistral-option 1.3141068945UNSAT 89.8523 90.6328
MDG-probe 2008-06-271068935UNSAT 113.346 113.803
choco2_dwdeg 2008-06-261068942UNSAT 155.406 156.225
mddc-solv 2008-06-091068933UNSAT 174.172 175.657
casper zao1068947UNSAT 396.224 404.059
Minion/Tailor 2008-07-041107323UNSAT 662.595 668.895
choco2_impwdeg 2008-06-261068941UNSAT 706.428 709.96
casper zito1068948UNSAT 912.039 919.14
galac E1068944UNSAT 1614.61 1627.73
SAT4J CSP 2008-06-131068937? 81.5126 78.7927
Concrete + CSP4J - WMC Engine 2008-05-301068931? (TO) 1800.04 1814.32
Concrete + CSP4J - Tabu Engine 2008-05-301068930? (TO) 1800.07 1811.92
galac M1068943? (TO) 1800.08 1815.71
spider 2008-06-141068934? (TO) 1800.08 1807.31
Sugar v1.13+picosat1068938? (TO) 1800.08 1812.49
Sugar v1.13+minisat1068939? (TO) 1800.14 1816.43
bpsolver 2008-06-271068940? (TO) 1800.18 1812.98

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: