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 constraints118
Best CPU time to get the best result obtained on this benchmark10.1685
(Un)Satisfiability was proved
Number of variables40
Number of constraints255
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension255
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-12279141OPTIMUM 10.1685 10.2263
Toolbar_BTD 2007-01-12279140OPTIMUM 16.5925 16.7237
Toulbar2 2007-01-12279138OPTIMUM 34.9537 35.1196
aolibpvo 2007-01-17279133OPTIMUM 87.8586 88.5524
aolibdvo 2007-01-17279134OPTIMUM 93.0539 93.2409
AbsconMax 109 EPFC279136MSAT (TO) 2400.08 2414.6
AbsconMax 109 PFC279137MSAT (TO) 2400.08 2400.99
CSP4J - MaxCSP 2006-12-19279135? (problem) 0.471927 0.612413
Toolbar_MaxSat 2007-01-19279139? (TO) 2400.05 2406.21