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 constraints1171
Best CPU time to get the best result obtained on this benchmark66.6629
(Un)Satisfiability was proved
Number of variables40
Number of constraints1273
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension1273
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_MaxSat 2007-01-19278122OPTIMUM 66.6629 67.2881
toolbar 2007-01-12278124OPTIMUM 104.25 104.718
Toolbar_BTD 2007-01-12278123OPTIMUM 110.292 111.255
Toulbar2 2007-01-12278121OPTIMUM 429.773 431.41
aolibdvo 2007-01-17278117OPTIMUM 1275.24 1276.41
aolibpvo 2007-01-17278116OPTIMUM 1321.78 1322.33
AbsconMax 109 EPFC278119MSAT (TO) 2400.06 2401.51
AbsconMax 109 PFC278120MSAT (TO) 2400.06 2400.92
CSP4J - MaxCSP 2006-12-19278118MSAT (TO) 2400.08 2400.89