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 constraints115
Best CPU time to get the best result obtained on this benchmark2.71159
(Un)Satisfiability was proved
Number of variables28
Number of constraints189
Maximum constraint arity2
Maximum domain size5
Number of constraints which are defined in extension189
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
aolibdvo 2007-01-17278621OPTIMUM 2.71159 2.73831
aolibpvo 2007-01-17278620OPTIMUM 2.73658 2.75929
toolbar 2007-01-12278628OPTIMUM 5.59415 5.60314
Toolbar_BTD 2007-01-12278627OPTIMUM 5.76912 5.82715
Toulbar2 2007-01-12278625OPTIMUM 6.51401 6.57593
AbsconMax 109 EPFC278623OPTIMUM 392.454 392.989
AbsconMax 109 PFC278624OPTIMUM 412.663 413.19
CSP4J - MaxCSP 2006-12-19278622? (problem) 0.440932 0.505054
Toolbar_MaxSat 2007-01-19278626? (TO) 2400.11 2401.24