0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1]
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-2705155-1278572918.wbo>
0.00/0.00 c original problem has 280 variables (250 bin, 0 int, 30 impl, 0 cont) and 73 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.00 c presolving:
0.00/0.00 c (round 1) 0 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 4 clqs
0.00/0.00 c (round 2) 0 del vars, 1 del conss, 30 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 0 impls, 4 clqs
0.00/0.00 c (round 3) 0 del vars, 1 del conss, 30 chg bounds, 0 chg sides, 0 chg coeffs, 8 upgd conss, 44 impls, 4 clqs
0.00/0.01 c (round 4) 0 del vars, 1 del conss, 30 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 44 impls, 4 clqs
0.00/0.01 c (0.0s) probing: 101/250 (40.4%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.01 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.01 c presolving (5 rounds):
0.00/0.01 c 0 deleted vars, 1 deleted constraints, 30 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 44 implications, 4 cliques
0.00/0.01 c presolved problem has 280 variables (250 bin, 0 int, 30 impl, 0 cont) and 72 constraints
0.00/0.01 c 4 constraints of type <setppc>
0.00/0.01 c 30 constraints of type <linear>
0.00/0.01 c 30 constraints of type <indicator>
0.00/0.01 c 8 constraints of type <logicor>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.01
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 1.2.1.3
0.00/0.01 c
0.00/0.01 c # frequency for displaying node information lines
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01 c display/freq = 10000
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1790
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 3420
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify inequalities
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/linear/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/addCouplingCons = TRUE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify knapsacks
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c separating/rapidlearning/freq = 0
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.01 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.01 c 0.0s| 1 | 0 | 8 | - | 797k| 0 | 0 | 280 | 72 | 280 | 12 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 48 | - | 816k| 0 | 0 | 280 | 72 | 280 | 28 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 73 | - | 817k| 0 | 0 | 280 | 72 | 280 | 30 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 87 | - | 819k| 0 | 0 | 280 | 72 | 280 | 32 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 104 | - | 820k| 0 | 0 | 280 | 72 | 280 | 34 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 116 | - | 821k| 0 | 0 | 280 | 72 | 280 | 36 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 122 | - | 823k| 0 | 0 | 280 | 72 | 280 | 38 | 26 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 126 | - | 824k| 0 | 0 | 280 | 72 | 280 | 40 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 128 | - | 825k| 0 | 0 | 280 | 72 | 280 | 41 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 c 0.0s| 1 | 0 | 129 | - | 825k| 0 | 0 | 280 | 72 | 280 | 42 | 30 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.02 c 0.0s| 1 | 2 | 129 | - | 826k| 0 | 0 | 280 | 72 | 280 | 42 | 30 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.04 o 102
0.00/0.04 c * 0.0s| 135 | 134 | 129 | 0.0 | 939k| 134 | - | 280 | 72 | 280 | 42 | 30 | 0 | 0 | 0.000000e+00 | 1.020000e+02 | Inf
0.00/0.04 o 75
0.00/0.04 c * 0.0s| 163 | 139 | 138 | 0.1 | 960k| 134 | - | 280 | 76 | 280 | 42 | 30 | 4 | 0 | 0.000000e+00 | 7.500000e+01 | Inf
0.00/0.04 o 69
0.00/0.04 c * 0.0s| 178 | 150 | 149 | 0.1 | 969k| 134 | - | 280 | 65 | 280 | 42 | 30 | 4 | 0 | 0.000000e+00 | 6.900000e+01 | Inf
0.00/0.04 o 53
0.00/0.04 c * 0.0s| 179 | 141 | 149 | 0.1 | 970k| 134 | - | 280 | 65 | 280 | 42 | 30 | 4 | 0 | 0.000000e+00 | 5.300000e+01 | Inf
0.04/0.05 o 52
0.04/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.04/0.05 c * 0.0s| 205 | 160 | 156 | 0.1 | 988k| 134 | - | 280 | 64 | 280 | 42 | 30 | 6 | 0 | 0.000000e+00 | 5.200000e+01 | Inf
0.04/0.05 o 3
0.04/0.05 c * 0.0s| 207 | 114 | 159 | 0.1 | 979k| 134 | - | 280 | 63 | 280 | 42 | 30 | 6 | 0 | 0.000000e+00 | 3.000000e+00 | Inf
0.04/0.05 c
0.04/0.05 c SCIP Status : problem is solved [optimal solution found]
0.04/0.05 c Solving Time (sec) : 0.05
0.04/0.05 c Solving Nodes : 207
0.04/0.05 c Primal Bound : +3.00000000000000e+00 (8 solutions)
0.04/0.05 c Dual Bound : +3.00000000000000e+00
0.04/0.05 c Gap : 0.00 %
0.04/0.05 s OPTIMUM FOUND
0.04/0.05 v -x220 -x219 -x218 -x217 -x216 -x215 -x214 -x213 x212 -x211 -x210 -x209 -x208 -x207 -x206 -x205 -x204 -x203 -x202 x201 -x200 -x199
0.04/0.05 v -x198 -x197 -x196 -x195 -x194 -x193 -x192 x191 -x190 -x189 -x188 -x187 -x186 -x185 -x184 -x183 x182 -x181 -x180 -x179 -x178
0.04/0.05 v -x177 -x176 -x175 -x174 x173 -x172 -x171 -x170 -x169 -x168 -x167 -x166 -x165 x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157
0.04/0.05 v -x156 -x155 -x154 x153 -x152 -x151 -x150 -x149 -x148 -x147 -x146 x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136
0.04/0.05 v -x135 x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 -x126 x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 x115 -x114
0.04/0.05 v -x113 -x112 -x111 -x110 -x109 -x108 -x107 x106 -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 x96 -x95 -x94 -x93 -x92
0.04/0.05 v -x91 -x90 -x89 -x88 x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 x68 -x67 -x66
0.04/0.05 v -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41
0.04/0.05 v -x40 -x39 x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 x19 -x18 -x17 -x16 -x15
0.04/0.05 v -x14 -x13 -x12 -x11 x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
0.04/0.05 c SCIP Status : problem is solved [optimal solution found]
0.04/0.05 c Solving Time : 0.05
0.04/0.05 c Original Problem :
0.04/0.05 c Problem name : HOME/instance-2705155-1278572918.wbo
0.04/0.05 c Variables : 280 (250 binary, 0 integer, 30 implicit integer, 0 continuous)
0.04/0.05 c Constraints : 73 initial, 73 maximal
0.04/0.05 c Presolved Problem :
0.04/0.05 c Problem name : t_HOME/instance-2705155-1278572918.wbo
0.04/0.05 c Variables : 280 (250 binary, 0 integer, 30 implicit integer, 0 continuous)
0.04/0.05 c Constraints : 72 initial, 76 maximal
0.04/0.05 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.04/0.05 c trivial : 0.00 0 0 0 0 0 0 0 0
0.04/0.05 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.04/0.05 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.04/0.05 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.04/0.05 c implics : 0.00 0 0 0 0 0 0 0 0
0.04/0.05 c probing : 0.00 0 0 0 0 0 0 0 0
0.04/0.05 c setppc : 0.00 0 0 0 0 0 0 0 0
0.04/0.05 c linear : 0.00 0 0 0 30 0 1 0 0
0.04/0.05 c indicator : 0.00 0 0 0 0 0 0 0 0
0.04/0.05 c logicor : 0.00 0 0 0 0 0 0 0 0
0.04/0.05 c bounddisjunction : 0.00 0 0 0 0 0 0 0 0
0.04/0.05 c root node : - 56 - - 56 - - - -
0.04/0.05 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.04/0.05 c integral : 0 0 0 204 0 0 0 0 0 0
0.04/0.05 c setppc : 4 10 533 204 0 0 10 0 0 0
0.04/0.05 c linear : 30 10 533 204 0 0 139 30 0 0
0.04/0.05 c indicator : 30 0 527 199 0 0 107 0 0 0
0.04/0.05 c logicor : 8+ 10 48 204 0 1 0 0 0 0
0.04/0.05 c bounddisjunction : 0+ 0 40 0 0 1 14 0 0 0
0.04/0.05 c countsols : 0 0 0 204 0 0 0 0 0 0
0.04/0.05 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.04/0.05 c integral : 0.00 0.00 0.00 0.00 0.00
0.04/0.05 c setppc : 0.00 0.00 0.00 0.00 0.00
0.04/0.05 c linear : 0.00 0.00 0.00 0.00 0.00
0.04/0.05 c indicator : 0.00 0.00 0.00 0.00 0.00
0.04/0.05 c logicor : 0.00 0.00 0.00 0.00 0.00
0.04/0.05 c bounddisjunction : 0.00 0.00 0.00 0.00 0.00
0.04/0.05 c countsols : 0.00 0.00 0.00 0.00 0.00
0.04/0.05 c Propagators : Time Calls Cutoffs DomReds
0.04/0.05 c vbounds : 0.00 77 0 53
0.04/0.05 c rootredcost : 0.00 6 0 28
0.04/0.05 c pseudoobj : 0.00 334 1 7
0.04/0.05 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.04/0.05 c propagation : 0.00 3 2 2 5.0 0 0.0 -
0.04/0.05 c infeasible LP : 0.00 3 3 5 18.0 0 0.0 0
0.04/0.05 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.04/0.05 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.04/0.05 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.04/0.05 c applied globally : - - - 7 14.3 - - -
0.04/0.05 c applied locally : - - - 0 0.0 - - -
0.04/0.05 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.04/0.05 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.04/0.05 c redcost : 0.00 217 0 8 0 0
0.04/0.05 c impliedbounds : 0.00 0 0 0 0 0
0.04/0.05 c intobj : 0.00 0 0 0 0 0
0.04/0.05 c cgmip : 0.00 0 0 0 0 0
0.04/0.05 c gomory : 0.00 0 0 0 0 0
0.04/0.05 c strongcg : 0.00 0 0 0 0 0
0.04/0.05 c cmir : 0.00 0 0 0 0 0
0.04/0.05 c flowcover : 0.00 0 0 0 0 0
0.04/0.05 c clique : 0.00 0 0 0 0 0
0.04/0.05 c zerohalf : 0.00 0 0 0 0 0
0.04/0.05 c mcf : 0.00 0 0 0 0 0
0.04/0.05 c rapidlearning : 0.01 1 0 0 0 0
0.04/0.05 c Pricers : Time Calls Vars
0.04/0.05 c problem variables: 0.00 0 0
0.04/0.05 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.04/0.05 c relpscost : 0.00 0 0 0 0 0 0
0.04/0.05 c pscost : 0.00 0 0 0 0 0 0
0.04/0.05 c inference : 0.00 198 0 0 0 0 396
0.04/0.05 c mostinf : 0.00 0 0 0 0 0 0
0.04/0.05 c leastinf : 0.00 0 0 0 0 0 0
0.04/0.05 c fullstrong : 0.00 0 0 0 0 0 0
0.04/0.05 c allfullstrong : 0.00 0 0 0 0 0 0
0.04/0.05 c random : 0.00 0 0 0 0 0 0
0.04/0.05 c Primal Heuristics : Time Calls Found
0.04/0.05 c LP solutions : 0.00 - 6
0.04/0.05 c pseudo solutions : 0.00 - 0
0.04/0.05 c crossover : 0.00 0 0
0.04/0.05 c coefdiving : 0.00 0 0
0.04/0.05 c pscostdiving : 0.00 0 0
0.04/0.05 c fracdiving : 0.00 0 0
0.04/0.05 c veclendiving : 0.00 0 0
0.04/0.05 c objpscostdiving : 0.00 0 0
0.04/0.05 c rootsoldiving : 0.00 0 0
0.04/0.05 c linesearchdiving : 0.00 0 0
0.04/0.05 c guideddiving : 0.00 0 0
0.04/0.05 c feaspump : 0.00 0 0
0.04/0.05 c oneopt : 0.00 4 0
0.04/0.05 c trivial : 0.00 2 0
0.04/0.05 c simplerounding : 0.00 0 0
0.04/0.05 c zirounding : 0.00 0 0
0.04/0.05 c rounding : 0.00 0 0
0.04/0.05 c shifting : 0.00 0 0
0.04/0.05 c intshifting : 0.00 0 0
0.04/0.05 c twoopt : 0.00 0 0
0.04/0.05 c fixandinfer : 0.00 0 0
0.04/0.05 c intdiving : 0.00 0 0
0.04/0.05 c actconsdiving : 0.00 0 0
0.04/0.05 c octane : 0.00 0 0
0.04/0.05 c rens : 0.00 0 0
0.04/0.05 c rins : 0.00 0 0
0.04/0.05 c localbranching : 0.00 0 0
0.04/0.05 c mutation : 0.00 0 0
0.04/0.05 c dins : 0.00 0 0
0.04/0.05 c undercover : 0.00 0 0
0.04/0.05 c nlp : 0.00 0 0
0.04/0.05 c trysol : 0.00 4 2
0.04/0.05 c LP : Time Calls Iterations Iter/call Iter/sec
0.04/0.05 c primal LP : 0.00 0 0 0.00 -
0.04/0.05 c dual LP : 0.01 24 152 6.33 14541.28
0.04/0.05 c lex dual LP : 0.00 0 0 0.00 -
0.04/0.05 c barrier LP : 0.00 0 0 0.00 -
0.04/0.05 c diving/probing LP: 0.00 3 7 2.33 -
0.04/0.05 c strong branching : 0.00 0 0 0.00 -
0.04/0.05 c (at root node) : - 0 0 0.00 -
0.04/0.05 c conflict analysis: 0.00 0 0 0.00 -
0.04/0.05 c B&B Tree :
0.04/0.05 c number of runs : 1
0.04/0.05 c nodes : 207
0.04/0.05 c nodes (total) : 207
0.04/0.05 c nodes left : 0
0.04/0.05 c max depth : 134
0.04/0.05 c max depth (total): 134
0.04/0.05 c backtracks : 6 (2.9%)
0.04/0.05 c delayed cutoffs : 115
0.04/0.05 c repropagations : 34 (65 domain reductions, 3 cutoffs)
0.04/0.05 c avg switch length: 2.27
0.04/0.05 c switching time : 0.00
0.04/0.05 c Solution :
0.04/0.05 c Solutions found : 8 (6 improvements)
0.04/0.05 c First Solution : +1.02000000000000e+02 (in run 1, after 135 nodes, 0.03 seconds, depth 134, found by <relaxation>)
0.04/0.05 c Primal Bound : +3.00000000000000e+00 (in run 1, after 207 nodes, 0.05 seconds, depth 19, found by <relaxation>)
0.04/0.05 c Dual Bound : +3.00000000000000e+00
0.04/0.05 c Gap : 0.00 %
0.04/0.05 c Root Dual Bound : +0.00000000000000e+00
0.04/0.05 c Root Iterations : 129
0.04/0.05 c Time complete: 0.04.