MAX-CSP 2006 Competition: solvers results per benchmarks

Result page for benchmark
tightness/tightness0.1/
rand-2-40-8-753-100-21_ext.xml

Jump to solvers results

General information on the benchmark

Nametightness/tightness0.1/
rand-2-40-8-753-100-21_ext.xml
MD5SUM458b61b666f24b7113cc3de8b84cb338
Bench Category2-ARY-EXT (binary constraints in extension)
Best result obtained on this benchmarkMOPT
Best Number of satisfied constraints752
Best CPU time to get the best result obtained on this benchmark0
SatisfiableNO
(Un)Satisfiability was provedNO
Number of variables40
Number of constraints753
Maximum constraint arity2
Maximum domain size8
Number of constraints which are defined in extension753
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
AbsconMax 109 EPFC276850OPTIMUM 0 1437.31
toolbar 2007-01-12276855OPTIMUM 22.0207 22.1304
Toolbar_BTD 2007-01-12276854OPTIMUM 26.8629 27.0855
Toulbar2 2007-01-12276852OPTIMUM 170.032 170.687
AbsconMax 109 PFC276851OPTIMUM 189.872 191.688
aolibpvo 2007-01-17276847OPTIMUM 842.635 846.984
aolibdvo 2007-01-17276848OPTIMUM 895.007 898.546
CSP4J - MaxCSP 2006-12-19276849MSAT (TO) 2400.08 2411.54
Toolbar_MaxSat 2007-01-19276853? (TO) 2400.07 2407