Name | normalized-PB07/OPT-SMALLINT-LIN/submittedPB07/ poldner/PB/testset/normalized-5_10.opb |
MD5SUM | ba69a176dcc33e2f7eda6b169d4d1c84 |
Bench Category | OPT-SMALLINT-LIN (optimisation, small integers, linear constraints) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 3951 |
Best CPU time to get the best result obtained on this benchmark | 0.012997 |
Has Objective Function | YES |
Satisfiable | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | 3951 |
Optimality of the best value was proved | YES |
Number of variables | 55 |
Total number of constraints | 60 |
Number of constraints which are clauses | 50 |
Number of constraints which are cardinality constraints (but not clauses) | 10 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 2 |
Maximum length of a constraint | 5 |
Number of terms in the objective function | 55 |
Biggest coefficient in the objective function | 1772 |
Number of bits for the biggest coefficient in the objective function | 11 |
Sum of the numbers in the objective function | 25669 |
Number of bits of the sum of numbers in the objective function | 15 |
Biggest number in a constraint | 1772 |
Number of bits of the biggest number in a constraint | 11 |
Biggest sum of numbers in a constraint | 25669 |
Number of bits of the biggest sum of numbers | 15 |
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: 3951-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 x41 -x42 -x43 -x44 -x45 -x46 -x47 x48 -x49 -x50 x51 -x52 x53 -x54 -x55