0.00/0.00 c SCIP version 2.0.1.4 [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-3486030-1307764005.opb>
0.00/0.01 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 950 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 0 del vars, 0 del conss, 0 add conss, 4 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 748 impls, 0 clqs
0.00/0.01 c (round 2) 6 del vars, 56 del conss, 0 add conss, 6 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 772 impls, 0 clqs
0.00/0.01 c (round 3) 10 del vars, 69 del conss, 0 add conss, 7 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 792 impls, 0 clqs
0.00/0.01 c (round 4) 15 del vars, 113 del conss, 0 add conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 792 impls, 0 clqs
0.00/0.01 c (round 5) 20 del vars, 164 del conss, 0 add conss, 17 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 846 impls, 0 clqs
0.01/0.01 c (round 6) 22 del vars, 201 del conss, 0 add conss, 19 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 872 impls, 0 clqs
0.01/0.02 c (round 7) 26 del vars, 218 del conss, 0 add conss, 23 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 878 impls, 0 clqs
0.01/0.02 c (round 8) 27 del vars, 227 del conss, 0 add conss, 24 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 908 impls, 0 clqs
0.01/0.02 c (round 9) 27 del vars, 245 del conss, 0 add conss, 24 chg bounds, 18 chg sides, 0 chg coeffs, 0 upgd conss, 908 impls, 0 clqs
0.01/0.03 c (round 10) 27 del vars, 245 del conss, 0 add conss, 24 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 908 impls, 0 clqs
0.01/0.04 c (round 11) 102 del vars, 245 del conss, 0 add conss, 27 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 3929 impls, 0 clqs
0.01/0.04 c (round 12) 105 del vars, 730 del conss, 0 add conss, 29 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 4299 impls, 0 clqs
0.01/0.04 c (round 13) 111 del vars, 752 del conss, 0 add conss, 29 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 4319 impls, 0 clqs
0.01/0.04 c (round 14) 113 del vars, 759 del conss, 0 add conss, 29 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 4347 impls, 0 clqs
0.01/0.04 c (round 15) 116 del vars, 767 del conss, 0 add conss, 29 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 4369 impls, 0 clqs
0.01/0.04 c (round 16) 117 del vars, 773 del conss, 0 add conss, 30 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 4456 impls, 0 clqs
0.01/0.04 c (round 17) 120 del vars, 785 del conss, 0 add conss, 30 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 4506 impls, 0 clqs
0.01/0.04 c (round 18) 122 del vars, 793 del conss, 0 add conss, 32 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 4539 impls, 0 clqs
0.01/0.04 c (round 19) 126 del vars, 807 del conss, 0 add conss, 32 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 4601 impls, 0 clqs
0.01/0.04 c (round 20) 126 del vars, 815 del conss, 0 add conss, 32 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 4601 impls, 0 clqs
0.01/0.04 c (round 21) 127 del vars, 816 del conss, 0 add conss, 32 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 4601 impls, 0 clqs
0.01/0.04 c (round 22) 132 del vars, 816 del conss, 0 add conss, 32 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 5581 impls, 0 clqs
0.01/0.04 c (round 23) 132 del vars, 819 del conss, 0 add conss, 32 chg bounds, 18 chg sides, 0 chg coeffs, 705 upgd conss, 5581 impls, 0 clqs
0.01/0.04 c presolving (24 rounds):
0.01/0.04 c 132 deleted vars, 819 deleted constraints, 0 added constraints, 32 tightened bounds, 0 added holes, 18 changed sides, 0 changed coefficients
0.01/0.04 c 5581 implications, 0 cliques
0.01/0.04 c presolved problem has 68 variables (68 bin, 0 int, 0 impl, 0 cont) and 131 constraints
0.01/0.04 c 45 constraints of type <setppc>
0.01/0.04 c 86 constraints of type <logicor>
0.01/0.04 c transformed objective value is always integral (scale: 1)
0.01/0.04 c Presolving Time: 0.04
0.01/0.04 c - non default parameters ----------------------------------------------------------------------
0.01/0.04 c # SCIP version 2.0.1.4
0.01/0.04 c
0.01/0.04 c # frequency for displaying node information lines
0.01/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.04 c display/freq = 10000
0.01/0.04 c
0.01/0.04 c # maximal time in seconds to run
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/time = 1797
0.01/0.04 c
0.01/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.04 c limits/memory = 13950
0.01/0.04 c
0.01/0.04 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.01/0.04 c # [type: int, range: [1,2], default: 1]
0.01/0.04 c timing/clocktype = 2
0.01/0.04 c
0.01/0.04 c # belongs reading time to solving time?
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c timing/reading = TRUE
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify inequalities
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/linear/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/indicator/addCouplingCons = TRUE
0.01/0.04 c
0.01/0.04 c # should presolving try to simplify knapsacks
0.01/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.04 c
0.01/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.04 c separating/rapidlearning/freq = 0
0.01/0.04 c
0.01/0.04 c -----------------------------------------------------------------------------------------------
0.01/0.04 c start solving
0.01/0.04 c
0.01/0.04 o 99
0.01/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.01/0.04 c T 0.0s| 1 | 0 | 0 | - |1170k| 0 | - | 68 | 131 | 68 | 126 | 0 | 0 | 0 | -- | 9.900000e+01 | Inf
0.01/0.05 o 89
0.01/0.05 c b 0.0s| 1 | 0 | 0 | - |1164k| 0 | - | 68 | 131 | 68 | 126 | 0 | 0 | 0 | -- | 8.900000e+01 | Inf
0.01/0.05 c 0.0s| 1 | 0 | 66 | - |1162k| 0 | 45 | 68 | 131 | 68 | 126 | 0 | 0 | 0 | 8.778571e+01 | 8.900000e+01 | 1.38%
0.01/0.06 c 0.1s| 1 | 0 | 72 | - |1214k| 0 | - | 68 | 182 | 68 | 126 | 0 | 0 | 0 | 8.900000e+01 | 8.900000e+01 | 0.00%
0.01/0.06 c 0.1s| 1 | 0 | 72 | - |1214k| 0 | - | 68 | 182 | 68 | 126 | 0 | 0 | 0 | 8.900000e+01 | 8.900000e+01 | 0.00%
0.01/0.06 c
0.01/0.06 c SCIP Status : problem is solved [optimal solution found]
0.01/0.06 c Solving Time (sec) : 0.07
0.01/0.06 c Solving Nodes : 1
0.01/0.06 c Primal Bound : +8.90000000000000e+01 (2 solutions)
0.01/0.06 c Dual Bound : +8.90000000000000e+01
0.01/0.06 c Gap : 0.00 %
0.01/0.07 s OPTIMUM FOUND
0.01/0.07 v -x200 x199 -x198 -x197 -x196 x195 x194 -x193 -x192 x191 -x190 x189 -x188 x187 -x186 -x185 -x184 x183 -x182 -x181 -x180 x179 x178
0.01/0.07 v -x177 -x176 x175 -x174 x173 x172 -x171 -x170 x169 x168 -x167 -x166 x165 -x164 x163 x162 -x161 -x160 x159 -x158 x157 -x156 -x155
0.01/0.07 v -x154 x153 -x152 x151 -x150 x149 -x148 x147 -x146 x145 x144 -x143 -x142 x141 -x140 x139 x138 -x137 x136 -x135 x134 -x133
0.01/0.07 v -x132 x131 -x130 x129 x128 -x127 -x126 x125 -x124 x123 x122 -x121 -x120 x119 -x118 -x117 x116 -x115 -x114 x113 -x112 x111 -x110
0.01/0.07 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 -x85
0.01/0.07 v -x84 x83 -x82 x81 -x80 x79 x78 -x77 -x76 x75 x74 -x73 -x72 x71 -x70 x69 -x68 x67 x66 -x65 -x64 x63 -x62 x61 x60 -x59 -x58 x57
0.01/0.07 v 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
0.01/0.07 v -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
0.01/0.07 c SCIP Status : problem is solved [optimal solution found]
0.01/0.07 c Total Time : 0.07
0.01/0.07 c solving : 0.07
0.01/0.07 c presolving : 0.04 (included in solving)
0.01/0.07 c reading : 0.01 (included in solving)
0.01/0.07 c Original Problem :
0.01/0.07 c Problem name : HOME/instance-3486030-1307764005.opb
0.01/0.07 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
0.01/0.07 c Constraints : 950 initial, 950 maximal
0.01/0.07 c Presolved Problem :
0.01/0.07 c Problem name : t_HOME/instance-3486030-1307764005.opb
0.01/0.07 c Variables : 68 (68 binary, 0 integer, 0 implicit integer, 0 continuous)
0.01/0.07 c Constraints : 131 initial, 182 maximal
0.01/0.07 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.01/0.07 c trivial : 0.00 9 0 0 0 0 0 0 0 0
0.01/0.07 c dualfix : 0.00 4 0 0 0 0 0 0 0 0
0.01/0.07 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.01/0.07 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.01/0.07 c implics : 0.00 0 6 0 0 0 0 0 0 0
0.01/0.07 c probing : 0.01 75 5 0 3 0 0 0 0 0
0.01/0.07 c setppc : 0.00 10 0 0 0 0 102 0 0 0
0.01/0.07 c linear : 0.01 20 0 0 24 0 245 0 18 0
0.01/0.07 c logicor : 0.01 3 0 0 5 0 472 0 0 0
0.01/0.07 c root node : - 29 - - 29 - - - - -
0.01/0.07 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.01/0.07 c integral : 0 0 0 0 0 8 0 0 0 0 0 0
0.01/0.07 c setppc : 45 1 541 0 0 5 0 5 0 0 0 0
0.01/0.07 c linear : 0+ 0 0 0 0 0 0 0 0 0 0 0
0.01/0.07 c logicor : 86 1 396 0 0 2 0 5 1 0 0 0
0.01/0.07 c countsols : 0 0 0 0 0 4 0 0 0 0 0 0
0.01/0.07 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.01/0.07 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.01/0.07 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.01/0.07 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.01/0.07 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.01/0.07 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.01/0.07 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.01/0.07 c vbounds : 0 0 0 0
0.01/0.07 c rootredcost : 0 0 0 0
0.01/0.07 c pseudoobj : 51 0 0 0
0.01/0.07 c Propagator Timings : TotalTime Propagate Resprop
0.01/0.07 c vbounds : 0.00 0.00 0.00
0.01/0.07 c rootredcost : 0.00 0.00 0.00
0.01/0.07 c pseudoobj : 0.00 0.00 0.00
0.01/0.07 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.01/0.07 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.01/0.07 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.01/0.07 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.01/0.07 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.01/0.07 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.01/0.07 c applied globally : - - - 0 0.0 - - -
0.01/0.07 c applied locally : - - - 0 0.0 - - -
0.01/0.07 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.01/0.07 c cut pool : 0.00 0 - - 0 - (maximal pool size: 31)
0.01/0.07 c redcost : 0.00 1 0 15 0 0
0.01/0.07 c impliedbounds : 0.00 1 0 0 21 0
0.01/0.07 c intobj : 0.00 0 0 0 0 0
0.01/0.07 c gomory : 0.00 1 0 0 116 0
0.01/0.07 c cgmip : 0.00 0 0 0 0 0
0.01/0.07 c closecuts : 0.00 0 0 0 0 0
0.01/0.07 c strongcg : 0.00 1 0 0 116 0
0.01/0.07 c cmir : 0.00 1 0 0 0 0
0.01/0.07 c flowcover : 0.00 1 0 0 0 0
0.01/0.07 c clique : 0.00 1 0 0 7 0
0.01/0.07 c zerohalf : 0.00 0 0 0 0 0
0.01/0.07 c mcf : 0.00 1 0 0 0 0
0.01/0.07 c oddcycle : 0.00 0 0 0 0 0
0.01/0.07 c rapidlearning : 0.01 1 0 13 0 52
0.01/0.07 c Pricers : Time Calls Vars
0.01/0.07 c problem variables: 0.00 0 0
0.01/0.07 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.01/0.07 c pscost : 0.00 0 0 0 0 0 0
0.01/0.07 c inference : 0.00 0 0 0 0 0 0
0.01/0.07 c mostinf : 0.00 0 0 0 0 0 0
0.01/0.07 c leastinf : 0.00 0 0 0 0 0 0
0.01/0.07 c fullstrong : 0.00 0 0 0 0 0 0
0.01/0.07 c allfullstrong : 0.00 0 0 0 0 0 0
0.01/0.07 c random : 0.00 0 0 0 0 0 0
0.01/0.07 c relpscost : 0.00 0 0 0 0 0 0
0.01/0.07 c Primal Heuristics : Time Calls Found
0.01/0.07 c LP solutions : 0.00 - 0
0.01/0.07 c pseudo solutions : 0.00 - 0
0.01/0.07 c trivial : 0.00 2 0
0.01/0.07 c shiftandpropagate: 0.00 1 1
0.01/0.07 c simplerounding : 0.00 0 0
0.01/0.07 c zirounding : 0.00 0 0
0.01/0.07 c rounding : 0.00 1 0
0.01/0.07 c shifting : 0.00 1 0
0.01/0.07 c intshifting : 0.00 0 0
0.01/0.07 c oneopt : 0.00 2 1
0.01/0.07 c twoopt : 0.00 0 0
0.01/0.07 c fixandinfer : 0.00 0 0
0.01/0.07 c feaspump : 0.00 0 0
0.01/0.07 c clique : 0.00 0 0
0.01/0.07 c coefdiving : 0.00 0 0
0.01/0.07 c pscostdiving : 0.00 0 0
0.01/0.07 c fracdiving : 0.00 0 0
0.01/0.07 c veclendiving : 0.00 0 0
0.01/0.07 c intdiving : 0.00 0 0
0.01/0.07 c actconsdiving : 0.00 0 0
0.01/0.07 c objpscostdiving : 0.00 0 0
0.01/0.07 c rootsoldiving : 0.00 0 0
0.01/0.07 c linesearchdiving : 0.00 0 0
0.01/0.07 c guideddiving : 0.00 0 0
0.01/0.07 c octane : 0.00 0 0
0.01/0.07 c rens : 0.00 0 0
0.01/0.07 c rins : 0.00 0 0
0.01/0.07 c localbranching : 0.00 0 0
0.01/0.07 c mutation : 0.00 0 0
0.01/0.07 c crossover : 0.00 0 0
0.01/0.07 c dins : 0.00 0 0
0.01/0.07 c vbounds : 0.00 0 0
0.01/0.07 c undercover : 0.00 0 0
0.01/0.07 c subnlp : 0.00 0 0
0.01/0.07 c trysol : 0.00 0 0
0.01/0.07 c LP : Time Calls Iterations Iter/call Iter/sec
0.01/0.07 c primal LP : 0.00 0 0 0.00 -
0.01/0.07 c dual LP : 0.00 2 72 36.00 -
0.01/0.07 c lex dual LP : 0.00 0 0 0.00 -
0.01/0.07 c barrier LP : 0.00 0 0 0.00 -
0.01/0.07 c diving/probing LP: 0.00 0 0 0.00 -
0.01/0.07 c strong branching : 0.00 0 0 0.00 -
0.01/0.07 c (at root node) : - 0 0 0.00 -
0.01/0.07 c conflict analysis: 0.00 0 0 0.00 -
0.01/0.07 c B&B Tree :
0.01/0.07 c number of runs : 1
0.01/0.07 c nodes : 1
0.01/0.07 c nodes (total) : 1
0.01/0.07 c nodes left : 0
0.01/0.07 c max depth : 0
0.01/0.07 c max depth (total): 0
0.01/0.07 c backtracks : 0 (0.0%)
0.01/0.07 c delayed cutoffs : 0
0.01/0.07 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.01/0.07 c avg switch length: 2.00
0.01/0.07 c switching time : 0.00
0.01/0.07 c Solution :
0.01/0.07 c Solutions found : 2 (2 improvements)
0.01/0.07 c First Solution : +9.90000000000000e+01 (in run 1, after 1 nodes, 0.05 seconds, depth 19, found by <shiftandpropagate>)
0.01/0.07 c Primal Bound : +8.90000000000000e+01 (in run 1, after 1 nodes, 0.05 seconds, depth 0, found by <oneopt>)
0.01/0.07 c Dual Bound : +8.90000000000000e+01
0.01/0.07 c Gap : 0.00 %
0.01/0.07 c Root Dual Bound : +8.90000000000000e+01
0.01/0.07 c Root Iterations : 72
0.01/0.07 c Time complete: 0.06.