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 constraints33
Best CPU time to get the best result obtained on this benchmark16.1875
(Un)Satisfiability was proved
Number of variables15
Number of constraints105
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension105
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_BTD 2007-01-12281471OPTIMUM 16.1875 16.2629
toolbar 2007-01-12281472OPTIMUM 16.6105 16.7049
Toulbar2 2007-01-12281469OPTIMUM 53.7398 54.1769
aolibdvo 2007-01-17281465OPTIMUM 154.525 154.874
aolibpvo 2007-01-17281464OPTIMUM 168.525 169.5
AbsconMax 109 EPFC281467OPTIMUM 824.276 826.774
AbsconMax 109 PFC281468OPTIMUM 2039.68 2053.08
CSP4J - MaxCSP 2006-12-19281466? (problem) 0.377942 0.446883
Toolbar_MaxSat 2007-01-19281470? (TO) 2400.1 2400.75