MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
tightness/tightness0.65/
rand-2-40-40-135-650-30_ext.xml

Jump to solvers results

General information on the benchmark

Nametightness/tightness0.65/
rand-2-40-40-135-650-30_ext.xml
MD5SUMd922d856305eac74d8ce632d0a1bd305
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints134
Best CPU time to get the best result obtained on this benchmark62.0956
SatisfiableNO
(Un)Satisfiability was provedNO
Number of variables40
Number of constraints135
Maximum constraint arity2
Maximum domain size40
Number of constraints which are defined in extension135
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
toolbar 2007-01-12276738OPTIMUM 62.0956 62.6251
Toolbar_BTD 2007-01-12276737OPTIMUM 72.593 73.2858
Toulbar2 2007-01-12276735OPTIMUM 439.301 441.394
AbsconMax 109 PFC276734OPTIMUM 1782.27 1784.96
aolibdvo 2007-01-17276731OPTIMUM 2080.17 2089.83
aolibpvo 2007-01-17276730OPTIMUM 2270.55 2273.65
CSP4J - MaxCSP 2006-12-19276732MSAT (TO) 2400.02 2420.57
AbsconMax 109 EPFC276733MSAT (TO) 2400.15 2408.09
Toolbar_MaxSat 2007-01-19276736? (MO) 1.09 1.15155