| Name | /OPT-BIGINT-LIN/zahidi/Base/ normalized-minisat100_4_32_4.opb |
| MD5SUM | ae94003fbe7fdee247bdd3d5d595cb68 |
| 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 | 6564197 |
| Best CPU time to get the best result obtained on this benchmark | 1647.82 |
| 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 | 20200 |
| Total number of constraints | 30206 |
| Number of constraints which are clauses | 200 |
| Number of constraints which are cardinality constraints (but not clauses) | 6 |
| Number of constraints which are nor clauses,nor cardinality constraints | 30000 |
| Minimum length of a constraint | 2 |
| Maximum length of a constraint | 4950 |
| Number of terms in the objective function | 19900 |
| Biggest coefficient in the objective function | 141420761 |
| Number of bits for the biggest coefficient in the objective function | 28 |
| Sum of the numbers in the objective function | 186872004500 |
| Number of bits of the sum of numbers in the objective function | 38 |
| Biggest number in a constraint | 141420761 |
| Number of bits of the biggest number in a constraint | 28 |
| Biggest sum of numbers in a constraint | 186872004500 |
| Number of bits of the biggest sum of numbers | 38 |
| 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: 6564197--too large--