MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
tightness/tightness0.2/
rand-2-40-11-414-200-39_ext.xml

Jump to solvers results

General information on the benchmark

Nametightness/tightness0.2/
rand-2-40-11-414-200-39_ext.xml
MD5SUM46ee70eb3b6a8794a3c1237e4cc2853d
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints413
Best CPU time to get the best result obtained on this benchmark25.9141
SatisfiableNO
(Un)Satisfiability was provedNO
Number of variables40
Number of constraints414
Maximum constraint arity2
Maximum domain size11
Number of constraints which are defined in extension414
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-12276990OPTIMUM 25.9141 26.1679
Toolbar_BTD 2007-01-12276989OPTIMUM 33.5089 33.6663
Toulbar2 2007-01-12276987OPTIMUM 219.471 221.184
AbsconMax 109 PFC276986OPTIMUM 311.747 314.469
AbsconMax 109 EPFC276985OPTIMUM 1622.35 1624.1
aolibpvo 2007-01-17276982OPTIMUM 1948.13 1956.82
aolibdvo 2007-01-17276983OPTIMUM 2319.69 2331.97
CSP4J - MaxCSP 2006-12-19276984MSAT (TO) 2400.08 2415.98
Toolbar_MaxSat 2007-01-19276988? (TO) 2400.01 2411.47