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 constraints437
Best CPU time to get the best result obtained on this benchmark1.09283
(Un)Satisfiability was proved
Number of variables40
Number of constraints693
Maximum constraint arity2
Maximum domain size2
Number of constraints which are defined in extension693
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-17278449OPTIMUM 1.09283 1.10587
aolibdvo 2007-01-17278450OPTIMUM 1.20182 1.21822
Toolbar_MaxSat 2007-01-19278455OPTIMUM 1.43678 1.45826
toolbar 2007-01-12278457OPTIMUM 5.20821 5.24531
Toolbar_BTD 2007-01-12278456OPTIMUM 5.2812 5.31561
Toulbar2 2007-01-12278454OPTIMUM 6.72198 6.77627
AbsconMax 109 EPFC278452OPTIMUM 167.379 168.258
AbsconMax 109 PFC278453OPTIMUM 193.909 194.943
CSP4J - MaxCSP 2006-12-19278451? (problem) 0.535918 0.570555