| Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/ factor-mod-B/factor-mod-size=5-P0=17-P1=13-P2=29-P3=37-P4=23-B.opb |
| MD5SUM | 77fa912135e48ed87b17a277e8c5de1d |
| 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 | 0.197969 |
| 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 | 60 |
| 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 | 5 |
| Maximum length of a constraint | 35 |
| Number of terms in the objective function | 5 |
| Biggest coefficient in the objective function | 16 |
| Number of bits for the biggest coefficient in the objective function | 5 |
| Sum of the numbers in the objective function | 31 |
| Number of bits of the sum of numbers in the objective function | 5 |
| Biggest number in a constraint | 512 |
| Number of bits of the biggest number in a constraint | 10 |
| Biggest sum of numbers in a constraint | 1984 |
| Number of bits of the biggest sum of numbers | 11 |
| Number of products (including duplicates) | 100 |
| Sum of products size (including duplicates) | 200 |
| Number of different products | 100 |
| Sum of products size | 200 |
| Solver Name | TraceID | Answer | obj | CPU time | Wall clock time |
|---|---|---|---|---|---|
| pbclasp 2009-04-24 (complete) | 1859161 | OPT | 3 | 0.197969 | 0.197089 |
| SCIPclp SCIP 1.1.0.7 with CLP 1.8.2 (complete) | 1869947 | OPT | 3 | 0.214966 | 0.215321 |
| wbo 1.0 (complete) | 1875132 | OPT | 3 | 0.216966 | 0.217009 |
| bsolo 3.1 cl (complete) | 1877992 | OPT | 3 | 0.261959 | 0.262137 |
| bsolo 3.1 (complete) | 1876562 | OPT | 3 | 0.353946 | 0.354189 |
| bsolo 3.1 pb (complete) | 1879422 | OPT | 3 | 1.20482 | 1.20592 |
| SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009) (complete) | 1869946 | OPT | 3 | 1.2958 | 1.2962 |
| SAT4J Pseudo Resolution 2.1.1 (complete) | 1857349 | OPT | 3 | 1.68274 | 1.19543 |
| SAT4J Pseudo CP 2.1.1 (complete) | 1857348 | OPT | 3 | 75.3975 | 72.4135 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: 3x1 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 x31 -x32 -x33 -x34 x35 x36 x37 x38 x39 -x40 -x41 x42 -x43 -x44 -x45 -x46 -x47 -x48 -x49 x50 -x51 -x52 -x53 -x54 x55 -x56 x57 -x58 -x59 -x60 x61 x62 -x63 -x64 -x65 -x66 -x67 -x68 -x69 -x70 x71 x72 -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 -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 -x145 x146 x147 x148 x149 -x150 -x151 -x152 -x153 -x154 -x155 -x156 -x157 -x158 -x159 -x160