Name | normalized-PB06/OPT-SMALLINT/submitted-PB06/manquiho/ market-split/normalized-market-split_5_40_1.opb |
MD5SUM | ae75c4a4fdafb98542bd11b7f7eecd54 |
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 | 1307.56 |
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 | 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 | 1086 |
Number of bits of the biggest number in a constraint | 11 |
Biggest sum of numbers in a constraint | 3258 |
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: 0-x1 -x2 x3 x4 x5 x6 -x7 -x8 x9 x10 -x12 -x13 -x14 -x15 -x16 x17 -x18 -x19 x20 -x21 -x22 -x23 x24 x25 -x26 -x27 x28 x29 -x30 x31 -x32 x33 -x34 x35 x36 x37 x38 x39 x40 -x41 -x11