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 constraints46
Best CPU time to get the best result obtained on this benchmark6.24805
(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_BTD 2007-01-12281786OPTIMUM 6.24805 6.37838
toolbar 2007-01-12281787OPTIMUM 6.38303 6.45086
Toulbar2 2007-01-12281784OPTIMUM 8.93264 8.97933
aolibdvo 2007-01-17281780OPTIMUM 24.4093 24.603
aolibpvo 2007-01-17281779OPTIMUM 59.233 59.765
AbsconMax 109 PFC281783MSAT (TO) 2400.07 2413.54
AbsconMax 109 EPFC281782MSAT (TO) 2400.14 2418.03
CSP4J - MaxCSP 2006-12-19281781? (problem) 0.395939 0.457999
Toolbar_MaxSat 2007-01-19281785? (TO) 2400.04 2413.32