MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
tightness/tightness0.1/
rand-2-40-8-753-100-36_ext.xml

Jump to solvers results

General information on the benchmark

Nametightness/tightness0.1/
rand-2-40-8-753-100-36_ext.xml
MD5SUMdcbd6b9485b369434f0a650143d33872
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints752
Best CPU time to get the best result obtained on this benchmark0
SatisfiableNO
(Un)Satisfiability was provedNO
Number of variables40
Number of constraints753
Maximum constraint arity2
Maximum domain size8
Number of constraints which are defined in extension753
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
AbsconMax 109 PFC276833OPTIMUM 0 139.819
toolbar 2007-01-12276837OPTIMUM 22.7545 22.9319
Toolbar_BTD 2007-01-12276836OPTIMUM 27.9408 28.1823
Toulbar2 2007-01-12276834OPTIMUM 119.266 119.764
aolibpvo 2007-01-17276829OPTIMUM 959.813 966.479
aolibdvo 2007-01-17276830OPTIMUM 1007.83 1016.07
AbsconMax 109 EPFC276832OPTIMUM 1071.59 1081.19
CSP4J - MaxCSP 2006-12-19276831MSAT (TO) 2400.08 2412.39
Toolbar_MaxSat 2007-01-19276835? (TO) 2400.04 2414.34