0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [Expressions interpreter: NONE]
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-2665697-1276268893.opb>
0.00/0.02 c original problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 470 constraints
0.00/0.02 c problem read
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.03 c (round 1) 3 del vars, 1 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 256 impls, 0 clqs
0.00/0.03 c (round 2) 13 del vars, 17 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 256 impls, 0 clqs
0.00/0.03 c (round 3) 13 del vars, 27 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 256 impls, 0 clqs
0.00/0.05 c (round 4) 13 del vars, 27 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 443 upgd conss, 256 impls, 0 clqs
0.00/0.05 c (round 5) 19 del vars, 27 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 443 upgd conss, 4704 impls, 6 clqs
0.00/0.06 c presolving (6 rounds):
0.00/0.06 c 19 deleted vars, 27 deleted constraints, 11 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.06 c 4704 implications, 6 cliques
0.00/0.06 c presolved problem has 201 variables (201 bin, 0 int, 0 impl, 0 cont) and 443 constraints
0.00/0.06 c 129 constraints of type <knapsack>
0.00/0.06 c 314 constraints of type <logicor>
0.00/0.06 c transformed objective value is always integral (scale: 1)
0.00/0.06 c Presolving Time: 0.03
0.00/0.06 c - non default parameters ----------------------------------------------------------------------
0.00/0.06 c # SCIP version 1.2.1.2
0.00/0.06 c
0.00/0.06 c # frequency for displaying node information lines
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.06 c display/freq = 10000
0.00/0.06 c
0.00/0.06 c # maximal time in seconds to run
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/time = 1799.99
0.00/0.06 c
0.00/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/memory = 1620
0.00/0.06 c
0.00/0.06 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c limits/solutions = 1
0.00/0.06 c
0.00/0.06 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.06 c separating/maxrounds = 1
0.00/0.06 c
0.00/0.06 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/maxroundsroot = 5
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify inequalities
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/linear/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.06 c constraints/knapsack/disaggregation = FALSE
0.00/0.06 c
0.00/0.06 c # should presolving try to simplify knapsacks
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.06 c
0.00/0.06 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c presolving/probing/maxrounds = 0
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/coefdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.06 c heuristics/crossover/freq = -1
0.00/0.06 c
0.00/0.06 c # number of nodes added to the contingent of the total nodes
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06 c heuristics/crossover/nodesofs = 750
0.00/0.06 c
0.00/0.06 c # number of nodes without incumbent change that heuristic should wait
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.06 c heuristics/crossover/nwaitingnodes = 100
0.00/0.06 c
0.00/0.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.06 c # [type: real, range: [0,1], default: 0.1]
0.00/0.06 c heuristics/crossover/nodesquot = 0.15
0.00/0.06 c
0.00/0.06 c # minimum percentage of integer variables that have to be fixed
0.00/0.06 c # [type: real, range: [0,1], default: 0.666]
0.00/0.06 c heuristics/crossover/minfixingrate = 0.5
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/feaspump/freq = -1
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/fracdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/guideddiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/intshifting/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/linesearchdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/nlp/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/objpscostdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.06 c # [type: real, range: [0,1], default: 0.01]
0.00/0.06 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/oneopt/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/pscostdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/rens/freq = -1
0.00/0.06 c
0.00/0.06 c # minimum percentage of integer variables that have to be fixable
0.00/0.06 c # [type: real, range: [0,1], default: 0.5]
0.00/0.06 c heuristics/rens/minfixingrate = 0.3
0.00/0.06 c
0.00/0.06 c # number of nodes added to the contingent of the total nodes
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06 c heuristics/rens/nodesofs = 2000
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/rootsoldiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.06 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/rounding/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/shifting/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/simplerounding/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/trivial/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/trysol/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/veclendiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/zirounding/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c separating/cmir/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c separating/flowcover/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/rapidlearning/freq = 0
0.00/0.06 c
0.00/0.06 c -----------------------------------------------------------------------------------------------
0.00/0.06 c start solving
0.00/0.06 c
0.00/0.08 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.08 c 0.0s| 1 | 0 | 158 | - |1443k| 0 | 109 | 201 | 443 | 201 | 437 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.46 c 0.4s| 1 | 0 | 443 | - |3079k| 0 | 153 | 201 | 526 | 201 | 582 | 145 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.76 c 0.7s| 1 | 0 | 938 | - |4867k| 0 | 135 | 201 | 526 | 201 | 664 | 227 | 0 | 0 | 0.000000e+00 | -- | Inf
1.00/1.01 c 0.9s| 1 | 0 | 1226 | - |6586k| 0 | 140 | 201 | 526 | 201 | 747 | 310 | 0 | 0 | 0.000000e+00 | -- | Inf
1.19/1.27 c 1.2s| 1 | 0 | 1513 | - |8304k| 0 | 153 | 201 | 526 | 201 | 799 | 362 | 0 | 0 | 0.000000e+00 | -- | Inf
1.39/1.48 c 1.4s| 1 | 0 | 1604 | - |9912k| 0 | 153 | 201 | 526 | 201 | 826 | 389 | 0 | 0 | 0.000000e+00 | -- | Inf
1.89/1.95 c 1.9s| 1 | 2 | 1604 | - |9912k| 0 | 153 | 201 | 526 | 201 | 826 | 389 | 0 | 9 | 0.000000e+00 | -- | Inf
34.18/34.29 c *33.0s| 8532 | 0 |135594 | 15.7 | 11M| 29 | - | 201 |3144 | 201 | 559 | 389 |5135 |1654 | 0.000000e+00 | 0.000000e+00 | 0.00%
34.18/34.29 c
34.18/34.29 c SCIP Status : problem is solved [optimal solution found]
34.18/34.29 c Solving Time (sec) : 32.98
34.18/34.29 c Solving Nodes : 8532
34.18/34.29 c Primal Bound : +0.00000000000000e+00 (1 solutions)
34.18/34.29 c Dual Bound : +0.00000000000000e+00
34.18/34.29 c Gap : 0.00 %
34.18/34.29 s SATISFIABLE
34.18/34.29 v x219 -x220 -x217 x218 -x215 x216 -x213 x214 -x211 -x212 -x209 -x210 -x207 -x208 -x205 -x206 x203 -x204 x201 -x202 x199 -x200 -x197
34.18/34.29 v x198 x195 -x196 x193 -x194 x191 -x192 -x189 x190 -x187 x188 -x185 x186 -x183 x184 -x181 -x182 -x179 -x180 -x177 x178 -x175
34.18/34.29 v -x176 x173 -x174 x171 -x172 x169 -x170 -x167 x168 x165 -x166 x163 -x164 -x161 x162 -x159 x160 x157 -x158 x155 -x156 -x153 x154
34.18/34.29 v -x151 x152 x149 -x150 x147 -x148 -x145 x146 x143 -x144 x141 -x142 x139 -x140 x137 -x138 -x135 x136 -x133 x134 -x131 x132
34.18/34.29 v -x129 x130 -x128 x126 x124 -x122 -x120 x118 x116 -x114 -x112 -x110 x108 -x106 -x104 x102 x100 -x98 -x96 x94 -x92 -x90 -x88 -x86
34.18/34.29 v -x84 -x82 -x80 -x78 x76 -x74 -x72 -x70 -x68 -x66 -x64 -x62 -x60 -x58 -x56 -x54 -x52 -x50 -x48 -x46 -x44 -x42 -x40 -x38 -x36
34.18/34.29 v -x34 -x32 -x30 -x28 -x26 -x24 -x22 -x20 -x18 -x16 -x14 -x12 -x10 -x8 -x6 -x4 -x2 -x127 -x125 -x123 -x121 -x119 -x117 -x115
34.18/34.29 v -x113 -x111 -x109 -x107 -x105 -x103 -x101 -x99 -x97 -x95 -x93 -x91 -x89 -x87 -x85 -x83 -x81 -x79 -x77 -x75 -x73 -x71 -x69 -x67
34.18/34.29 v -x65 x63 -x61 -x59 -x57 x55 -x53 -x51 x49 -x47 -x45 -x43 x41 -x39 -x37 -x35 -x33 -x31 -x29 -x27 x25 x23 -x21 -x19 -x17 -x15
34.18/34.29 v -x13 -x11 x9 x7 -x5 -x3 x1
34.18/34.29 c SCIP Status : problem is solved [optimal solution found]
34.18/34.29 c Solving Time : 32.98
34.18/34.29 c Original Problem :
34.18/34.29 c Problem name : HOME/instance-2665697-1276268893.opb
34.18/34.29 c Variables : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
34.18/34.29 c Constraints : 470 initial, 470 maximal
34.18/34.29 c Presolved Problem :
34.18/34.29 c Problem name : t_HOME/instance-2665697-1276268893.opb
34.18/34.29 c Variables : 201 (201 binary, 0 integer, 0 implicit integer, 0 continuous)
34.18/34.29 c Constraints : 443 initial, 3246 maximal
34.18/34.29 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
34.18/34.29 c trivial : 0.00 0 0 0 0 0 0 0 0
34.18/34.29 c dualfix : 0.00 0 0 0 0 0 0 0 0
34.18/34.29 c boundshift : 0.00 0 0 0 0 0 0 0 0
34.18/34.29 c inttobinary : 0.00 0 0 0 0 0 0 0 0
34.18/34.29 c implics : 0.00 0 8 0 0 0 0 0 0
34.18/34.29 c probing : 0.00 0 0 0 0 0 0 0 0
34.18/34.29 c knapsack : 0.01 0 0 0 0 0 0 0 0
34.18/34.29 c linear : 0.01 11 0 0 11 0 27 0 0
34.18/34.29 c logicor : 0.01 0 0 0 0 0 0 0 0
34.18/34.29 c root node : - 0 - - 0 - - - -
34.18/34.29 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
34.18/34.29 c integral : 0 0 0 5084 0 25 261 0 0 9854
34.18/34.29 c knapsack : 129 5 38916 1 0 3326 96402 470 0 0
34.18/34.29 c linear : 0+ 5 31108 0 0 27 496 1 0 0
34.18/34.29 c logicor : 314+ 5 29098 1 0 888 64291 0 0 0
34.18/34.29 c countsols : 0 0 0 1 0 0 0 0 0 0
34.18/34.29 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
34.18/34.29 c integral : 9.89 0.00 0.00 9.89 0.00
34.18/34.29 c knapsack : 1.57 0.02 1.55 0.00 0.00
34.18/34.29 c linear : 0.10 0.00 0.10 0.00 0.00
34.18/34.29 c logicor : 0.94 0.00 0.94 0.00 0.00
34.18/34.29 c countsols : 0.00 0.00 0.00 0.00 0.00
34.18/34.29 c Propagators : Time Calls Cutoffs DomReds
34.18/34.29 c vbounds : 0.01 1 0 0
34.18/34.29 c rootredcost : 0.04 0 0 0
34.18/34.29 c pseudoobj : 0.00 0 0 0
34.18/34.29 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
34.18/34.29 c propagation : 0.77 4241 3526 27263 47.1 136 21.7 -
34.18/34.29 c infeasible LP : 0.10 554 25 210 47.0 0 0.0 0
34.18/34.29 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
34.18/34.29 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
34.18/34.29 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
34.18/34.29 c applied globally : - - - 5042 15.8 - - -
34.18/34.29 c applied locally : - - - 93 55.2 - - -
34.18/34.29 c Separators : Time Calls Cutoffs DomReds Cuts Conss
34.18/34.29 c cut pool : 0.01 4 - - 18 - (maximal pool size: 2240)
34.18/34.29 c redcost : 0.06 4992 0 0 0 0
34.18/34.29 c impliedbounds : 0.00 5 0 0 725 0
34.18/34.29 c intobj : 0.00 0 0 0 0 0
34.18/34.29 c cgmip : 0.00 0 0 0 0 0
34.18/34.29 c gomory : 0.37 5 0 0 55 0
34.18/34.29 c strongcg : 0.37 5 0 0 2305 0
34.18/34.29 c cmir : 0.00 0 0 0 0 0
34.18/34.29 c flowcover : 0.00 0 0 0 0 0
34.18/34.29 c clique : 0.01 5 0 0 2 0
34.18/34.29 c zerohalf : 0.00 0 0 0 0 0
34.18/34.29 c mcf : 0.00 1 0 0 0 0
34.18/34.29 c rapidlearning : 0.18 1 0 0 0 83
34.18/34.29 c Pricers : Time Calls Vars
34.18/34.29 c problem variables: 0.00 0 0
34.18/34.29 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
34.18/34.29 c relpscost : 9.88 5083 25 261 0 0 9854
34.18/34.29 c pscost : 0.00 0 0 0 0 0 0
34.18/34.29 c inference : 0.00 0 0 0 0 0 0
34.18/34.29 c mostinf : 0.00 0 0 0 0 0 0
34.18/34.29 c leastinf : 0.00 0 0 0 0 0 0
34.18/34.29 c fullstrong : 0.00 0 0 0 0 0 0
34.18/34.29 c allfullstrong : 0.00 0 0 0 0 0 0
34.18/34.29 c random : 0.00 0 0 0 0 0 0
34.18/34.29 c Primal Heuristics : Time Calls Found
34.18/34.29 c LP solutions : 0.00 - 1
34.18/34.29 c pseudo solutions : 0.00 - 0
34.18/34.29 c trivial : 0.00 1 0
34.18/34.29 c simplerounding : 0.00 0 0
34.18/34.29 c zirounding : 0.00 0 0
34.18/34.29 c rounding : 0.00 0 0
34.18/34.29 c shifting : 0.00 0 0
34.18/34.29 c intshifting : 0.00 0 0
34.18/34.29 c oneopt : 0.00 0 0
34.18/34.29 c twoopt : 0.00 0 0
34.18/34.29 c fixandinfer : 0.00 0 0
34.18/34.29 c feaspump : 0.00 0 0
34.18/34.29 c coefdiving : 0.00 0 0
34.18/34.29 c pscostdiving : 0.00 0 0
34.18/34.29 c fracdiving : 0.00 0 0
34.18/34.29 c veclendiving : 0.00 0 0
34.18/34.29 c intdiving : 0.00 0 0
34.18/34.29 c actconsdiving : 0.00 0 0
34.18/34.29 c objpscostdiving : 0.00 0 0
34.18/34.29 c rootsoldiving : 0.00 0 0
34.18/34.29 c linesearchdiving : 0.00 0 0
34.18/34.29 c guideddiving : 0.00 0 0
34.18/34.29 c octane : 0.00 0 0
34.18/34.29 c rens : 0.00 0 0
34.18/34.29 c rins : 0.00 0 0
34.18/34.29 c localbranching : 0.00 0 0
34.18/34.29 c mutation : 0.00 0 0
34.18/34.29 c crossover : 0.00 0 0
34.18/34.29 c dins : 0.00 0 0
34.18/34.29 c undercover : 0.00 0 0
34.18/34.29 c nlp : 0.00 0 0
34.18/34.29 c trysol : 0.00 0 0
34.18/34.29 c LP : Time Calls Iterations Iter/call Iter/sec
34.18/34.29 c primal LP : 0.00 0 0 0.00 -
34.18/34.29 c dual LP : 16.81 5642 135594 24.03 8066.27
34.18/34.29 c lex dual LP : 0.00 0 0 0.00 -
34.18/34.29 c barrier LP : 0.00 0 0 0.00 -
34.18/34.29 c diving/probing LP: 0.00 0 0 0.00 -
34.18/34.29 c strong branching : 9.67 1654 72320 43.72 7478.80
34.18/34.29 c (at root node) : - 9 2115 235.00 -
34.18/34.29 c conflict analysis: 0.00 0 0 0.00 -
34.18/34.29 c B&B Tree :
34.18/34.29 c number of runs : 1
34.18/34.29 c nodes : 8532
34.18/34.29 c nodes (total) : 8532
34.18/34.29 c nodes left : 0
34.18/34.29 c max depth : 29
34.18/34.29 c max depth (total): 29
34.18/34.29 c backtracks : 2088 (24.5%)
34.18/34.29 c delayed cutoffs : 1287
34.18/34.29 c repropagations : 4990 (42923 domain reductions, 1216 cutoffs)
34.18/34.29 c avg switch length: 3.48
34.18/34.29 c switching time : 1.13
34.18/34.29 c Solution :
34.18/34.29 c Solutions found : 1 (1 improvements)
34.18/34.29 c First Solution : +0.00000000000000e+00 (in run 1, after 8532 nodes, 32.98 seconds, depth 20, found by <relaxation>)
34.18/34.29 c Primal Bound : +0.00000000000000e+00 (in run 1, after 8532 nodes, 32.98 seconds, depth 20, found by <relaxation>)
34.18/34.29 c Dual Bound : +0.00000000000000e+00
34.18/34.29 c Gap : 0.00 %
34.18/34.29 c Root Dual Bound : +0.00000000000000e+00
34.18/34.30 c Root Iterations : 1604
34.28/34.31 c Time complete: 34.29.