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 constraints162
Best CPU time to get the best result obtained on this benchmark4.30534
(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
toolbar 2007-01-12278736OPTIMUM 4.30534 4.34317
Toolbar_BTD 2007-01-12278735OPTIMUM 4.48732 4.49599
aolibpvo 2007-01-17278728OPTIMUM 5.54616 5.54959
aolibdvo 2007-01-17278729OPTIMUM 6.03608 6.03658
Toulbar2 2007-01-12278733OPTIMUM 8.40272 8.44718
AbsconMax 109 PFC278732OPTIMUM 297.029 298.35
AbsconMax 109 EPFC278731OPTIMUM 396.626 400.331
CSP4J - MaxCSP 2006-12-19278730? (problem) 0.461929 0.557001
Toolbar_MaxSat 2007-01-19278734? (TO) 2400.07 2403.68