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 constraints1791
Best CPU time to get the best result obtained on this benchmark302.103
(Un)Satisfiability was proved
Number of variables40
Number of constraints1973
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension1973
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-12278286OPTIMUM 302.103 303.415
Toolbar_BTD 2007-01-12278285OPTIMUM 302.39 303.822
Toolbar_MaxSat 2007-01-19278284OPTIMUM 317.928 318.025
Toulbar2 2007-01-12278283OPTIMUM 1092.92 1103.06
CSP4J - MaxCSP 2006-12-19278280MSAT (TO) 2400.02 2422.6
AbsconMax 109 PFC278282MSAT (TO) 2400.1 2401.93
AbsconMax 109 EPFC278281MSAT (TO) 2400.12 2402.75
aolibpvo 2007-01-17278278? (TO) 2400.02 2402.83
aolibdvo 2007-01-17278279? (TO) 2400.04 2418.19