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.49556
(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 PFC281234OPTIMUM 9.49556 9.59015
toolbar 2007-01-12281238OPTIMUM 9.78051 9.79279
Toolbar_BTD 2007-01-12281237OPTIMUM 10.1585 10.2622
Toulbar2 2007-01-12281235OPTIMUM 13.8209 13.8845
AbsconMax 109 EPFC281233OPTIMUM 25.1762 25.445
aolibdvo 2007-01-17281231OPTIMUM 29.6525 29.8896
aolibpvo 2007-01-17281230OPTIMUM 31.0703 31.0891
CSP4J - MaxCSP 2006-12-19281232MSAT (TO) 2400.08 2411.55
Toolbar_MaxSat 2007-01-19281236? (TO) 2400.07 2411.84