Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/ factor-mod-B/factor-mod-size=7-P0=79-P1=41-B.opb |
MD5SUM | 4ddd68556b0128f7c9c0c4c2bfb48c53 |
Bench Category | OPT-SMALLINT-NLC (optimisation, small integers, non linear constraints) |
Best result obtained on this benchmark | OPT |
Best value of the objective obtained on this benchmark | 3 |
Best CPU time to get the best result obtained on this benchmark | 0.003998 |
Has Objective Function | YES |
Satisfiable | YES |
(Un)Satisfiability was proved | YES |
Best value of the objective function | 3 |
Optimality of the best value was proved | YES |
Number of variables | 21 |
Total number of constraints | 3 |
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 | 3 |
Minimum length of a constraint | 7 |
Maximum length of a constraint | 56 |
Number of terms in the objective function | 7 |
Biggest coefficient in the objective function | 64 |
Number of bits for the biggest coefficient in the objective function | 7 |
Sum of the numbers in the objective function | 127 |
Number of bits of the sum of numbers in the objective function | 7 |
Biggest number in a constraint | 8192 |
Number of bits of the biggest number in a constraint | 14 |
Biggest sum of numbers in a constraint | 32424 |
Number of bits of the biggest sum of numbers | 15 |
Number of products (including duplicates) | 49 |
Sum of products size (including duplicates) | 98 |
Number of different products | 49 |
Sum of products size | 98 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 3x1 x2 -x3 -x4 -x5 -x6 -x7 x8 -x9 x10 x11 -x12 -x13 -x14 -x15 -x16 -x17 -x18 -x19 -x20 -x21