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 constraints2365
Best CPU time to get the best result obtained on this benchmark1080.27
(Un)Satisfiability was proved
Number of variables1359
Number of constraints2366
Maximum constraint arity5
Maximum domain size2
Number of constraints which are defined in extension2366
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
AbsconMax 109 PFC277589OPTIMUM 1080.27 1081.43
AbsconMax 109 EPFC277588OPTIMUM 1117.02 1127.14
CSP4J - MaxCSP 2006-12-19277587MSAT (TO) 2400.1 2420.82
Toulbar2 2007-01-12277590MSAT (TO) 2400.1 2409.35
aolibpvo 2007-01-17277585MSAT (TO) 2400.13 2411.17
Toolbar_BTD 2007-01-12277592? (TO) 2400.01 2418.16
toolbar 2007-01-12277593? (TO) 2400.08 2402.69
Toolbar_MaxSat 2007-01-19277591? (TO) 2400.1 2420.43
aolibdvo 2007-01-17277586? (TO) 2400.1 2409.79