| Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/factor-mod-B/ factor-mod-size=7-P0=5-P1=47-P2=89-P3=41-P4=37-P5=113-P6=47-P7=127-P8=37-B.opb |
| MD5SUM | ad74f094bba1086e11cc0beef00e98a6 |
| 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 | 3.42548 |
| 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 | 168 |
| Total number of constraints | 17 |
| 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 | 17 |
| Minimum length of a constraint | 7 |
| Maximum length of a constraint | 63 |
| 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 | 32512 |
| Number of bits of the biggest sum of numbers | 15 |
| Number of products (including duplicates) | 392 |
| Sum of products size (including duplicates) | 784 |
| Number of different products | 392 |
| Sum of products size | 784 |
| Solver Name | TraceID | Answer | obj | CPU time | Wall clock time |
|---|---|---|---|---|---|
| SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009) (complete) | 1870140 | OPT | 3 | 3.42548 | 3.42659 |
| SCIPclp SCIP 1.1.0.7 with CLP 1.8.2 (complete) | 1870141 | OPT | 3 | 11.0233 | 11.0275 |
| pbclasp 2009-04-24 (complete) | 1859258 | OPT | 3 | 27.1939 | 27.2013 |
| bsolo 3.1 (complete) | 1876659 | OPT | 3 | 33.5279 | 33.5378 |
| bsolo 3.1 cl (complete) | 1878089 | OPT | 3 | 51.3882 | 51.4069 |
| wbo 1.0 (complete) | 1875229 | OPT | 3 | 104.181 | 104.233 |
| SAT4J Pseudo Resolution 2.1.1 (complete) | 1857543 | OPT | 3 | 108.109 | 106.757 |
| bsolo 3.1 pb (complete) | 1879519 | SAT | 3 | 1798.02 | 1798.69 |
| SAT4J Pseudo CP 2.1.1 (complete) | 1857542 | ? (TO) | 1800.24 | 1767.45 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: 3-x168 x167 -x166 -x165 -x164 -x163 x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x112 x111 -x110 x109 x108 -x107 x106 -x154 x153 -x152 x151 x150 -x149 x148 -x105 -x104 -x103 -x102 -x101 x100 x99 -x147 x146 -x145 -x144 -x143 -x142 x141 -x98 x97 x96 -x95 -x94 x93 x92 -x140 -x139 -x138 -x137 -x136 -x135 -x134 x91 -x90 -x89 x88 -x87 x86 x85 -x133 -x132 x131 -x130 -x129 -x128 x127 -x84 -x83 x82 x81 -x80 -x79 x78 -x126 -x125 -x124 -x123 -x122 x121 -x120 -x77 -x76 x75 x74 x73 x72 x71 -x119 -x118 -x117 -x116 -x115 -x114 x113 -x70 -x69 -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 x24 x23 x22 -x21 x20 -x19 x18 -x17 -x16 x15 -x14 x13 -x12 x11 x10 -x9 x8 -x7 -x6 -x5 -x4 -x3 x2 x1