| Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/factor-mod-B/ factor-mod-size=5-P0=29-P1=31-P2=13-P3=17-P4=29-P5=2-P6=29-B.opb |
| MD5SUM | bab73d97554da370c1dcc7d97b4a612d |
| 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 | 2 |
| Best CPU time to get the best result obtained on this benchmark | 0.265959 |
| Has Objective Function | YES |
| Satisfiable | YES |
| (Un)Satisfiability was proved | YES |
| Best value of the objective function | 2 |
| Optimality of the best value was proved | YES |
| Number of variables | 90 |
| Total number of constraints | 13 |
| 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 | 13 |
| Minimum length of a constraint | 5 |
| Maximum length of a constraint | 35 |
| 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 | 512 |
| Number of bits of the biggest number in a constraint | 10 |
| Biggest sum of numbers in a constraint | 1984 |
| Number of bits of the biggest sum of numbers | 11 |
| Number of products (including duplicates) | 150 |
| Sum of products size (including duplicates) | 300 |
| Number of different products | 150 |
| Sum of products size | 300 |
| Solver Name | TraceID | Answer | obj | CPU time | Wall clock time |
|---|---|---|---|---|---|
| bsolo 3.1 cl (complete) | 1877996 | OPT | 2 | 0.265959 | 0.265933 |
| bsolo 3.1 (complete) | 1876566 | OPT | 2 | 0.406937 | 0.407543 |
| pbclasp 2009-04-24 (complete) | 1859165 | OPT | 2 | 0.419935 | 0.416754 |
| wbo 1.0 (complete) | 1875136 | OPT | 2 | 0.422934 | 0.422689 |
| bsolo 3.1 pb (complete) | 1879426 | OPT | 2 | 0.841871 | 0.841949 |
| SAT4J Pseudo Resolution 2.1.1 (complete) | 1857357 | OPT | 2 | 1.91071 | 1.26233 |
| SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009) (complete) | 1869954 | OPT | 2 | 2.92155 | 2.9212 |
| SCIPclp SCIP 1.1.0.7 with CLP 1.8.2 (complete) | 1869955 | OPT | 2 | 3.99839 | 3.99977 |
| SAT4J Pseudo CP 2.1.1 (complete) | 1857356 | OPT | 2 | 59.147 | 56.4719 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: 2-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 -x91 x92 -x93 -x94 -x95 -x96 -x97 -x98 -x99 -x100 -x101 -x102 -x103 -x104 -x105 -x106 -x107 -x108 -x109 -x110 -x111 x112 -x113 -x114 -x115 -x36 x37 -x38 -x39 -x40 x61 -x62 -x63 -x64 -x65 -x116 x117 -x118 -x119 -x120 -x121 -x122 -x123 -x124 -x125 -x126 -x127 -x128 -x129 -x130 -x131 -x132 -x133 -x134 -x135 -x136 x137 -x138 -x139 -x140 -x41 x42 -x43 -x44 -x45 x66 -x67 -x68 -x69 -x70 -x141 x142 -x143 -x144 -x145 -x146 -x147 -x148 -x149 -x150 -x151 -x152 -x153 -x154 -x155 -x156 -x157 -x158 -x159 -x160 -x161 x162 -x163 -x164 -x165 -x46 x47 -x48 -x49 -x50 x71 -x72 -x73 -x74 -x75 -x166 x167 -x168 -x169 -x170 -x171 -x172 -x173 -x174 -x175 -x176 -x177 -x178 -x179 -x180 -x181 x182 -x183 -x184 -x185 -x186 -x187 -x188 -x189 -x190 -x51 x52 -x53 -x54 x55 -x76 -x77 -x78 -x79 -x80 -x191 x192 -x193 -x194 x195 -x196 -x197 -x198 -x199 -x200 -x201 x202 -x203 -x204 x205 -x206 x207 -x208 -x209 x210 -x211 -x212 -x213 -x214 -x215 -x56 x57 -x58 x59 -x60 x81 x82 x83 -x84 -x85 -x216 x217 -x218 x219 -x220 -x221 x222 -x223 x224 -x225 -x226 -x227 -x228 -x229 -x230 -x231 -x232 -x233 -x234 -x235 -x236 -x237 -x238 -x239 -x240 -x86 -x87 -x88 -x89 -x90