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-2705272-1278572930.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.02/0.04 c 0.0s| 1 | 0 | 131 | - |1059k| 0 | 49 | 223 | 112 | 223 | 79 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.02/0.05 c 0.0s| 1 | 0 | 149 | - |1313k| 0 | 56 | 223 | 112 | 223 | 89 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.02/0.06 c 0.1s| 1 | 0 | 174 | - |1470k| 0 | 61 | 223 | 112 | 223 | 93 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.02/0.08 c 0.1s| 1 | 0 | 189 | - |1611k| 0 | 64 | 223 | 112 | 223 | 99 | 41 | 0 | 0 | 0.000000e+00 | -- | Inf
0.02/0.09 c 0.1s| 1 | 0 | 221 | - |1741k| 0 | 72 | 223 | 112 | 223 | 100 | 42 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 234 | - |1796k| 0 | 72 | 223 | 112 | 223 | 101 | 43 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 2 | 234 | - |1796k| 0 | 72 | 223 | 112 | 223 | 101 | 43 | 0 | 14 | 0.000000e+00 | -- | Inf
0.39/0.42 o 1334
0.39/0.42 c y 0.4s| 15 | 14 | 643 | 29.2 |1825k| 13 | - | 223 | 112 | 0 | 0 | 46 | 0 | 126 | 0.000000e+00 | 1.334000e+03 | Inf
0.69/0.77 o 181
0.69/0.77 c * 0.8s| 53 | 33 | 1252 | 19.6 |1874k| 16 | - | 223 | 112 | 223 | 97 | 57 | 0 | 402 | 0.000000e+00 | 1.810000e+02 | Inf
0.79/0.87 o 175
0.79/0.87 c * 0.9s| 63 | 35 | 1567 | 21.5 |1903k| 16 | - | 223 | 113 | 223 | 93 | 62 | 1 | 518 | 0.000000e+00 | 1.750000e+02 | Inf
0.99/1.03 o 155
0.99/1.03 c * 1.0s| 108 | 50 | 2077 | 17.2 |1957k| 18 | - | 223 | 133 | 223 | 97 | 70 | 21 | 751 | 0.000000e+00 | 1.550000e+02 | Inf
0.99/1.06 o 150
0.99/1.06 c * 1.1s| 129 | 59 | 2219 | 15.5 |1972k| 22 | - | 223 | 136 | 223 | 96 | 70 | 24 | 800 | 0.000000e+00 | 1.500000e+02 | Inf
0.99/1.07 o 148
0.99/1.07 c * 1.1s| 137 | 61 | 2289 | 15.1 |1986k| 24 | - | 223 | 139 | 223 | 96 | 71 | 27 | 820 | 0.000000e+00 | 1.480000e+02 | Inf
1.09/1.11 o 80
1.09/1.11 c * 1.1s| 181 | 44 | 2560 | 12.9 |1969k| 31 | - | 223 | 152 | 223 | 97 | 84 | 40 | 870 | 0.000000e+00 | 8.000000e+01 | Inf
1.09/1.15 c
1.09/1.15 c SCIP Status : problem is solved [optimal solution found]
1.09/1.15 c Solving Time (sec) : 1.15
1.09/1.15 c Solving Nodes : 191
1.09/1.15 c Primal Bound : +8.00000000000000e+01 (9 solutions)
1.09/1.15 c Dual Bound : +8.00000000000000e+01
1.09/1.15 c Gap : 0.00 %
1.09/1.15 s OPTIMUM FOUND
1.09/1.15 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 x161 -x160 -x159 -x158 -x157 -x156 -x155 x154 -x153 -x152 -x151 -x150 -x149 -x148
1.09/1.15 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
1.09/1.15 v -x126 -x125 -x124 -x123 -x122 -x121 x120 -x119 -x118 -x117 x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106
1.09/1.15 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.09/1.15 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 -x56
1.09/1.15 v -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.09/1.15 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.09/1.15 v -x4 -x3 x2 -x1
1.09/1.15 c SCIP Status : problem is solved [optimal solution found]
1.09/1.15 c Solving Time : 1.15
1.09/1.15 c Original Problem :
1.09/1.15 c Problem name : HOME/instance-2705272-1278572930.wbo
1.09/1.15 c Variables : 225 (197 binary, 0 integer, 28 implicit integer, 0 continuous)
1.09/1.15 c Constraints : 130 initial, 130 maximal
1.09/1.15 c Presolved Problem :
1.09/1.15 c Problem name : t_HOME/instance-2705272-1278572930.wbo
1.09/1.15 c Variables : 223 (196 binary, 0 integer, 27 implicit integer, 0 continuous)
1.09/1.15 c Constraints : 112 initial, 162 maximal
1.09/1.15 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.09/1.15 c trivial : 0.00 0 0 0 0 0 0 0 0
1.09/1.15 c dualfix : 0.00 2 0 0 0 0 0 0 0
1.09/1.15 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.09/1.15 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.09/1.15 c implics : 0.00 0 0 0 0 0 0 0 0
1.09/1.15 c probing : 0.01 0 0 0 0 0 0 0 0
1.09/1.15 c setppc : 0.00 0 0 0 0 0 0 0 0
1.09/1.15 c linear : 0.00 0 0 0 27 0 17 1 0
1.09/1.15 c indicator : 0.00 0 0 0 0 0 1 0 0
1.09/1.15 c logicor : 0.00 0 0 0 0 0 0 0 0
1.09/1.15 c bounddisjunction : 0.00 0 0 0 0 0 0 0 0
1.09/1.15 c root node : - 14 - - 14 - - - -
1.09/1.15 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.09/1.15 c integral : 0 0 0 197 0 1 47 0 0 206
1.09/1.15 c setppc : 51 6 815 66 0 13 1473 0 0 0
1.09/1.15 c linear : 27 6 802 66 0 8 683 50 0 0
1.09/1.15 c indicator : 27 0 801 70 0 9 431 0 0 0
1.09/1.15 c logicor : 7+ 6 282 46 0 3 56 0 0 0
1.09/1.15 c bounddisjunction : 0+ 0 58 0 0 0 1 0 0 0
1.09/1.15 c countsols : 0 0 0 49 0 0 0 0 0 0
1.09/1.15 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.09/1.15 c integral : 0.87 0.00 0.00 0.87 0.00
1.09/1.15 c setppc : 0.00 0.00 0.00 0.00 0.00
1.09/1.15 c linear : 0.01 0.00 0.01 0.00 0.00
1.09/1.15 c indicator : 0.00 0.00 0.00 0.00 0.00
1.09/1.15 c logicor : 0.00 0.00 0.00 0.00 0.00
1.09/1.15 c bounddisjunction : 0.00 0.00 0.00 0.00 0.00
1.09/1.15 c countsols : 0.00 0.00 0.00 0.00 0.00
1.09/1.15 c Propagators : Time Calls Cutoffs DomReds
1.09/1.15 c vbounds : 0.00 177 0 38
1.09/1.15 c rootredcost : 0.00 7 0 6
1.09/1.15 c pseudoobj : 0.00 623 1 380
1.09/1.15 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.09/1.15 c propagation : 0.00 25 25 182 25.4 1 12.0 -
1.09/1.15 c infeasible LP : 0.00 13 11 35 21.2 0 0.0 0
1.09/1.15 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.09/1.15 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.09/1.15 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.09/1.15 c applied globally : - - - 59 13.4 - - -
1.09/1.15 c applied locally : - - - 0 0.0 - - -
1.09/1.15 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.09/1.15 c cut pool : 0.00 5 - - 64 - (maximal pool size: 259)
1.09/1.15 c redcost : 0.00 213 0 28 0 0
1.09/1.15 c impliedbounds : 0.00 6 0 0 0 0
1.09/1.15 c intobj : 0.00 0 0 0 0 0
1.09/1.15 c cgmip : 0.00 0 0 0 0 0
1.09/1.15 c gomory : 0.02 6 0 0 53 0
1.09/1.15 c strongcg : 0.02 6 0 0 220 0
1.09/1.15 c cmir : 0.00 6 0 0 0 0
1.09/1.15 c flowcover : 0.03 6 0 0 0 0
1.09/1.15 c clique : 0.00 6 0 0 12 0
1.09/1.15 c zerohalf : 0.00 0 0 0 0 0
1.09/1.15 c mcf : 0.00 1 0 0 0 0
1.09/1.15 c rapidlearning : 0.01 1 0 0 0 0
1.09/1.15 c Pricers : Time Calls Vars
1.09/1.15 c problem variables: 0.00 0 0
1.09/1.15 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.09/1.15 c relpscost : 0.87 127 1 47 0 0 206
1.09/1.15 c pscost : 0.00 0 0 0 0 0 0
1.09/1.15 c inference : 0.00 43 0 0 0 0 87
1.09/1.15 c mostinf : 0.00 0 0 0 0 0 0
1.09/1.15 c leastinf : 0.00 0 0 0 0 0 0
1.09/1.15 c fullstrong : 0.00 0 0 0 0 0 0
1.09/1.15 c allfullstrong : 0.00 0 0 0 0 0 0
1.09/1.15 c random : 0.00 0 0 0 0 0 0
1.09/1.15 c Primal Heuristics : Time Calls Found
1.09/1.15 c LP solutions : 0.00 - 6
1.09/1.15 c pseudo solutions : 0.00 - 0
1.09/1.15 c crossover : 0.00 0 0
1.09/1.15 c feaspump : 0.00 1 0
1.09/1.15 c veclendiving : 0.00 3 0
1.09/1.15 c linesearchdiving : 0.00 3 0
1.09/1.15 c coefdiving : 0.00 3 0
1.09/1.15 c pscostdiving : 0.00 3 0
1.09/1.15 c fracdiving : 0.00 3 0
1.09/1.15 c objpscostdiving : 0.00 3 0
1.09/1.15 c rootsoldiving : 0.00 3 0
1.09/1.15 c trivial : 0.00 2 0
1.09/1.15 c simplerounding : 0.00 101 0
1.09/1.15 c zirounding : 0.00 104 0
1.09/1.15 c rounding : 0.00 118 0
1.09/1.15 c shifting : 0.00 20 0
1.09/1.15 c intshifting : 0.00 0 0
1.09/1.15 c oneopt : 0.00 7 0
1.09/1.15 c twoopt : 0.00 0 0
1.09/1.15 c fixandinfer : 0.00 0 0
1.09/1.15 c intdiving : 0.00 0 0
1.09/1.15 c actconsdiving : 0.00 0 0
1.09/1.15 c guideddiving : 0.00 3 0
1.09/1.15 c octane : 0.00 0 0
1.09/1.15 c rens : 0.02 1 0
1.09/1.15 c rins : 0.00 0 0
1.09/1.15 c localbranching : 0.00 0 0
1.09/1.15 c mutation : 0.00 0 0
1.09/1.15 c dins : 0.00 0 0
1.09/1.15 c undercover : 0.00 0 0
1.09/1.15 c nlp : 0.00 0 0
1.09/1.15 c trysol : 0.00 3 3
1.09/1.15 c LP : Time Calls Iterations Iter/call Iter/sec
1.09/1.15 c primal LP : 0.00 0 0 0.00 -
1.09/1.15 c dual LP : 0.11 184 3803 20.67 34283.19
1.09/1.15 c lex dual LP : 0.00 0 0 0.00 -
1.09/1.15 c barrier LP : 0.00 0 0 0.00 -
1.09/1.15 c diving/probing LP: 0.01 24 182 7.58 -
1.09/1.15 c strong branching : 0.87 872 30850 35.38 35554.58
1.09/1.15 c (at root node) : - 14 5411 386.50 -
1.09/1.15 c conflict analysis: 0.00 0 0 0.00 -
1.09/1.15 c B&B Tree :
1.09/1.15 c number of runs : 1
1.09/1.15 c nodes : 191
1.09/1.15 c nodes (total) : 191
1.09/1.15 c nodes left : 0
1.09/1.15 c max depth : 31
1.09/1.15 c max depth (total): 31
1.09/1.15 c backtracks : 32 (16.8%)
1.09/1.15 c delayed cutoffs : 39
1.09/1.15 c repropagations : 83 (345 domain reductions, 7 cutoffs)
1.09/1.15 c avg switch length: 3.04
1.09/1.15 c switching time : 0.00
1.09/1.15 c Solution :
1.09/1.15 c Solutions found : 9 (7 improvements)
1.09/1.15 c First Solution : +1.33400000000000e+03 (in run 1, after 14 nodes, 0.42 seconds, depth 14, found by <trysol>)
1.09/1.15 c Primal Bound : +8.00000000000000e+01 (in run 1, after 181 nodes, 1.11 seconds, depth 31, found by <relaxation>)
1.09/1.15 c Dual Bound : +8.00000000000000e+01
1.09/1.15 c Gap : 0.00 %
1.09/1.15 c Root Dual Bound : +0.00000000000000e+00
1.09/1.15 c Root Iterations : 234
1.09/1.16 c Time complete: 1.15.