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 constraints130
Best CPU time to get the best result obtained on this benchmark4.14437
(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-17278755OPTIMUM 4.14437 4.17821
toolbar 2007-01-12278763OPTIMUM 4.71328 4.7675
Toolbar_BTD 2007-01-12278762OPTIMUM 4.88626 4.93457
aolibdvo 2007-01-17278756OPTIMUM 5.18121 5.18484
Toulbar2 2007-01-12278760OPTIMUM 5.9421 5.95321
AbsconMax 109 PFC278759OPTIMUM 319.373 319.599
AbsconMax 109 EPFC278758OPTIMUM 329.288 329.564
CSP4J - MaxCSP 2006-12-19278757? (problem) 0.443932 0.505826
Toolbar_MaxSat 2007-01-19278761? (TO) 2400.05 2401.57