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 benchmark8.65968
(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
AbsconMax 109 PFC281243OPTIMUM 8.65968 8.89947
Toolbar_BTD 2007-01-12281246OPTIMUM 9.39757 9.4947
toolbar 2007-01-12281247OPTIMUM 9.57454 9.5924
Toulbar2 2007-01-12281244OPTIMUM 13.206 13.2186
AbsconMax 109 EPFC281242OPTIMUM 22.3826 22.6426
aolibpvo 2007-01-17281239OPTIMUM 111.129 112.079
aolibdvo 2007-01-17281240OPTIMUM 112.764 113.201
Toolbar_MaxSat 2007-01-19281245OPTIMUM 1191.99 1198.45
CSP4J - MaxCSP 2006-12-19281241MSAT (TO) 2400.03 2410.87