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 benchmark6.41002
(Un)Satisfiability was proved
Number of variables58
Number of constraints309
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension309
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-12279500OPTIMUM 6.41002 6.47646
aolibdvo 2007-01-17279494OPTIMUM 21.6187 21.7064
toolbar 2007-01-12279501OPTIMUM 47.0328 47.117
Toulbar2 2007-01-12279498OPTIMUM 125.969 127.041
aolibpvo 2007-01-17279493OPTIMUM 383.74 385.17
AbsconMax 109 EPFC279496MSAT (TO) 2400.04 2411.14
AbsconMax 109 PFC279497MSAT (TO) 2400.04 2400.85
CSP4J - MaxCSP 2006-12-19279495? (problem) 0.487924 0.511461
Toolbar_MaxSat 2007-01-19279499? (TO) 2400.01 2411.47