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 constraints225
Best CPU time to get the best result obtained on this benchmark11.2823
(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-12279267OPTIMUM 11.2823 11.3455
Toolbar_BTD 2007-01-12279266OPTIMUM 14.9397 15.0831
Toulbar2 2007-01-12279264OPTIMUM 47.4688 47.7174
aolibpvo 2007-01-17279259OPTIMUM 78.3281 78.9703
aolibdvo 2007-01-17279260OPTIMUM 125.532 126.22
AbsconMax 109 PFC279263MSAT (TO) 2400.03 2409.86
AbsconMax 109 EPFC279262MSAT (TO) 2400.14 2402.7
CSP4J - MaxCSP 2006-12-19279261? (problem) 0.471928 0.499956
Toolbar_MaxSat 2007-01-19279265? (TO) 2400.15 2421.62