| Name | PB24/normalized-PB06/OPT-LIN/mps-v2-20-10/plato.asu.edu/ pub/unibo/normalized-mps-v2-20-10-sp97ic.opb |
| MD5SUM | 607b48cbe3e34864f2afe67379f5975c |
| 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 | 2684509028 |
| Best CPU time to get the best result obtained on this benchmark | 3600.07 |
| 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 | 12497 |
| Total number of constraints | 1033 |
| Number of constraints which are clauses | 41 |
| Number of constraints which are cardinality constraints (but not clauses) | 815 |
| Number of constraints which are nor clauses,nor cardinality constraints | 177 |
| Minimum length of a constraint | 2 |
| Maximum length of a constraint | 6739 |
| Number of terms in the objective function | 12497 |
| Biggest coefficient in the objective function | 1010107916 |
| Number of bits for the biggest coefficient in the objective function | 30 |
| Sum of the numbers in the objective function | 3093137085579 |
| Number of bits of the sum of numbers in the objective function | 42 |
| Biggest number in a constraint | 1010107916 |
| Number of bits of the biggest number in a constraint | 30 |
| Biggest sum of numbers in a constraint | 3093137085579 |
| Number of bits of the biggest sum of numbers | 42 |
| Number of products (including duplicates) | 0 |
| Sum of products size (including duplicates) | 0 |
| Number of different products | 0 |
| Sum of products size | 0 |