Name | /OPT-SMALLINT-LIN/heinz/ normalized-neos-859770.opb |
MD5SUM | cbc412f006cacd8e2fcdc61d20cbc351 |
Bench Category | OPT-SMALLINT-LIN (optimisation, small integers, linear constraints) |
Best result obtained on this benchmark | UNSAT |
Best value of the objective obtained on this benchmark | |
Best CPU time to get the best result obtained on this benchmark | 134.834 |
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 | 2504 |
Total number of constraints | 2065 |
Number of constraints which are clauses | 1536 |
Number of constraints which are cardinality constraints (but not clauses) | 529 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 8 |
Maximum length of a constraint | 1446 |
Number of terms in the objective function | 2504 |
Biggest coefficient in the objective function | 10 |
Number of bits for the biggest coefficient in the objective function | 4 |
Sum of the numbers in the objective function | 16472 |
Number of bits of the sum of numbers in the objective function | 15 |
Biggest number in a constraint | 10 |
Number of bits of the biggest number in a constraint | 4 |
Biggest sum of numbers in a constraint | 16472 |
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: