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.144977
(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-17278701OPTIMUM 0.144977 0.144919
aolibdvo 2007-01-17278702OPTIMUM 0.164974 0.171178
AbsconMax 109 PFC278705OPTIMUM 0.864867 0.926803
AbsconMax 109 EPFC278704OPTIMUM 0.875866 0.923875
toolbar 2007-01-12278709OPTIMUM 2.69859 2.71522
Toulbar2 2007-01-12278706OPTIMUM 2.91456 2.95451
Toolbar_BTD 2007-01-12278708OPTIMUM 3.07253 3.10964
Toolbar_MaxSat 2007-01-19278707OPTIMUM 8.05177 8.09682
CSP4J - MaxCSP 2006-12-19278703MSAT (TO) 2400.01 2402.18