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 constraints169
Best CPU time to get the best result obtained on this benchmark3.16652
(Un)Satisfiability was proved
Number of variables62
Number of constraints211
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension211
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
aolibpvo 2007-01-17278908OPTIMUM 3.16652 3.18191
Toolbar_BTD 2007-01-12278915OPTIMUM 4.13437 4.13868
aolibdvo 2007-01-17278909OPTIMUM 22.2456 22.416
toolbar 2007-01-12278916OPTIMUM 25.1462 25.1595
Toulbar2 2007-01-12278913OPTIMUM 102.296 102.614
AbsconMax 109 EPFC278911MSAT (TO) 2400.04 2403.02
AbsconMax 109 PFC278912MSAT (TO) 2400.12 2414.18
CSP4J - MaxCSP 2006-12-19278910? (problem) 0.468928 0.515717
Toolbar_MaxSat 2007-01-19278914? (TO) 2400.08 2419.49