0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
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-3451743-1307115621.opb>
0.00/0.01 c original problem has 280 variables (280 bin, 0 int, 0 impl, 0 cont) and 1934 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 127 del vars, 266 del conss, 0 add conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5536 impls, 0 clqs
0.00/0.02 c (round 2) 140 del vars, 407 del conss, 0 add conss, 48 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5615 impls, 0 clqs
0.00/0.02 c (round 3) 206 del vars, 1774 del conss, 0 add conss, 65 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5638 impls, 0 clqs
0.00/0.02 c (round 4) 230 del vars, 1796 del conss, 0 add conss, 65 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5638 impls, 0 clqs
0.00/0.02 c (round 5) 237 del vars, 1830 del conss, 0 add conss, 65 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5638 impls, 0 clqs
0.00/0.03 c (round 6) 239 del vars, 1832 del conss, 0 add conss, 65 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 5638 impls, 0 clqs
0.00/0.03 c (round 7) 239 del vars, 1844 del conss, 0 add conss, 65 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 5638 impls, 0 clqs
0.00/0.03 c (round 8) 240 del vars, 1845 del conss, 0 add conss, 65 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 5638 impls, 0 clqs
0.00/0.03 c (round 9) 240 del vars, 1845 del conss, 0 add conss, 65 chg bounds, 1 chg sides, 0 chg coeffs, 88 upgd conss, 5638 impls, 0 clqs
0.00/0.03 c (round 10) 240 del vars, 1845 del conss, 0 add conss, 65 chg bounds, 1 chg sides, 0 chg coeffs, 89 upgd conss, 5638 impls, 0 clqs
0.00/0.03 c (round 11) 253 del vars, 1845 del conss, 0 add conss, 66 chg bounds, 1 chg sides, 0 chg coeffs, 89 upgd conss, 5661 impls, 0 clqs
0.00/0.03 c (round 12) 253 del vars, 1906 del conss, 0 add conss, 66 chg bounds, 1 chg sides, 0 chg coeffs, 89 upgd conss, 5667 impls, 0 clqs
0.00/0.03 c (round 13) 267 del vars, 1914 del conss, 0 add conss, 66 chg bounds, 1 chg sides, 0 chg coeffs, 89 upgd conss, 5667 impls, 0 clqs
0.00/0.03 c (round 14) 268 del vars, 1914 del conss, 0 add conss, 66 chg bounds, 1 chg sides, 0 chg coeffs, 89 upgd conss, 5667 impls, 0 clqs
0.00/0.03 c presolving (15 rounds):
0.00/0.03 c 268 deleted vars, 1914 deleted constraints, 0 added constraints, 66 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
0.00/0.03 c 5667 implications, 0 cliques
0.00/0.03 c presolved problem has 12 variables (12 bin, 0 int, 0 impl, 0 cont) and 20 constraints
0.00/0.03 c 12 constraints of type <setppc>
0.00/0.03 c 8 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 2.0.1.5
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1800
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 13950
0.00/0.03 c
0.00/0.03 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
0.00/0.03 c
0.00/0.03 c # belongs reading time to solving time?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c timing/reading = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/indicator/addCouplingCons = TRUE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.03 o 94
0.00/0.03 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.03 c t 0.0s| 1 | 0 | 0 | - |1422k| 0 | - | 12 | 20 | 0 | 0 | 0 | 0 | 0 | -- | 9.400000e+01 | Inf
0.00/0.03 o 93
0.00/0.03 c b 0.0s| 1 | 0 | 0 | - |1435k| 0 | - | 12 | 20 | 12 | 20 | 0 | 0 | 0 | -- | 9.300000e+01 | Inf
0.00/0.03 c 0.0s| 1 | 0 | 7 | - |1432k| 0 | 5 | 12 | 20 | 12 | 20 | 0 | 0 | 0 | 8.950000e+01 | 9.300000e+01 | 3.91%
0.00/0.03 o 90
0.00/0.03 c R 0.0s| 1 | 0 | 7 | - |1432k| 0 | - | 12 | 20 | 12 | 20 | 0 | 0 | 0 | 8.950000e+01 | 9.000000e+01 | 0.56%
0.00/0.03 c 0.0s| 1 | 0 | 7 | - |1432k| 0 | - | 12 | 20 | 12 | 20 | 0 | 0 | 0 | 9.000000e+01 | 9.000000e+01 | 0.00%
0.00/0.03 c
0.00/0.03 c SCIP Status : problem is solved [optimal solution found]
0.00/0.03 c Solving Time (sec) : 0.03
0.00/0.03 c Solving Nodes : 1
0.00/0.03 c Primal Bound : +9.00000000000000e+01 (3 solutions)
0.00/0.03 c Dual Bound : +9.00000000000000e+01
0.00/0.03 c Gap : 0.00 %
0.00/0.03 s OPTIMUM FOUND
0.00/0.03 v x151 x150 x149 x148 x147 -x135 -x146 -x133 -x132 -x128 -x145 -x123 -x144 -x122 -x134 -x143 -x142 -x141 -x129 -x126 -x140 -x139
0.00/0.03 v -x138 -x121 -x137 -x127 -x120 -x131 -x130 -x125 -x124 -x136 -x119 x118 x117 x116 x115 x114 x113 x112 x111 x110 x109 -x108 x107
0.00/0.03 v x106 x105 x104 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 x78
0.00/0.03 v 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 x52 x51 -x50 -x49 x48
0.00/0.03 v 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
0.00/0.03 v x17 x16 x15 x14 -x13 x12 x11 x10 x9 x8 -x7 x6 -x5 -x4 -x3 x2 x1 x280 x279 x278 x277 x276 x275 x274 x273 x272 x271 x270 x269
0.00/0.03 v x268 x267 x266 x265 x264 x263 x262 x261 x260 x259 x258 x257 x256 x255 -x254 x253 x252 x251 x250 -x249 x248 -x247 -x246 -x245
0.00/0.03 v -x244 -x243 -x242 -x241 -x240 -x239 -x238 -x237 -x236 -x235 -x234 -x233 -x232 -x231 -x230 -x229 -x228 -x227 -x226 -x225 -x224
0.00/0.03 v -x223 -x222 -x221 -x220 -x219 x218 x217 x216 x215 x214 x213 x212 x211 x210 x209 x208 x207 x206 x205 x204 x203 x202 x201 x200
0.00/0.03 v x199 x198 x197 x196 x195 x194 x193 x192 x191 x190 x189 -x188 x187 -x186 x185 x184 x183 x182 x181 -x180 x179 x178 x177 x176
0.00/0.03 v x175 x174 x173 x172 x171 x170 -x169 x168 x167 x166 x165 x164 x163 x162 x161 -x160 x159 -x158 -x157 -x156 x155 x154 x153 x152
0.00/0.03 c SCIP Status : problem is solved [optimal solution found]
0.00/0.03 c Total Time : 0.03
0.00/0.03 c solving : 0.03
0.00/0.03 c presolving : 0.01 (included in solving)
0.00/0.03 c reading : 0.01 (included in solving)
0.00/0.03 c Original Problem :
0.00/0.03 c Problem name : HOME/instance-3451743-1307115621.opb
0.00/0.03 c Variables : 280 (280 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.03 c Constraints : 1934 initial, 1934 maximal
0.00/0.03 c Presolved Problem :
0.00/0.03 c Problem name : t_HOME/instance-3451743-1307115621.opb
0.00/0.03 c Variables : 12 (12 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.03 c Constraints : 20 initial, 20 maximal
0.00/0.03 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.03 c trivial : 0.00 48 0 0 0 0 0 0 0 0
0.00/0.03 c dualfix : 0.00 57 0 0 0 0 0 0 0 0
0.00/0.03 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.03 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.03 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.03 c implics : 0.00 0 16 0 0 0 0 0 0 0
0.00/0.03 c probing : 0.00 13 0 0 1 0 0 0 0 0
0.00/0.03 c setppc : 0.00 0 0 0 0 0 41 0 0 0
0.00/0.03 c linear : 0.01 17 117 0 65 0 1845 0 1 0
0.00/0.03 c logicor : 0.00 0 0 0 0 0 28 0 0 0
0.00/0.03 c root node : - 0 - - 0 - - - - -
0.00/0.03 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.00/0.03 c integral : 0 0 0 0 0 8 0 0 0 0 0 0
0.00/0.03 c setppc : 12 0 85 0 0 5 0 7 0 0 0 0
0.00/0.03 c logicor : 8 0 70 0 0 3 0 5 0 0 0 0
0.00/0.03 c countsols : 0 0 0 0 0 5 0 0 0 0 0 0
0.00/0.03 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.00/0.03 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.03 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.00/0.03 c vbounds : 0 0 0 0
0.00/0.03 c rootredcost : 0 0 0 0
0.00/0.03 c pseudoobj : 2 0 0 0
0.00/0.03 c Propagator Timings : TotalTime Propagate Resprop
0.00/0.03 c vbounds : 0.00 0.00 0.00
0.00/0.03 c rootredcost : 0.00 0.00 0.00
0.00/0.03 c pseudoobj : 0.00 0.00 0.00
0.00/0.03 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.03 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.03 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.03 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.03 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.03 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.03 c applied globally : - - - 0 0.0 - - -
0.00/0.03 c applied locally : - - - 0 0.0 - - -
0.00/0.03 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.03 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.00/0.03 c redcost : 0.00 0 0 0 0 0
0.00/0.03 c impliedbounds : 0.00 0 0 0 0 0
0.00/0.03 c intobj : 0.00 0 0 0 0 0
0.00/0.03 c gomory : 0.00 0 0 0 0 0
0.00/0.03 c cgmip : 0.00 0 0 0 0 0
0.00/0.03 c closecuts : 0.00 0 0 0 0 0
0.00/0.03 c strongcg : 0.00 0 0 0 0 0
0.00/0.03 c cmir : 0.00 0 0 0 0 0
0.00/0.03 c flowcover : 0.00 0 0 0 0 0
0.00/0.03 c clique : 0.00 0 0 0 0 0
0.00/0.03 c zerohalf : 0.00 0 0 0 0 0
0.00/0.03 c mcf : 0.00 0 0 0 0 0
0.00/0.03 c oddcycle : 0.00 0 0 0 0 0
0.00/0.03 c rapidlearning : 0.00 0 0 0 0 0
0.00/0.03 c Pricers : Time Calls Vars
0.00/0.03 c problem variables: 0.00 0 0
0.00/0.03 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.03 c pscost : 0.00 0 0 0 0 0 0
0.00/0.03 c inference : 0.00 0 0 0 0 0 0
0.00/0.03 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.03 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.03 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.03 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.03 c random : 0.00 0 0 0 0 0 0
0.00/0.03 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.03 c Primal Heuristics : Time Calls Found
0.00/0.03 c LP solutions : 0.00 - 0
0.00/0.03 c pseudo solutions : 0.00 - 0
0.00/0.03 c feaspump : 0.00 0 0
0.00/0.03 c trivial : 0.00 2 1
0.00/0.03 c shiftandpropagate: 0.00 0 0
0.00/0.03 c simplerounding : 0.00 0 0
0.00/0.03 c zirounding : 0.00 0 0
0.00/0.03 c rounding : 0.00 1 1
0.00/0.03 c shifting : 0.00 0 0
0.00/0.03 c intshifting : 0.00 0 0
0.00/0.03 c oneopt : 0.00 2 1
0.00/0.03 c twoopt : 0.00 0 0
0.00/0.03 c fixandinfer : 0.00 0 0
0.00/0.03 c clique : 0.00 0 0
0.00/0.03 c coefdiving : 0.00 0 0
0.00/0.03 c pscostdiving : 0.00 0 0
0.00/0.03 c fracdiving : 0.00 0 0
0.00/0.03 c veclendiving : 0.00 0 0
0.00/0.03 c intdiving : 0.00 0 0
0.00/0.03 c actconsdiving : 0.00 0 0
0.00/0.03 c objpscostdiving : 0.00 0 0
0.00/0.03 c rootsoldiving : 0.00 0 0
0.00/0.03 c linesearchdiving : 0.00 0 0
0.00/0.03 c guideddiving : 0.00 0 0
0.00/0.03 c octane : 0.00 0 0
0.00/0.03 c rens : 0.00 0 0
0.00/0.03 c rins : 0.00 0 0
0.00/0.03 c localbranching : 0.00 0 0
0.00/0.03 c mutation : 0.00 0 0
0.00/0.03 c crossover : 0.00 0 0
0.00/0.03 c dins : 0.00 0 0
0.00/0.03 c vbounds : 0.00 0 0
0.00/0.03 c undercover : 0.00 0 0
0.00/0.03 c subnlp : 0.00 0 0
0.00/0.03 c trysol : 0.00 0 0
0.00/0.03 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.03 c primal LP : 0.00 0 0 0.00 -
0.00/0.03 c dual LP : 0.00 1 7 7.00 -
0.00/0.03 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.03 c barrier LP : 0.00 0 0 0.00 -
0.00/0.03 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.03 c strong branching : 0.00 0 0 0.00 -
0.00/0.03 c (at root node) : - 0 0 0.00 -
0.00/0.03 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.03 c B&B Tree :
0.00/0.03 c number of runs : 1
0.00/0.03 c nodes : 1
0.00/0.03 c nodes (total) : 1
0.00/0.03 c nodes left : 0
0.00/0.03 c max depth : 0
0.00/0.03 c max depth (total): 0
0.00/0.03 c backtracks : 0 (0.0%)
0.00/0.03 c delayed cutoffs : 0
0.00/0.03 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.03 c avg switch length: 2.00
0.00/0.03 c switching time : 0.00
0.00/0.03 c Solution :
0.00/0.03 c Solutions found : 3 (3 improvements)
0.00/0.03 c First Solution : +9.40000000000000e+01 (in run 1, after 1 nodes, 0.03 seconds, depth 0, found by <trivial>)
0.00/0.03 c Primal Bound : +9.00000000000000e+01 (in run 1, after 1 nodes, 0.03 seconds, depth 0, found by <rounding>)
0.00/0.03 c Dual Bound : +9.00000000000000e+01
0.00/0.03 c Gap : 0.00 %
0.00/0.03 c Root Dual Bound : +9.00000000000000e+01
0.00/0.03 c Root Iterations : 7
0.00/0.04 c Time complete: 0.03.