| Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/ factor-mod-B/factor-mod-size=6-P0=2-P1=31-P2=13-P3=31-P4=31-B.opb |
| MD5SUM | 626c966be089469ef760f193c8b19154 |
| 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.275957 |
| 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 | 72 |
| Total number of constraints | 9 |
| 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 | 9 |
| Minimum length of a constraint | 6 |
| Maximum length of a constraint | 48 |
| Number of terms in the objective function | 6 |
| Biggest coefficient in the objective function | 32 |
| Number of bits for the biggest coefficient in the objective function | 6 |
| Sum of the numbers in the objective function | 63 |
| Number of bits of the sum of numbers in the objective function | 6 |
| Biggest number in a constraint | 2048 |
| Number of bits of the biggest number in a constraint | 12 |
| Biggest sum of numbers in a constraint | 8064 |
| Number of bits of the biggest sum of numbers | 13 |
| Number of products (including duplicates) | 144 |
| Sum of products size (including duplicates) | 288 |
| Number of different products | 144 |
| Sum of products size | 288 |
| Solver Name | TraceID | Answer | obj | CPU time | Wall clock time |
|---|---|---|---|---|---|
| wbo 1.0 (complete) | 1875187 | OPT | 2 | 0.275957 | 0.276697 |
| bsolo 3.1 cl (complete) | 1878047 | OPT | 2 | 0.308952 | 0.309951 |
| pbclasp 2009-04-24 (complete) | 1859216 | OPT | 2 | 0.330949 | 0.328901 |
| bsolo 3.1 (complete) | 1876617 | OPT | 2 | 0.606906 | 0.607439 |
| SAT4J Pseudo Resolution 2.1.1 (complete) | 1857459 | OPT | 2 | 2.21466 | 1.52439 |
| SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009) (complete) | 1870056 | OPT | 2 | 2.70259 | 2.70743 |
| bsolo 3.1 pb (complete) | 1879477 | OPT | 2 | 3.36749 | 3.36909 |
| SCIPclp SCIP 1.1.0.7 with CLP 1.8.2 (complete) | 1870057 | OPT | 2 | 4.55031 | 4.55152 |
| SAT4J Pseudo CP 2.1.1 (complete) | 1857458 | OPT | 2 | 8.50171 | 5.19185 |
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 -x73 x74 -x75 -x76 -x77 -x78 -x79 -x80 -x81 -x82 -x83 -x84 -x85 -x86 -x87 -x88 -x89 -x90 -x91 -x92 -x93 -x94 -x95 -x96 -x97 -x98 -x99 -x100 -x101 -x102 -x103 x104 -x105 -x106 -x107 -x108 -x31 x32 -x33 -x34 -x35 -x36 x49 -x50 -x51 -x52 -x53 -x54 -x109 x110 -x111 -x112 -x113 -x114 -x115 -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 -x141 -x142 -x143 -x144 -x37 x38 -x39 -x40 -x41 -x42 x55 -x56 -x57 -x58 -x59 -x60 -x145 x146 -x147 -x148 -x149 -x150 -x151 -x152 -x153 -x154 -x155 -x156 -x157 -x158 -x159 -x160 -x161 -x162 -x163 -x164 -x165 -x166 -x167 -x168 -x169 -x170 -x171 -x172 -x173 -x174 -x175 x176 -x177 -x178 -x179 -x180 -x43 x44 -x45 -x46 -x47 -x48 x61 -x62 -x63 -x64 -x65 -x66 -x181 x182 -x183 -x184 -x185 -x186 -x187 x188 -x189 -x190 -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 -x216 -x67 -x68 -x69 -x70 -x71 -x72