| Name | /OPT-SMALLINT-LIN/heinz/ normalized-tanglegram1.opb |
| MD5SUM | eea015c3a78884de3d3a35aee07e2edf |
| Bench Category | OPT-SMALLINT-LIN (optimisation, small integers, linear constraints) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 5907 |
| Best CPU time to get the best result obtained on this benchmark | 1800.25 |
| Has Objective Function | YES |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Best value of the objective function | |
| Optimality of the best value was proved | |
| Number of variables | 34759 |
| Total number of constraints | 68342 |
| Number of constraints which are clauses | 68342 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 3 |
| Maximum length of a constraint | 3 |
| Number of terms in the objective function | 34171 |
| Biggest coefficient in the objective function | 1 |
| Number of bits for the biggest coefficient in the objective function | 1 |
| Sum of the numbers in the objective function | 34171 |
| Number of bits of the sum of numbers in the objective function | 16 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 34171 |
| Number of bits of the biggest sum of numbers | 16 |
| Number of products (including duplicates) | 0 |
| Sum of products size (including duplicates) | 0 |
| Number of different products | 0 |
| Sum of products size | 0 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 34171--too large--