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-2705472-1278572947.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.00 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.01 c (0.0s) probing: 101/196 (51.5%) - 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 2 deleted vars, 18 deleted constraints, 27 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
0.00/0.01 c 38 implications, 49 cliques
0.00/0.01 c presolved problem has 223 variables (196 bin, 0 int, 27 impl, 0 cont) and 112 constraints
0.00/0.01 c 51 constraints of type <setppc>
0.00/0.01 c 27 constraints of type <linear>
0.00/0.01 c 27 constraints of type <indicator>
0.00/0.01 c 7 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.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.03 c 0.0s| 1 | 0 | 81 | - |1056k| 0 | 45 | 223 | 112 | 223 | 78 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.04 c 0.0s| 1 | 0 | 109 | - |1149k| 0 | 47 | 223 | 112 | 223 | 85 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.06 c 0.1s| 1 | 0 | 156 | - |1177k| 0 | 55 | 223 | 112 | 223 | 89 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.07 c 0.1s| 1 | 0 | 167 | - |1267k| 0 | 52 | 223 | 112 | 223 | 90 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
0.06/0.08 c 0.1s| 1 | 0 | 214 | - |1327k| 0 | 54 | 223 | 112 | 223 | 93 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.06/0.09 c 0.1s| 1 | 0 | 243 | - |1349k| 0 | 55 | 223 | 112 | 223 | 95 | 37 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.19 c 0.2s| 1 | 2 | 243 | - |1350k| 0 | 55 | 223 | 112 | 223 | 95 | 37 | 0 | 15 | 0.000000e+00 | -- | Inf
0.19/0.29 o 1334
0.19/0.29 c y 0.3s| 17 | 16 | 557 | 19.6 |1380k| 15 | - | 223 | 112 | 0 | 0 | 38 | 0 | 109 | 0.000000e+00 | 1.334000e+03 | Inf
0.69/0.77 o 323
0.69/0.77 c * 0.8s| 204 | 175 | 1784 | 7.6 |1587k| 31 | - | 223 | 120 | 223 | 90 | 67 | 8 | 648 | 0.000000e+00 | 3.230000e+02 | Inf
0.69/0.77 o 274
0.69/0.77 c * 0.8s| 210 | 170 | 1801 | 7.5 |1593k| 36 | - | 223 | 120 | 223 | 91 | 68 | 8 | 653 | 0.000000e+00 | 2.740000e+02 | Inf
0.69/0.77 o 142
0.69/0.77 c * 0.8s| 214 | 109 | 1802 | 7.3 |1566k| 39 | - | 223 | 120 | 223 | 91 | 68 | 8 | 653 | 0.000000e+00 | 1.420000e+02 | Inf
0.79/0.82 o 127
0.79/0.82 c * 0.8s| 278 | 128 | 2160 | 6.9 |1631k| 39 | - | 223 | 135 | 223 | 93 | 77 | 24 | 719 | 0.000000e+00 | 1.270000e+02 | Inf
0.79/0.83 o 80
0.79/0.83 c * 0.8s| 291 | 62 | 2234 | 6.9 |1580k| 39 | - | 223 | 144 | 223 | 89 | 78 | 33 | 727 | 0.000000e+00 | 8.000000e+01 | Inf
1.49/1.58 c
1.49/1.58 c SCIP Status : problem is solved [optimal solution found]
1.49/1.58 c Solving Time (sec) : 1.58
1.49/1.58 c Solving Nodes : 939
1.49/1.58 c Primal Bound : +8.00000000000000e+01 (30 solutions)
1.49/1.58 c Dual Bound : +8.00000000000000e+01
1.49/1.58 c Gap : 0.00 %
1.49/1.58 s OPTIMUM FOUND
1.49/1.58 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 x153 -x152 -x151 -x150 -x149 -x148
1.49/1.58 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
1.49/1.58 v -x126 -x125 -x124 -x123 -x122 -x121 x120 -x119 -x118 -x117 -x116 x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
1.49/1.58 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.49/1.58 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.49/1.58 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.49/1.58 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.49/1.58 v -x4 -x3 -x2 -x1
1.49/1.58 c SCIP Status : problem is solved [optimal solution found]
1.49/1.58 c Solving Time : 1.58
1.49/1.58 c Original Problem :
1.49/1.58 c Problem name : HOME/instance-2705472-1278572947.wbo
1.49/1.58 c Variables : 225 (197 binary, 0 integer, 28 implicit integer, 0 continuous)
1.49/1.58 c Constraints : 130 initial, 130 maximal
1.49/1.58 c Presolved Problem :
1.49/1.58 c Problem name : t_HOME/instance-2705472-1278572947.wbo
1.49/1.58 c Variables : 223 (196 binary, 0 integer, 27 implicit integer, 0 continuous)
1.49/1.58 c Constraints : 112 initial, 895 maximal
1.49/1.58 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.49/1.58 c trivial : 0.00 0 0 0 0 0 0 0 0
1.49/1.58 c dualfix : 0.00 2 0 0 0 0 0 0 0
1.49/1.58 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.49/1.58 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.49/1.58 c implics : 0.00 0 0 0 0 0 0 0 0
1.49/1.58 c probing : 0.01 0 0 0 0 0 0 0 0
1.49/1.58 c setppc : 0.00 0 0 0 0 0 0 0 0
1.49/1.58 c linear : 0.00 0 0 0 27 0 17 1 0
1.49/1.58 c indicator : 0.00 0 0 0 0 0 1 0 0
1.49/1.58 c logicor : 0.00 0 0 0 0 0 0 0 0
1.49/1.58 c bounddisjunction : 0.00 0 0 0 0 0 0 0 0
1.49/1.58 c root node : - 12 - - 12 - - - -
1.49/1.58 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.49/1.58 c integral : 0 0 0 806 0 12 231 0 0 506
1.49/1.58 c setppc : 51 6 3088 404 0 30 6876 0 0 0
1.49/1.58 c linear : 27 6 3074 412 0 29 2603 122 0 0
1.49/1.58 c indicator : 27 0 3047 414 0 16 1420 0 0 0
1.49/1.58 c logicor : 7+ 6 1352 341 0 18 474 0 0 0
1.49/1.58 c bounddisjunction : 0+ 0 306 0 0 0 11 0 0 0
1.49/1.58 c countsols : 0 0 0 355 0 0 0 0 0 0
1.49/1.58 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.49/1.58 c integral : 0.96 0.00 0.00 0.96 0.00
1.49/1.58 c setppc : 0.01 0.00 0.01 0.00 0.00
1.49/1.58 c linear : 0.02 0.00 0.02 0.00 0.00
1.49/1.58 c indicator : 0.00 0.00 0.00 0.00 0.00
1.49/1.58 c logicor : 0.01 0.00 0.01 0.00 0.00
1.49/1.58 c bounddisjunction : 0.00 0.00 0.00 0.00 0.00
1.49/1.58 c countsols : 0.00 0.00 0.00 0.00 0.00
1.49/1.58 c Propagators : Time Calls Cutoffs DomReds
1.49/1.58 c vbounds : 0.00 555 0 141
1.49/1.58 c rootredcost : 0.00 6 0 6
1.49/1.58 c pseudoobj : 0.01 2934 28 1268
1.49/1.58 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.49/1.58 c propagation : 0.00 105 102 604 26.2 1 35.0 -
1.49/1.58 c infeasible LP : 0.01 251 249 1211 19.1 0 0.0 0
1.49/1.58 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.58 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.49/1.58 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.49/1.58 c applied globally : - - - 790 14.6 - - -
1.49/1.58 c applied locally : - - - 1 56.0 - - -
1.49/1.58 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.49/1.58 c cut pool : 0.00 5 - - 36 - (maximal pool size: 146)
1.49/1.58 c redcost : 0.00 821 0 52 0 0
1.49/1.58 c impliedbounds : 0.00 6 0 0 0 0
1.49/1.58 c intobj : 0.00 0 0 0 0 0
1.49/1.58 c cgmip : 0.00 0 0 0 0 0
1.49/1.58 c gomory : 0.02 6 0 0 43 0
1.49/1.58 c strongcg : 0.02 6 0 0 118 0
1.49/1.58 c cmir : 0.01 6 0 0 0 0
1.49/1.58 c flowcover : 0.01 6 0 0 0 0
1.49/1.58 c clique : 0.00 6 0 0 11 0
1.49/1.58 c zerohalf : 0.00 0 0 0 0 0
1.49/1.58 c mcf : 0.00 1 0 0 0 0
1.49/1.58 c rapidlearning : 0.01 1 0 0 0 0
1.49/1.58 c Pricers : Time Calls Vars
1.49/1.58 c problem variables: 0.00 0 0
1.49/1.58 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.49/1.58 c relpscost : 0.96 392 12 231 0 0 506
1.49/1.58 c pscost : 0.00 0 0 0 0 0 0
1.49/1.58 c inference : 0.00 350 0 0 0 0 707
1.49/1.58 c mostinf : 0.00 0 0 0 0 0 0
1.49/1.58 c leastinf : 0.00 0 0 0 0 0 0
1.49/1.58 c fullstrong : 0.00 0 0 0 0 0 0
1.49/1.58 c allfullstrong : 0.00 0 0 0 0 0 0
1.49/1.58 c random : 0.00 0 0 0 0 0 0
1.49/1.58 c Primal Heuristics : Time Calls Found
1.49/1.58 c LP solutions : 0.00 - 5
1.49/1.58 c pseudo solutions : 0.00 - 0
1.49/1.58 c oneopt : 0.00 6 0
1.49/1.58 c feaspump : 0.00 1 0
1.49/1.58 c veclendiving : 0.00 15 0
1.49/1.58 c linesearchdiving : 0.00 15 0
1.49/1.58 c coefdiving : 0.01 15 0
1.49/1.58 c pscostdiving : 0.00 15 0
1.49/1.58 c guideddiving : 0.00 15 0
1.49/1.58 c fracdiving : 0.01 16 0
1.49/1.58 c objpscostdiving : 0.00 9 0
1.49/1.58 c rootsoldiving : 0.00 10 0
1.49/1.58 c trivial : 0.00 2 0
1.49/1.58 c simplerounding : 0.00 350 0
1.49/1.58 c zirounding : 0.00 265 0
1.49/1.58 c rounding : 0.01 230 0
1.49/1.58 c shifting : 0.01 48 0
1.49/1.58 c intshifting : 0.00 0 0
1.49/1.58 c twoopt : 0.00 0 0
1.49/1.58 c fixandinfer : 0.00 0 0
1.49/1.58 c intdiving : 0.00 0 0
1.49/1.58 c actconsdiving : 0.00 0 0
1.49/1.58 c octane : 0.00 0 0
1.49/1.58 c rens : 0.02 1 0
1.49/1.58 c rins : 0.00 0 0
1.49/1.58 c localbranching : 0.00 0 0
1.49/1.58 c mutation : 0.00 0 0
1.49/1.58 c crossover : 0.01 1 0
1.49/1.58 c dins : 0.00 0 0
1.49/1.58 c undercover : 0.00 0 0
1.49/1.58 c nlp : 0.00 0 0
1.49/1.58 c trysol : 0.00 29 25
1.49/1.58 c LP : Time Calls Iterations Iter/call Iter/sec
1.49/1.58 c primal LP : 0.00 0 0 0.00 -
1.49/1.58 c dual LP : 0.33 764 12681 16.60 38024.56
1.49/1.58 c lex dual LP : 0.00 0 0 0.00 -
1.49/1.58 c barrier LP : 0.00 0 0 0.00 -
1.49/1.58 c diving/probing LP: 0.02 78 436 5.59 24660.63
1.49/1.58 c strong branching : 0.96 1258 42248 33.58 44098.09
1.49/1.58 c (at root node) : - 15 2884 192.27 -
1.49/1.58 c conflict analysis: 0.00 0 0 0.00 -
1.49/1.58 c B&B Tree :
1.49/1.58 c number of runs : 1
1.49/1.58 c nodes : 939
1.49/1.58 c nodes (total) : 939
1.49/1.58 c nodes left : 0
1.49/1.58 c max depth : 39
1.49/1.58 c max depth (total): 39
1.49/1.58 c backtracks : 241 (25.7%)
1.49/1.58 c delayed cutoffs : 99
1.49/1.58 c repropagations : 577 (2445 domain reductions, 35 cutoffs)
1.49/1.58 c avg switch length: 3.38
1.49/1.58 c switching time : 0.02
1.49/1.58 c Solution :
1.49/1.58 c Solutions found : 30 (6 improvements)
1.49/1.58 c First Solution : +1.33400000000000e+03 (in run 1, after 16 nodes, 0.28 seconds, depth 16, found by <trysol>)
1.49/1.58 c Primal Bound : +8.00000000000000e+01 (in run 1, after 291 nodes, 0.83 seconds, depth 16, found by <relaxation>)
1.49/1.58 c Dual Bound : +8.00000000000000e+01
1.49/1.58 c Gap : 0.00 %
1.49/1.58 c Root Dual Bound : +0.00000000000000e+00
1.49/1.58 c Root Iterations : 243
1.49/1.58 c Time complete: 1.58.