MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark

Jump to solvers results

General information on the benchmark

Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints104
Best CPU time to get the best result obtained on this benchmark0.12298
(Un)Satisfiability was proved
Number of variables61
Number of constraints106
Maximum constraint arity3
Maximum domain size10
Number of constraints which are defined in extension106
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-17280528OPTIMUM 0.089985 0.097234
aolibdvo 2007-01-17280529OPTIMUM 0.12298 0.124572
Toulbar2 2007-01-12280533OPTIMUM 11.7412 11.7846
Toolbar_BTD 2007-01-12280535OPTIMUM 12.2641 12.3617
toolbar 2007-01-12280536OPTIMUM 12.3231 12.3535
AbsconMax 109 PFC280532OPTIMUM 30.9533 30.989
AbsconMax 109 EPFC280531OPTIMUM 31.2872 31.4751
CSP4J - MaxCSP 2006-12-19280530? (problem) 0.468928 0.497848
Toolbar_MaxSat 2007-01-19280534? (TO) 2400.04 2421.46