CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/lexVg/
normalized-crossword-m1c-lex-vg10-12_ext.xml
MD5SUMeb1569f94e68bd8b544b9e21020dd29b
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.370943
Satisfiable
(Un)Satisfiability was proved
Number of variables120
Number of constraints22
Maximum constraint arity12
Maximum domain size26
Number of constraints which are defined in extension22
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.3131078973UNSAT 0.370943 0.371688
MDG-noprobe 2008-06-271078963UNSAT 0.399938 0.406579
cpHydra k_101078978UNSAT 0.420935 0.427847
cpHydra k_401078979UNSAT 0.421935 0.439619
Abscon 112v4 AC1078976UNSAT 0.942856 0.997847
mddc-solv 2008-06-091078960UNSAT 0.956854 0.968441
Concrete + CPS4J 2008-05-301078959UNSAT 1.05484 1.10913
Mistral-option 1.3141078972UNSAT 1.34979 1.35071
Abscon 112v4 ESAC1078977UNSAT 1.90571 1.93581
choco2_dwdeg 2008-06-261078969UNSAT 4.18136 4.22807
choco2_impwdeg 2008-06-261078968UNSAT 4.54831 5.62268
Minion/Tailor 2008-07-041105969UNSAT 7.77382 7.85531
casper zito1078975UNSAT 8.83766 8.84787
casper zao1078974UNSAT 9.71152 9.72254
MDG-probe 2008-06-271078962UNSAT 15.5006 15.5299
galac M1078970UNSAT 27.6528 27.9642
galac E1078971UNSAT 34.6577 35.2583
Sugar v1.13+minisat1078966UNSAT 88.5885 89.5826
Sugar v1.13+picosat1078965UNSAT 149.832 151.48
SAT4J CSP 2008-06-131078964? 32.877 29.7257
Concrete + CSP4J - Tabu Engine 2008-05-301078957? (TO) 1800.01 1810.92
Concrete + CSP4J - WMC Engine 2008-05-301078958? (TO) 1800.06 1810.92
bpsolver 2008-06-271078967? (TO) 1800.08 1807.44
spider 2008-06-141078961? (TO) 1800.11 1812.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: