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 constraints299
Best CPU time to get the best result obtained on this benchmark9.57954
(Un)Satisfiability was proved
Number of variables25
Number of constraints300
Maximum constraint arity2
Maximum domain size10
Number of constraints which are defined in extension300
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-12281301OPTIMUM 9.57954 9.67079
Toolbar_BTD 2007-01-12281300OPTIMUM 9.8955 9.99064
AbsconMax 109 PFC281297OPTIMUM 10.2004 10.3557
Toulbar2 2007-01-12281298OPTIMUM 13.6019 13.7434
AbsconMax 109 EPFC281296OPTIMUM 25.8201 26.143
aolibpvo 2007-01-17281293OPTIMUM 96.1754 96.8911
aolibdvo 2007-01-17281294OPTIMUM 96.6903 97.0736
CSP4J - MaxCSP 2006-12-19281295MSAT (TO) 2400.04 2403.85
Toolbar_MaxSat 2007-01-19281299? (TO) 2400.05 2414.78