0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [Expressions interpreter: NONE]
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-2666205-1276593138.opb>
0.00/0.02 c original problem has 301 variables (301 bin, 0 int, 0 impl, 0 cont) and 732 constraints
0.00/0.02 c problem read
0.00/0.02 c presolving settings loaded
0.00/0.03 o 301
0.00/0.03 c feasible solution found by trivial heuristic, objective value 3.010000e+02
0.00/0.03 c presolving:
0.00/0.04 c (round 1) 38 del vars, 184 del conss, 39 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 394 impls, 0 clqs
0.00/0.04 c (round 2) 39 del vars, 208 del conss, 39 chg bounds, 2 chg sides, 2 chg coeffs, 0 upgd conss, 394 impls, 0 clqs
0.03/0.05 c (round 3) 39 del vars, 259 del conss, 39 chg bounds, 7 chg sides, 2 chg coeffs, 0 upgd conss, 394 impls, 0 clqs
0.03/0.05 c (round 4) 47 del vars, 267 del conss, 39 chg bounds, 7 chg sides, 2 chg coeffs, 0 upgd conss, 394 impls, 0 clqs
0.03/0.05 c (round 5) 49 del vars, 270 del conss, 39 chg bounds, 7 chg sides, 2 chg coeffs, 0 upgd conss, 394 impls, 0 clqs
0.03/0.05 c (round 6) 50 del vars, 273 del conss, 39 chg bounds, 10 chg sides, 2 chg coeffs, 0 upgd conss, 394 impls, 0 clqs
0.03/0.05 c (round 7) 53 del vars, 276 del conss, 39 chg bounds, 10 chg sides, 2 chg coeffs, 0 upgd conss, 394 impls, 0 clqs
0.03/0.06 c (round 8) 53 del vars, 279 del conss, 39 chg bounds, 12 chg sides, 2 chg coeffs, 0 upgd conss, 394 impls, 0 clqs
0.03/0.07 c (round 9) 53 del vars, 309 del conss, 39 chg bounds, 12 chg sides, 2 chg coeffs, 444 upgd conss, 394 impls, 0 clqs
0.03/0.07 c (round 10) 53 del vars, 309 del conss, 39 chg bounds, 12 chg sides, 2 chg coeffs, 453 upgd conss, 394 impls, 0 clqs
0.03/0.08 c (0.0s) probing: 168/248 (67.7%) - 0 fixings, 0 aggregations, 4 implications, 0 bound changes
0.03/0.08 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.03/0.08 c presolving (11 rounds):
0.03/0.08 c 53 deleted vars, 309 deleted constraints, 39 tightened bounds, 0 added holes, 12 changed sides, 2 changed coefficients
0.03/0.08 c 402 implications, 0 cliques
0.03/0.08 c presolved problem has 248 variables (248 bin, 0 int, 0 impl, 0 cont) and 423 constraints
0.03/0.08 c 423 constraints of type <logicor>
0.03/0.08 c transformed objective value is always integral (scale: 1)
0.03/0.08 c Presolving Time: 0.03
0.03/0.08 c - non default parameters ----------------------------------------------------------------------
0.03/0.08 c # SCIP version 1.2.1.2
0.03/0.08 c
0.03/0.08 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.03/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.03/0.08 c conflict/interconss = 0
0.03/0.08 c
0.03/0.08 c # should binary conflicts be preferred?
0.03/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.08 c conflict/preferbinary = TRUE
0.03/0.08 c
0.03/0.08 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.03/0.08 c # [type: int, range: [-1,2147483647], default: 0]
0.03/0.08 c constraints/agelimit = 1
0.03/0.08 c
0.03/0.08 c # should enforcement of pseudo solution be disabled?
0.03/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.08 c constraints/disableenfops = TRUE
0.03/0.08 c
0.03/0.08 c # frequency for displaying node information lines
0.03/0.08 c # [type: int, range: [-1,2147483647], default: 100]
0.03/0.08 c display/freq = 10000
0.03/0.08 c
0.03/0.08 c # maximal time in seconds to run
0.03/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.08 c limits/time = 1799.99
0.03/0.08 c
0.03/0.08 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.03/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.03/0.08 c limits/memory = 1620
0.03/0.08 c
0.03/0.08 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.03/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.03/0.08 c lp/solvefreq = 0
0.03/0.08 c
0.03/0.08 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.03/0.08 c # [type: char, range: {lafpsqd}, default: l]
0.03/0.08 c lp/pricing = a
0.03/0.08 c
0.03/0.08 c # should presolving try to simplify inequalities
0.03/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.08 c constraints/linear/simplifyinequalities = TRUE
0.03/0.08 c
0.03/0.08 c # should presolving try to simplify knapsacks
0.03/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.03/0.08 c constraints/knapsack/simplifyinequalities = TRUE
0.03/0.08 c
0.03/0.08 c # priority of node selection rule <dfs> in standard mode
0.03/0.08 c # [type: int, range: [-536870912,536870911], default: 0]
0.03/0.08 c nodeselection/dfs/stdpriority = 1000000
0.03/0.08 c
0.03/0.08 c -----------------------------------------------------------------------------------------------
0.03/0.08 c start solving
0.03/0.08 c
0.03/0.08 o 292
0.03/0.08 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.03/0.08 c t 0.0s| 1 | 0 | 0 | - |1267k| 0 | - | 248 | 423 | 0 | 0 | 0 | 0 | 0 | -- | 2.920000e+02 | Inf
0.03/0.08 o 124
0.03/0.08 c b 0.0s| 1 | 0 | 0 | - |1545k| 0 | - | 248 | 423 | 248 | 423 | 0 | 0 | 0 | -- | 1.240000e+02 | Inf
0.03/0.09 c 0.1s| 1 | 0 | 141 | - |1541k| 0 | 43 | 248 | 423 | 248 | 423 | 0 | 0 | 0 | 8.541176e+01 | 1.240000e+02 | 45.18%
0.03/0.09 o 104
0.03/0.09 c R 0.1s| 1 | 0 | 141 | - |1548k| 0 | 43 | 248 | 423 | 248 | 423 | 0 | 0 | 0 | 8.541176e+01 | 1.040000e+02 | 21.76%
0.03/0.09 o 103
0.03/0.09 c s 0.1s| 1 | 0 | 141 | - |1555k| 0 | 43 | 248 | 423 | 248 | 423 | 0 | 0 | 0 | 8.541176e+01 | 1.030000e+02 | 20.59%
0.03/0.09 o 94
0.03/0.09 c b 0.1s| 1 | 0 | 141 | - |1562k| 0 | 43 | 248 | 423 | 248 | 423 | 0 | 0 | 0 | 8.541176e+01 | 9.400000e+01 | 10.06%
0.09/0.11 c 0.1s| 1 | 0 | 168 | - |1613k| 0 | 33 | 248 | 423 | 248 | 426 | 3 | 0 | 0 | 8.629233e+01 | 9.400000e+01 | 8.93%
0.09/0.11 o 91
0.09/0.11 c b 0.1s| 1 | 0 | 168 | - |1621k| 0 | 33 | 248 | 423 | 248 | 426 | 3 | 0 | 0 | 8.629233e+01 | 9.100000e+01 | 5.46%
0.09/0.13 c 0.1s| 1 | 0 | 176 | - |1665k| 0 | 30 | 248 | 423 | 248 | 427 | 4 | 0 | 0 | 8.635082e+01 | 9.100000e+01 | 5.38%
0.09/0.15 c 0.1s| 1 | 0 | 192 | - |1681k| 0 | 31 | 248 | 423 | 248 | 428 | 5 | 0 | 0 | 8.639534e+01 | 9.100000e+01 | 5.33%
0.09/0.16 c 0.1s| 1 | 0 | 212 | - |1694k| 0 | 23 | 248 | 423 | 248 | 429 | 6 | 0 | 0 | 8.655302e+01 | 9.100000e+01 | 5.14%
0.09/0.18 c 0.1s| 1 | 0 | 234 | - |1732k| 0 | 25 | 248 | 423 | 248 | 431 | 8 | 0 | 0 | 8.675000e+01 | 9.100000e+01 | 4.90%
0.19/0.20 c 0.1s| 1 | 0 | 253 | - |1786k| 0 | 24 | 248 | 423 | 248 | 434 | 11 | 0 | 0 | 8.689518e+01 | 9.100000e+01 | 4.72%
0.19/0.22 c 0.2s| 1 | 0 | 275 | - |1806k| 0 | 30 | 248 | 423 | 248 | 435 | 12 | 0 | 0 | 8.700000e+01 | 9.100000e+01 | 4.60%
0.19/0.24 c 0.2s| 1 | 0 | 282 | - |1843k| 0 | 0 | 248 | 423 | 248 | 436 | 13 | 0 | 0 | 8.700000e+01 | 9.100000e+01 | 4.60%
0.19/0.24 o 87
0.19/0.24 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.19/0.24 c * 0.2s| 1 | 0 | 282 | - |1847k| 0 | - | 248 | 423 | 248 | 436 | 13 | 0 | 0 | 8.700000e+01 | 8.700000e+01 | 0.00%
0.19/0.24 c
0.19/0.24 c SCIP Status : problem is solved [optimal solution found]
0.19/0.24 c Solving Time (sec) : 0.20
0.19/0.24 c Solving Nodes : 1
0.19/0.24 c Primal Bound : +8.70000000000000e+01 (8 solutions)
0.19/0.24 c Dual Bound : +8.70000000000000e+01
0.19/0.24 c Gap : 0.00 %
0.19/0.25 s OPTIMUM FOUND
0.19/0.25 v -x301 x300 -x299 x298 x297 -x296 x295 -x294 x293 x292 x291 x290 -x289 -x288 -x287 x286 x285 x284 -x283 -x282 -x281 x280 -x279 -x278
0.19/0.25 v -x277 x276 x275 x274 -x273 x272 -x271 x270 x269 -x268 x267 -x266 x265 -x264 -x263 x262 x261 x260 -x259 x258 -x257 x256 -x255
0.19/0.25 v x254 x253 -x252 -x251 -x250 x249 -x248 x247 -x246 -x245 x244 x243 x242 -x241 -x240 x239 -x238 -x237 -x236 -x235 x234 -x233
0.19/0.25 v x232 -x231 -x230 x229 -x228 x227 -x226 -x225 -x224 -x223 -x222 -x221 -x220 -x219 -x218 -x217 -x216 -x215 -x214 x213 x212 x211
0.19/0.25 v -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 x202 -x201 -x200 -x199 -x198 -x197 -x196 x195 -x194 -x193 -x192 x191 x190
0.19/0.25 v x189 -x188 -x187 x186 x185 -x184 -x183 -x182 -x181 -x180 -x179 -x178 -x177 -x176 -x175 -x174 -x173 -x172 -x171 -x170 x169 x168
0.19/0.25 v x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 x152 x151 -x150 -x149 -x148 -x147
0.19/0.25 v -x146 -x145 -x144 x143 -x142 -x141 -x140 -x139 -x138 -x137 x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126
0.19/0.25 v x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 x114 -x113 x112 -x111 x110 -x109 -x108 -x107 -x106 -x105 -x104
0.19/0.25 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.19/0.25 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.19/0.25 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.19/0.25 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.19/0.25 c SCIP Status : problem is solved [optimal solution found]
0.19/0.25 c Solving Time : 0.20
0.19/0.25 c Original Problem :
0.19/0.25 c Problem name : HOME/instance-2666205-1276593138.opb
0.19/0.25 c Variables : 301 (301 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.25 c Constraints : 732 initial, 732 maximal
0.19/0.25 c Presolved Problem :
0.19/0.25 c Problem name : t_HOME/instance-2666205-1276593138.opb
0.19/0.25 c Variables : 248 (248 binary, 0 integer, 0 implicit integer, 0 continuous)
0.19/0.25 c Constraints : 423 initial, 423 maximal
0.19/0.25 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.19/0.25 c trivial : 0.00 1 0 0 0 0 0 0 0
0.19/0.25 c dualfix : 0.00 3 0 0 0 0 0 0 0
0.19/0.25 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.19/0.25 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.19/0.25 c implics : 0.00 0 0 0 0 0 0 0 0
0.19/0.25 c probing : 0.01 0 0 0 0 0 0 0 0
0.19/0.25 c linear : 0.01 38 11 0 39 0 279 12 2
0.19/0.25 c logicor : 0.01 0 0 0 0 0 30 0 0
0.19/0.25 c root node : - 0 - - 0 - - - -
0.19/0.25 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.19/0.25 c integral : 0 0 0 1 0 0 0 0 0 0
0.19/0.25 c logicor : 423 9 299 1 0 0 0 0 0 0
0.19/0.25 c countsols : 0 0 0 1 0 0 0 0 0 0
0.19/0.25 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.19/0.25 c integral : 0.00 0.00 0.00 0.00 0.00
0.19/0.25 c logicor : 0.01 0.01 0.00 0.00 0.00
0.19/0.25 c countsols : 0.00 0.00 0.00 0.00 0.00
0.19/0.25 c Propagators : Time Calls Cutoffs DomReds
0.19/0.25 c vbounds : 0.00 2 0 0
0.19/0.25 c rootredcost : 0.00 0 0 0
0.19/0.25 c pseudoobj : 0.00 9 0 0
0.19/0.25 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.19/0.25 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.19/0.25 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.25 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.25 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.19/0.25 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.19/0.25 c applied globally : - - - 0 0.0 - - -
0.19/0.25 c applied locally : - - - 0 0.0 - - -
0.19/0.25 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.19/0.25 c cut pool : 0.00 8 - - 67 - (maximal pool size: 200)
0.19/0.25 c redcost : 0.00 9 0 0 0 0
0.19/0.25 c impliedbounds : 0.00 8 0 0 0 0
0.19/0.25 c intobj : 0.00 0 0 0 0 0
0.19/0.25 c cgmip : 0.00 0 0 0 0 0
0.19/0.25 c gomory : 0.03 8 0 0 416 0
0.19/0.25 c strongcg : 0.05 8 0 0 470 0
0.19/0.25 c cmir : 0.01 8 0 0 0 0
0.19/0.25 c flowcover : 0.03 8 0 0 2 0
0.19/0.25 c clique : 0.00 8 0 0 0 0
0.19/0.25 c zerohalf : 0.00 0 0 0 0 0
0.19/0.25 c mcf : 0.01 1 0 0 0 0
0.19/0.25 c rapidlearning : 0.00 0 0 0 0 0
0.19/0.25 c Pricers : Time Calls Vars
0.19/0.25 c problem variables: 0.00 0 0
0.19/0.25 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.19/0.25 c pscost : 0.00 0 0 0 0 0 0
0.19/0.25 c inference : 0.00 0 0 0 0 0 0
0.19/0.25 c mostinf : 0.00 0 0 0 0 0 0
0.19/0.25 c leastinf : 0.00 0 0 0 0 0 0
0.19/0.25 c fullstrong : 0.00 0 0 0 0 0 0
0.19/0.25 c allfullstrong : 0.00 0 0 0 0 0 0
0.19/0.25 c random : 0.00 0 0 0 0 0 0
0.19/0.25 c relpscost : 0.00 0 0 0 0 0 0
0.19/0.25 c Primal Heuristics : Time Calls Found
0.19/0.25 c LP solutions : 0.00 - 1
0.19/0.25 c pseudo solutions : 0.00 - 0
0.19/0.25 c crossover : 0.00 0 0
0.19/0.25 c oneopt : 0.00 4 3
0.19/0.25 c trivial : 0.00 2 2
0.19/0.25 c simplerounding : 0.00 8 0
0.19/0.25 c zirounding : 0.00 0 0
0.19/0.25 c rounding : 0.00 8 1
0.19/0.25 c shifting : 0.00 8 1
0.19/0.25 c intshifting : 0.00 0 0
0.19/0.25 c twoopt : 0.00 0 0
0.19/0.25 c fixandinfer : 0.00 0 0
0.19/0.25 c feaspump : 0.00 0 0
0.19/0.25 c coefdiving : 0.00 0 0
0.19/0.25 c pscostdiving : 0.00 0 0
0.19/0.25 c fracdiving : 0.00 0 0
0.19/0.25 c veclendiving : 0.00 0 0
0.19/0.25 c intdiving : 0.00 0 0
0.19/0.25 c actconsdiving : 0.00 0 0
0.19/0.25 c objpscostdiving : 0.00 0 0
0.19/0.25 c rootsoldiving : 0.00 0 0
0.19/0.25 c linesearchdiving : 0.00 0 0
0.19/0.25 c guideddiving : 0.00 0 0
0.19/0.25 c octane : 0.00 0 0
0.19/0.25 c rens : 0.00 0 0
0.19/0.25 c rins : 0.00 0 0
0.19/0.25 c localbranching : 0.00 0 0
0.19/0.25 c mutation : 0.00 0 0
0.19/0.25 c dins : 0.00 0 0
0.19/0.25 c undercover : 0.00 0 0
0.19/0.25 c nlp : 0.00 0 0
0.19/0.25 c trysol : 0.00 0 0
0.19/0.25 c LP : Time Calls Iterations Iter/call Iter/sec
0.19/0.25 c primal LP : 0.00 0 0 0.00 -
0.19/0.25 c dual LP : 0.01 9 282 31.33 28200.00
0.19/0.25 c lex dual LP : 0.00 0 0 0.00 -
0.19/0.25 c barrier LP : 0.00 0 0 0.00 -
0.19/0.25 c diving/probing LP: 0.00 0 0 0.00 -
0.19/0.25 c strong branching : 0.00 0 0 0.00 -
0.19/0.25 c (at root node) : - 0 0 0.00 -
0.19/0.25 c conflict analysis: 0.00 0 0 0.00 -
0.19/0.25 c B&B Tree :
0.19/0.25 c number of runs : 1
0.19/0.25 c nodes : 1
0.19/0.25 c nodes (total) : 1
0.19/0.25 c nodes left : 0
0.19/0.25 c max depth : 0
0.19/0.25 c max depth (total): 0
0.19/0.25 c backtracks : 0 (0.0%)
0.19/0.25 c delayed cutoffs : 0
0.19/0.25 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.19/0.25 c avg switch length: 2.00
0.19/0.25 c switching time : 0.00
0.19/0.25 c Solution :
0.19/0.25 c Solutions found : 8 (8 improvements)
0.19/0.25 c First Solution : +3.01000000000000e+02 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.19/0.25 c Primal Bound : +8.70000000000000e+01 (in run 1, after 1 nodes, 0.20 seconds, depth 0, found by <relaxation>)
0.19/0.25 c Dual Bound : +8.70000000000000e+01
0.19/0.25 c Gap : 0.00 %
0.19/0.25 c Root Dual Bound : +8.70000000000000e+01
0.19/0.25 c Root Iterations : 282
0.19/0.25 c Time complete: 0.25.