| Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/factor-mod-B/ factor-mod-size=6-P0=5-P1=53-P2=23-P3=7-P4=31-P5=59-P6=59-P7=37-P8=41-P9=67-B.opb |
| MD5SUM | fb8239991fe60a33867ecb92496c7603 |
| 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.06338 |
| 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 | 162 |
| 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 | 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) | 324 |
| Sum of products size (including duplicates) | 648 |
| Number of different products | 324 |
| Sum of products size | 648 |
| 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) | 1870180 | OPT | 3 | 4.06338 | 4.06441 |
| SCIPclp SCIP 1.1.0.7 with CLP 1.8.2 (complete) | 1870181 | OPT | 3 | 6.39303 | 6.39592 |
| pbclasp 2009-04-24 (complete) | 1859278 | OPT | 3 | 9.58054 | 9.58038 |
| SAT4J Pseudo Resolution 2.1.1 (complete) | 1857583 | OPT | 3 | 9.58454 | 8.76072 |
| bsolo 3.1 cl (complete) | 1878109 | OPT | 3 | 11.4063 | 11.4102 |
| wbo 1.0 (complete) | 1875249 | OPT | 3 | 12.1632 | 12.1677 |
| bsolo 3.1 pb (complete) | 1879539 | OPT | 3 | 89.4774 | 89.5263 |
| SAT4J Pseudo CP 2.1.1 (complete) | 1857582 | SAT (TO) | 3 | 1800.33 | 1768.47 |
| bsolo 3.1 (complete) | 1876679 | Wrong UNSAT | 3.20551 | 3.20692 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: 3-x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 x154 x153 -x152 x151 -x108 -x107 -x106 -x105 -x104 x103 -x150 -x149 -x148 x147 x146 x145 -x102 x101 -x100 -x99 -x98 x97 x144 -x143 -x142 -x141 x140 x139 -x96 -x95 x94 x93 x92 x91 -x138 x137 x136 x135 -x134 -x133 x90 -x89 x88 -x87 -x86 x85 -x132 -x131 -x130 x129 -x128 -x127 x84 -x83 -x82 x81 x80 x79 -x126 -x125 -x124 -x123 -x122 -x121 -x78 -x77 -x76 x75 -x74 x73 -x120 x119 -x118 -x117 -x116 x115 -x72 -x71 -x70 -x69 -x68 x67 -x114 -x113 -x112 -x111 -x110 -x109 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