MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark

Jump to solvers results

General information on the benchmark

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 benchmark0
(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-12276792OPTIMUM 0 78.3596
Toolbar_BTD 2007-01-12276791OPTIMUM 85.362 86.1524
Toulbar2 2007-01-12276789OPTIMUM 309.635 312.493
AbsconMax 109 EPFC276787OPTIMUM 913.299 915.786
AbsconMax 109 PFC276788OPTIMUM 1522.85 1529.94
aolibdvo 2007-01-17276785OPTIMUM 1912.22 1929.3
CSP4J - MaxCSP 2006-12-19276786MSAT (TO) 2400.03 2413.63
Toolbar_MaxSat 2007-01-19276790? (MO) 1.07 1.14202
aolibpvo 2007-01-17276784? (TO) 2400.03 2401.04