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 constraints57
Best CPU time to get the best result obtained on this benchmark220.504
(Un)Satisfiability was provedNO
Number of variables20
Number of constraints58
Maximum constraint arity3
Maximum domain size20
Number of constraints which are defined in extension58
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-12275970OPTIMUM 220.504 222.379
Toolbar_BTD 2007-01-12275969OPTIMUM 254.93 256.232
aolibpvo 2007-01-17275962OPTIMUM 1258.73 1268.07
aolibdvo 2007-01-17275963OPTIMUM 1328.73 1335
Toulbar2 2007-01-12275967OPTIMUM 1394.27 1407.11
AbsconMax 109 PFC275966OPTIMUM 2330.78 2335.95
CSP4J - MaxCSP 2006-12-19275964MSAT (TO) 2400.08 2410.78
AbsconMax 109 EPFC275965MSAT (TO) 2400.1 2412.01
Toolbar_MaxSat 2007-01-19275968? (exit code) 23.7884 24.0193