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 constraints1651
Best CPU time to get the best result obtained on this benchmark32.828
(Un)Satisfiability was proved
Number of variables1001
Number of constraints1670
Maximum constraint arity3
Maximum domain size6
Number of constraints which are defined in extension1670
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
Toulbar2 2007-01-12280614OPTIMUM 32.828 32.8537
AbsconMax 109 PFC280613MSAT (TO) 2400.07 2411.62
AbsconMax 109 EPFC280612MSAT (TO) 2400.11 2410.74
CSP4J - MaxCSP 2006-12-19280611? (problem) 1.3018 1.33616
Toolbar_MaxSat 2007-01-19280615? (MO) 2.11 2.15766
toolbar 2007-01-12280617? (TO) 2400 2400.83
Toolbar_BTD 2007-01-12280616? (TO) 2400.01 2411.9
aolibpvo 2007-01-17280609? (TO) 2400.05 2411.4
aolibdvo 2007-01-17280610? (TO) 2400.12 2408.2