| Name | /OPT-BIGINT-LIN/aries-da_nrp/ normalized-aries-da_network_50_2__8_45__256.opb |
| MD5SUM | 521ed767a167eb8f632cec6025d152e5 |
| 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 | 45008 |
| Best CPU time to get the best result obtained on this benchmark | 4.97324 |
| 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 | 25648 |
| Total number of constraints | 150 |
| Number of constraints which are clauses | 0 |
| Number of constraints which are cardinality constraints (but not clauses) | 102 |
| Number of constraints which are nor clauses,nor cardinality constraints | 48 |
| Minimum length of a constraint | 256 |
| Maximum length of a constraint | 2305 |
| Number of terms in the objective function | 25600 |
| Biggest coefficient in the objective function | 126454 |
| Number of bits for the biggest coefficient in the objective function | 17 |
| Sum of the numbers in the objective function | 859272960 |
| Number of bits of the sum of numbers in the objective function | 30 |
| Biggest number in a constraint | 126454 |
| Number of bits of the biggest number in a constraint | 17 |
| Biggest sum of numbers in a constraint | 859272960 |
| Number of bits of the biggest sum of numbers | 30 |
| 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: 45008--too large--