| Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/factor-mod-B/ factor-mod-size=7-P0=71-P1=131-P2=37-P3=29-P4=71-P5=79-P6=47-P7=41-B.opb |
| MD5SUM | 3dcbc29326e863fba53ed8c8a10116ce |
| 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 | 4.29535 |
| 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 | 147 |
| 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 | 7 |
| Maximum length of a constraint | 63 |
| Number of terms in the objective function | 7 |
| Biggest coefficient in the objective function | 64 |
| Number of bits for the biggest coefficient in the objective function | 7 |
| Sum of the numbers in the objective function | 127 |
| Number of bits of the sum of numbers in the objective function | 7 |
| Biggest number in a constraint | 8192 |
| Number of bits of the biggest number in a constraint | 14 |
| Biggest sum of numbers in a constraint | 32512 |
| Number of bits of the biggest sum of numbers | 15 |
| Number of products (including duplicates) | 343 |
| Sum of products size (including duplicates) | 686 |
| Number of different products | 343 |
| Sum of products size | 686 |
| 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) | 1870208 | OPT | 3 | 4.29535 | 4.29795 |
| SCIPclp SCIP 1.1.0.7 with CLP 1.8.2 (complete) | 1870209 | OPT | 3 | 17.0144 | 17.0284 |
| wbo 1.0 (complete) | 1875263 | OPT | 3 | 55.8825 | 55.9188 |
| pbclasp 2009-04-24 (complete) | 1859292 | OPT | 3 | 60.4388 | 60.4648 |
| bsolo 3.1 cl (complete) | 1878123 | OPT | 3 | 105.98 | 106.023 |
| SAT4J Pseudo Resolution 2.1.1 (complete) | 1857611 | OPT | 3 | 153.428 | 152.093 |
| bsolo 3.1 pb (complete) | 1879553 | SAT | 3 | 1798.04 | 1798.77 |
| SAT4J Pseudo CP 2.1.1 (complete) | 1857610 | SAT (TO) | 53 | 1800.27 | 1768.78 |
| bsolo 3.1 (complete) | 1876693 | Wrong UNSAT | 28.8336 | 28.8436 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: 3x147 -x146 x145 -x144 -x143 -x142 x141 -x140 x139 -x138 x137 -x136 x135 -x134 x98 x97 -x96 -x95 -x94 x93 x92 x133 x132 -x131 x130 x129 -x128 -x127 x91 -x90 -x89 x88 -x87 x86 x85 -x126 -x125 x124 x123 x122 -x121 x120 x84 x83 x82 -x81 -x80 -x79 x78 x119 -x118 -x117 -x116 -x115 -x114 x113 x77 -x76 -x75 x74 -x73 x72 x71 -x112 -x111 -x110 -x109 -x108 -x107 -x106 x70 x69 x68 -x67 -x66 x65 x64 -x105 -x104 -x103 -x102 -x101 -x100 x99 -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