MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
MaxCSP/cnf/3-40-1100-2000/
cnf-3-40-1300-439021_ext.xml

Jump to solvers results

General information on the benchmark

NameMaxCSP/cnf/3-40-1100-2000/
cnf-3-40-1300-439021_ext.xml
MD5SUMe2943702a07e701f63714593ecddfa5e
Bench CategoryN-ARY-EXT (n-ary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints1136
Best CPU time to get the best result obtained on this benchmark88.1646
Satisfiable
(Un)Satisfiability was proved
Number of variables40
Number of constraints1230
Maximum constraint arity3
Maximum domain size2
Number of constraints which are defined in extension1230
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-19278113OPTIMUM 88.1646 88.2043
toolbar 2007-01-12278115OPTIMUM 100.294 100.393
Toolbar_BTD 2007-01-12278114OPTIMUM 114.165 114.216
Toulbar2 2007-01-12278112OPTIMUM 504.211 506.477
aolibpvo 2007-01-17278107OPTIMUM 1874.5 1875.29
aolibdvo 2007-01-17278108OPTIMUM 1932.31 1933
AbsconMax 109 EPFC278110MSAT (TO) 2400.04 2406.12
CSP4J - MaxCSP 2006-12-19278109MSAT (TO) 2400.09 2401.06
AbsconMax 109 PFC278111MSAT (TO) 2400.16 2412.24