Name | normalized-PB07/OPT-SMALLINT-LIN/submittedPB07/ aksoy/area_opers/normalized-fir07_area_opers.opb |
MD5SUM | e3ec914b5fa2e36b0a6c3f63a5a73343 |
Bench Category | OPT-SMALLINT-LIN (optimisation, small integers, linear constraints) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 32 |
Best CPU time to get the best result obtained on this benchmark | 4.74428 |
Has Objective Function | YES |
Satisfiable | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | 32 |
Optimality of the best value was proved | YES |
Number of variables | 22270 |
Total number of constraints | 51660 |
Number of constraints which are clauses | 51660 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 255 |
Number of terms in the objective function | 10984 |
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 | 10984 |
Number of bits of the sum of numbers in the objective function | 14 |
Biggest number in a constraint | 2 |
Number of bits of the biggest number in a constraint | 2 |
Biggest sum of numbers in a constraint | 10984 |
Number of bits of the biggest sum of numbers | 14 |
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: 32--too large--