CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/ukVg/
normalized-crossword-m1c-uk-vg16-18_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/ukVg/
normalized-crossword-m1c-uk-vg16-18_ext.xml
MD5SUMb9a123c3462c681e773444fb1d5bb234
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.811875
Satisfiable
(Un)Satisfiability was proved
Number of variables288
Number of constraints34
Maximum constraint arity18
Maximum domain size26
Number of constraints which are defined in extension34
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-271069143UNSAT 0.811875 0.817649
cpHydra k_101069158UNSAT 0.878866 0.882316
cpHydra k_401069159UNSAT 0.945855 0.958662
Mistral-prime 1.3131069153UNSAT 0.966852 0.97806
Abscon 112v4 ESAC1069157UNSAT 1.27781 1.3171
Abscon 112v4 AC1069156UNSAT 1.2878 1.30386
Mistral-option 1.3141069152UNSAT 1.48977 1.49535
Concrete + CPS4J 2008-05-301069139UNSAT 1.72074 1.75279
mddc-solv 2008-06-091069140UNSAT 3.05453 3.08774
casper zito1069155UNSAT 10.0545 10.1569
Minion/Tailor 2008-07-041107331UNSAT 13.5109 13.7174
choco2_impwdeg 2008-06-261069148UNSAT 14.3428 14.5335
choco2_dwdeg 2008-06-261069149UNSAT 14.4098 14.6002
casper zao1069154UNSAT 24.8512 25.0813
galac M1069150UNSAT 51.6741 52.2114
galac E1069151UNSAT 66.7459 67.4488
MDG-probe 2008-06-271069142UNSAT 69.2635 69.9056
SAT4J CSP 2008-06-131069144? 70.6433 69.1571
Concrete + CSP4J - Tabu Engine 2008-05-301069137? (TO) 1800 1802.52
Concrete + CSP4J - WMC Engine 2008-05-301069138? (TO) 1800.04 1817.12
Sugar v1.13+picosat1069145? (TO) 1800.09 1804.33
spider 2008-06-141069141? (TO) 1800.1 1807.61
Sugar v1.13+minisat1069146? (TO) 1800.1 1807.71
bpsolver 2008-06-271069147? (TO) 1800.12 1809.07

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: