CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/lexVg/
normalized-crossword-m1c-lex-vg8-8_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/lexVg/
normalized-crossword-m1c-lex-vg8-8_ext.xml
MD5SUM83434445d1ade316b4a7419841b63e78
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 benchmark41.3817
Satisfiable
(Un)Satisfiability was proved
Number of variables64
Number of constraints16
Maximum constraint arity8
Maximum domain size26
Number of constraints which are defined in extension16
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 ESAC1078954UNSAT 41.3817 41.6682
Abscon 112v4 AC1078953UNSAT 44.3783 45.7288
cpHydra k_101078955UNSAT 49.5045 50.4819
cpHydra k_401078956UNSAT 52.717 54.1708
MDG-probe 2008-06-271078939UNSAT 76.9483 77.6196
Mistral-prime 1.3131078950UNSAT 81.4416 82.1558
Concrete + CPS4J 2008-05-301078936UNSAT 117.416 117.485
mddc-solv 2008-06-091078937UNSAT 117.481 117.945
Mistral-option 1.3141078949UNSAT 123.224 124.313
MDG-noprobe 2008-06-271078940UNSAT 126.588 127.391
Minion/Tailor 2008-07-041106003UNSAT 560.966 564.139
choco2_dwdeg 2008-06-261078946UNSAT 624.682 631.072
casper zao1078951UNSAT 665.823 667.269
casper zito1078952UNSAT 1058.7 1065.97
SAT4J CSP 2008-06-131078941? 32.642 31.5003
galac M1078947? (TO) 1800.01 1804.11
Concrete + CSP4J - Tabu Engine 2008-05-301078934? (TO) 1800.03 1803.52
galac E1078948? (TO) 1800.03 1816.41
bpsolver 2008-06-271078944? (TO) 1800.06 1813.42
Concrete + CSP4J - WMC Engine 2008-05-301078935? (TO) 1800.07 1802.62
choco2_impwdeg 2008-06-261078945? (TO) 1800.07 1815.27
Sugar v1.13+picosat1078942? (TO) 1800.07 1801.74
Sugar v1.13+minisat1078943? (TO) 1800.08 1801.94
spider 2008-06-141078938? (TO) 1800.1 1800.91

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: