0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
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-2704230-1278550135.opb>
0.00/0.01 c original problem has 198 variables (198 bin, 0 int, 0 impl, 0 cont) and 166 constraints
0.00/0.01 c problem read
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 166 upgd conss, 0 impls, 23 clqs
0.00/0.03 c presolving (2 rounds):
0.00/0.03 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 0 implications, 23 cliques
0.00/0.03 c presolved problem has 198 variables (198 bin, 0 int, 0 impl, 0 cont) and 166 constraints
0.00/0.03 c 23 constraints of type <setppc>
0.00/0.03 c 143 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.01
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.3
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1789.99
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = 5
0.00/0.03 c
0.00/0.03 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/indicator/addCouplingCons = TRUE
0.00/0.03 c
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = FALSE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = -1
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = 750
0.00/0.03 c
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = 100
0.00/0.03 c
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = 0.15
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixed
0.00/0.03 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = 0.5
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/feaspump/freq = -1
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/fracdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/guideddiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/intshifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/linesearchdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/nlp/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/objpscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03 c # [type: real, range: [0,1], default: 0.01]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/oneopt/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/pscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/rens/freq = -1
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixable
0.00/0.03 c # [type: real, range: [0,1], default: 0.5]
0.00/0.03 c heuristics/rens/minfixingrate = 0.3
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/rens/nodesofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/rootsoldiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/rounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/shifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/simplerounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/trivial/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/trysol/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/veclendiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/zirounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/cmir/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/flowcover/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.03 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.03 c 0.0s| 1 | 0 | 85 | - | 800k| 0 | 69 | 198 | 166 | 198 | 166 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.10/0.15 c 0.1s| 1 | 0 | 125 | - |1069k| 0 | 77 | 198 | 241 | 198 | 171 | 5 | 0 | 0 | 0.000000e+00 | -- | Inf
0.10/0.18 c 0.2s| 1 | 0 | 215 | - |1209k| 0 | 64 | 198 | 241 | 198 | 179 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 314 | - |1458k| 0 | 55 | 198 | 241 | 198 | 187 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 390 | - |1661k| 0 | 55 | 198 | 241 | 198 | 193 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.3s| 1 | 0 | 461 | - |1792k| 0 | 44 | 198 | 241 | 198 | 199 | 33 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.30 c 0.3s| 1 | 2 | 461 | - |1793k| 0 | 44 | 198 | 241 | 198 | 199 | 33 | 0 | 11 | 0.000000e+00 | -- | Inf
0.49/0.58 c * 0.6s| 29 | 0 | 597 | 4.9 |1859k| 28 | - | 198 | 241 | 198 | 183 | 33 | 0 | 308 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.49/0.58 c
0.49/0.58 c SCIP Status : problem is solved [optimal solution found]
0.49/0.58 c Solving Time (sec) : 0.56
0.49/0.58 c Solving Nodes : 29
0.49/0.58 c Primal Bound : +0.00000000000000e+00 (1 solutions)
0.49/0.58 c Dual Bound : +0.00000000000000e+00
0.49/0.58 c Gap : 0.00 %
0.49/0.58 s SATISFIABLE
0.49/0.58 v -x24 x22 -x5 -x2 -x10 -x83 -x82 -x81 -x48 -x46 -x39 -x18 -x3 -x11 -x36 -x31 -x30 -x29 -x28 -x27 -x25 -x17 -x34 -x47 -x7 -x84 -x43
0.49/0.58 v -x77 -x6 -x23 -x74 -x44 -x4 -x15 x38 -x186 -x185 x184 -x183 -x182 -x181 -x80 -x132 -x131 -x130 -x128 -x127 -x126 -x124 -x122
0.49/0.58 v -x121 -x13 -x78 -x35 -x21 -x12 -x1 -x59 -x58 -x56 -x55 -x54 -x53 x52 -x51 -x49 -x19 -x60 -x162 -x161 -x160 -x159 -x158 -x42
0.49/0.58 v -x40 -x50 -x125 -x20 -x14 -x168 -x167 -x166 -x165 x164 -x163 -x79 -x71 -x70 -x69 x67 -x66 -x64 -x62 x108 -x107 -x106 -x105
0.49/0.58 v -x104 -x103 -x102 -x101 -x99 -x97 -x75 -x96 x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x129 -x65 -x33 -x198 -x197 -x196
0.49/0.58 v -x195 -x194 x193 -x72 -x68 -x37 -x45 -x26 -x8 -x192 -x191 -x190 x189 -x188 -x187 x9 -x63 -x157 x156 -x155 -x154 -x153 -x41
0.49/0.58 v -x180 x179 -x178 -x177 -x176 -x175 -x57 -x61 x142 -x141 -x140 -x139 -x138 -x98 -x120 -x119 -x118 -x117 -x116 -x115 -x114 x113
0.49/0.58 v -x112 -x111 -x110 -x147 -x146 -x145 -x144 x143 x123 -x100 -x16 -x109 x73 -x137 -x136 -x135 x134 -x133 -x85 x174 -x173 -x172
0.49/0.58 v -x171 -x170 -x169 x32 -x152 -x151 x150 -x149 -x148 -x76
0.49/0.58 c SCIP Status : problem is solved [optimal solution found]
0.49/0.58 c Solving Time : 0.56
0.49/0.58 c Original Problem :
0.49/0.58 c Problem name : HOME/instance-2704230-1278550135.opb
0.49/0.58 c Variables : 198 (198 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.58 c Constraints : 166 initial, 166 maximal
0.49/0.58 c Presolved Problem :
0.49/0.58 c Problem name : t_HOME/instance-2704230-1278550135.opb
0.49/0.58 c Variables : 198 (198 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.58 c Constraints : 166 initial, 241 maximal
0.49/0.58 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.49/0.58 c trivial : 0.00 0 0 0 0 0 0 0 0
0.49/0.58 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.49/0.58 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.49/0.58 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.49/0.58 c implics : 0.00 0 0 0 0 0 0 0 0
0.49/0.58 c probing : 0.00 0 0 0 0 0 0 0 0
0.49/0.58 c setppc : 0.00 0 0 0 0 0 0 0 0
0.49/0.58 c linear : 0.00 0 0 0 0 0 0 0 0
0.49/0.58 c logicor : 0.00 0 0 0 0 0 0 0 0
0.49/0.58 c root node : - 0 - - 0 - - - -
0.49/0.58 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.49/0.58 c integral : 0 0 0 31 0 0 3 0 0 56
0.49/0.58 c setppc : 23 5 48 1 0 0 125 0 0 0
0.49/0.58 c linear : 0+ 5 46 0 0 0 0 0 0 0
0.49/0.58 c logicor : 143 5 30 1 0 0 13 0 0 0
0.49/0.58 c countsols : 0 0 0 1 0 0 0 0 0 0
0.49/0.58 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.49/0.58 c integral : 0.28 0.00 0.00 0.28 0.00
0.49/0.58 c setppc : 0.00 0.00 0.00 0.00 0.00
0.49/0.58 c linear : 0.00 0.00 0.00 0.00 0.00
0.49/0.58 c logicor : 0.00 0.00 0.00 0.00 0.00
0.49/0.58 c countsols : 0.00 0.00 0.00 0.00 0.00
0.49/0.58 c Propagators : Time Calls Cutoffs DomReds
0.49/0.58 c vbounds : 0.00 1 0 0
0.49/0.58 c rootredcost : 0.00 0 0 0
0.49/0.58 c pseudoobj : 0.00 0 0 0
0.49/0.58 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.58 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.58 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.58 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.58 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.58 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.58 c applied globally : - - - 0 0.0 - - -
0.49/0.58 c applied locally : - - - 0 0.0 - - -
0.49/0.58 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.49/0.58 c cut pool : 0.00 4 - - 0 - (maximal pool size: 308)
0.49/0.58 c redcost : 0.00 33 0 0 0 0
0.49/0.58 c impliedbounds : 0.00 5 0 0 0 0
0.49/0.58 c intobj : 0.00 0 0 0 0 0
0.49/0.58 c cgmip : 0.00 0 0 0 0 0
0.49/0.58 c gomory : 0.06 5 0 0 642 0
0.49/0.58 c strongcg : 0.05 5 0 0 756 0
0.49/0.58 c cmir : 0.00 0 0 0 0 0
0.49/0.58 c flowcover : 0.00 0 0 0 0 0
0.49/0.58 c clique : 0.00 5 0 0 0 0
0.49/0.58 c zerohalf : 0.00 0 0 0 0 0
0.49/0.58 c mcf : 0.00 1 0 0 0 0
0.49/0.58 c rapidlearning : 0.09 1 0 0 0 75
0.49/0.58 c Pricers : Time Calls Vars
0.49/0.58 c problem variables: 0.00 0 0
0.49/0.58 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.49/0.58 c relpscost : 0.28 30 0 3 0 0 56
0.49/0.58 c pscost : 0.00 0 0 0 0 0 0
0.49/0.58 c inference : 0.00 0 0 0 0 0 0
0.49/0.58 c mostinf : 0.00 0 0 0 0 0 0
0.49/0.58 c leastinf : 0.00 0 0 0 0 0 0
0.49/0.58 c fullstrong : 0.00 0 0 0 0 0 0
0.49/0.58 c allfullstrong : 0.00 0 0 0 0 0 0
0.49/0.58 c random : 0.00 0 0 0 0 0 0
0.49/0.58 c Primal Heuristics : Time Calls Found
0.49/0.58 c LP solutions : 0.00 - 1
0.49/0.58 c pseudo solutions : 0.00 - 0
0.49/0.58 c trivial : 0.00 1 0
0.49/0.58 c simplerounding : 0.00 0 0
0.49/0.58 c zirounding : 0.00 0 0
0.49/0.58 c rounding : 0.00 0 0
0.49/0.58 c shifting : 0.00 0 0
0.49/0.58 c intshifting : 0.00 0 0
0.49/0.58 c oneopt : 0.00 0 0
0.49/0.58 c twoopt : 0.00 0 0
0.49/0.58 c fixandinfer : 0.00 0 0
0.49/0.58 c feaspump : 0.00 0 0
0.49/0.58 c coefdiving : 0.00 0 0
0.49/0.58 c pscostdiving : 0.00 0 0
0.49/0.58 c fracdiving : 0.00 0 0
0.49/0.58 c veclendiving : 0.00 0 0
0.49/0.58 c intdiving : 0.00 0 0
0.49/0.58 c actconsdiving : 0.00 0 0
0.49/0.58 c objpscostdiving : 0.00 0 0
0.49/0.58 c rootsoldiving : 0.00 0 0
0.49/0.58 c linesearchdiving : 0.00 0 0
0.49/0.58 c guideddiving : 0.00 0 0
0.49/0.58 c octane : 0.00 0 0
0.49/0.58 c rens : 0.00 0 0
0.49/0.58 c rins : 0.00 0 0
0.49/0.58 c localbranching : 0.00 0 0
0.49/0.58 c mutation : 0.00 0 0
0.49/0.58 c crossover : 0.00 0 0
0.49/0.58 c dins : 0.00 0 0
0.49/0.58 c undercover : 0.00 0 0
0.49/0.58 c nlp : 0.00 0 0
0.49/0.58 c trysol : 0.00 0 0
0.49/0.58 c LP : Time Calls Iterations Iter/call Iter/sec
0.49/0.58 c primal LP : 0.00 0 0 0.00 -
0.49/0.58 c dual LP : 0.05 36 597 16.58 11706.11
0.49/0.58 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.58 c barrier LP : 0.00 0 0 0.00 -
0.49/0.58 c diving/probing LP: 0.00 0 0 0.00 -
0.49/0.58 c strong branching : 0.27 308 2861 9.29 10441.64
0.49/0.58 c (at root node) : - 11 272 24.73 -
0.49/0.58 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.58 c B&B Tree :
0.49/0.58 c number of runs : 1
0.49/0.58 c nodes : 29
0.49/0.58 c nodes (total) : 29
0.49/0.58 c nodes left : 0
0.49/0.58 c max depth : 28
0.49/0.58 c max depth (total): 28
0.49/0.58 c backtracks : 0 (0.0%)
0.49/0.58 c delayed cutoffs : 0
0.49/0.58 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.49/0.58 c avg switch length: 2.00
0.49/0.58 c switching time : 0.00
0.49/0.58 c Solution :
0.49/0.58 c Solutions found : 1 (1 improvements)
0.49/0.58 c First Solution : +0.00000000000000e+00 (in run 1, after 29 nodes, 0.56 seconds, depth 28, found by <relaxation>)
0.49/0.58 c Primal Bound : +0.00000000000000e+00 (in run 1, after 29 nodes, 0.56 seconds, depth 28, found by <relaxation>)
0.49/0.58 c Dual Bound : +0.00000000000000e+00
0.49/0.58 c Gap : 0.00 %
0.49/0.58 c Root Dual Bound : +0.00000000000000e+00
0.49/0.58 c Root Iterations : 461
0.49/0.59 c Time complete: 0.58.