Download the above graph as a PDF file / as an EPS file
| Solver Name | Answer | Objective function | CPU time | Wall clock time |
|---|---|---|---|---|
| wildcat-rnp 2007-03-21 | SAT (TO) | 39 | 1800.1 | 1800.63 |
| Name | normalized-PB06/OPT-SMALLINT/reduced/mps-v2-20-10/plato.asu.edu/ pub/fctp/normalized-reduced-mps-v2-20-10-ran17x17.opb |
| MD5SUM | eacfeaf84791543db8ee3be1e77f11f6 |
| Bench Category | OPT-SMALLINT (optimisation, small integers) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 35 |
| Best CPU time to get the best result obtained on this benchmark | 1012.03 |
| Has Objective Function | YES |
| Satisfiable | YES |
| (Un)Satisfiability was proved | YES |
| Best value of the objective function | 35 |
| Optimality of the best value was proved | YES |
| Number of variables | 8959 |
| Total number of constraints | 323 |
| Number of constraints which are clauses | 0 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 323 |
| Minimum length of a constraint | 31 |
| Maximum length of a constraint | 510 |
| Number of terms in the objective function | 8959 |
| Biggest coefficient in the objective function | 1746 |
| Number of bits for the biggest coefficient in the objective function | 11 |
| Sum of the numbers in the objective function | 531501 |
| Number of bits of the sum of numbers in the objective function | 20 |
| Biggest number in a constraint | 262144 |
| Number of bits of the biggest number in a constraint | 19 |
| Biggest sum of numbers in a constraint | 531501 |
| Number of bits of the biggest sum of numbers | 20 |
| Number of products (including duplicates) | 0 |
| Sum of products size (including duplicates) | 0 |
| Number of different products | 0 |
| Sum of products size | 0 |