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 constraints35
Best CPU time to get the best result obtained on this benchmark11.9062
(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-12281435OPTIMUM 11.9062 11.9673
toolbar 2007-01-12281436OPTIMUM 12.3461 12.4242
Toulbar2 2007-01-12281433OPTIMUM 27.4748 27.7
aolibdvo 2007-01-17281429OPTIMUM 151.614 152.334
aolibpvo 2007-01-17281428OPTIMUM 152.26 153.553
AbsconMax 109 EPFC281431OPTIMUM 317.04 319.931
AbsconMax 109 PFC281432OPTIMUM 453.691 457.65
CSP4J - MaxCSP 2006-12-19281430? (problem) 0.376942 0.447006
Toolbar_MaxSat 2007-01-19281434? (TO) 2400.08 2412.64