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-2705287-1278572931.wbo>
0.00/0.00 c original problem has 225 variables (197 bin, 0 int, 28 impl, 0 cont) and 130 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.01 c (round 1) 0 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 4 impls, 49 clqs
0.00/0.01 c (round 2) 0 del vars, 17 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 4 impls, 49 clqs
0.00/0.01 c (round 3) 1 del vars, 18 del conss, 27 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 4 impls, 49 clqs
0.00/0.01 c (round 4) 2 del vars, 18 del conss, 27 chg bounds, 1 chg sides, 0 chg coeffs, 58 upgd conss, 4 impls, 49 clqs
0.00/0.02 c (0.0s) probing: 101/196 (51.5%) - 0 fixings, 0 aggregations, 0 implications, 0 bound changes
0.00/0.02 c (0.0s) probing aborted: 100/100 successive totally useless probings
0.00/0.02 c presolving (5 rounds):
0.00/0.02 c 2 deleted vars, 18 deleted constraints, 27 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
0.00/0.02 c 38 implications, 49 cliques
0.00/0.02 c presolved problem has 223 variables (196 bin, 0 int, 27 impl, 0 cont) and 112 constraints
0.00/0.02 c 51 constraints of type <setppc>
0.00/0.02 c 27 constraints of type <linear>
0.00/0.02 c 27 constraints of type <indicator>
0.00/0.02 c 7 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 1.2.1.3
0.00/0.02 c
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = 10000
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1790
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 3420
0.00/0.02 c
0.00/0.02 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.02 c # [type: int, range: [1,2], default: 1]
0.00/0.02 c timing/clocktype = 2
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/indicator/addCouplingCons = TRUE
0.00/0.02 c
0.00/0.02 c # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/rapidlearning/freq = 0
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.00/0.02 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.02 c 0.0s| 1 | 0 | 49 | - | 831k| 0 | 31 | 223 | 112 | 223 | 58 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.04 c 0.0s| 1 | 0 | 134 | - |1059k| 0 | 48 | 223 | 112 | 223 | 79 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.04/0.05 c 0.0s| 1 | 0 | 158 | - |1236k| 0 | 51 | 223 | 112 | 223 | 86 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
0.04/0.06 c 0.1s| 1 | 0 | 172 | - |1373k| 0 | 55 | 223 | 112 | 223 | 90 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
0.04/0.07 c 0.1s| 1 | 0 | 195 | - |1446k| 0 | 57 | 223 | 112 | 223 | 91 | 33 | 0 | 0 | 0.000000e+00 | -- | Inf
0.04/0.09 c 0.1s| 1 | 0 | 199 | - |1560k| 0 | 59 | 223 | 112 | 223 | 93 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 207 | - |1651k| 0 | 59 | 223 | 112 | 223 | 94 | 36 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.20 c 0.2s| 1 | 2 | 207 | - |1655k| 0 | 59 | 223 | 112 | 223 | 94 | 36 | 0 | 15 | 0.000000e+00 | -- | Inf
0.09/0.20 o 1334
0.09/0.20 c y 0.2s| 2 | 1 | 207 | 0.0 |1658k| 1 | - | 223 | 112 | 0 | 0 | 36 | 0 | 15 | 0.000000e+00 | 1.334000e+03 | Inf
0.49/0.56 o 268
0.49/0.56 c * 0.6s| 58 | 41 | 1051 | 14.8 |1745k| 21 | - | 223 | 112 | 223 | 89 | 50 | 0 | 390 | 0.000000e+00 | 2.680000e+02 | Inf
0.59/0.64 o 261
0.59/0.64 c * 0.6s| 83 | 61 | 1268 | 12.9 |1780k| 21 | - | 223 | 112 | 223 | 89 | 57 | 0 | 492 | 0.000000e+00 | 2.610000e+02 | Inf
0.59/0.64 o 252
0.59/0.64 c * 0.6s| 89 | 62 | 1299 | 12.4 |1792k| 21 | - | 223 | 113 | 223 | 86 | 57 | 1 | 511 | 0.000000e+00 | 2.520000e+02 | Inf
0.59/0.65 o 208
0.59/0.65 c * 0.6s| 93 | 55 | 1329 | 12.2 |1800k| 21 | - | 223 | 113 | 223 | 92 | 63 | 1 | 518 | 0.000000e+00 | 2.080000e+02 | Inf
0.59/0.65 o 201
0.59/0.65 c * 0.6s| 94 | 50 | 1329 | 12.1 |1796k| 21 | - | 223 | 113 | 223 | 92 | 63 | 1 | 518 | 0.000000e+00 | 2.010000e+02 | Inf
0.59/0.65 o 158
0.59/0.65 c * 0.7s| 101 | 43 | 1362 | 11.6 |1792k| 21 | - | 223 | 113 | 223 | 89 | 66 | 1 | 523 | 0.000000e+00 | 1.580000e+02 | Inf
0.59/0.68 o 86
0.59/0.68 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.59/0.68 c * 0.7s| 148 | 38 | 1496 | 8.8 |1817k| 23 | - | 223 | 130 | 223 | 90 | 78 | 18 | 566 | 0.000000e+00 | 8.600000e+01 | Inf
0.80/0.86 o 80
0.80/0.86 c * 0.9s| 228 | 41 | 2258 | 9.0 |1860k| 23 | - | 223 | 164 | 223 | 90 | 96 | 56 | 847 | 0.000000e+00 | 8.000000e+01 | Inf
1.29/1.33 c
1.29/1.33 c SCIP Status : problem is solved [optimal solution found]
1.29/1.33 c Solving Time (sec) : 1.33
1.29/1.33 c Solving Nodes : 497
1.29/1.33 c Primal Bound : +8.00000000000000e+01 (17 solutions)
1.29/1.33 c Dual Bound : +8.00000000000000e+01
1.29/1.33 c Gap : 0.00 %
1.29/1.33 s OPTIMUM FOUND
1.29/1.33 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148
1.29/1.33 v -x147 -x146 -x145 x144 -x143 x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
1.29/1.33 v x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 x110 -x109 -x108 -x107 -x106
1.29/1.33 v -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 x85 -x84 -x83 -x82
1.29/1.33 v -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
1.29/1.33 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
1.29/1.33 v -x30 -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
1.29/1.33 v -x4 -x3 -x2 -x1
1.29/1.33 c SCIP Status : problem is solved [optimal solution found]
1.29/1.33 c Solving Time : 1.33
1.29/1.33 c Original Problem :
1.29/1.33 c Problem name : HOME/instance-2705287-1278572931.wbo
1.29/1.33 c Variables : 225 (197 binary, 0 integer, 28 implicit integer, 0 continuous)
1.29/1.33 c Constraints : 130 initial, 130 maximal
1.29/1.33 c Presolved Problem :
1.29/1.33 c Problem name : t_HOME/instance-2705287-1278572931.wbo
1.29/1.33 c Variables : 223 (196 binary, 0 integer, 27 implicit integer, 0 continuous)
1.29/1.33 c Constraints : 112 initial, 488 maximal
1.29/1.33 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.29/1.33 c trivial : 0.00 0 0 0 0 0 0 0 0
1.29/1.33 c dualfix : 0.00 2 0 0 0 0 0 0 0
1.29/1.33 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.29/1.33 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.29/1.33 c implics : 0.00 0 0 0 0 0 0 0 0
1.29/1.33 c probing : 0.01 0 0 0 0 0 0 0 0
1.29/1.33 c setppc : 0.00 0 0 0 0 0 0 0 0
1.29/1.33 c linear : 0.00 0 0 0 27 0 17 1 0
1.29/1.33 c indicator : 0.00 0 0 0 0 0 1 0 0
1.29/1.33 c logicor : 0.00 0 0 0 0 0 0 0 0
1.29/1.33 c bounddisjunction : 0.00 0 0 0 0 0 0 0 0
1.29/1.33 c root node : - 15 - - 15 - - - -
1.29/1.33 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.29/1.33 c integral : 0 0 0 464 0 17 131 0 0 348
1.29/1.33 c setppc : 51 6 1755 182 0 16 3978 0 0 0
1.29/1.33 c linear : 27 6 1751 189 0 8 1679 102 0 0
1.29/1.33 c indicator : 27 0 1746 192 0 3 909 0 0 0
1.29/1.33 c logicor : 7+ 6 713 137 0 15 214 0 0 0
1.29/1.33 c bounddisjunction : 0+ 0 183 0 0 0 2 0 0 0
1.29/1.33 c countsols : 0 0 0 149 0 0 0 0 0 0
1.29/1.33 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.29/1.33 c integral : 0.89 0.00 0.00 0.89 0.00
1.29/1.33 c setppc : 0.00 0.00 0.00 0.00 0.00
1.29/1.33 c linear : 0.01 0.00 0.01 0.00 0.00
1.29/1.33 c indicator : 0.00 0.00 0.00 0.00 0.00
1.29/1.33 c logicor : 0.00 0.00 0.00 0.00 0.00
1.29/1.33 c bounddisjunction : 0.00 0.00 0.00 0.00 0.00
1.29/1.33 c countsols : 0.00 0.00 0.00 0.00 0.00
1.29/1.33 c Propagators : Time Calls Cutoffs DomReds
1.29/1.33 c vbounds : 0.00 308 0 104
1.29/1.33 c rootredcost : 0.00 9 0 6
1.29/1.33 c pseudoobj : 0.00 1586 16 783
1.29/1.33 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.29/1.33 c propagation : 0.00 54 52 264 20.7 2 20.0 -
1.29/1.33 c infeasible LP : 0.00 122 118 463 15.2 0 0.0 0
1.29/1.33 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.33 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.33 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.33 c applied globally : - - - 392 12.4 - - -
1.29/1.33 c applied locally : - - - 0 0.0 - - -
1.29/1.33 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.29/1.33 c cut pool : 0.00 5 - - 67 - (maximal pool size: 228)
1.29/1.33 c redcost : 0.00 480 0 72 0 0
1.29/1.33 c impliedbounds : 0.00 6 0 0 0 0
1.29/1.33 c intobj : 0.00 0 0 0 0 0
1.29/1.33 c cgmip : 0.00 0 0 0 0 0
1.29/1.33 c gomory : 0.02 6 0 0 44 0
1.29/1.33 c strongcg : 0.02 6 0 0 198 0
1.29/1.33 c cmir : 0.00 6 0 0 0 0
1.29/1.33 c flowcover : 0.03 6 0 0 0 0
1.29/1.33 c clique : 0.00 6 0 0 14 0
1.29/1.33 c zerohalf : 0.00 0 0 0 0 0
1.29/1.33 c mcf : 0.00 1 0 0 0 0
1.29/1.33 c rapidlearning : 0.01 1 0 0 0 0
1.29/1.33 c Pricers : Time Calls Vars
1.29/1.33 c problem variables: 0.00 0 0
1.29/1.33 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.29/1.33 c relpscost : 0.89 272 17 131 0 0 348
1.29/1.33 c pscost : 0.00 0 0 0 0 0 0
1.29/1.33 c inference : 0.00 141 0 0 0 0 288
1.29/1.33 c mostinf : 0.00 0 0 0 0 0 0
1.29/1.33 c leastinf : 0.00 0 0 0 0 0 0
1.29/1.33 c fullstrong : 0.00 0 0 0 0 0 0
1.29/1.33 c allfullstrong : 0.00 0 0 0 0 0 0
1.29/1.33 c random : 0.00 0 0 0 0 0 0
1.29/1.33 c Primal Heuristics : Time Calls Found
1.29/1.33 c LP solutions : 0.00 - 8
1.29/1.33 c pseudo solutions : 0.00 - 0
1.29/1.33 c oneopt : 0.00 8 0
1.29/1.33 c feaspump : 0.00 1 0
1.29/1.33 c linesearchdiving : 0.00 5 0
1.29/1.33 c guideddiving : 0.00 5 0
1.29/1.33 c coefdiving : 0.00 6 0
1.29/1.33 c pscostdiving : 0.00 6 0
1.29/1.33 c fracdiving : 0.00 6 0
1.29/1.33 c veclendiving : 0.00 6 0
1.29/1.33 c objpscostdiving : 0.00 5 0
1.29/1.33 c rootsoldiving : 0.00 5 0
1.29/1.33 c trivial : 0.00 2 0
1.29/1.33 c simplerounding : 0.00 233 0
1.29/1.33 c zirounding : 0.00 191 0
1.29/1.33 c rounding : 0.01 183 0
1.29/1.33 c shifting : 0.01 38 0
1.29/1.33 c intshifting : 0.00 0 0
1.29/1.33 c twoopt : 0.00 0 0
1.29/1.33 c fixandinfer : 0.00 0 0
1.29/1.33 c intdiving : 0.00 0 0
1.29/1.33 c actconsdiving : 0.00 0 0
1.29/1.33 c octane : 0.00 0 0
1.29/1.33 c rens : 0.02 1 0
1.29/1.33 c rins : 0.00 0 0
1.29/1.33 c localbranching : 0.00 0 0
1.29/1.33 c mutation : 0.00 0 0
1.29/1.33 c crossover : 0.01 1 0
1.29/1.33 c dins : 0.00 0 0
1.29/1.33 c undercover : 0.00 0 0
1.29/1.33 c nlp : 0.00 0 0
1.29/1.33 c trysol : 0.00 13 9
1.29/1.33 c LP : Time Calls Iterations Iter/call Iter/sec
1.29/1.33 c primal LP : 0.00 0 0 0.00 -
1.29/1.33 c dual LP : 0.23 466 9073 19.47 39572.74
1.29/1.33 c lex dual LP : 0.00 0 0 0.00 -
1.29/1.33 c barrier LP : 0.00 0 0 0.00 -
1.29/1.33 c diving/probing LP: 0.01 17 131 7.71 -
1.29/1.33 c strong branching : 0.89 1152 38478 33.40 43373.53
1.29/1.33 c (at root node) : - 15 2624 174.93 -
1.29/1.33 c conflict analysis: 0.00 0 0 0.00 -
1.29/1.33 c B&B Tree :
1.29/1.33 c number of runs : 1
1.29/1.33 c nodes : 497
1.29/1.33 c nodes (total) : 497
1.29/1.33 c nodes left : 0
1.29/1.33 c max depth : 38
1.29/1.33 c max depth (total): 38
1.29/1.33 c backtracks : 105 (21.1%)
1.29/1.33 c delayed cutoffs : 54
1.29/1.33 c repropagations : 375 (1163 domain reductions, 15 cutoffs)
1.29/1.33 c avg switch length: 3.55
1.29/1.33 c switching time : 0.01
1.29/1.33 c Solution :
1.29/1.33 c Solutions found : 17 (9 improvements)
1.29/1.33 c First Solution : +1.33400000000000e+03 (in run 1, after 1 nodes, 0.12 seconds, depth 0, found by <trysol>)
1.29/1.33 c Primal Bound : +8.00000000000000e+01 (in run 1, after 228 nodes, 0.86 seconds, depth 9, found by <relaxation>)
1.29/1.33 c Dual Bound : +8.00000000000000e+01
1.29/1.33 c Gap : 0.00 %
1.29/1.33 c Root Dual Bound : +0.00000000000000e+00
1.29/1.33 c Root Iterations : 207
1.29/1.33 c Time complete: 1.33.