CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/lexVg/
normalized-crossword-m1c-lex-vg10-11_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/lexVg/
normalized-crossword-m1c-lex-vg10-11_ext.xml
MD5SUMac1503673bc5c1dbe328395c9dc771a5
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 benchmark1.54976
Satisfiable
(Un)Satisfiability was proved
Number of variables110
Number of constraints21
Maximum constraint arity11
Maximum domain size26
Number of constraints which are defined in extension21
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-271079768UNSAT 1.54976 1.5689
Mistral-prime 1.3131079778UNSAT 1.63075 1.64061
Abscon 112v4 AC1079781UNSAT 1.70074 1.77791
Concrete + CPS4J 2008-05-301079764UNSAT 2.76158 2.83038
Abscon 112v4 ESAC1079782UNSAT 3.23551 3.28604
mddc-solv 2008-06-091079765UNSAT 4.34234 4.36053
Mistral-option 1.3141079777UNSAT 7.46186 7.52307
cpHydra k_401079784UNSAT 9.02563 9.27754
cpHydra k_101079783UNSAT 9.32858 9.49885
Minion/Tailor 2008-07-041105968UNSAT 14.4128 14.4582
casper zito1079780UNSAT 17.8073 17.9742
MDG-probe 2008-06-271079767UNSAT 18.0173 18.1647
choco2_dwdeg 2008-06-261079774UNSAT 20.7868 20.9357
choco2_impwdeg 2008-06-261079773UNSAT 22.2576 22.5121
casper zao1079779UNSAT 41.1007 41.421
galac M1079775UNSAT 51.2102 51.7262
galac E1079776UNSAT 64.2482 64.557
Sugar v1.13+minisat1079771UNSAT 181.014 182.848
SAT4J CSP 2008-06-131079769? 31.5912 29.9797
Sugar v1.13+picosat1079770? (TO) 1800 1801.64
Concrete + CSP4J - WMC Engine 2008-05-301079763? (TO) 1800.03 1807.02
spider 2008-06-141079766? (TO) 1800.08 1810.61
bpsolver 2008-06-271079772? (TO) 1800.09 1805.54
Concrete + CSP4J - Tabu Engine 2008-05-301079762? (TO) 1800.1 1811.72

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: