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 constraints189
Best CPU time to get the best result obtained on this benchmark0.267959
(Un)Satisfiability was proved
Number of variables80
Number of constraints196
Maximum constraint arity2
Maximum domain size2
Number of constraints which are defined in extension196
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-17277783OPTIMUM 0.267959 0.268017
aolibdvo 2007-01-17277784OPTIMUM 0.307952 0.316839
Toolbar_MaxSat 2007-01-19277789OPTIMUM 0.324949 0.394881
toolbar 2007-01-12277791OPTIMUM 1.71474 1.73138
Toulbar2 2007-01-12277788OPTIMUM 1.76473 1.79195
Toolbar_BTD 2007-01-12277790OPTIMUM 1.88171 1.89005
AbsconMax 109 PFC277787OPTIMUM 82.6334 83.0698
AbsconMax 109 EPFC277786OPTIMUM 91.824 92.7241
CSP4J - MaxCSP 2006-12-19277785? (problem) 0.372942 0.397649