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-2705431-1278572942.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 | 121 | - |1059k| 0 | 46 | 223 | 112 | 223 | 79 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.05 c 0.0s| 1 | 0 | 155 | - |1261k| 0 | 56 | 223 | 112 | 223 | 86 | 28 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.07 c 0.1s| 1 | 0 | 281 | - |1514k| 0 | 58 | 223 | 112 | 223 | 94 | 36 | 0 | 0 | 0.000000e+00 | -- | Inf
0.07/0.09 c 0.1s| 1 | 0 | 295 | - |1807k| 0 | 57 | 223 | 112 | 223 | 97 | 39 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 328 | - |2110k| 0 | 67 | 223 | 112 | 223 | 100 | 42 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.12 c 0.1s| 1 | 0 | 344 | - |2244k| 0 | 70 | 223 | 112 | 223 | 104 | 46 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.12 o 1334
0.09/0.12 c y 0.1s| 1 | 0 | 344 | - |2247k| 0 | 70 | 223 | 112 | 223 | 104 | 46 | 0 | 0 | 0.000000e+00 | 1.334000e+03 | Inf
0.39/0.40 c 0.4s| 1 | 2 | 344 | - |2248k| 0 | 70 | 223 | 112 | 223 | 104 | 46 | 0 | 15 | 0.000000e+00 | 1.334000e+03 | Inf
0.49/0.57 o 201
0.49/0.57 c * 0.6s| 9 | 7 | 899 | 69.4 |2272k| 8 | - | 223 | 112 | 223 | 97 | 51 | 0 | 113 | 0.000000e+00 | 2.010000e+02 | Inf
0.79/0.84 o 191
0.79/0.84 c * 0.8s| 20 | 13 | 1392 | 55.2 |2302k| 10 | - | 223 | 112 | 223 | 95 | 54 | 0 | 258 | 0.000000e+00 | 1.910000e+02 | Inf
0.88/0.90 o 183
0.88/0.90 c * 0.9s| 27 | 16 | 1589 | 47.9 |2323k| 10 | - | 223 | 114 | 223 | 97 | 59 | 2 | 319 | 0.000000e+00 | 1.830000e+02 | Inf
1.00/1.05 o 152
1.00/1.05 c * 1.0s| 48 | 27 | 1897 | 33.0 |2354k| 15 | - | 223 | 120 | 223 | 94 | 68 | 8 | 454 | 0.000000e+00 | 1.520000e+02 | Inf
1.10/1.17 o 148
1.10/1.17 c * 1.2s| 67 | 39 | 2337 | 30.2 |2387k| 17 | - | 223 | 128 | 223 | 102 | 79 | 16 | 546 | 0.000000e+00 | 1.480000e+02 | Inf
1.10/1.19 o 142
1.10/1.19 c * 1.2s| 75 | 45 | 2408 | 27.9 |2402k| 17 | - | 223 | 128 | 223 | 92 | 80 | 16 | 567 | 0.000000e+00 | 1.420000e+02 | Inf
1.10/1.19 o 97
1.10/1.19 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
1.10/1.19 c * 1.2s| 76 | 20 | 2412 | 27.6 |2378k| 17 | - | 223 | 128 | 223 | 94 | 82 | 16 | 567 | 0.000000e+00 | 9.700000e+01 | Inf
1.29/1.31 o 80
1.29/1.31 c * 1.3s| 88 | 20 | 2700 | 27.1 |2387k| 17 | - | 223 | 131 | 223 | 93 | 83 | 21 | 661 | 0.000000e+00 | 8.000000e+01 | Inf
1.89/1.97 c
1.89/1.97 c SCIP Status : problem is solved [optimal solution found]
1.89/1.97 c Solving Time (sec) : 1.97
1.89/1.97 c Solving Nodes : 317
1.89/1.97 c Primal Bound : +8.00000000000000e+01 (13 solutions)
1.89/1.97 c Dual Bound : +8.00000000000000e+01
1.89/1.97 c Gap : 0.00 %
1.89/1.97 s OPTIMUM FOUND
1.89/1.97 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 x154 -x153 -x152 -x151 -x150 -x149 -x148
1.89/1.97 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
1.89/1.97 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 x107 -x106
1.89/1.97 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.89/1.97 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.89/1.97 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.89/1.97 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.89/1.97 v -x4 -x3 -x2 -x1
1.89/1.97 c SCIP Status : problem is solved [optimal solution found]
1.89/1.97 c Solving Time : 1.97
1.89/1.97 c Original Problem :
1.89/1.97 c Problem name : HOME/instance-2705431-1278572942.wbo
1.89/1.97 c Variables : 225 (197 binary, 0 integer, 28 implicit integer, 0 continuous)
1.89/1.97 c Constraints : 130 initial, 130 maximal
1.89/1.97 c Presolved Problem :
1.89/1.97 c Problem name : t_HOME/instance-2705431-1278572942.wbo
1.89/1.97 c Variables : 223 (196 binary, 0 integer, 27 implicit integer, 0 continuous)
1.89/1.97 c Constraints : 112 initial, 405 maximal
1.89/1.97 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.89/1.97 c trivial : 0.00 0 0 0 0 0 0 0 0
1.89/1.97 c dualfix : 0.00 2 0 0 0 0 0 0 0
1.89/1.97 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.89/1.97 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.89/1.97 c implics : 0.00 0 0 0 0 0 0 0 0
1.89/1.97 c probing : 0.01 0 0 0 0 0 0 0 0
1.89/1.97 c setppc : 0.00 0 0 0 0 0 0 0 0
1.89/1.97 c linear : 0.00 0 0 0 27 0 17 1 0
1.89/1.97 c indicator : 0.00 0 0 0 0 0 1 0 0
1.89/1.97 c logicor : 0.00 0 0 0 0 0 0 0 0
1.89/1.97 c bounddisjunction : 0.00 0 0 0 0 0 0 0 0
1.89/1.97 c root node : - 12 - - 12 - - - -
1.89/1.97 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.89/1.97 c integral : 0 0 0 313 0 4 137 0 0 178
1.89/1.97 c setppc : 51 6 1303 151 0 3 2688 0 0 0
1.89/1.97 c linear : 27 6 1303 152 0 7 846 100 0 0
1.89/1.97 c indicator : 27 0 1301 157 0 1 655 0 0 0
1.89/1.97 c logicor : 7+ 6 525 110 0 9 139 0 0 0
1.89/1.97 c bounddisjunction : 0+ 0 240 0 0 2 13 0 0 0
1.89/1.97 c countsols : 0 0 0 116 0 0 0 0 0 0
1.89/1.97 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.89/1.97 c integral : 1.49 0.00 0.00 1.49 0.00
1.89/1.97 c setppc : 0.00 0.00 0.00 0.00 0.00
1.89/1.97 c linear : 0.01 0.00 0.01 0.00 0.00
1.89/1.97 c indicator : 0.00 0.00 0.00 0.00 0.00
1.89/1.97 c logicor : 0.00 0.00 0.00 0.00 0.00
1.89/1.97 c bounddisjunction : 0.00 0.00 0.00 0.00 0.00
1.89/1.97 c countsols : 0.00 0.00 0.00 0.00 0.00
1.89/1.97 c Propagators : Time Calls Cutoffs DomReds
1.89/1.97 c vbounds : 0.00 210 0 18
1.89/1.97 c rootredcost : 0.00 9 0 6
1.89/1.97 c pseudoobj : 0.00 1116 4 555
1.89/1.97 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.89/1.97 c propagation : 0.00 25 23 94 19.5 0 0.0 -
1.89/1.97 c infeasible LP : 0.01 103 103 413 18.6 0 0.0 0
1.89/1.97 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.97 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.89/1.97 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.89/1.97 c applied globally : - - - 299 14.8 - - -
1.89/1.97 c applied locally : - - - 0 0.0 - - -
1.89/1.97 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.89/1.97 c cut pool : 0.00 5 - - 42 - (maximal pool size: 363)
1.89/1.97 c redcost : 0.00 325 0 12 0 0
1.89/1.97 c impliedbounds : 0.00 6 0 0 0 0
1.89/1.97 c intobj : 0.00 0 0 0 0 0
1.89/1.97 c cgmip : 0.00 0 0 0 0 0
1.89/1.97 c gomory : 0.02 6 0 0 44 0
1.89/1.97 c strongcg : 0.02 6 0 0 332 0
1.89/1.97 c cmir : 0.00 6 0 0 0 0
1.89/1.97 c flowcover : 0.02 6 0 0 0 0
1.89/1.97 c clique : 0.00 6 0 0 17 0
1.89/1.97 c zerohalf : 0.00 0 0 0 0 0
1.89/1.97 c mcf : 0.00 1 0 0 0 0
1.89/1.97 c rapidlearning : 0.01 1 0 0 0 0
1.89/1.97 c Pricers : Time Calls Vars
1.89/1.97 c problem variables: 0.00 0 0
1.89/1.97 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.89/1.97 c relpscost : 1.49 156 4 137 0 0 178
1.89/1.97 c pscost : 0.00 0 0 0 0 0 0
1.89/1.97 c inference : 0.00 108 0 0 0 0 219
1.89/1.97 c mostinf : 0.00 0 0 0 0 0 0
1.89/1.97 c leastinf : 0.00 0 0 0 0 0 0
1.89/1.97 c fullstrong : 0.00 0 0 0 0 0 0
1.89/1.97 c allfullstrong : 0.00 0 0 0 0 0 0
1.89/1.97 c random : 0.00 0 0 0 0 0 0
1.89/1.97 c Primal Heuristics : Time Calls Found
1.89/1.97 c LP solutions : 0.00 - 8
1.89/1.97 c pseudo solutions : 0.00 - 0
1.89/1.97 c oneopt : 0.01 8 0
1.89/1.97 c veclendiving : 0.00 2 0
1.89/1.97 c linesearchdiving : 0.00 2 0
1.89/1.97 c guideddiving : 0.00 2 0
1.89/1.97 c feaspump : 0.00 1 0
1.89/1.97 c coefdiving : 0.00 3 0
1.89/1.97 c pscostdiving : 0.00 3 0
1.89/1.97 c fracdiving : 0.00 3 0
1.89/1.97 c objpscostdiving : 0.00 2 0
1.89/1.97 c rootsoldiving : 0.00 2 0
1.89/1.97 c trivial : 0.00 2 0
1.89/1.97 c simplerounding : 0.00 100 0
1.89/1.97 c zirounding : 0.00 93 0
1.89/1.97 c rounding : 0.00 125 0
1.89/1.97 c shifting : 0.01 17 0
1.89/1.97 c intshifting : 0.00 0 0
1.89/1.97 c twoopt : 0.00 0 0
1.89/1.97 c fixandinfer : 0.00 0 0
1.89/1.97 c intdiving : 0.00 0 0
1.89/1.97 c actconsdiving : 0.00 0 0
1.89/1.97 c octane : 0.00 0 0
1.89/1.97 c rens : 0.04 1 0
1.89/1.97 c rins : 0.00 0 0
1.89/1.97 c localbranching : 0.00 0 0
1.89/1.97 c mutation : 0.00 0 0
1.89/1.97 c crossover : 0.01 1 0
1.89/1.97 c dins : 0.00 0 0
1.89/1.97 c undercover : 0.00 0 0
1.89/1.97 c nlp : 0.00 0 0
1.89/1.97 c trysol : 0.00 7 5
1.89/1.97 c LP : Time Calls Iterations Iter/call Iter/sec
1.89/1.97 c primal LP : 0.00 0 0 0.00 -
1.89/1.97 c dual LP : 0.25 326 8419 25.83 33365.30
1.89/1.97 c lex dual LP : 0.00 0 0 0.00 -
1.89/1.97 c barrier LP : 0.00 0 0 0.00 -
1.89/1.97 c diving/probing LP: 0.01 26 323 12.42 26082.04
1.89/1.97 c strong branching : 1.49 983 53189 54.11 35812.83
1.89/1.97 c (at root node) : - 15 6449 429.93 -
1.89/1.97 c conflict analysis: 0.00 0 0 0.00 -
1.89/1.97 c B&B Tree :
1.89/1.97 c number of runs : 1
1.89/1.97 c nodes : 317
1.89/1.97 c nodes (total) : 317
1.89/1.97 c nodes left : 0
1.89/1.97 c max depth : 29
1.89/1.97 c max depth (total): 29
1.89/1.97 c backtracks : 95 (30.0%)
1.89/1.97 c delayed cutoffs : 49
1.89/1.97 c repropagations : 291 (1347 domain reductions, 14 cutoffs)
1.89/1.97 c avg switch length: 4.12
1.89/1.97 c switching time : 0.01
1.89/1.97 c Solution :
1.89/1.97 c Solutions found : 13 (9 improvements)
1.89/1.97 c First Solution : +1.33400000000000e+03 (in run 1, after 1 nodes, 0.12 seconds, depth 0, found by <trysol>)
1.89/1.97 c Primal Bound : +8.00000000000000e+01 (in run 1, after 88 nodes, 1.31 seconds, depth 10, found by <relaxation>)
1.89/1.97 c Dual Bound : +8.00000000000000e+01
1.89/1.97 c Gap : 0.00 %
1.89/1.97 c Root Dual Bound : +0.00000000000000e+00
1.89/1.97 c Root Iterations : 344
1.89/1.97 c Time complete: 1.97.