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 constraints47
Best CPU time to get the best result obtained on this benchmark6.32104
(Un)Satisfiability was proved
Number of variables25
Number of constraints75
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension75
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-12281841OPTIMUM 6.32104 6.40188
Toolbar_BTD 2007-01-12281840OPTIMUM 6.43102 6.48696
Toulbar2 2007-01-12281838OPTIMUM 7.11992 7.13279
aolibdvo 2007-01-17281834OPTIMUM 12.7691 12.8769
aolibpvo 2007-01-17281833OPTIMUM 17.0554 17.0756
AbsconMax 109 PFC281837OPTIMUM 518.897 519.425
AbsconMax 109 EPFC281836OPTIMUM 561.299 566.028
CSP4J - MaxCSP 2006-12-19281835? (problem) 0.39294 0.463131
Toolbar_MaxSat 2007-01-19281839? (TO) 2400.07 2402.58