Name | PB15eval/normalized-PB15eval/OPT-SMALLINT-NLC/ minlplib2-pb-0.1.0/opb/normalized-edgecross14-019.opb |
MD5SUM | 6349a302de8f5a326ac0d30f5c192ab1 |
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 | 4 |
Best CPU time to get the best result obtained on this benchmark | 145.013 |
Has Objective Function | YES |
Satisfiable | |
(Un)Satisfiability was proved | |
Best value of the objective function | |
Optimality of the best value was proved | |
Number of variables | 183 |
Total number of constraints | 1457 |
Number of constraints which are clauses | 1456 |
Number of constraints which are cardinality constraints (but not clauses) | 1 |
Number of constraints which are nor clauses,nor cardinality constraints | 0 |
Minimum length of a constraint | 1 |
Maximum length of a constraint | 3 |
Number of terms in the objective function | 231 |
Biggest coefficient in the objective function | 49 |
Number of bits for the biggest coefficient in the objective function | 6 |
Sum of the numbers in the objective function | 519 |
Number of bits of the sum of numbers in the objective function | 10 |
Biggest number in a constraint | 49 |
Number of bits of the biggest number in a constraint | 6 |
Biggest sum of numbers in a constraint | 519 |
Number of bits of the biggest sum of numbers | 10 |
Number of products (including duplicates) | 145 |
Sum of products size (including duplicates) | 290 |
Number of different products | 0 |
Sum of products size | 0 |
Solver Name | TraceID | Answer | objective function | CPU time | Wall clock time |
---|---|---|---|---|---|
minisatp 2012-10-02 git-d91742b (complete) | 4119471 | OPT | 4 | 145.013 | 145.042 |
Sat4j PB 2.3.6 Resolution PB16 (complete) | 4119470 | SAT (TO) | 6 | 1800.06 | 1795.84 |
Sat4j PB 2.3.6 Res+CP PB16 (complete) | 4119469 | SAT (TO) | 6 | 1800.66 | 912.353 |
toysat 2016-05-02 (complete) | 4119468 | ? (TO) | 1800.06 | 1800.61 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
objective function: 4x184 x5 x135 x185 x174 -x186 -x181 -x187 x7 -x180 x188 x9 x189 x170 -x190 x15 -x191 -x17 -x177 -x192 -x19 -x144 -x193 -x21 -x152 -x194 x195 x23 -x196 -x25 -x125 -x197 -x198 -x37 -x199 x136 -x200 -x201 x175 -x202 -x203 -x182 -x204 -x38 x130 -x205 x132 -x206 -x207 -x157 -x208 -x161 -x209 -x168 -x210 -x172 -x211 -x212 -x213 -x41 -x214 -x215 -x216 -x42 x134 -x217 -x218 x173 -x219 -x220 -x179 -x221 -x222 x128 -x223 -x224 -x142 -x225 -x146 -x226 -x227 -x228 x129 -x229 -x230 -x150 -x231 -x154 -x232 -x233 -x234 -x45 -x235 -x236 -x237 -x46 -x117 -x238 -x123 -x239 -x127 -x240 -x241 -x242 x243 x47 x244 x245 x246 x171 -x247 -x248 x50 -x249 -x51 -x250 -x178 -x251 -x252 -x52 -x253 -x145 -x254 -x255 -x53 -x256 -x153 -x257 -x258 x259 x54 x260 -x261 -x55 -x262 -x126 -x263 -x264 -x265 -x58 -x266 -x267 -x268 -x59 x158 -x269 -x270 x169 -x271 -x272 -x273 -x60 -x139 -x274 -x275 -x276 -x277 -x278 -x61 -x147 -x279 -x280 -x281 -x282 -x283 -x284 -x156 x285 -x286 -x63 -x120 -x287 -x122 -x288 -x289 -x290 -x291 -x292 -x77 -x293 -x294 -x78 -x295 -x296 -x79 -x297 x298 x80 -x299 -x81 -x300 x301 x82 x143 -x302 -x303 -x304 -x83 -x305 -x306 x307 x84 x308 -x309 -x85 -x124 -x310 -x311 -x312 x138 -x313 -x314 -x315 -x316 x317 -x318 -x88 -x118 -x319 -x320 -x321 -x322 x323 -x324 -x90 -x119 -x325 -x326 -x327 -x328 x183 -x1 x2 -x3 -x4 -x6 -x8 -x10 -x11 -x12 -x13 -x14 -x16 -x18 -x20 -x22 -x24 -x26 -x27 -x28 -x29 -x30 -x31 -x32 -x33 -x34 -x35 -x36 -x39 -x40 -x43 -x44 -x48 -x49 -x56 -x57 x62 -x64 x65 x66 x67 x68 x69 x70 x71 x72 x73 x74 x75 x76 -x86 x87 x89 -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 -x116 x121 x131 x133 x137 x140 -x141 x148 -x149 -x151 x155 x159 x160 -x162 -x163 -x164 -x165 -x166 -x167 x176