CSP 2008 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Namecsp/tightness0.8/
normalized-rand-2-40-80-103-800-59_ext.xml
MD5SUM9509fa9d9c8a8361ccac678e618ac115
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 benchmark5.22321
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
MDG-probe 2008-06-271103306UNSAT 5.22321 5.26988
Mistral-option 1.3141103316UNSAT 5.33019 5.381
Mistral-prime 1.3131103317UNSAT 7.37388 7.41466
MDG-noprobe 2008-06-271103307UNSAT 7.45287 7.5128
Concrete + CPS4J 2008-05-301103304UNSAT 13.342 13.3645
choco2_dwdeg 2008-06-261103313UNSAT 33.179 33.441
choco2_impwdeg 2008-06-261103312UNSAT 34.0418 34.4195
Abscon 112v4 ESAC1103321UNSAT 54.2707 54.5435
Abscon 112v4 AC1103320UNSAT 58.4151 58.9704
cpHydra k_401103323UNSAT 61.1097 61.3751
cpHydra k_101103322UNSAT 65.1201 66.2644
spider 2008-06-141103305UNSAT 92.6389 93.4378
galac E1103315UNSAT 198.332 200.236
bpsolver 2008-06-271103311UNSAT 226.366 227.125
Minion/Tailor 2008-07-041107238UNSAT 324.005 327.157
Sugar v1.13+minisat1103310UNSAT 497.565 500.134
SAT4J CSP 2008-06-131103308UNSAT 500.733 503.01
Sugar v1.13+picosat1103309UNSAT 594.634 600.378
galac M1103314UNSAT 1139.76 1140.51
casper zito1103319UNSAT 1473.4 1476.75
casper zao1103318UNSAT 1785.43 1801.22
Concrete + CSP4J - Tabu Engine 2008-05-301103302? (TO) 1800.05 1802.62
Concrete + CSP4J - WMC Engine 2008-05-301103303? (TO) 1800.05 1803.72

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: