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 constraints151
Best CPU time to get the best result obtained on this benchmark2.43663
(Un)Satisfiability was proved
Number of variables28
Number of constraints189
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension189
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-17278827OPTIMUM 2.43663 2.43866
aolibdvo 2007-01-17278828OPTIMUM 2.52262 2.53323
Toolbar_BTD 2007-01-12278834OPTIMUM 4.92625 4.98366
toolbar 2007-01-12278835OPTIMUM 4.95225 4.96675
Toulbar2 2007-01-12278832OPTIMUM 6.81896 6.82961
AbsconMax 109 EPFC278830OPTIMUM 86.5228 87.4146
AbsconMax 109 PFC278831OPTIMUM 160.625 161.985
CSP4J - MaxCSP 2006-12-19278829? (problem) 0.473927 0.506234
Toolbar_MaxSat 2007-01-19278833? (TO) 2400.11 2419.37