Name | /OPT-BIGINT-LIN/heinz/ normalized-ns1685374.opb |
MD5SUM | 50acc4afebeb32cddb95c5011f072af8 |
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 | -13 |
Best CPU time to get the best result obtained on this benchmark | 276.793 |
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 | 10000 |
Total number of constraints | 43295 |
Number of constraints which are clauses | 9074 |
Number of constraints which are cardinality constraints (but not clauses) | 200 |
Number of constraints which are nor clauses,nor cardinality constraints | 34021 |
Minimum length of a constraint | 3 |
Maximum length of a constraint | 97 |
Number of terms in the objective function | 100 |
Biggest coefficient in the objective function | 1 |
Number of bits for the biggest coefficient in the objective function | 1 |
Sum of the numbers in the objective function | 100 |
Number of bits of the sum of numbers in the objective function | 7 |
Biggest number in a constraint | 1000000000 |
Number of bits of the biggest number in a constraint | 30 |
Biggest sum of numbers in a constraint | 2000000032 |
Number of bits of the biggest sum of numbers | 31 |
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: -13--too large--