Name | normalized-PB06/OPT-SMALLINT/submitted-PB06/manquiho/ market-split/normalized-market-split_5_40_3.opb |
MD5SUM | 37c74b9e914d30b1ddfc0838676dd479 |
Bench Category | OPT-SMALLINT (optimisation, small integers) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 0 |
Best CPU time to get the best result obtained on this benchmark | 607.011 |
Has Objective Function | YES |
Satisfiable | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | 0 |
Optimality of the best value was proved | YES |
Number of variables | 41 |
Total number of constraints | 11 |
Number of constraints which are clauses | 1 |
Number of constraints which are cardinality constraints (but not clauses) | 0 |
Number of constraints which are nor clauses,nor cardinality constraints | 10 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 40 |
Number of terms in the objective function | 1 |
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 | 1 |
Number of bits of the sum of numbers in the objective function | 1 |
Biggest number in a constraint | 1162 |
Number of bits of the biggest number in a constraint | 11 |
Biggest sum of numbers in a constraint | 3487 |
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: 0x2 x3 x6 x9 x10 x13 x14 x17 x18 x21 x23 x24 x26 x28 x29 x31 x36 x37 x39 x40