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 constraints102
Best CPU time to get the best result obtained on this benchmark3.07753
(Un)Satisfiability was proved
Number of variables61
Number of constraints108
Maximum constraint arity3
Maximum domain size10
Number of constraints which are defined in extension108
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-17280519OPTIMUM 0.45193 0.453537
aolibdvo 2007-01-17280520OPTIMUM 3.07753 3.10788
toolbar 2007-01-12280527OPTIMUM 11.0403 11.1174
Toulbar2 2007-01-12280524OPTIMUM 11.4033 11.4661
Toolbar_BTD 2007-01-12280526OPTIMUM 11.5172 11.5777
AbsconMax 109 EPFC280522OPTIMUM 31.9431 32.1333
AbsconMax 109 PFC280523OPTIMUM 35.8076 36.2192
CSP4J - MaxCSP 2006-12-19280521? (problem) 0.463929 0.501598
Toolbar_MaxSat 2007-01-19280525? (TO) 2400 2409.59