0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.00 c Copyright (c) 2002-2011 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-3450295-1307112541.opb>
0.00/0.01 c original problem has 1452 variables (1452 bin, 0 int, 0 impl, 0 cont) and 1754 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.01 c presolving:
0.00/0.04 c (round 1) 0 del vars, 1452 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 101 upgd conss, 10216 impls, 199 clqs
0.00/0.05 c (round 2) 1252 del vars, 1452 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 10216 impls, 0 clqs
0.00/0.05 c presolving (3 rounds):
0.00/0.05 c 1252 deleted vars, 1452 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.05 c 10216 implications, 0 cliques
0.00/0.05 c presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 302 constraints
0.00/0.05 c 201 constraints of type <knapsack>
0.00/0.05 c 100 constraints of type <setppc>
0.00/0.05 c 1 constraints of type <linear>
0.00/0.05 c transformed objective value is always integral (scale: 1)
0.00/0.05 c Presolving Time: 0.04
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 2.0.1.5
0.00/0.05 c
0.00/0.05 c # frequency for displaying node information lines
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05 c display/freq = 10000
0.00/0.05 c
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/time = 1800
0.00/0.05 c
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/memory = 13950
0.00/0.05 c
0.00/0.05 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c limits/solutions = 1
0.00/0.05 c
0.00/0.05 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.05 c separating/maxrounds = 1
0.00/0.05 c
0.00/0.05 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/maxroundsroot = 5
0.00/0.05 c
0.00/0.05 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.05 c # [type: int, range: [1,2], default: 1]
0.00/0.05 c timing/clocktype = 2
0.00/0.05 c
0.00/0.05 c # belongs reading time to solving time?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c timing/reading = TRUE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify inequalities
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/linear/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/indicator/addCouplingCons = TRUE
0.00/0.05 c
0.00/0.05 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.05 c constraints/knapsack/disaggregation = FALSE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify knapsacks
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c presolving/probing/maxrounds = 0
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/coefdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.05 c heuristics/crossover/freq = -1
0.00/0.05 c
0.00/0.05 c # number of nodes added to the contingent of the total nodes
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05 c heuristics/crossover/nodesofs = 750
0.00/0.05 c
0.00/0.05 c # number of nodes without incumbent change that heuristic should wait
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.05 c heuristics/crossover/nwaitingnodes = 100
0.00/0.05 c
0.00/0.05 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.05 c # [type: real, range: [0,1], default: 0.1]
0.00/0.05 c heuristics/crossover/nodesquot = 0.15
0.00/0.05 c
0.00/0.05 c # minimum percentage of integer variables that have to be fixed
0.00/0.05 c # [type: real, range: [0,1], default: 0.666]
0.00/0.05 c heuristics/crossover/minfixingrate = 0.5
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/feaspump/freq = -1
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/fracdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/guideddiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/intshifting/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/linesearchdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/objpscostdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.05 c # [type: real, range: [0,1], default: 0.01]
0.00/0.05 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/oneopt/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/pscostdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/rens/freq = -1
0.00/0.05 c
0.00/0.05 c # minimum percentage of integer variables that have to be fixable
0.00/0.05 c # [type: real, range: [0,1], default: 0.5]
0.00/0.05 c heuristics/rens/minfixingrate = 0.3
0.00/0.05 c
0.00/0.05 c # number of nodes added to the contingent of the total nodes
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05 c heuristics/rens/nodesofs = 2000
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/rootsoldiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.05 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/rounding/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/shiftandpropagate/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/shifting/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/simplerounding/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/subnlp/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/trivial/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/trysol/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/undercover/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/veclendiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/zirounding/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c separating/cmir/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c separating/flowcover/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/rapidlearning/freq = 0
0.00/0.05 c
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c start solving
0.00/0.05 c
0.00/0.05 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.05 c 0.1s| 1 | 0 | 57 | - |4118k| 0 | 24 | 200 | 302 | 200 | 302 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.07/0.09 c 0.1s| 1 | 0 | 95 | - |4423k| 0 | 40 | 200 | 310 | 200 | 316 | 14 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 229 | - |4755k| 0 | 109 | 200 | 310 | 200 | 337 | 35 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.18 c 0.2s| 1 | 0 | 325 | - |5478k| 0 | 154 | 200 | 310 | 200 | 388 | 86 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 335 | - |6162k| 0 | 157 | 200 | 310 | 200 | 400 | 98 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.3s| 1 | 0 | 348 | - |6276k| 0 | 158 | 200 | 310 | 200 | 403 | 101 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.42 c 0.4s| 1 | 2 | 348 | - |6277k| 0 | 158 | 200 | 310 | 200 | 403 | 101 | 0 | 10 | 0.000000e+00 | -- | Inf
4.89/4.97 c * 5.0s| 151 | 0 | 1647 | 8.7 |6369k| 117 | - | 200 | 310 | 200 | 398 | 101 | 0 |1012 | 0.000000e+00 | 0.000000e+00 | 0.00%
4.89/4.97 c
4.89/4.97 c SCIP Status : problem is solved [optimal solution found]
4.89/4.97 c Solving Time (sec) : 4.97
4.89/4.97 c Solving Nodes : 151
4.89/4.97 c Primal Bound : +0.00000000000000e+00 (1 solutions)
4.89/4.97 c Dual Bound : +0.00000000000000e+00
4.89/4.97 c Gap : 0.00 %
4.89/4.98 s SATISFIABLE
4.89/4.98 v -x148 -x139 -x160 -x157 -x183 -x131 -x156 x196 -x165 -x122 -x198 -x197 x170 -x113 -x163 -x158 -x130 -x126 -x125 -x119 -x159 -x192
4.89/4.98 v x195 x144 -x142 x120 -x164 x175 -x107 -x181 -x118 -x188 -x145 -x191 -x151 x169 -x134 -x117 -x143 -x190 -x186 -x116 -x124 -x136
4.89/4.98 v -x104 -x193 -x179 x140 -x108 -x138 -x154 -x172 -x162 x200 -x109 x103 x194 -x178 -x146 -x141 -x137 -x185 -x128 -x147 -x168
4.89/4.98 v -x153 -x184 x180 -x102 -x171 -x135 x114 x110 -x105 -x106 -x115 -x187 -x129 -x199 -x161 -x127 -x101 -x189 -x167 -x155 -x152
4.89/4.98 v x149 -x132 -x123 -x112 -x182 -x174 -x150 -x121 -x133 -x177 -x173 -x111 -x166 -x176 -x100 x99 -x98 -x97 -x96 -x95 -x94 x93 x92
4.89/4.98 v -x91 x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 x79 -x78 -x77 x76 -x75 x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 x66
4.89/4.98 v -x65 -x64 x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 x43 -x42 -x41 -x40
4.89/4.98 v x39 x38 -x37 x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 x25 -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 x15 -x14
4.89/4.98 v -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
4.89/4.98 c SCIP Status : problem is solved [optimal solution found]
4.89/4.98 c Total Time : 4.97
4.89/4.98 c solving : 4.97
4.89/4.98 c presolving : 0.04 (included in solving)
4.89/4.98 c reading : 0.01 (included in solving)
4.89/4.98 c Original Problem :
4.89/4.98 c Problem name : HOME/instance-3450295-1307112541.opb
4.89/4.98 c Variables : 1452 (1452 binary, 0 integer, 0 implicit integer, 0 continuous)
4.89/4.98 c Constraints : 1754 initial, 1754 maximal
4.89/4.98 c Presolved Problem :
4.89/4.98 c Problem name : t_HOME/instance-3450295-1307112541.opb
4.89/4.98 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
4.89/4.98 c Constraints : 302 initial, 310 maximal
4.89/4.98 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
4.89/4.98 c trivial : 0.00 0 0 0 0 0 0 0 0 0
4.89/4.98 c dualfix : 0.00 1252 0 0 0 0 0 0 0 0
4.89/4.98 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
4.89/4.98 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
4.89/4.98 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
4.89/4.98 c implics : 0.00 0 0 0 0 0 0 0 0 0
4.89/4.98 c probing : 0.00 0 0 0 0 0 0 0 0 0
4.89/4.98 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
4.89/4.98 c setppc : 0.00 0 0 0 0 0 0 0 0 0
4.89/4.98 c linear : 0.00 0 0 0 0 0 0 0 0 0
4.89/4.98 c pseudoboolean : 0.00 0 0 0 0 0 1452 0 0 0
4.89/4.98 c root node : - 0 - - 0 - - - - -
4.89/4.98 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
4.89/4.98 c integral : 0 0 0 152 0 3 0 0 1 0 0 300
4.89/4.98 c knapsack : 201 5 170 1 0 0 0 0 62 329 0 0
4.89/4.98 c setppc : 100 5 169 0 0 0 0 0 14 0 0 0
4.89/4.98 c linear : 1+ 6 170 1 0 0 0 0 0 0 0 0
4.89/4.98 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
4.89/4.98 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
4.89/4.98 c integral : 4.50 0.00 0.00 4.50 0.00 0.00 0.00
4.89/4.98 c knapsack : 0.01 0.01 0.00 0.00 0.00 0.00 0.00
4.89/4.98 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
4.89/4.98 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
4.89/4.98 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
4.89/4.98 c Propagators : #Propagate #Resprop Cutoffs DomReds
4.89/4.98 c vbounds : 0 0 0 0
4.89/4.98 c rootredcost : 0 0 0 0
4.89/4.98 c pseudoobj : 0 0 0 0
4.89/4.98 c Propagator Timings : TotalTime Propagate Resprop
4.89/4.98 c vbounds : 0.00 0.00 0.00
4.89/4.98 c rootredcost : 0.00 0.00 0.00
4.89/4.98 c pseudoobj : 0.00 0.00 0.00
4.89/4.98 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
4.89/4.98 c propagation : 0.00 0 0 0 0.0 0 0.0 -
4.89/4.98 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
4.89/4.98 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
4.89/4.98 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
4.89/4.98 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
4.89/4.98 c applied globally : - - - 0 0.0 - - -
4.89/4.98 c applied locally : - - - 0 0.0 - - -
4.89/4.98 c Separators : Time Calls Cutoffs DomReds Cuts Conss
4.89/4.98 c cut pool : 0.00 4 - - 0 - (maximal pool size: 437)
4.89/4.98 c redcost : 0.00 155 0 0 0 0
4.89/4.98 c impliedbounds : 0.00 5 0 0 0 0
4.89/4.98 c intobj : 0.00 0 0 0 0 0
4.89/4.98 c gomory : 0.09 5 0 0 0 0
4.89/4.98 c cgmip : 0.00 0 0 0 0 0
4.89/4.98 c closecuts : 0.00 0 0 0 0 0
4.89/4.98 c strongcg : 0.08 5 0 0 469 0
4.89/4.98 c cmir : 0.00 0 0 0 0 0
4.89/4.98 c flowcover : 0.00 0 0 0 0 0
4.89/4.98 c clique : 0.00 1 0 0 0 0
4.89/4.98 c zerohalf : 0.00 0 0 0 0 0
4.89/4.98 c mcf : 0.00 1 0 0 0 0
4.89/4.98 c oddcycle : 0.00 0 0 0 0 0
4.89/4.98 c rapidlearning : 0.02 1 0 0 0 8
4.89/4.98 c Pricers : Time Calls Vars
4.89/4.98 c problem variables: 0.00 0 0
4.89/4.98 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
4.89/4.98 c relpscost : 4.50 151 0 1 0 0 300
4.89/4.98 c pscost : 0.00 0 0 0 0 0 0
4.89/4.98 c inference : 0.00 0 0 0 0 0 0
4.89/4.98 c mostinf : 0.00 0 0 0 0 0 0
4.89/4.98 c leastinf : 0.00 0 0 0 0 0 0
4.89/4.98 c fullstrong : 0.00 0 0 0 0 0 0
4.89/4.98 c allfullstrong : 0.00 0 0 0 0 0 0
4.89/4.98 c random : 0.00 0 0 0 0 0 0
4.89/4.98 c Primal Heuristics : Time Calls Found
4.89/4.98 c LP solutions : 0.00 - 1
4.89/4.98 c pseudo solutions : 0.00 - 0
4.89/4.98 c trivial : 0.00 1 0
4.89/4.98 c shiftandpropagate: 0.00 0 0
4.89/4.98 c simplerounding : 0.00 0 0
4.89/4.98 c zirounding : 0.00 0 0
4.89/4.98 c rounding : 0.00 0 0
4.89/4.98 c shifting : 0.00 0 0
4.89/4.98 c intshifting : 0.00 0 0
4.89/4.98 c oneopt : 0.00 0 0
4.89/4.98 c twoopt : 0.00 0 0
4.89/4.98 c fixandinfer : 0.00 0 0
4.89/4.98 c feaspump : 0.00 0 0
4.89/4.98 c clique : 0.00 0 0
4.89/4.98 c coefdiving : 0.00 0 0
4.89/4.98 c pscostdiving : 0.00 0 0
4.89/4.98 c fracdiving : 0.00 0 0
4.89/4.98 c veclendiving : 0.00 0 0
4.89/4.98 c intdiving : 0.00 0 0
4.89/4.98 c actconsdiving : 0.00 0 0
4.89/4.98 c objpscostdiving : 0.00 0 0
4.89/4.98 c rootsoldiving : 0.00 0 0
4.89/4.98 c linesearchdiving : 0.00 0 0
4.89/4.98 c guideddiving : 0.00 0 0
4.89/4.98 c octane : 0.00 0 0
4.89/4.98 c rens : 0.00 0 0
4.89/4.98 c rins : 0.00 0 0
4.89/4.98 c localbranching : 0.00 0 0
4.89/4.98 c mutation : 0.00 0 0
4.89/4.98 c crossover : 0.00 0 0
4.89/4.98 c dins : 0.00 0 0
4.89/4.98 c vbounds : 0.00 0 0
4.89/4.98 c undercover : 0.00 0 0
4.89/4.98 c subnlp : 0.00 0 0
4.89/4.98 c trysol : 0.00 0 0
4.89/4.98 c LP : Time Calls Iterations Iter/call Iter/sec
4.89/4.98 c primal LP : 0.00 0 0 0.00 -
4.89/4.98 c dual LP : 0.21 157 1647 10.49 7964.37
4.89/4.98 c lex dual LP : 0.00 0 0 0.00 -
4.89/4.98 c barrier LP : 0.00 0 0 0.00 -
4.89/4.98 c diving/probing LP: 0.00 0 0 0.00 -
4.89/4.98 c strong branching : 4.49 1012 40889 40.40 9108.92
4.89/4.98 c (at root node) : - 10 673 67.30 -
4.89/4.98 c conflict analysis: 0.00 0 0 0.00 -
4.89/4.98 c B&B Tree :
4.89/4.98 c number of runs : 1
4.89/4.98 c nodes : 151
4.89/4.98 c nodes (total) : 151
4.89/4.98 c nodes left : 0
4.89/4.98 c max depth : 117
4.89/4.98 c max depth (total): 117
4.89/4.98 c backtracks : 1 (0.7%)
4.89/4.98 c delayed cutoffs : 0
4.89/4.98 c repropagations : 0 (0 domain reductions, 0 cutoffs)
4.89/4.98 c avg switch length: 2.00
4.89/4.98 c switching time : 0.00
4.89/4.98 c Solution :
4.89/4.98 c Solutions found : 1 (1 improvements)
4.89/4.98 c First Solution : +0.00000000000000e+00 (in run 1, after 151 nodes, 4.97 seconds, depth 117, found by <relaxation>)
4.89/4.98 c Primal Bound : +0.00000000000000e+00 (in run 1, after 151 nodes, 4.97 seconds, depth 117, found by <relaxation>)
4.89/4.98 c Dual Bound : +0.00000000000000e+00
4.89/4.98 c Gap : 0.00 %
4.89/4.98 c Root Dual Bound : +0.00000000000000e+00
4.89/4.98 c Root Iterations : 348
4.89/4.98 c Time complete: 4.97.