Name | normalized-PB07/OPT-SMALLINT-LIN/submittedPB07/aksoy/ area_partials/normalized-fir04_area_partials.opb |
MD5SUM | 95f6cd76e0e9cbaf8e95e1cd4db90f8e |
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 | 30 |
Best CPU time to get the best result obtained on this benchmark | 0.001998 |
Has Objective Function | YES |
Satisfiable | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | 30 |
Optimality of the best value was proved | YES |
Number of variables | 54 |
Total number of constraints | 69 |
Number of constraints which are clauses | 69 |
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 | 11 |
Number of terms in the objective function | 43 |
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 | 43 |
Number of bits of the sum of numbers in the objective function | 6 |
Biggest number in a constraint | 1 |
Number of bits of the biggest number in a constraint | 1 |
Biggest sum of numbers in a constraint | 43 |
Number of bits of the biggest sum of numbers | 6 |
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: 30x1 x2 x3 x4 x5 x6 x7 x8 x9 x10 x11 x12 x13 x14 x15 x16 x17 x18 x19 x20 x21 x22 x23 x24 x25 x26 x27 x28 x30 -x31 x32 -x33 -x34 -x36 -x38 -x39 -x41 -x44 -x47 -x50 -x52 -x53 -x54 -x35 -x40 -x43 -x29 -x37 x42 -x45 -x49 -x46 -x48 x51