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 constraints188
Best CPU time to get the best result obtained on this benchmark0.083986
(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-17278683OPTIMUM 0.083986 0.0855901
aolibdvo 2007-01-17278684OPTIMUM 0.090985 0.092373
AbsconMax 109 PFC278687OPTIMUM 0.85087 0.921335
AbsconMax 109 EPFC278686OPTIMUM 0.893864 0.912849
toolbar 2007-01-12278691OPTIMUM 2.96955 3.00522
Toulbar2 2007-01-12278688OPTIMUM 2.99154 3.07448
Toolbar_BTD 2007-01-12278690OPTIMUM 3.35649 3.36452
Toolbar_MaxSat 2007-01-19278689OPTIMUM 92.4419 92.8858
CSP4J - MaxCSP 2006-12-19278685MSAT (TO) 2400.02 2401.04