MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
MaxCSP/cnf/2-40-2100-3000/
cnf-2-40-2900-050221_ext.xml

Jump to solvers results

General information on the benchmark

NameMaxCSP/cnf/2-40-2100-3000/
cnf-2-40-2900-050221_ext.xml
MD5SUMa6e9367b3b405d0ac5c7e5614f8927c4
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints357
Best CPU time to get the best result obtained on this benchmark4.5933
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints654
Maximum constraint arity2
Maximum domain size2
Number of constraints which are defined in extension654
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-19278446OPTIMUM 1.58876 1.66024
aolibdvo 2007-01-17278441OPTIMUM 4.5933 4.59445
aolibpvo 2007-01-17278440OPTIMUM 4.80727 4.8534
toolbar 2007-01-12278448OPTIMUM 5.18321 5.19695
Toolbar_BTD 2007-01-12278447OPTIMUM 5.48317 5.55869
Toulbar2 2007-01-12278445OPTIMUM 8.68268 8.77024
AbsconMax 109 PFC278444OPTIMUM 493.936 494.174
AbsconMax 109 EPFC278443OPTIMUM 706.618 711.501
CSP4J - MaxCSP 2006-12-19278442? (problem) 0.526919 0.561822