0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1]
0.00/0.00 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-2705144-1278572917.wbo>
0.00/0.00 c original problem has 336 variables (318 bin, 0 int, 18 impl, 0 cont) and 69 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.00 c presolving:
0.00/0.00 c (round 1) 0 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 10 clqs
0.00/0.00 c (round 2) 0 del vars, 1 del conss, 18 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 10 clqs
0.00/0.01 c (round 3) 0 del vars, 1 del conss, 18 chg bounds, 0 chg sides, 0 chg coeffs, 22 upgd conss, 26 impls, 10 clqs
0.00/0.01 c (round 4) 0 del vars, 1 del conss, 18 chg bounds, 0 chg sides, 0 chg coeffs, 32 upgd conss, 26 impls, 10 clqs
0.00/0.01 c (0.0s) probing: 101/318 (31.8%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.01 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.01 c presolving (5 rounds):
0.00/0.01 c 0 deleted vars, 1 deleted constraints, 18 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 26 implications, 10 cliques
0.00/0.01 c presolved problem has 336 variables (318 bin, 0 int, 18 impl, 0 cont) and 68 constraints
0.00/0.01 c 10 constraints of type <setppc>
0.00/0.01 c 18 constraints of type <linear>
0.00/0.01 c 18 constraints of type <indicator>
0.00/0.01 c 22 constraints of type <logicor>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.01
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 1.2.1.3
0.00/0.01 c
0.00/0.01 c # frequency for displaying node information lines
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01 c display/freq = 10000
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1790
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 3420
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify inequalities
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/linear/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/addCouplingCons = TRUE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify knapsacks
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/rapidlearning/freq = 0
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.01 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.01 c 0.0s| 1 | 0 | 22 | - | 918k| 0 | 0 | 336 | 68 | 336 | 32 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 86 | - | 929k| 0 | 0 | 336 | 68 | 336 | 42 | 10 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 109 | - | 930k| 0 | 0 | 336 | 68 | 336 | 44 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 183 | - | 932k| 0 | 0 | 336 | 68 | 336 | 46 | 14 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 202 | - | 933k| 0 | 0 | 336 | 68 | 336 | 48 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 227 | - | 935k| 0 | 0 | 336 | 68 | 336 | 50 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 c 0.0s| 1 | 2 | 227 | - | 936k| 0 | 0 | 336 | 68 | 336 | 50 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.03 o 837
0.00/0.03 c y 0.0s| 23 | 18 | 268 | 1.9 | 964k| 17 | - | 336 | 70 | 0 | 0 | 18 | 2 | 0 | 3.000000e+00 | 8.370000e+02 | Large
0.00/0.03 o 91
0.00/0.03 c * 0.0s| 27 | 16 | 286 | 2.3 | 971k| 17 | - | 336 | 70 | 336 | 50 | 18 | 2 | 0 | 2.400000e+01 | 9.100000e+01 | 279.17%
0.00/0.03 o 89
0.00/0.03 c * 0.0s| 38 | 27 | 325 | 2.6 | 992k| 17 | - | 336 | 70 | 336 | 50 | 18 | 2 | 0 | 3.900000e+01 | 8.900000e+01 | 128.21%
0.00/0.05 o 62
0.00/0.05 c * 0.1s| 188 | 141 | 451 | 1.2 |1115k| 143 | - | 336 | 71 | 336 | 50 | 18 | 3 | 0 | 5.800000e+01 | 6.200000e+01 | 6.90%
0.00/0.05 o 59
0.00/0.05 c * 0.1s| 192 | 95 | 464 | 1.2 |1108k| 143 | - | 336 | 74 | 336 | 50 | 18 | 10 | 0 | 5.800000e+01 | 5.900000e+01 | 1.72%
0.00/0.06 o 58
0.00/0.06 c * 0.1s| 194 | 0 | 467 | 1.2 |1056k| 143 | - | 336 | 60 | 336 | 50 | 18 | 11 | 0 | 5.800000e+01 | 5.800000e+01 | 0.00%
0.00/0.06 c
0.00/0.06 c SCIP Status : problem is solved [optimal solution found]
0.00/0.06 c Solving Time (sec) : 0.05
0.00/0.06 c Solving Nodes : 194
0.00/0.06 c Primal Bound : +5.80000000000000e+01 (13 solutions)
0.00/0.06 c Dual Bound : +5.80000000000000e+01
0.00/0.06 c Gap : 0.00 %
0.00/0.06 s OPTIMUM FOUND
0.00/0.06 v -x300 -x299 -x298 -x297 -x296 -x295 -x294 -x293 -x292 x291 -x290 -x289 -x288 -x287 -x286 -x285 -x284 -x283 -x282 x281 -x280 -x279
0.00/0.06 v -x278 -x277 -x276 -x275 -x274 -x273 x272 -x271 -x270 -x269 -x268 -x267 -x266 -x265 -x264 x263 -x262 -x261 -x260 -x259 -x258
0.00/0.06 v -x257 -x256 -x255 x254 -x253 -x252 -x251 -x250 -x249 -x248 -x247 -x246 -x245 -x244 -x243 x242 -x241 -x240 -x239 -x238 -x237
0.00/0.06 v -x236 -x235 -x234 -x233 -x232 x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224 x223 -x222 -x221 -x220 -x219 -x218 -x217 -x216
0.00/0.06 v -x215 x214 -x213 -x212 -x211 -x210 -x209 -x208 -x207 -x206 x205 -x204 -x203 -x202 -x201 -x200 -x199 -x198 -x197 x196 -x195 -x194
0.00/0.06 v -x193 -x192 -x191 -x190 -x189 -x188 x187 -x186 -x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 x176 -x175 -x174 -x173
0.00/0.06 v -x172 -x171 -x170 -x169 -x168 -x167 -x166 x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 x156 -x155 -x154 -x153 -x152
0.00/0.06 v -x151 -x150 -x149 -x148 x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131
0.00/0.06 v -x130 x129 -x128 -x127 -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 x116 -x115 -x114 -x113 -x112 -x111 -x110
0.00/0.06 v -x109 -x108 -x107 x106 -x105 -x104 -x103 -x102 -x101 -x100 x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 x90 -x89 -x88 -x87 -x86
0.00/0.06 v -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 x71 -x70 -x69 -x68 -x67 x66 -x65 -x64 -x63 -x62 -x61
0.00/0.06 v 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
0.00/0.06 v -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
0.00/0.06 v -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 x1
0.00/0.06 c SCIP Status : problem is solved [optimal solution found]
0.00/0.06 c Solving Time : 0.05
0.00/0.06 c Original Problem :
0.00/0.06 c Problem name : HOME/instance-2705144-1278572917.wbo
0.00/0.06 c Variables : 336 (318 binary, 0 integer, 18 implicit integer, 0 continuous)
0.00/0.06 c Constraints : 69 initial, 69 maximal
0.00/0.06 c Presolved Problem :
0.00/0.06 c Problem name : t_HOME/instance-2705144-1278572917.wbo
0.00/0.06 c Variables : 336 (318 binary, 0 integer, 18 implicit integer, 0 continuous)
0.00/0.06 c Constraints : 68 initial, 75 maximal
0.00/0.06 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.00/0.06 c trivial : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c implics : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c probing : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c setppc : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c linear : 0.00 0 0 0 18 0 1 0 0
0.00/0.06 c indicator : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c logicor : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c bounddisjunction : 0.00 0 0 0 0 0 0 0 0
0.00/0.06 c root node : - 34 - - 36 - - - -
0.00/0.06 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.00/0.06 c integral : 0 0 0 187 0 0 0 0 0 0
0.00/0.06 c setppc : 10 6 701 187 0 0 53 0 0 0
0.00/0.06 c linear : 18 6 700 186 0 0 63 18 0 0
0.00/0.06 c indicator : 18 0 496 184 0 0 120 0 0 0
0.00/0.06 c logicor : 22+ 6 72 187 0 0 1 0 0 0
0.00/0.06 c bounddisjunction : 0+ 0 47 0 0 1 24 0 0 0
0.00/0.06 c countsols : 0 0 0 187 0 0 0 0 0 0
0.00/0.06 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.00/0.06 c integral : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c setppc : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c linear : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c indicator : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c logicor : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c bounddisjunction : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c countsols : 0.00 0.00 0.00 0.00 0.00
0.00/0.06 c Propagators : Time Calls Cutoffs DomReds
0.00/0.06 c vbounds : 0.00 72 0 23
0.00/0.06 c rootredcost : 0.00 5 0 7
0.00/0.06 c pseudoobj : 0.00 502 0 79
0.00/0.06 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.06 c propagation : 0.00 1 1 2 2.5 0 0.0 -
0.00/0.06 c infeasible LP : 0.00 5 5 10 11.1 0 0.0 0
0.00/0.06 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.06 c pseudo solution : 0.00 1 1 2 2.5 0 0.0 -
0.00/0.06 c applied globally : - - - 11 9.8 - - -
0.00/0.06 c applied locally : - - - 0 0.0 - - -
0.00/0.06 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.06 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.06 c redcost : 0.00 196 0 12 0 0
0.00/0.06 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.06 c intobj : 0.00 0 0 0 0 0
0.00/0.06 c cgmip : 0.00 0 0 0 0 0
0.00/0.06 c gomory : 0.00 0 0 0 0 0
0.00/0.06 c strongcg : 0.00 0 0 0 0 0
0.00/0.06 c cmir : 0.00 0 0 0 0 0
0.00/0.06 c flowcover : 0.00 0 0 0 0 0
0.00/0.06 c clique : 0.00 0 0 0 0 0
0.00/0.06 c zerohalf : 0.00 0 0 0 0 0
0.00/0.06 c mcf : 0.00 0 0 0 0 0
0.00/0.06 c rapidlearning : 0.01 1 0 0 0 0
0.00/0.06 c Pricers : Time Calls Vars
0.00/0.06 c problem variables: 0.00 0 0
0.00/0.06 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.06 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.06 c pscost : 0.00 0 0 0 0 0 0
0.00/0.06 c inference : 0.00 182 0 0 0 0 377
0.00/0.06 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.06 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.06 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.06 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.06 c random : 0.00 0 0 0 0 0 0
0.00/0.06 c Primal Heuristics : Time Calls Found
0.00/0.06 c LP solutions : 0.00 - 5
0.00/0.06 c pseudo solutions : 0.00 - 0
0.00/0.06 c crossover : 0.00 0 0
0.00/0.06 c feaspump : 0.00 0 0
0.00/0.06 c oneopt : 0.00 3 0
0.00/0.06 c linesearchdiving : 0.00 3 0
0.00/0.06 c guideddiving : 0.00 3 0
0.00/0.06 c coefdiving : 0.00 3 0
0.00/0.06 c pscostdiving : 0.00 3 0
0.00/0.06 c fracdiving : 0.00 3 0
0.00/0.06 c veclendiving : 0.00 3 0
0.00/0.06 c rootsoldiving : 0.00 3 0
0.00/0.06 c objpscostdiving : 0.00 3 0
0.00/0.06 c trivial : 0.00 2 0
0.00/0.06 c simplerounding : 0.00 0 0
0.00/0.06 c zirounding : 0.00 0 0
0.00/0.06 c rounding : 0.00 0 0
0.00/0.06 c shifting : 0.00 0 0
0.00/0.06 c intshifting : 0.00 0 0
0.00/0.06 c twoopt : 0.00 0 0
0.00/0.06 c fixandinfer : 0.00 0 0
0.00/0.06 c intdiving : 0.00 0 0
0.00/0.06 c actconsdiving : 0.00 0 0
0.00/0.06 c octane : 0.00 0 0
0.00/0.06 c rens : 0.00 0 0
0.00/0.06 c rins : 0.00 0 0
0.00/0.06 c localbranching : 0.00 0 0
0.00/0.06 c mutation : 0.00 0 0
0.00/0.06 c dins : 0.00 0 0
0.00/0.06 c undercover : 0.00 0 0
0.00/0.06 c nlp : 0.00 0 0
0.00/0.06 c trysol : 0.00 9 8
0.00/0.06 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.06 c primal LP : 0.00 0 0 0.00 -
0.00/0.06 c dual LP : 0.01 35 463 13.23 32057.05
0.00/0.06 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.06 c barrier LP : 0.00 0 0 0.00 -
0.00/0.06 c diving/probing LP: 0.00 2 4 2.00 -
0.00/0.06 c strong branching : 0.00 0 0 0.00 -
0.00/0.06 c (at root node) : - 0 0 0.00 -
0.00/0.06 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.06 c B&B Tree :
0.00/0.06 c number of runs : 1
0.00/0.06 c nodes : 194
0.00/0.06 c nodes (total) : 194
0.00/0.06 c nodes left : 0
0.00/0.06 c max depth : 143
0.00/0.06 c max depth (total): 143
0.00/0.06 c backtracks : 18 (9.3%)
0.00/0.06 c delayed cutoffs : 56
0.00/0.06 c repropagations : 227 (72 domain reductions, 0 cutoffs)
0.00/0.06 c avg switch length: 4.53
0.00/0.06 c switching time : 0.00
0.00/0.06 c Solution :
0.00/0.06 c Solutions found : 13 (6 improvements)
0.00/0.06 c First Solution : +8.37000000000000e+02 (in run 1, after 22 nodes, 0.03 seconds, depth 8, found by <trysol>)
0.00/0.06 c Primal Bound : +5.80000000000000e+01 (in run 1, after 194 nodes, 0.05 seconds, depth 7, found by <relaxation>)
0.00/0.06 c Dual Bound : +5.80000000000000e+01
0.00/0.06 c Gap : 0.00 %
0.00/0.06 c Root Dual Bound : +0.00000000000000e+00
0.00/0.06 c Root Iterations : 227
0.00/0.06 c Time complete: 0.05.