CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/ukVg/
normalized-crossword-m1c-uk-vg15-18_ext.xml
MD5SUMa701f3f59671fae930bd0c2ea7e3e55b
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.62975
Satisfiable
(Un)Satisfiability was proved
Number of variables270
Number of constraints33
Maximum constraint arity18
Maximum domain size26
Number of constraints which are defined in extension33
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 AC1068190UNSAT 1.62975 1.66781
MDG-noprobe 2008-06-271068177UNSAT 2.11468 2.13953
Mistral-prime 1.3131068187UNSAT 2.29865 2.3134
Concrete + CPS4J 2008-05-301068173UNSAT 3.55046 3.59544
mddc-solv 2008-06-091068174UNSAT 6.36003 6.39833
Abscon 112v4 ESAC1068191UNSAT 6.73298 6.84081
cpHydra k_401068193UNSAT 8.58569 8.77942
cpHydra k_101068192UNSAT 8.67468 8.7834
Mistral-option 1.3141068186UNSAT 11.5542 11.6937
casper zito1068189UNSAT 20.4409 20.5527
choco2_impwdeg 2008-06-261068182UNSAT 23.8104 23.9801
choco2_dwdeg 2008-06-261068183UNSAT 25.6511 25.9114
Minion/Tailor 2008-07-041107327UNSAT 38.4672 38.7252
casper zao1068188UNSAT 59.197 59.4941
MDG-probe 2008-06-271068176UNSAT 66.3579 66.6881
galac M1068184UNSAT 78.4491 79.4352
galac E1068185UNSAT 86.5498 87.4392
Sugar v1.13+minisat1068180UNSAT 907.757 918.235
SAT4J CSP 2008-06-131068178? 84.2752 82.2391
spider 2008-06-141068175? (TO) 1800.01 1814.81
Sugar v1.13+picosat1068179? (TO) 1800.01 1821.75
Concrete + CSP4J - WMC Engine 2008-05-301068172? (TO) 1800.06 1812.82
Concrete + CSP4J - Tabu Engine 2008-05-301068171? (TO) 1800.07 1814.22
bpsolver 2008-06-271068181? (TO) 1800.16 1802.47

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: