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 constraints2129
Best CPU time to get the best result obtained on this benchmark291.681
(Un)Satisfiability was proved
Number of variables40
Number of constraints2354
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension2354
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_BTD 2007-01-12278294OPTIMUM 291.681 294.138
toolbar 2007-01-12278295OPTIMUM 294.427 294.561
Toolbar_MaxSat 2007-01-19278293OPTIMUM 373.023 374.933
Toulbar2 2007-01-12278292OPTIMUM 963.769 970.464
AbsconMax 109 EPFC278290MSAT (TO) 2400.04 2422.59
CSP4J - MaxCSP 2006-12-19278289MSAT (TO) 2400.06 2410.51
AbsconMax 109 PFC278291MSAT (TO) 2400.14 2402.86
aolibpvo 2007-01-17278287? (TO) 2400.05 2420.59
aolibdvo 2007-01-17278288? (TO) 2400.1 2400.87