MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark

Jump to solvers results

General information on the benchmark

Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints106
Best CPU time to get the best result obtained on this benchmark0.137978
(Un)Satisfiability was proved
Number of variables61
Number of constraints108
Maximum constraint arity3
Maximum domain size10
Number of constraints which are defined in extension108
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
aolibpvo 2007-01-17280582OPTIMUM 0.119981 0.124853
aolibdvo 2007-01-17280583OPTIMUM 0.137978 0.145461
Toolbar_BTD 2007-01-12280589OPTIMUM 13.421 13.4352
toolbar 2007-01-12280590OPTIMUM 13.8209 13.9012
Toulbar2 2007-01-12280587OPTIMUM 14.1259 14.2028
AbsconMax 109 EPFC280585OPTIMUM 30.8453 31.1119
AbsconMax 109 PFC280586OPTIMUM 30.8893 30.9729
Toolbar_MaxSat 2007-01-19280588OPTIMUM 1953.78 1954.58
CSP4J - MaxCSP 2006-12-19280584? (problem) 0.528918 0.56818