Name | normalized-PB06/OPT-SMALLINT/submitted-PB06/ manquiho/market-split/normalized-opt-market-split_4_30_2.opb |
MD5SUM | 031b0f629913e7cd5c934f00ec1a1885 |
Bench Category | OPT-SMALLINT (optimisation, small integers) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 1 |
Best CPU time to get the best result obtained on this benchmark | 11.1943 |
Has Objective Function | YES |
Satisfiable | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | 1 |
Optimality of the best value was proved | YES |
Number of variables | 94 |
Total number of constraints | 8 |
Number of constraints which are clauses | 0 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 8 |
Minimum length of a constraint | 44 |
Maximum length of a constraint | 46 |
Number of terms in the objective function | 64 |
Biggest coefficient in the objective function | 128 |
Number of bits for the biggest coefficient in the objective function | 8 |
Sum of the numbers in the objective function | 2040 |
Number of bits of the sum of numbers in the objective function | 11 |
Biggest number in a constraint | 808 |
Number of bits of the biggest number in a constraint | 10 |
Biggest sum of numbers in a constraint | 2934 |
Number of bits of the biggest sum of numbers | 12 |
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: 1x49 x65 x68 x69 x70 x71 x72 x78 x84 x85 x87 x88 x90 x91 x92 x94