Name | normalized-PB06/OPT-SMALLINT/mps-v2-20-10/plato.asu.edu/ pub/milp/normalized-mps-v2-20-10-neos10.opb |
MD5SUM | ec3e7f33041767154dc667e0cee0b579 |
Bench Category | OPT-SMALLINT (optimisation, small integers) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | -1135 |
Best CPU time to get the best result obtained on this benchmark | 2.05969 |
Has Objective Function | YES |
Satisfiable | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | -1135 |
Optimality of the best value was proved | YES |
Number of variables | 23534 |
Total number of constraints | 46798 |
Number of constraints which are clauses | 21028 |
Number of constraints which are cardinality constraints (but not clauses) | 4 |
Number of constraints which are nor clauses,nor cardinality constraints | 25766 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 2747 |
Number of terms in the objective function | 78 |
Biggest coefficient in the objective function | 2048 |
Number of bits for the biggest coefficient in the objective function | 12 |
Sum of the numbers in the objective function | 27016 |
Number of bits of the sum of numbers in the objective function | 15 |
Biggest number in a constraint | 2048 |
Number of bits of the biggest number in a constraint | 12 |
Biggest sum of numbers in a constraint | 27016 |
Number of bits of the biggest sum of numbers | 15 |
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: -1135--too large--