| Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/factor-mod-B/ factor-mod-size=8-P0=233-P1=79-P2=107-P3=23-P4=107-P5=223-P6=239-P7=127-P8=229-P9=181-B.opb |
| MD5SUM | 9ac2b65e6f5a9e0208aa5abddde874b2 |
| 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 | 7.51786 |
| 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 | 216 |
| Total number of constraints | 19 |
| 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 | 19 |
| Minimum length of a constraint | 8 |
| Maximum length of a constraint | 80 |
| Number of terms in the objective function | 8 |
| Biggest coefficient in the objective function | 128 |
| Number of bits for the biggest coefficient in the objective function | 8 |
| Sum of the numbers in the objective function | 255 |
| Number of bits of the sum of numbers in the objective function | 8 |
| Biggest number in a constraint | 32768 |
| Number of bits of the biggest number in a constraint | 16 |
| Biggest sum of numbers in a constraint | 130560 |
| Number of bits of the biggest sum of numbers | 17 |
| Number of products (including duplicates) | 576 |
| Sum of products size (including duplicates) | 1152 |
| Number of different products | 576 |
| Sum of products size | 1152 |
| 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) | 1869922 | OPT | 3 | 7.51786 | 7.52007 |
| SCIPclp SCIP 1.1.0.7 with CLP 1.8.2 (complete) | 1869923 | OPT | 3 | 30.9183 | 30.9274 |
| pbclasp 2009-04-24 (complete) | 1859149 | OPT | 3 | 1573.92 | 1574.37 |
| SAT4J Pseudo Resolution 2.1.1 (complete) | 1857325 | SAT (TO) | 3 | 1800.89 | 1797 |
| bsolo 3.1 cl (complete) | 1877980 | SAT | 9 | 1798.01 | 1798.49 |
| bsolo 3.1 pb (complete) | 1879410 | ? | 1798.02 | 1798.66 | |
| SAT4J Pseudo CP 2.1.1 (complete) | 1857324 | ? (TO) | 1800.25 | 1775.05 | |
| wbo 1.0 (complete) | 1875120 | ? (TO) | 1800.34 | 1800.98 | |
| bsolo 3.1 (complete) | 1876550 | Wrong UNSAT | 4.89925 | 4.90037 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: 3-x216 x215 -x214 -x213 -x212 -x211 x210 x209 -x208 -x207 -x206 -x205 -x204 x203 -x202 -x201 -x144 x143 -x142 x141 x140 -x139 x138 x137 -x200 -x199 -x198 -x197 -x196 x195 -x194 -x193 -x136 -x135 -x134 -x133 -x132 x131 -x130 x129 -x192 -x191 -x190 -x189 -x188 -x187 -x186 -x185 x128 -x127 -x126 x125 -x124 -x123 x122 x121 -x184 x183 x182 -x181 x180 -x179 -x178 -x177 -x120 -x119 -x118 -x117 -x116 -x115 -x114 x113 -x176 -x175 -x174 -x173 -x172 -x171 -x170 x169 -x112 x111 x110 x109 x108 x107 -x106 x105 x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x104 x103 x102 x101 x100 x99 x98 x97 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 x96 x95 x94 x93 x92 x91 x90 x89 -x152 -x151 -x150 -x149 -x148 -x147 -x146 -x145 -x88 -x87 x86 x85 -x84 -x83 x82 x81 x80 -x79 x78 x77 x76 x75 -x74 x73 x72 x71 -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