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 constraints452
Best CPU time to get the best result obtained on this benchmark4.29835
(Un)Satisfiability was proved
Number of variables40
Number of constraints660
Maximum constraint arity2
Maximum domain size2
Number of constraints which are defined in extension660
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_MaxSat 2007-01-19277699OPTIMUM 1.2848 1.30239
aolibpvo 2007-01-17277693OPTIMUM 4.29835 4.32024
aolibdvo 2007-01-17277694OPTIMUM 4.70228 4.74812
toolbar 2007-01-12277701OPTIMUM 5.2482 5.30063
Toolbar_BTD 2007-01-12277700OPTIMUM 5.41418 5.44477
Toulbar2 2007-01-12277698OPTIMUM 8.31673 8.32684
AbsconMax 109 EPFC277696OPTIMUM 299.718 302.274
AbsconMax 109 PFC277697OPTIMUM 353.799 355.53
CSP4J - MaxCSP 2006-12-19277695? (problem) 0.556914 0.613134