Name | /OPT-BIGINT-LIN/ heinz/normalized-sp98ar.opb |
MD5SUM | 1a17360e8d3b3640e2f372bae2b1d5b0 |
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 | 1684166798400000016 |
Best CPU time to get the best result obtained on this benchmark | 1800.03 |
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 | 15085 |
Total number of constraints | 1430 |
Number of constraints which are clauses | 181 |
Number of constraints which are cardinality constraints (but not clauses) | 837 |
Number of constraints which are nor clauses,nor cardinality constraints | 412 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 4222 |
Number of terms in the objective function | 15085 |
Biggest coefficient in the objective function | 201731527200000000 |
Number of bits for the biggest coefficient in the objective function | 58 |
Sum of the numbers in the objective function | 826921649885199999998 |
Number of bits of the sum of numbers in the objective function | 70 |
Biggest number in a constraint | 201731527200000000 |
Number of bits of the biggest number in a constraint | 58 |
Biggest sum of numbers in a constraint | 826921649885199999998 |
Number of bits of the biggest sum of numbers | 70 |
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: 1684166798400000016--too large--