| Name | PB24/normalized-PB11/ OPT-LIN/heinz/normalized-seymour.opb |
| MD5SUM | 2fc9faea969371da963ffb1268a000b0 |
| Bench Category | OPT-LIN (optimization problem, linear constraints, no OPT/UNSAT certificate) |
| Best result obtained on this benchmark | SAT |
| Best value of the objective obtained on this benchmark | 423 |
| Best CPU time to get the best result obtained on this benchmark | 3559.97 |
| 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 | 1372 |
| Total number of constraints | 4944 |
| Number of constraints which are clauses | 4944 |
| 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 | 1 |
| Maximum length of a constraint | 19 |
| Number of terms in the objective function | 1372 |
| 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 | 1372 |
| Number of bits of the sum of numbers in the objective function | 11 |
| Biggest number in a constraint | 1 |
| Number of bits of the biggest number in a constraint | 1 |
| Biggest sum of numbers in a constraint | 1372 |
| Number of bits of the biggest sum of numbers | 11 |
| Number of products (including duplicates) | 0 |
| Sum of products size (including duplicates) | 0 |
| Number of different products | 0 |
| Sum of products size | 0 |