Name | normalized-PB06/OPT-SMALLINT/submitted-PB06/manquiho/ bounded_golomb_rulers/normalized-bogr_5.opb |
MD5SUM | fd5650da6eaa0e3a50dfb52821ac86aa |
Bench Category | OPT-SMALLINT (optimisation, small integers) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 11 |
Best CPU time to get the best result obtained on this benchmark | 0.021995 |
Has Objective Function | YES |
Satisfiable | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | 11 |
Optimality of the best value was proved | YES |
Number of variables | 75 |
Total number of constraints | 105 |
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 | 104 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 21 |
Number of terms in the objective function | 5 |
Biggest coefficient in the objective function | 10 |
Number of bits for the biggest coefficient in the objective function | 4 |
Sum of the numbers in the objective function | 25 |
Number of bits of the sum of numbers in the objective function | 5 |
Biggest number in a constraint | 34 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 177 |
Number of bits of the biggest sum of numbers | 8 |
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: 11x1 -x2 -x3 -x4 x75 x15 -x16 -x17 -x18 -x19 x20 x21 -x22 -x23 -x24 -x74 -x5 -x6 -x7 -x8 -x9 -x73 -x72 -x71 x70 x69 -x10 -x11 -x12 -x13 -x14 -x68 -x67 x66 -x65 x64 x63 x62 x61 x60 x59 x58 x57 x56 x55 -x54 -x53 x52 x51 -x50 x49 x48 x47 x46 x45 x44 x43 x42 x41 x40 x39 x38 x37 x36 x35 x34 x33 x32 x31 x30 x29 x28 x27 x26 x25