| Name | /OPT-BIGINT-LIN/leberre/opb-paranoid/misc2010/datasets/ 9orless/normalized-mono-gac.cudf.paranoid.opb |
| MD5SUM | 1ea3f4841cbcc12846a9d6a05204354c |
| Bench Category | OPT-BIGINT-LIN (optimisation, big integers, linear constraints) |
| Best result obtained on this benchmark | OPT |
| Best value of the objective obtained on this benchmark | 141778 |
| Best CPU time to get the best result obtained on this benchmark | 461.153 |
| 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 | 19768 |
| Total number of constraints | 96403 |
| Number of constraints which are clauses | 94838 |
| Number of constraints which are cardinality constraints (but not clauses) | 1565 |
| Number of constraints which are nor clauses,nor cardinality constraints | 0 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 2962 |
| Number of terms in the objective function | 7253 |
| Biggest coefficient in the objective function | 4295 |
| Number of bits for the biggest coefficient in the objective function | 13 |
| Sum of the numbers in the objective function | 12717493 |
| Number of bits of the sum of numbers in the objective function | 24 |
| Biggest number in a constraint | 4295 |
| Number of bits of the biggest number in a constraint | 13 |
| Biggest sum of numbers in a constraint | 12717493 |
| 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: 141778--too large--