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 constraints222
Best CPU time to get the best result obtained on this benchmark9.1856
(Un)Satisfiability was provedNO
Number of variables30
Number of constraints223
Maximum constraint arity2
Maximum domain size15
Number of constraints which are defined in extension223
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-12275568OPTIMUM 9.1856 9.29027
Toolbar_BTD 2007-01-12275567OPTIMUM 10.1405 10.2013
AbsconMax 109 PFC275564OPTIMUM 19.992 20.228
Toulbar2 2007-01-12275565OPTIMUM 22.4086 22.6314
aolibpvo 2007-01-17275560OPTIMUM 31.8862 32.0529
aolibdvo 2007-01-17275561OPTIMUM 34.6857 34.9726
AbsconMax 109 EPFC275563OPTIMUM 44.2543 44.7995
CSP4J - MaxCSP 2006-12-19275562MSAT (TO) 2400.05 2402.23
Toolbar_MaxSat 2007-01-19275566? (TO) 2400.02 2411.38