CSP 2008 Competition: solvers results per benchmarks

Result page for benchmark
csp/tightness0.8/
normalized-rand-2-40-80-103-800-25_ext.xml

Jump to solvers results

General information on the benchmark

Namecsp/tightness0.8/
normalized-rand-2-40-80-103-800-25_ext.xml
MD5SUMa76ef683ec8e7d029a4d3919489c756c
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkUNSAT
Best CPU time to get the best result obtained on this benchmark1.3168
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints103
Maximum constraint arity2
Maximum domain size80
Number of constraints which are defined in extension103
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.3131103273UNSAT 1.3168 1.33081
MDG-noprobe 2008-06-271103263UNSAT 1.3258 1.34354
cpHydra k_101103278UNSAT 1.42978 1.44803
cpHydra k_401103279UNSAT 1.44478 1.47905
MDG-probe 2008-06-271103262UNSAT 1.51077 1.52226
Mistral-option 1.3141103272UNSAT 1.52377 1.54546
Concrete + CPS4J 2008-05-301103260UNSAT 3.47747 3.52307
Abscon 112v4 ESAC1103277UNSAT 10.6974 10.7231
Abscon 112v4 AC1103276UNSAT 11.5402 11.6922
choco2_impwdeg 2008-06-261103268UNSAT 18.3312 18.5348
choco2_dwdeg 2008-06-261103269UNSAT 19.663 19.9017
spider 2008-06-141103261UNSAT 29.4345 29.4487
galac E1103271UNSAT 33.7489 33.9506
Minion/Tailor 2008-07-041107231UNSAT 52.635 53.18
SAT4J CSP 2008-06-131103264UNSAT 58.1562 58.3048
Sugar v1.13+picosat1103265UNSAT 74.4197 74.6565
galac M1103270UNSAT 87.5457 88.4431
Sugar v1.13+minisat1103266UNSAT 103.931 104.567
casper zito1103275UNSAT 349.865 349.975
casper zao1103274UNSAT 376.495 380.07
bpsolver 2008-06-271103267UNSAT 426.383 428.737
Concrete + CSP4J - Tabu Engine 2008-05-301103258? (TO) 1800.02 1813.32
Concrete + CSP4J - WMC Engine 2008-05-301103259? (TO) 1800.04 1807.62

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: