| Name | normalized-PB07/OPT-SMALLINT-NLC/submittedPB07/roussel/factor-mod-B/ factor-mod-size=6-P0=23-P1=11-P2=13-P3=17-P4=19-P5=53-P6=67-P7=29-P8=7-B.opb |
| MD5SUM | 7950e484ba213c1be7d5b467b494899c |
| 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 | 3.37249 |
| 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 | 144 |
| Total number of constraints | 17 |
| 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 | 17 |
| 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) | 288 |
| Sum of products size (including duplicates) | 576 |
| Number of different products | 288 |
| Sum of products size | 576 |
| 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) | 1869886 | OPT | 3 | 3.37249 | 3.37404 |
| wbo 1.0 (complete) | 1875102 | OPT | 3 | 5.2292 | 5.23223 |
| SCIPclp SCIP 1.1.0.7 with CLP 1.8.2 (complete) | 1869887 | OPT | 3 | 9.51555 | 9.52188 |
| bsolo 3.1 cl (complete) | 1877962 | OPT | 3 | 9.80851 | 9.81288 |
| SAT4J Pseudo Resolution 2.1.1 (complete) | 1857289 | OPT | 3 | 10.5654 | 9.85327 |
| pbclasp 2009-04-24 (complete) | 1859131 | OPT | 3 | 17.3324 | 17.3351 |
| bsolo 3.1 pb (complete) | 1879392 | OPT | 3 | 86.3819 | 86.4206 |
| SAT4J Pseudo CP 2.1.1 (complete) | 1857288 | SAT (TO) | 3 | 1800.34 | 1770.99 |
| bsolo 3.1 (complete) | 1876532 | Wrong Opt. | 23 | 2.87256 | 2.87525 |
This section presents information obtained from the best job displayed in the list (i.e. solvers whose names are not hidden).
obj: 3-x144 -x143 x142 x141 x140 x139 -x138 -x137 x136 -x135 x134 x133 x96 -x95 -x94 x93 -x92 x91 -x132 -x131 -x130 -x129 x128 -x127 x90 x89 x88 -x87 -x86 x85 -x126 -x125 x124 -x123 x122 x121 x84 -x83 -x82 x81 -x80 x79 x120 -x119 x118 x117 -x116 -x115 -x78 x77 -x76 -x75 x74 x73 -x114 -x113 x112 -x111 -x110 x109 x72 -x71 x70 x69 -x68 x67 -x108 x107 x106 x105 x104 -x103 -x66 x65 x64 -x63 x62 x61 -x102 -x101 -x100 -x99 -x98 x97 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