| Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/factor-mod-B/ factor-mod-size=9-P0=211-P1=317-P2=331-P3=491-P4=101-P5=283-P6=487-P7=439-B.opb |
| MD5SUM | 901fa4df755866cb23bdcc769669d554 |
| 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 | 11.6712 |
| 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 | 189 |
| Total number of constraints | 15 |
| 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 | 15 |
| Minimum length of a constraint | 9 |
| Maximum length of a constraint | 99 |
| Number of terms in the objective function | 9 |
| Biggest coefficient in the objective function | 256 |
| Number of bits for the biggest coefficient in the objective function | 9 |
| Sum of the numbers in the objective function | 511 |
| Number of bits of the sum of numbers in the objective function | 9 |
| Biggest number in a constraint | 131072 |
| Number of bits of the biggest number in a constraint | 18 |
| Biggest sum of numbers in a constraint | 523264 |
| Number of bits of the biggest sum of numbers | 19 |
| Number of products (including duplicates) | 567 |
| Sum of products size (including duplicates) | 1134 |
| Number of different products | 567 |
| Sum of products size | 1134 |
| 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) | 1870198 | OPT | 3 | 11.6712 | 11.6753 |
| SCIPclp SCIP 1.1.0.7 with CLP 1.8.2 (complete) | 1870199 | OPT | 3 | 615.16 | 615.379 |
| SAT4J Pseudo Resolution 2.1.1 (complete) | 1857601 | SAT (TO) | 3 | 1800.91 | 1796.99 |
| pbclasp 2009-04-24 (complete) | 1859287 | SAT (TO) | 121 | 1800.11 | 1800.82 |
| bsolo 3.1 pb (complete) | 1879548 | SAT | 257 | 1798.01 | 1798.54 |
| bsolo 3.1 cl (complete) | 1878118 | SAT | 257 | 1798.01 | 1798.54 |
| SAT4J Pseudo CP 2.1.1 (complete) | 1857600 | SAT (TO) | 259 | 1800.33 | 1772.01 |
| wbo 1.0 (complete) | 1875258 | ? (MO) | 1503.28 | 1503.79 | |
| bsolo 3.1 (complete) | 1876688 | Wrong UNSAT | 300.509 | 300.606 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: 3-x189 -x188 x187 -x186 x185 x184 x183 x182 x181 -x180 -x179 -x178 -x177 -x176 -x175 x174 x173 x172 -x126 x125 -x124 x123 -x122 x121 -x120 -x119 x118 -x171 -x170 -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x117 -x116 -x115 -x114 -x113 x112 -x111 -x110 x109 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 x154 -x108 -x107 -x106 -x105 -x104 -x103 -x102 x101 x100 -x153 x152 -x151 -x150 -x149 -x148 -x147 x146 x145 -x99 -x98 -x97 -x96 -x95 -x94 x93 -x92 x91 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 x90 -x89 -x88 -x87 -x86 -x85 x84 -x83 x82 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -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