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 constraints158
Best CPU time to get the best result obtained on this benchmark7.8828
(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-12279312OPTIMUM 7.8828 7.96614
Toolbar_BTD 2007-01-12279311OPTIMUM 9.2136 9.30188
Toulbar2 2007-01-12279309OPTIMUM 20.4849 20.5717
aolibdvo 2007-01-17279305OPTIMUM 28.1677 28.3877
aolibpvo 2007-01-17279304OPTIMUM 72.13 72.2387
AbsconMax 109 EPFC279307MSAT (TO) 2400.1 2409.26
AbsconMax 109 PFC279308MSAT (TO) 2400.1 2409.08
CSP4J - MaxCSP 2006-12-19279306? (problem) 0.483925 0.508974
Toolbar_MaxSat 2007-01-19279310? (TO) 2400.04 2421.48