| Name | /OPT-BIGINT-LIN/heinz/ normalized-n3seq24.opb |
| MD5SUM | 748baf4f5accf34b9eefa80f1acc6fdd |
| Bench Category | OPT-BIGINT-LIN (optimisation, big integers, linear constraints) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 277 |
| Best CPU time to get the best result obtained on this benchmark | 1800.08 |
| 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 | 119856 |
| Total number of constraints | 6044 |
| Number of constraints which are clauses | 1112 |
| Number of constraints which are cardinality constraints (but not clauses) | 4484 |
| Number of constraints which are nor clauses,nor cardinality constraints | 448 |
| Minimum length of a constraint | 24 |
| Maximum length of a constraint | 52272 |
| Number of terms in the objective function | 106176 |
| Biggest coefficient in the objective function | 336 |
| Number of bits for the biggest coefficient in the objective function | 9 |
| Sum of the numbers in the objective function | 9558600 |
| Number of bits of the sum of numbers in the objective function | 24 |
| Biggest number in a constraint | 336 |
| Number of bits of the biggest number in a constraint | 9 |
| Biggest sum of numbers in a constraint | 9558600 |
| Number of bits of the biggest sum of numbers | 24 |
| 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: 277--too large--