MAX-CSP 2006 Competition: solvers results per benchmarks

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

Jump to solvers results

General information on the benchmark

Nametightness/tightness0.2/
rand-2-40-11-414-200-1_ext.xml
MD5SUM1b1c27f1174ad9d3519665d1cc58d473
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 benchmark161.952
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
AbsconMax 109 PFC277013OPTIMUM 161.952 163.417
Toulbar2 2007-01-12277014OPTIMUM 371.978 375.305
AbsconMax 109 EPFC277012OPTIMUM 432.659 433.277
toolbar 2007-01-12277017OPTIMUM 511.201 512.258
Toolbar_BTD 2007-01-12277016OPTIMUM 639.335 644.215
aolibpvo 2007-01-17277009OPTIMUM 2048.8 2065.78
aolibdvo 2007-01-17277010OPTIMUM 2094.07 2109.38
CSP4J - MaxCSP 2006-12-19277011MSAT (TO) 2400.05 2412.51
Toolbar_MaxSat 2007-01-19277015? (TO) 2400.03 2418.1