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-3486025-1307763741.opb>
0.00/0.00 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 900 constraints
0.00/0.00 c problem read
0.00/0.00 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, 6 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 786 impls, 0 clqs
0.00/0.01 c (round 2) 12 del vars, 79 del conss, 0 add conss, 12 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 796 impls, 0 clqs
0.00/0.01 c (round 3) 19 del vars, 142 del conss, 0 add conss, 16 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 884 impls, 0 clqs
0.00/0.01 c (round 4) 23 del vars, 184 del conss, 0 add conss, 20 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 946 impls, 0 clqs
0.00/0.01 c (round 5) 26 del vars, 225 del conss, 0 add conss, 23 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 956 impls, 0 clqs
0.00/0.01 c (round 6) 30 del vars, 253 del conss, 0 add conss, 27 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1014 impls, 0 clqs
0.00/0.01 c (round 7) 31 del vars, 263 del conss, 0 add conss, 28 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1080 impls, 0 clqs
0.00/0.03 c (round 8) 31 del vars, 281 del conss, 0 add conss, 28 chg bounds, 18 chg sides, 0 chg coeffs, 619 upgd conss, 1096 impls, 0 clqs
0.00/0.04 c (round 9) 82 del vars, 281 del conss, 0 add conss, 28 chg bounds, 18 chg sides, 0 chg coeffs, 619 upgd conss, 6302 impls, 0 clqs
0.00/0.04 c (round 10) 85 del vars, 607 del conss, 0 add conss, 28 chg bounds, 18 chg sides, 0 chg coeffs, 619 upgd conss, 6492 impls, 0 clqs
0.00/0.04 c (round 11) 85 del vars, 617 del conss, 0 add conss, 28 chg bounds, 18 chg sides, 0 chg coeffs, 619 upgd conss, 6492 impls, 0 clqs
0.00/0.04 c (round 12) 86 del vars, 617 del conss, 0 add conss, 28 chg bounds, 18 chg sides, 0 chg coeffs, 619 upgd conss, 6740 impls, 0 clqs
0.00/0.04 c (round 13) 86 del vars, 618 del conss, 0 add conss, 28 chg bounds, 18 chg sides, 0 chg coeffs, 619 upgd conss, 6740 impls, 0 clqs
0.00/0.04 c presolving (14 rounds):
0.00/0.04 c 86 deleted vars, 618 deleted constraints, 0 added constraints, 28 tightened bounds, 0 added holes, 18 changed sides, 0 changed coefficients
0.00/0.04 c 6740 implications, 0 cliques
0.00/0.04 c presolved problem has 114 variables (114 bin, 0 int, 0 impl, 0 cont) and 282 constraints
0.00/0.04 c 87 constraints of type <setppc>
0.00/0.04 c 195 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 1)
0.00/0.04 c Presolving Time: 0.04
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 2.0.1.4
0.00/0.04 c
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = 10000
0.00/0.04 c
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = 1797
0.00/0.04 c
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = 13950
0.00/0.04 c
0.00/0.04 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.04 c # [type: int, range: [1,2], default: 1]
0.00/0.04 c timing/clocktype = 2
0.00/0.04 c
0.00/0.04 c # belongs reading time to solving time?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c timing/reading = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/indicator/addCouplingCons = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/rapidlearning/freq = 0
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.00/0.05 o 100
0.00/0.05 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.05 c T 0.0s| 1 | 0 | 0 | - |1317k| 0 | - | 114 | 285 | 114 | 280 | 0 | 3 | 0 | -- | 1.000000e+02 | Inf
0.00/0.05 o 98
0.00/0.05 c b 0.0s| 1 | 0 | 0 | - |1311k| 0 | - | 114 | 285 | 114 | 280 | 0 | 3 | 0 | -- | 9.800000e+01 | Inf
0.00/0.05 c 0.1s| 1 | 0 | 241 | - |1308k| 0 | 92 | 114 | 285 | 114 | 280 | 0 | 3 | 0 | 8.420000e+01 | 9.800000e+01 | 16.39%
0.07/0.08 o 93
0.07/0.08 c y 0.1s| 1 | 0 | 241 | - |1959k| 0 | 92 | 114 | 285 | 114 | 280 | 0 | 3 | 0 | 8.420000e+01 | 9.300000e+01 | 10.45%
0.07/0.08 c 0.1s| 1 | 0 | 299 | - |1246k| 0 | 31 | 114 | 168 | 114 | 111 | 0 | 3 | 0 | 9.150000e+01 | 9.300000e+01 | 1.64%
0.07/0.09 c 0.1s| 1 | 0 | 302 | - |1239k| 0 | 32 | 114 | 157 | 114 | 108 | 1 | 3 | 0 | 9.200000e+01 | 9.300000e+01 | 1.09%
0.07/0.09 o 93
0.07/0.09 c s 0.1s| 1 | 0 | 302 | - |1241k| 0 | 32 | 114 | 157 | 114 | 108 | 1 | 3 | 0 | 9.200000e+01 | 9.300000e+01 | 1.09%
0.07/0.09 c 0.1s| 1 | 0 | 308 | - |1253k| 0 | 30 | 114 | 157 | 114 | 109 | 2 | 3 | 0 | 9.200000e+01 | 9.300000e+01 | 1.09%
0.07/0.09 c 0.1s| 1 | 0 | 314 | - |1271k| 0 | 0 | 114 | 157 | 114 | 111 | 4 | 3 | 0 | 9.200000e+01 | 9.300000e+01 | 1.09%
0.07/0.09 o 92
0.07/0.09 c * 0.1s| 1 | 0 | 314 | - |1273k| 0 | - | 114 | 157 | 114 | 111 | 4 | 3 | 0 | 9.200000e+01 | 9.200000e+01 | 0.00%
0.07/0.09 c
0.07/0.09 c SCIP Status : problem is solved [optimal solution found]
0.07/0.09 c Solving Time (sec) : 0.09
0.07/0.09 c Solving Nodes : 1
0.07/0.09 c Primal Bound : +9.20000000000000e+01 (6 solutions)
0.07/0.09 c Dual Bound : +9.20000000000000e+01
0.07/0.09 c Gap : 0.00 %
0.07/0.09 s OPTIMUM FOUND
0.07/0.09 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.07/0.09 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.07/0.09 v -x154 x153 x152 -x151 -x150 x149 x148 -x147 -x146 x145 -x144 x143 x142 -x141 -x140 x139 -x138 x137 -x136 x135 -x134 -x133 -x132
0.07/0.09 v x131 -x130 x129 -x128 x127 -x126 x125 -x124 x123 x122 -x121 -x120 x119 -x118 x117 -x116 x115 -x114 x113 -x112 x111 -x110
0.07/0.09 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 -x84
0.07/0.09 v -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
0.07/0.09 v x57 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.07/0.09 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.07/0.09 c SCIP Status : problem is solved [optimal solution found]
0.07/0.09 c Total Time : 0.09
0.07/0.09 c solving : 0.09
0.07/0.09 c presolving : 0.04 (included in solving)
0.07/0.09 c reading : 0.01 (included in solving)
0.07/0.09 c Original Problem :
0.07/0.09 c Problem name : HOME/instance-3486025-1307763741.opb
0.07/0.09 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
0.07/0.09 c Constraints : 900 initial, 900 maximal
0.07/0.09 c Presolved Problem :
0.07/0.09 c Problem name : t_HOME/instance-3486025-1307763741.opb
0.07/0.09 c Variables : 114 (114 binary, 0 integer, 0 implicit integer, 0 continuous)
0.07/0.09 c Constraints : 282 initial, 285 maximal
0.07/0.09 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.07/0.09 c trivial : 0.00 6 0 0 0 0 0 0 0 0
0.07/0.09 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.07/0.09 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.07/0.09 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.07/0.09 c implics : 0.00 0 6 0 0 0 0 0 0 0
0.07/0.09 c probing : 0.01 41 11 0 0 0 0 0 0 0
0.07/0.09 c setppc : 0.00 0 0 0 0 0 72 0 0 0
0.07/0.09 c linear : 0.01 22 0 0 28 0 281 0 18 0
0.07/0.09 c logicor : 0.01 0 0 0 0 0 265 0 0 0
0.07/0.09 c root node : - 65 - - 65 - - - - -
0.07/0.09 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.07/0.09 c integral : 0 0 0 1 0 12 0 0 0 0 0 0
0.07/0.09 c setppc : 87 5 681 1 0 9 49 12 0 0 0 0
0.07/0.09 c logicor : 195+ 5 509 1 0 6 26 8 0 1 0 0
0.07/0.09 c countsols : 0 0 0 1 0 8 0 0 0 0 0 0
0.07/0.09 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.07/0.09 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.07/0.09 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.07/0.09 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.07/0.09 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.07/0.09 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.07/0.09 c vbounds : 0 0 0 0
0.07/0.09 c rootredcost : 0 0 0 0
0.07/0.09 c pseudoobj : 55 0 0 0
0.07/0.09 c Propagator Timings : TotalTime Propagate Resprop
0.07/0.09 c vbounds : 0.00 0.00 0.00
0.07/0.09 c rootredcost : 0.00 0.00 0.00
0.07/0.09 c pseudoobj : 0.00 0.00 0.00
0.07/0.09 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.07/0.09 c propagation : 0.00 2 2 4 3.2 0 0.0 -
0.07/0.09 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.07/0.09 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.07/0.09 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.07/0.09 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.07/0.09 c applied globally : - - - 3 3.0 - - -
0.07/0.09 c applied locally : - - - 0 0.0 - - -
0.07/0.09 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.07/0.09 c cut pool : 0.00 4 - - 3 - (maximal pool size: 81)
0.07/0.09 c redcost : 0.00 5 0 5 0 0
0.07/0.09 c impliedbounds : 0.00 4 0 0 59 0
0.07/0.09 c intobj : 0.00 0 0 0 0 0
0.07/0.09 c gomory : 0.01 4 0 0 398 0
0.07/0.09 c cgmip : 0.00 0 0 0 0 0
0.07/0.09 c closecuts : 0.00 0 0 0 0 0
0.07/0.09 c strongcg : 0.01 4 0 0 398 0
0.07/0.09 c cmir : 0.00 4 0 0 0 0
0.07/0.09 c flowcover : 0.00 4 0 0 0 0
0.07/0.09 c clique : 0.00 4 0 0 8 0
0.07/0.09 c zerohalf : 0.00 0 0 0 0 0
0.07/0.09 c mcf : 0.00 1 0 0 0 0
0.07/0.09 c oddcycle : 0.00 0 0 0 0 0
0.07/0.09 c rapidlearning : 0.02 1 0 60 0 0
0.07/0.09 c Pricers : Time Calls Vars
0.07/0.09 c problem variables: 0.00 0 0
0.07/0.09 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.07/0.09 c pscost : 0.00 0 0 0 0 0 0
0.07/0.09 c inference : 0.00 0 0 0 0 0 0
0.07/0.09 c mostinf : 0.00 0 0 0 0 0 0
0.07/0.09 c leastinf : 0.00 0 0 0 0 0 0
0.07/0.09 c fullstrong : 0.00 0 0 0 0 0 0
0.07/0.09 c allfullstrong : 0.00 0 0 0 0 0 0
0.07/0.09 c random : 0.00 0 0 0 0 0 0
0.07/0.09 c relpscost : 0.00 0 0 0 0 0 0
0.07/0.09 c Primal Heuristics : Time Calls Found
0.07/0.09 c LP solutions : 0.00 - 0
0.07/0.09 c pseudo solutions : 0.00 - 0
0.07/0.09 c crossover : 0.00 0 0
0.07/0.09 c oneopt : 0.00 4 1
0.07/0.09 c trivial : 0.00 2 0
0.07/0.09 c shiftandpropagate: 0.00 1 1
0.07/0.09 c simplerounding : 0.00 0 0
0.07/0.09 c zirounding : 0.00 0 0
0.07/0.09 c rounding : 0.00 4 0
0.07/0.09 c shifting : 0.00 4 2
0.07/0.09 c intshifting : 0.00 0 0
0.07/0.09 c twoopt : 0.00 0 0
0.07/0.09 c fixandinfer : 0.00 0 0
0.07/0.09 c feaspump : 0.00 0 0
0.07/0.09 c clique : 0.00 0 0
0.07/0.09 c coefdiving : 0.00 0 0
0.07/0.09 c pscostdiving : 0.00 0 0
0.07/0.09 c fracdiving : 0.00 0 0
0.07/0.09 c veclendiving : 0.00 0 0
0.07/0.09 c intdiving : 0.00 0 0
0.07/0.09 c actconsdiving : 0.00 0 0
0.07/0.09 c objpscostdiving : 0.00 0 0
0.07/0.09 c rootsoldiving : 0.00 0 0
0.07/0.09 c linesearchdiving : 0.00 0 0
0.07/0.09 c guideddiving : 0.00 0 0
0.07/0.09 c octane : 0.00 0 0
0.07/0.09 c rens : 0.00 0 0
0.07/0.09 c rins : 0.00 0 0
0.07/0.09 c localbranching : 0.00 0 0
0.07/0.09 c mutation : 0.00 0 0
0.07/0.09 c dins : 0.00 0 0
0.07/0.09 c vbounds : 0.00 0 0
0.07/0.09 c undercover : 0.00 0 0
0.07/0.09 c subnlp : 0.00 0 0
0.07/0.09 c trysol : 0.00 0 0
0.07/0.09 c LP : Time Calls Iterations Iter/call Iter/sec
0.07/0.09 c primal LP : 0.00 0 0 0.00 -
0.07/0.09 c dual LP : 0.01 5 314 62.80 -
0.07/0.09 c lex dual LP : 0.00 0 0 0.00 -
0.07/0.09 c barrier LP : 0.00 0 0 0.00 -
0.07/0.09 c diving/probing LP: 0.00 0 0 0.00 -
0.07/0.09 c strong branching : 0.00 0 0 0.00 -
0.07/0.09 c (at root node) : - 0 0 0.00 -
0.07/0.09 c conflict analysis: 0.00 0 0 0.00 -
0.07/0.09 c B&B Tree :
0.07/0.09 c number of runs : 1
0.07/0.09 c nodes : 1
0.07/0.09 c nodes (total) : 1
0.07/0.09 c nodes left : 0
0.07/0.09 c max depth : 0
0.07/0.09 c max depth (total): 0
0.07/0.09 c backtracks : 0 (0.0%)
0.07/0.09 c delayed cutoffs : 0
0.07/0.09 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.07/0.09 c avg switch length: 2.00
0.07/0.09 c switching time : 0.00
0.07/0.09 c Solution :
0.07/0.09 c Solutions found : 6 (5 improvements)
0.07/0.09 c First Solution : +1.00000000000000e+02 (in run 1, after 1 nodes, 0.05 seconds, depth 8, found by <shiftandpropagate>)
0.07/0.09 c Primal Bound : +9.20000000000000e+01 (in run 1, after 1 nodes, 0.09 seconds, depth 0, found by <relaxation>)
0.07/0.09 c Dual Bound : +9.20000000000000e+01
0.07/0.09 c Gap : 0.00 %
0.07/0.09 c Root Dual Bound : +9.20000000000000e+01
0.07/0.09 c Root Iterations : 314
0.07/0.10 c Time complete: 0.09.