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 constraints391
Best CPU time to get the best result obtained on this benchmark4.79727
(Un)Satisfiability was proved
Number of variables40
Number of constraints671
Maximum constraint arity2
Maximum domain size2
Number of constraints which are defined in extension671
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_MaxSat 2007-01-19278437OPTIMUM 1.49577 1.54816
aolibpvo 2007-01-17278431OPTIMUM 4.79727 4.80904
aolibdvo 2007-01-17278432OPTIMUM 5.06123 5.08664
Toolbar_BTD 2007-01-12278438OPTIMUM 5.43717 5.45013
toolbar 2007-01-12278439OPTIMUM 5.62414 5.68474
Toulbar2 2007-01-12278436OPTIMUM 12.6711 12.7899
AbsconMax 109 PFC278435OPTIMUM 580.258 583.085
AbsconMax 109 EPFC278434OPTIMUM 591.42 594.326
CSP4J - MaxCSP 2006-12-19278433? (problem) 0.555914 0.611804