MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark

Jump to solvers results

General information on the benchmark

Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints179
Best CPU time to get the best result obtained on this benchmark34.1838
(Un)Satisfiability was provedNO
Number of variables40
Number of constraints180
Maximum constraint arity2
Maximum domain size25
Number of constraints which are defined in extension180
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-12276378OPTIMUM 34.1838 34.4788
Toolbar_BTD 2007-01-12276377OPTIMUM 41.7746 41.9521
aolibdvo 2007-01-17276371OPTIMUM 966.805 974.925
AbsconMax 109 PFC276374OPTIMUM 1123.67 1129.11
Toulbar2 2007-01-12276375OPTIMUM 1392.38 1399.98
CSP4J - MaxCSP 2006-12-19276372MSAT (TO) 2400.05 2421.02
AbsconMax 109 EPFC276373MSAT (TO) 2400.08 2410.38
Toolbar_MaxSat 2007-01-19276376? (TO) 2400.01 2416.86
aolibpvo 2007-01-17276370? (TO) 2400.1 2417.65