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 benchmark0.636902
(Un)Satisfiability was proved
Number of variables40
Number of constraints369
Maximum constraint arity2
Maximum domain size2
Number of constraints which are defined in extension369
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
aolibpvo 2007-01-17278368OPTIMUM 0.636902 0.638659
Toolbar_MaxSat 2007-01-19278374OPTIMUM 0.642902 0.652024
aolibdvo 2007-01-17278369OPTIMUM 0.675896 0.680364
toolbar 2007-01-12278376OPTIMUM 3.16052 3.17906
Toolbar_BTD 2007-01-12278375OPTIMUM 3.38149 3.4061
Toulbar2 2007-01-12278373OPTIMUM 3.99039 4.01858
AbsconMax 109 EPFC278371OPTIMUM 120.733 121.294
AbsconMax 109 PFC278372OPTIMUM 159.972 160.647
CSP4J - MaxCSP 2006-12-19278370? (problem) 0.429933 0.448893