CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/lexVg/
normalized-crossword-m1c-lex-vg4-5_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/lexVg/
normalized-crossword-m1c-lex-vg4-5_ext.xml
MD5SUMe11f37f2b6dc6dada2ec32e29eb25689
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.016996
Satisfiable
(Un)Satisfiability was proved
Number of variables20
Number of constraints9
Maximum constraint arity5
Maximum domain size26
Number of constraints which are defined in extension9
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
Mistral-prime 1.3131079088SAT 0.016996 0.021381
MDG-noprobe 2008-06-271079078SAT 0.017996 0.0201599
MDG-probe 2008-06-271079077SAT 0.020996 0.0223889
cpHydra k_401079094SAT 0.029994 0.035924
cpHydra k_101079093SAT 0.029994 0.0426181
Mistral-option 1.3141079087SAT 0.031994 0.0350299
mddc-solv 2008-06-091079075SAT 0.035994 0.036419
casper zito1079090SAT 0.19097 0.193351
casper zao1079089SAT 0.246962 0.253225
spider 2008-06-141079076SAT 0.488924 0.503929
Minion/Tailor 2008-07-041105987SAT 0.589909 0.644255
Abscon 112v4 AC1079091SAT 0.730888 0.784286
Abscon 112v4 ESAC1079092SAT 0.742886 0.786487
choco2_dwdeg 2008-06-261079084SAT 0.905861 0.952675
choco2_impwdeg 2008-06-261079083SAT 0.951854 0.992276
bpsolver 2008-06-271079082SAT 2.38964 2.41378
Sugar v1.13+minisat1079081SAT 4.35234 4.54452
Sugar v1.13+picosat1079080SAT 4.70628 4.85137
galac E1079086SAT 12.3051 12.5206
galac M1079085SAT 15.4716 15.6901
Concrete + CPS4J 2008-05-301079074SAT 16.2225 16.3114
Concrete + CSP4J - Tabu Engine 2008-05-301079072SAT 1386.18 1392.92
SAT4J CSP 2008-06-131079079? (MO) 33.132 32.2365
Concrete + CSP4J - WMC Engine 2008-05-301079073? (TO) 1800.1 1802.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:
11 0 1 8 0 0 1 0 1 0 12 4 3 8 0 1 11 4 18 18