Name | normalized-PB06/OPT-SMALLINT/ submitted-PB06/manquiho/golomb-rulers/normalized-OGR_4.opb |
MD5SUM | 8b1fbd52a1a4f2762439b4bdacc06a04 |
Bench Category | OPT-SMALLINT (optimisation, small integers) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 6 |
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 | 6 |
Optimality of the best value was proved | YES |
Number of variables | 40 |
Total number of constraints | 43 |
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 | 43 |
Minimum length of a constraint | 10 |
Maximum length of a constraint | 21 |
Number of terms in the objective function | 5 |
Biggest coefficient in the objective function | 16 |
Number of bits for the biggest coefficient in the objective function | 5 |
Sum of the numbers in the objective function | 31 |
Number of bits of the sum of numbers in the objective function | 5 |
Biggest number in a constraint | 32 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 155 |
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: 6-x1 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 x29 x30 -x31 x32 -x33 -x34 x35 x36 -x37 -x38 -x39 -x40