0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 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-3489544-1307771713.opb>
0.00/0.00 c original problem has 301 variables (301 bin, 0 int, 0 impl, 0 cont) and 732 constraints
0.00/0.00 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 o 301
0.00/0.01 c feasible solution found by trivial heuristic, objective value 3.010000e+02
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 38 del vars, 184 del conss, 0 add conss, 39 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 394 impls, 0 clqs
0.00/0.01 c (round 2) 39 del vars, 208 del conss, 0 add conss, 39 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 394 impls, 0 clqs
0.00/0.01 c (round 3) 39 del vars, 259 del conss, 0 add conss, 39 chg bounds, 7 chg sides, 2 chg coeffs, 0 upgd conss, 394 impls, 0 clqs
0.00/0.01 c (round 4) 47 del vars, 267 del conss, 0 add conss, 39 chg bounds, 7 chg sides, 2 chg coeffs, 0 upgd conss, 394 impls, 0 clqs
0.00/0.01 c (round 5) 49 del vars, 270 del conss, 0 add conss, 39 chg bounds, 7 chg sides, 2 chg coeffs, 0 upgd conss, 394 impls, 0 clqs
0.00/0.02 c (round 6) 50 del vars, 273 del conss, 0 add conss, 39 chg bounds, 10 chg sides, 2 chg coeffs, 0 upgd conss, 394 impls, 0 clqs
0.00/0.02 c (round 7) 53 del vars, 276 del conss, 0 add conss, 39 chg bounds, 10 chg sides, 2 chg coeffs, 0 upgd conss, 394 impls, 0 clqs
0.00/0.02 c (round 8) 53 del vars, 279 del conss, 0 add conss, 39 chg bounds, 12 chg sides, 2 chg coeffs, 0 upgd conss, 394 impls, 0 clqs
0.00/0.02 c (round 9) 53 del vars, 291 del conss, 0 add conss, 39 chg bounds, 12 chg sides, 2 chg coeffs, 444 upgd conss, 394 impls, 0 clqs
0.00/0.02 c (round 10) 53 del vars, 291 del conss, 0 add conss, 39 chg bounds, 12 chg sides, 2 chg coeffs, 453 upgd conss, 394 impls, 0 clqs
0.00/0.02 c (0.0s) probing: 101/248 (40.7%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.02 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.02 c presolving (11 rounds):
0.00/0.02 c 53 deleted vars, 291 deleted constraints, 0 added constraints, 39 tightened bounds, 0 added holes, 12 changed sides, 2 changed coefficients
0.00/0.02 c 394 implications, 0 cliques
0.00/0.02 c presolved problem has 248 variables (248 bin, 0 int, 0 impl, 0 cont) and 441 constraints
0.00/0.02 c 156 constraints of type <setppc>
0.00/0.02 c 285 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.02
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 2.0.1.5
0.00/0.02 c
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = 10000
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1797
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 13950
0.00/0.02 c
0.00/0.02 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.02 c # [type: int, range: [1,2], default: 1]
0.00/0.02 c timing/clocktype = 2
0.00/0.02 c
0.00/0.02 c # belongs reading time to solving time?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c timing/reading = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/indicator/addCouplingCons = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/rapidlearning/freq = 0
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.00/0.02 o 292
0.00/0.02 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.02 c t 0.0s| 1 | 0 | 0 | - |1279k| 0 | - | 248 | 441 | 0 | 0 | 0 | 0 | 0 | -- | 2.920000e+02 | Inf
0.00/0.02 o 124
0.00/0.02 c b 0.0s| 1 | 0 | 0 | - |1600k| 0 | - | 248 | 441 | 248 | 441 | 0 | 0 | 0 | -- | 1.240000e+02 | Inf
0.00/0.03 c 0.0s| 1 | 0 | 146 | - |1596k| 0 | 43 | 248 | 441 | 248 | 441 | 0 | 0 | 0 | 8.541176e+01 | 1.240000e+02 | 45.18%
0.00/0.03 o 103
0.00/0.03 c R 0.0s| 1 | 0 | 146 | - |1602k| 0 | 43 | 248 | 441 | 248 | 441 | 0 | 0 | 0 | 8.541176e+01 | 1.030000e+02 | 20.59%
0.00/0.03 o 102
0.00/0.03 c s 0.0s| 1 | 0 | 146 | - |1609k| 0 | 43 | 248 | 441 | 248 | 441 | 0 | 0 | 0 | 8.541176e+01 | 1.020000e+02 | 19.42%
0.00/0.03 o 93
0.00/0.03 c b 0.0s| 1 | 0 | 146 | - |1617k| 0 | 43 | 248 | 441 | 248 | 441 | 0 | 0 | 0 | 8.541176e+01 | 9.300000e+01 | 8.88%
0.05/0.06 c 0.1s| 1 | 0 | 175 | - |1685k| 0 | 32 | 248 | 458 | 248 | 442 | 3 | 0 | 0 | 8.629233e+01 | 9.300000e+01 | 7.77%
0.05/0.06 o 89
0.05/0.06 c b 0.1s| 1 | 0 | 175 | - |1693k| 0 | 32 | 248 | 458 | 248 | 442 | 3 | 0 | 0 | 8.629233e+01 | 8.900000e+01 | 3.14%
0.05/0.06 c 0.1s| 1 | 0 | 185 | - |1739k| 0 | 31 | 248 | 458 | 248 | 443 | 4 | 0 | 0 | 8.635082e+01 | 8.900000e+01 | 3.07%
0.05/0.07 c 0.1s| 1 | 0 | 195 | - |1753k| 0 | 31 | 248 | 458 | 248 | 444 | 5 | 0 | 0 | 8.639534e+01 | 8.900000e+01 | 3.01%
0.05/0.08 c 0.1s| 1 | 0 | 207 | - |1766k| 0 | 28 | 248 | 458 | 248 | 445 | 6 | 0 | 0 | 8.666667e+01 | 8.900000e+01 | 2.69%
0.05/0.09 c 0.1s| 1 | 0 | 234 | - |1802k| 0 | 35 | 248 | 458 | 248 | 447 | 8 | 0 | 0 | 8.666667e+01 | 8.900000e+01 | 2.69%
0.05/0.09 c 0.1s| 1 | 0 | 246 | - |1853k| 0 | 35 | 248 | 458 | 248 | 449 | 10 | 0 | 0 | 8.666667e+01 | 8.900000e+01 | 2.69%
0.09/0.11 c 0.1s| 1 | 0 | 257 | - |1856k| 0 | 39 | 248 | 458 | 248 | 450 | 11 | 0 | 0 | 8.666667e+01 | 8.900000e+01 | 2.69%
0.09/0.12 c 0.1s| 1 | 0 | 280 | - |1857k| 0 | 28 | 248 | 458 | 248 | 451 | 12 | 0 | 0 | 8.666667e+01 | 8.900000e+01 | 2.69%
0.09/0.13 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.13 c 0.1s| 1 | 0 | 311 | - |1858k| 0 | 32 | 248 | 458 | 248 | 452 | 13 | 0 | 0 | 8.666667e+01 | 8.900000e+01 | 2.69%
0.09/0.14 o 87
0.09/0.14 c E 0.1s| 1 | 0 | 311 | - |1862k| 0 | - | 248 | 458 | 248 | 452 | 13 | 0 | 0 | 8.666667e+01 | 8.700000e+01 | 0.38%
0.09/0.14 c 0.1s| 1 | 0 | 311 | - |1862k| 0 | - | 248 | 458 | 248 | 452 | 13 | 0 | 0 | 8.700000e+01 | 8.700000e+01 | 0.00%
0.09/0.14 c
0.09/0.14 c SCIP Status : problem is solved [optimal solution found]
0.09/0.14 c Solving Time (sec) : 0.14
0.09/0.14 c Solving Nodes : 1
0.09/0.14 c Primal Bound : +8.70000000000000e+01 (9 solutions)
0.09/0.14 c Dual Bound : +8.70000000000000e+01
0.09/0.14 c Gap : 0.00 %
0.09/0.14 s OPTIMUM FOUND
0.09/0.14 v -x301 x300 -x299 x298 x297 -x296 x295 -x294 x293 -x292 x291 x290 -x289 -x288 -x287 x286 x285 x284 -x283 -x282 -x281 x280 -x279
0.09/0.14 v -x278 -x277 x276 x275 x274 -x273 x272 -x271 x270 x269 -x268 x267 -x266 x265 -x264 -x263 x262 x261 x260 -x259 x258 -x257 x256
0.09/0.14 v -x255 x254 x253 -x252 -x251 -x250 x249 -x248 x247 -x246 -x245 x244 x243 x242 -x241 -x240 x239 -x238 -x237 -x236 -x235 x234 -x233
0.09/0.14 v x232 -x231 -x230 x229 -x228 x227 -x226 -x225 -x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217 -x216 -x215 -x214 x213 -x212
0.09/0.14 v x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 x202 -x201 -x200 -x199 -x198 -x197 -x196 x195 -x194 -x193 -x192 x191 x190
0.09/0.14 v x189 -x188 -x187 x186 x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 x169
0.09/0.14 v x168 x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 x152 x151 -x150 -x149 -x148 -x147
0.09/0.14 v -x146 -x145 -x144 x143 x142 -x141 x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126
0.09/0.14 v x125 -x124 -x123 -x122 -x121 -x120 -x119 x118 -x117 -x116 -x115 x114 -x113 x112 -x111 x110 -x109 -x108 -x107 -x106 -x105 -x104
0.09/0.14 v -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 x92 -x91 -x90 -x89 -x88 -x87 -x86 x85 x84 -x83 -x82 x81 -x80 -x79
0.09/0.14 v -x78 x77 x76 x75 -x74 -x73 -x72 -x71 -x70 -x69 x68 x67 -x66 -x65 -x64 -x63 x62 -x61 x60 -x59 -x58 -x57 -x56 x55 -x54 -x53
0.09/0.14 v -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
0.09/0.14 v -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 x1
0.09/0.14 c SCIP Status : problem is solved [optimal solution found]
0.09/0.14 c Total Time : 0.14
0.09/0.14 c solving : 0.14
0.09/0.14 c presolving : 0.02 (included in solving)
0.09/0.14 c reading : 0.01 (included in solving)
0.09/0.14 c Original Problem :
0.09/0.14 c Problem name : HOME/instance-3489544-1307771713.opb
0.09/0.14 c Variables : 301 (301 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.14 c Constraints : 732 initial, 732 maximal
0.09/0.14 c Presolved Problem :
0.09/0.14 c Problem name : t_HOME/instance-3489544-1307771713.opb
0.09/0.14 c Variables : 248 (248 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.14 c Constraints : 441 initial, 460 maximal
0.09/0.14 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.09/0.14 c trivial : 0.00 1 0 0 0 0 0 0 0 0
0.09/0.14 c dualfix : 0.00 3 0 0 0 0 0 0 0 0
0.09/0.14 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.14 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.14 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.14 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.14 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.14 c setppc : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.14 c linear : 0.01 38 11 0 39 0 279 0 12 2
0.09/0.14 c logicor : 0.00 0 0 0 0 0 12 0 0 0
0.09/0.14 c root node : - 2 - - 2 - - - - -
0.09/0.14 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.09/0.14 c integral : 0 0 0 0 0 14 0 0 0 0 0 0
0.09/0.14 c setppc : 156 10 180 0 0 10 0 0 0 0 0 0
0.09/0.14 c linear : 0+ 9 1 0 0 0 0 0 0 0 0 0
0.09/0.14 c logicor : 285 10 110 0 0 8 0 0 0 0 0 0
0.09/0.14 c countsols : 0 0 0 0 0 11 0 0 0 0 0 0
0.09/0.14 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.09/0.14 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.14 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.14 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.14 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.14 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.14 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.09/0.14 c vbounds : 0 0 0 0
0.09/0.14 c rootredcost : 0 0 0 0
0.09/0.14 c pseudoobj : 7 0 0 0
0.09/0.14 c Propagator Timings : TotalTime Propagate Resprop
0.09/0.14 c vbounds : 0.00 0.00 0.00
0.09/0.14 c rootredcost : 0.00 0.00 0.00
0.09/0.14 c pseudoobj : 0.00 0.00 0.00
0.09/0.14 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.14 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.14 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.14 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.14 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.14 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.14 c applied globally : - - - 0 0.0 - - -
0.09/0.14 c applied locally : - - - 0 0.0 - - -
0.09/0.14 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.14 c cut pool : 0.00 8 - - 117 - (maximal pool size: 156)
0.09/0.14 c redcost : 0.00 9 0 0 0 0
0.09/0.14 c impliedbounds : 0.00 9 0 0 0 0
0.09/0.14 c intobj : 0.00 0 0 0 0 0
0.09/0.14 c gomory : 0.02 9 0 0 345 0
0.09/0.14 c cgmip : 0.00 0 0 0 0 0
0.09/0.14 c closecuts : 0.00 0 0 0 0 0
0.09/0.14 c strongcg : 0.02 9 0 0 405 0
0.09/0.14 c cmir : 0.01 9 0 0 3 0
0.09/0.14 c flowcover : 0.02 9 0 0 2 0
0.09/0.14 c clique : 0.00 9 0 0 0 0
0.09/0.14 c zerohalf : 0.00 0 0 0 0 0
0.09/0.14 c mcf : 0.00 1 0 0 0 0
0.09/0.14 c oddcycle : 0.00 0 0 0 0 0
0.09/0.14 c rapidlearning : 0.02 1 0 2 0 19
0.09/0.14 c Pricers : Time Calls Vars
0.09/0.14 c problem variables: 0.00 0 0
0.09/0.14 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.14 c relpscost : 0.00 0 0 0 0 0 0
0.09/0.14 c pscost : 0.00 0 0 0 0 0 0
0.09/0.14 c inference : 0.00 0 0 0 0 0 0
0.09/0.14 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.14 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.14 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.14 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.14 c random : 0.00 0 0 0 0 0 0
0.09/0.14 c Primal Heuristics : Time Calls Found
0.09/0.14 c LP solutions : 0.00 - 0
0.09/0.14 c pseudo solutions : 0.00 - 0
0.09/0.14 c crossover : 0.00 0 0
0.09/0.14 c oneopt : 0.00 4 3
0.09/0.14 c trivial : 0.00 2 2
0.09/0.14 c shiftandpropagate: 0.00 0 0
0.09/0.14 c simplerounding : 0.00 10 0
0.09/0.14 c zirounding : 0.00 1 0
0.09/0.14 c rounding : 0.00 10 1
0.09/0.14 c shifting : 0.00 10 1
0.09/0.14 c intshifting : 0.00 0 0
0.09/0.14 c twoopt : 0.00 0 0
0.09/0.14 c fixandinfer : 0.00 0 0
0.09/0.14 c feaspump : 0.00 0 0
0.09/0.14 c clique : 0.00 0 0
0.09/0.14 c coefdiving : 0.00 0 0
0.09/0.14 c pscostdiving : 0.00 0 0
0.09/0.14 c fracdiving : 0.00 0 0
0.09/0.14 c veclendiving : 0.00 0 0
0.09/0.14 c intdiving : 0.00 0 0
0.09/0.14 c actconsdiving : 0.00 0 0
0.09/0.14 c objpscostdiving : 0.00 0 0
0.09/0.14 c rootsoldiving : 0.00 0 0
0.09/0.14 c linesearchdiving : 0.00 0 0
0.09/0.14 c guideddiving : 0.00 0 0
0.09/0.14 c octane : 0.00 0 0
0.09/0.14 c rens : 0.02 1 1
0.09/0.14 c rins : 0.00 0 0
0.09/0.14 c localbranching : 0.00 0 0
0.09/0.14 c mutation : 0.00 0 0
0.09/0.14 c dins : 0.00 0 0
0.09/0.14 c vbounds : 0.00 0 0
0.09/0.14 c undercover : 0.00 0 0
0.09/0.14 c subnlp : 0.00 0 0
0.09/0.14 c trysol : 0.00 0 0
0.09/0.14 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.14 c primal LP : 0.00 0 0 0.00 -
0.09/0.14 c dual LP : 0.01 10 311 31.10 -
0.09/0.14 c lex dual LP : 0.00 0 0 0.00 -
0.09/0.14 c barrier LP : 0.00 0 0 0.00 -
0.09/0.14 c diving/probing LP: 0.00 0 0 0.00 -
0.09/0.14 c strong branching : 0.00 0 0 0.00 -
0.09/0.14 c (at root node) : - 0 0 0.00 -
0.09/0.14 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.14 c B&B Tree :
0.09/0.14 c number of runs : 1
0.09/0.14 c nodes : 1
0.09/0.14 c nodes (total) : 1
0.09/0.14 c nodes left : 0
0.09/0.14 c max depth : 0
0.09/0.14 c max depth (total): 0
0.09/0.14 c backtracks : 0 (0.0%)
0.09/0.14 c delayed cutoffs : 0
0.09/0.14 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.09/0.14 c avg switch length: 2.00
0.09/0.14 c switching time : 0.00
0.09/0.14 c Solution :
0.09/0.14 c Solutions found : 9 (8 improvements)
0.09/0.14 c First Solution : +3.01000000000000e+02 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.09/0.14 c Primal Bound : +8.70000000000000e+01 (in run 1, after 1 nodes, 0.14 seconds, depth 0, found by <rens>)
0.09/0.14 c Dual Bound : +8.70000000000000e+01
0.09/0.14 c Gap : 0.00 %
0.09/0.14 c Root Dual Bound : +8.70000000000000e+01
0.09/0.14 c Root Iterations : 311
0.09/0.15 c Time complete: 0.14.