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 constraints52
Best CPU time to get the best result obtained on this benchmark0.12698
(Un)Satisfiability was proved
Number of variables37
Number of constraints53
Maximum constraint arity3
Maximum domain size21
Number of constraints which are defined in extension53
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-17280591OPTIMUM 0.111982 0.112726
aolibdvo 2007-01-17280592OPTIMUM 0.12698 0.127851
AbsconMax 109 EPFC280594OPTIMUM 0.732888 0.76371
AbsconMax 109 PFC280595OPTIMUM 0.78088 0.822068
Toulbar2 2007-01-12280596OPTIMUM 17.8633 17.984
toolbar 2007-01-12280599OPTIMUM 18.0733 18.1084
Toolbar_BTD 2007-01-12280598OPTIMUM 18.3052 18.4057
CSP4J - MaxCSP 2006-12-19280593? (problem) 0.641901 0.659883
Toolbar_MaxSat 2007-01-19280597? (MO) 1.07 1.13812