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 constraints43
Best CPU time to get the best result obtained on this benchmark4.35334
(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-12281634OPTIMUM 4.35334 4.40061
Toolbar_BTD 2007-01-12281633OPTIMUM 4.52831 4.58157
Toulbar2 2007-01-12281631OPTIMUM 4.92625 4.96449
aolibdvo 2007-01-17281627OPTIMUM 7.38987 7.44743
aolibpvo 2007-01-17281626OPTIMUM 30.0944 30.2906
AbsconMax 109 EPFC281629OPTIMUM 1291.75 1292.24
AbsconMax 109 PFC281630OPTIMUM 1352.74 1363.95
CSP4J - MaxCSP 2006-12-19281628? (problem) 0.394939 0.536202
Toolbar_MaxSat 2007-01-19281632? (TO) 2400.03 2409.86