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 constraints576
Best CPU time to get the best result obtained on this benchmark5.03523
(Un)Satisfiability was proved
Number of variables351
Number of constraints578
Maximum constraint arity3
Maximum domain size10
Number of constraints which are defined in extension578
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-17280573OPTIMUM 4.96824 5.01907
aolibdvo 2007-01-17280574OPTIMUM 5.03523 5.06394
AbsconMax 109 PFC280577OPTIMUM 46.9929 47.1114
Toulbar2 2007-01-12280578OPTIMUM 60.9907 61.4466
toolbar 2007-01-12280581OPTIMUM 62.1566 62.4639
Toolbar_BTD 2007-01-12280580OPTIMUM 64.0343 64.6058
AbsconMax 109 EPFC280576OPTIMUM 69.9174 70.3342
CSP4J - MaxCSP 2006-12-19280575? (problem) 0.957853 0.989182
Toolbar_MaxSat 2007-01-19280579? (MO) 1.06 1.14231