Name | /OPT-BIGINT-LIN/ heinz/normalized-ivu52.opb |
MD5SUM | 125c932e94e2457d1c83522659b39a64 |
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 | 20170239442749999993 |
Best CPU time to get the best result obtained on this benchmark | 1800.69 |
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 | 157591 |
Total number of constraints | 2116 |
Number of constraints which are clauses | 0 |
Number of constraints which are cardinality constraints (but not clauses) | 2111 |
Number of constraints which are nor clauses,nor cardinality constraints | 5 |
Minimum length of a constraint | 7 |
Maximum length of a constraint | 155481 |
Number of terms in the objective function | 157591 |
Biggest coefficient in the objective function | 40000000000000000 |
Number of bits for the biggest coefficient in the objective function | 56 |
Sum of the numbers in the objective function | 1955699014025000001657 |
Number of bits of the sum of numbers in the objective function | 71 |
Biggest number in a constraint | 45000000000000000 |
Number of bits of the biggest number in a constraint | 56 |
Biggest sum of numbers in a constraint | 2472448333291898744553 |
Number of bits of the biggest sum of numbers | 72 |
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: 20170239442749999993--too large--