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 constraints132
Best CPU time to get the best result obtained on this benchmark3.56546
(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
aolibdvo 2007-01-17278738OPTIMUM 3.56546 3.57782
aolibpvo 2007-01-17278737OPTIMUM 3.83742 3.84252
toolbar 2007-01-12278745OPTIMUM 4.74528 4.79321
Toolbar_BTD 2007-01-12278744OPTIMUM 5.22021 5.24456
Toulbar2 2007-01-12278742OPTIMUM 7.27089 7.29963
AbsconMax 109 PFC278741OPTIMUM 333.678 335.166
AbsconMax 109 EPFC278740OPTIMUM 402.044 402.189
CSP4J - MaxCSP 2006-12-19278739? (problem) 0.438933 0.505286
Toolbar_MaxSat 2007-01-19278743? (TO) 2400.1 2420.59