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 constraints80
Best CPU time to get the best result obtained on this benchmark0.093985
(Un)Satisfiability was proved
Number of variables30
Number of constraints81
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension81
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
aolibdvo 2007-01-17283031OPTIMUM 0.093985 0.099861
aolibpvo 2007-01-17283030OPTIMUM 0.12098 0.127467
AbsconMax 109 PFC283034OPTIMUM 0.837871 0.97409
AbsconMax 109 EPFC283033OPTIMUM 0.838871 0.875276
toolbar 2007-01-12283038OPTIMUM 1.60576 1.62112
Toulbar2 2007-01-12283035OPTIMUM 1.71674 1.74401
Toolbar_BTD 2007-01-12283037OPTIMUM 1.76873 1.78561
CSP4J - MaxCSP 2006-12-19283032MSAT (TO) 2400.05 2410.74
Toolbar_MaxSat 2007-01-19283036? (TO) 2400.13 2402.52