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-2705345-1278572939.wbo>
0.00/0.00 c original problem has 227 variables (198 bin, 0 int, 29 impl, 0 cont) and 131 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, 8 impls, 48 clqs
0.00/0.01 c (round 2) 0 del vars, 18 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 8 impls, 48 clqs
0.00/0.01 c (round 3) 1 del vars, 19 del conss, 28 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 8 impls, 48 clqs
0.00/0.01 c (round 4) 2 del vars, 19 del conss, 28 chg bounds, 1 chg sides, 0 chg coeffs, 56 upgd conss, 8 impls, 48 clqs
0.00/0.02 c (0.0s) probing: 101/197 (51.3%) - 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, 19 deleted constraints, 28 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
0.00/0.02 c 44 implications, 48 cliques
0.00/0.02 c presolved problem has 225 variables (197 bin, 0 int, 28 impl, 0 cont) and 112 constraints
0.00/0.02 c 1 constraints of type <knapsack>
0.00/0.02 c 52 constraints of type <setppc>
0.00/0.02 c 28 constraints of type <linear>
0.00/0.02 c 28 constraints of type <indicator>
0.00/0.02 c 3 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 | 31 | - | 978k| 0 | 20 | 225 | 112 | 225 | 56 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.04 c 0.0s| 1 | 0 | 66 | - |1110k| 0 | 41 | 225 | 112 | 225 | 72 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 86 | - |1345k| 0 | 43 | 225 | 112 | 225 | 81 | 25 | 0 | 0 | 0.000000e+00 | -- | Inf
0.04/0.06 c 0.1s| 1 | 0 | 105 | - |1576k| 0 | 45 | 225 | 112 | 225 | 85 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
0.04/0.07 c 0.1s| 1 | 0 | 126 | - |1821k| 0 | 44 | 225 | 112 | 225 | 88 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
0.04/0.08 c 0.1s| 1 | 0 | 149 | - |1926k| 0 | 44 | 225 | 112 | 225 | 91 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.04/0.09 c 0.1s| 1 | 0 | 185 | - |1981k| 0 | 48 | 225 | 112 | 225 | 93 | 37 | 0 | 0 | 0.000000e+00 | -- | Inf
0.20/0.20 c 0.2s| 1 | 2 | 185 | - |1985k| 0 | 48 | 225 | 112 | 225 | 93 | 37 | 0 | 15 | 0.000000e+00 | -- | Inf
0.20/0.20 o 1473
0.20/0.20 c y 0.2s| 2 | 1 | 185 | 0.0 |1987k| 1 | - | 225 | 112 | 0 | 0 | 37 | 0 | 15 | 0.000000e+00 | 1.473000e+03 | Inf
0.49/0.53 o 277
0.49/0.53 c * 0.5s| 65 | 38 | 1067 | 13.8 |2075k| 23 | - | 225 | 134 | 225 | 86 | 43 | 22 | 278 | 0.000000e+00 | 2.770000e+02 | Inf
0.49/0.53 o 213
0.49/0.53 c * 0.5s| 88 | 43 | 1083 | 10.3 |2092k| 24 | - | 225 | 138 | 225 | 86 | 43 | 26 | 278 | 0.000000e+00 | 2.130000e+02 | Inf
0.59/0.62 o 212
0.59/0.62 c * 0.6s| 130 | 75 | 1334 | 8.9 |2134k| 24 | - | 225 | 148 | 225 | 85 | 45 | 36 | 360 | 0.000000e+00 | 2.120000e+02 | Inf
0.59/0.65 o 204
0.59/0.65 c * 0.6s| 196 | 114 | 1585 | 7.2 |2188k| 35 | - | 225 | 173 | 225 | 87 | 49 | 62 | 380 | 0.000000e+00 | 2.040000e+02 | Inf
0.69/0.74 o 160
0.69/0.74 c * 0.7s| 326 | 135 | 2294 | 6.5 |2284k| 35 | - | 225 | 267 | 225 | 87 | 58 | 156 | 483 | 0.000000e+00 | 1.600000e+02 | Inf
0.79/0.80 o 19
0.79/0.80 c * 0.8s| 418 | 17 | 2867 | 6.4 |2244k| 35 | - | 225 | 385 | 225 | 85 | 64 | 275 | 510 | 0.000000e+00 | 1.900000e+01 | Inf
0.89/0.92 c
0.89/0.92 c SCIP Status : problem is solved [optimal solution found]
0.89/0.92 c Solving Time (sec) : 0.92
0.89/0.92 c Solving Nodes : 447
0.89/0.92 c Primal Bound : +1.90000000000000e+01 (16 solutions)
0.89/0.92 c Dual Bound : +1.90000000000000e+01
0.89/0.92 c Gap : 0.00 %
0.89/0.93 s OPTIMUM FOUND
0.89/0.93 v -x169 x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 x148
0.89/0.93 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 x132 -x131 x130 -x129 -x128 -x127
0.89/0.93 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 x110 -x109 -x108 -x107 -x106
0.89/0.93 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
0.89/0.93 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
0.89/0.93 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
0.89/0.93 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
0.89/0.93 v -x4 -x3 -x2 -x1
0.89/0.93 c SCIP Status : problem is solved [optimal solution found]
0.89/0.93 c Solving Time : 0.92
0.89/0.93 c Original Problem :
0.89/0.93 c Problem name : HOME/instance-2705345-1278572939.wbo
0.89/0.93 c Variables : 227 (198 binary, 0 integer, 29 implicit integer, 0 continuous)
0.89/0.93 c Constraints : 131 initial, 131 maximal
0.89/0.93 c Presolved Problem :
0.89/0.93 c Problem name : t_HOME/instance-2705345-1278572939.wbo
0.89/0.93 c Variables : 225 (197 binary, 0 integer, 28 implicit integer, 0 continuous)
0.89/0.93 c Constraints : 112 initial, 407 maximal
0.89/0.93 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.89/0.93 c trivial : 0.00 0 0 0 0 0 0 0 0
0.89/0.93 c dualfix : 0.00 2 0 0 0 0 0 0 0
0.89/0.93 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.89/0.93 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.89/0.93 c implics : 0.00 0 0 0 0 0 0 0 0
0.89/0.93 c probing : 0.01 0 0 0 0 0 0 0 0
0.89/0.93 c knapsack : 0.00 0 0 0 0 0 0 0 0
0.89/0.93 c setppc : 0.00 0 0 0 0 0 0 0 0
0.89/0.93 c linear : 0.00 0 0 0 28 0 18 1 0
0.89/0.93 c indicator : 0.00 0 0 0 0 0 1 0 0
0.89/0.93 c logicor : 0.00 0 0 0 0 0 0 0 0
0.89/0.93 c bounddisjunction : 0.00 0 0 0 0 0 0 0 0
0.89/0.93 c root node : - 97 - - 97 - - - -
0.89/0.93 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.89/0.93 c integral : 0 0 0 398 0 4 185 0 0 72
0.89/0.93 c knapsack : 1 6 1623 291 0 2 897 0 0 0
0.89/0.93 c setppc : 52 6 1607 284 0 29 2897 0 0 0
0.89/0.93 c linear : 28 6 1587 288 0 9 542 46 0 0
0.89/0.93 c indicator : 28 0 1587 292 0 9 598 0 0 0
0.89/0.93 c logicor : 3+ 6 574 244 0 4 166 0 0 0
0.89/0.93 c bounddisjunction : 0+ 0 363 0 0 0 37 0 0 0
0.89/0.93 c countsols : 0 0 0 271 0 0 0 0 0 0
0.89/0.93 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.89/0.93 c integral : 0.60 0.00 0.00 0.60 0.00
0.89/0.93 c knapsack : 0.03 0.00 0.03 0.00 0.00
0.89/0.93 c setppc : 0.00 0.00 0.00 0.00 0.00
0.89/0.93 c linear : 0.01 0.00 0.01 0.00 0.00
0.89/0.93 c indicator : 0.00 0.00 0.00 0.00 0.00
0.89/0.93 c logicor : 0.00 0.00 0.00 0.00 0.00
0.89/0.93 c bounddisjunction : 0.00 0.00 0.00 0.00 0.00
0.89/0.93 c countsols : 0.00 0.00 0.00 0.00 0.00
0.89/0.93 c Propagators : Time Calls Cutoffs DomReds
0.89/0.93 c vbounds : 0.00 334 0 68
0.89/0.93 c rootredcost : 0.00 7 0 24
0.89/0.93 c pseudoobj : 0.00 1440 12 504
0.89/0.93 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.89/0.93 c propagation : 0.00 56 56 332 30.4 1 29.0 -
0.89/0.93 c infeasible LP : 0.00 101 98 448 21.3 0 0.0 0
0.89/0.93 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.93 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.89/0.93 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.89/0.93 c applied globally : - - - 325 16.1 - - -
0.89/0.93 c applied locally : - - - 2 31.5 - - -
0.89/0.93 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.89/0.93 c cut pool : 0.00 5 - - 81 - (maximal pool size: 228)
0.89/0.93 c redcost : 0.00 399 0 2 0 0
0.89/0.93 c impliedbounds : 0.00 6 0 0 0 0
0.89/0.93 c intobj : 0.00 0 0 0 0 0
0.89/0.93 c cgmip : 0.00 0 0 0 0 0
0.89/0.93 c gomory : 0.02 6 0 0 38 0
0.89/0.93 c strongcg : 0.02 6 0 0 225 0
0.89/0.93 c cmir : 0.00 6 0 0 0 0
0.89/0.93 c flowcover : 0.02 6 0 0 1 0
0.89/0.93 c clique : 0.00 6 0 0 10 0
0.89/0.93 c zerohalf : 0.00 0 0 0 0 0
0.89/0.93 c mcf : 0.00 1 0 0 0 0
0.89/0.93 c rapidlearning : 0.01 1 0 0 0 0
0.89/0.93 c Pricers : Time Calls Vars
0.89/0.93 c problem variables: 0.00 0 0
0.89/0.93 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.89/0.93 c relpscost : 0.60 105 4 185 0 0 72
0.89/0.93 c pscost : 0.00 0 0 0 0 0 0
0.89/0.93 c inference : 0.00 265 0 0 0 0 534
0.89/0.93 c mostinf : 0.00 0 0 0 0 0 0
0.89/0.93 c leastinf : 0.00 0 0 0 0 0 0
0.89/0.93 c fullstrong : 0.00 0 0 0 0 0 0
0.89/0.93 c allfullstrong : 0.00 0 0 0 0 0 0
0.89/0.93 c random : 0.00 0 0 0 0 0 0
0.89/0.93 c Primal Heuristics : Time Calls Found
0.89/0.93 c LP solutions : 0.00 - 6
0.89/0.93 c pseudo solutions : 0.00 - 0
0.89/0.93 c crossover : 0.00 0 0
0.89/0.93 c oneopt : 0.00 7 0
0.89/0.93 c fracdiving : 0.00 5 0
0.89/0.93 c pscostdiving : 0.00 5 0
0.89/0.93 c veclendiving : 0.00 5 0
0.89/0.93 c linesearchdiving : 0.00 6 0
0.89/0.93 c guideddiving : 0.00 6 0
0.89/0.93 c objpscostdiving : 0.00 5 0
0.89/0.93 c rootsoldiving : 0.00 5 0
0.89/0.93 c trivial : 0.00 2 0
0.89/0.93 c simplerounding : 0.00 93 0
0.89/0.93 c zirounding : 0.00 40 0
0.89/0.93 c rounding : 0.00 103 0
0.89/0.93 c shifting : 0.00 11 0
0.89/0.93 c intshifting : 0.00 0 0
0.89/0.93 c twoopt : 0.00 0 0
0.89/0.93 c fixandinfer : 0.00 0 0
0.89/0.93 c feaspump : 0.00 1 0
0.89/0.93 c coefdiving : 0.00 6 0
0.89/0.93 c intdiving : 0.00 0 0
0.89/0.93 c actconsdiving : 0.00 0 0
0.89/0.93 c octane : 0.00 0 0
0.89/0.93 c rens : 0.02 1 0
0.89/0.93 c rins : 0.00 0 0
0.89/0.93 c localbranching : 0.00 0 0
0.89/0.93 c mutation : 0.00 0 0
0.89/0.93 c dins : 0.00 0 0
0.89/0.93 c undercover : 0.00 0 0
0.89/0.93 c nlp : 0.00 0 0
0.89/0.93 c trysol : 0.00 14 10
0.89/0.93 c LP : Time Calls Iterations Iter/call Iter/sec
0.89/0.93 c primal LP : 0.00 0 0 0.00 -
0.89/0.93 c dual LP : 0.12 264 4031 15.27 33751.14
0.89/0.93 c lex dual LP : 0.00 0 0 0.00 -
0.89/0.93 c barrier LP : 0.00 0 0 0.00 -
0.89/0.93 c diving/probing LP: 0.01 29 139 4.79 -
0.89/0.93 c strong branching : 0.59 623 27520 44.17 46302.61
0.89/0.93 c (at root node) : - 15 2934 195.60 -
0.89/0.93 c conflict analysis: 0.00 0 0 0.00 -
0.89/0.93 c B&B Tree :
0.89/0.93 c number of runs : 1
0.89/0.93 c nodes : 447
0.89/0.93 c nodes (total) : 447
0.89/0.93 c nodes left : 0
0.89/0.93 c max depth : 35
0.89/0.93 c max depth (total): 35
0.89/0.93 c backtracks : 124 (27.7%)
0.89/0.93 c delayed cutoffs : 31
0.89/0.93 c repropagations : 338 (1360 domain reductions, 24 cutoffs)
0.89/0.93 c avg switch length: 4.98
0.89/0.93 c switching time : 0.01
0.89/0.93 c Solution :
0.89/0.93 c Solutions found : 16 (7 improvements)
0.89/0.93 c First Solution : +1.47300000000000e+03 (in run 1, after 1 nodes, 0.11 seconds, depth 0, found by <trysol>)
0.89/0.93 c Primal Bound : +1.90000000000000e+01 (in run 1, after 418 nodes, 0.80 seconds, depth 21, found by <relaxation>)
0.89/0.93 c Dual Bound : +1.90000000000000e+01
0.89/0.93 c Gap : 0.00 %
0.89/0.93 c Root Dual Bound : +0.00000000000000e+00
0.89/0.93 c Root Iterations : 185
0.89/0.93 c Time complete: 0.92.