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 constraints170
Best CPU time to get the best result obtained on this benchmark1.22281
(Un)Satisfiability was proved
Number of variables62
Number of constraints211
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension211
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-17278917OPTIMUM 1.22281 1.23915
aolibdvo 2007-01-17278918OPTIMUM 2.83657 2.86914
Toolbar_BTD 2007-01-12278924OPTIMUM 4.31234 4.34224
toolbar 2007-01-12278925OPTIMUM 7.1979 7.23138
Toulbar2 2007-01-12278922OPTIMUM 14.7908 14.9131
AbsconMax 109 EPFC278920MSAT (TO) 2400.07 2419.55
AbsconMax 109 PFC278921MSAT (TO) 2400.15 2400.97
CSP4J - MaxCSP 2006-12-19278919? (problem) 0.478927 0.596289
Toolbar_MaxSat 2007-01-19278923? (TO) 2400.05 2422.31