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 constraints42
Best CPU time to get the best result obtained on this benchmark4.26035
(Un)Satisfiability was proved
Number of variables25
Number of constraints63
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension63
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 2007-01-12281652OPTIMUM 4.26035 4.28365
Toulbar2 2007-01-12281649OPTIMUM 4.48132 4.51295
Toolbar_BTD 2007-01-12281651OPTIMUM 4.51731 4.54598
aolibpvo 2007-01-17281644OPTIMUM 12.1472 12.1944
aolibdvo 2007-01-17281645OPTIMUM 16.1805 16.2361
AbsconMax 109 EPFC281647OPTIMUM 877.666 878.004
AbsconMax 109 PFC281648OPTIMUM 1076.07 1076.37
CSP4J - MaxCSP 2006-12-19281646? (problem) 0.366944 0.394169
Toolbar_MaxSat 2007-01-19281650? (TO) 2400.06 2408.32