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-3729037-1338678628.opb>
0.00/0.00 c original problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 332 constraints
0.00/0.00 c problem read
0.00/0.00 c No objective function, only one solution is needed.
0.00/0.00 c presolving settings loaded
0.00/0.01 c presolving:
0.00/0.01 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 252 impls, 0 clqs
0.01/0.01 c (round 2) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 5244 impls, 0 clqs
0.01/0.01 c (round 3) 8 del vars, 8 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 5244 impls, 0 clqs
0.01/0.01 c (round 4) 8 del vars, 12 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 5244 impls, 0 clqs
0.01/0.01 c presolving (5 rounds):
0.01/0.01 c 8 deleted vars, 12 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.01 c 5244 implications, 0 cliques
0.01/0.01 c presolved problem has 212 variables (212 bin, 0 int, 0 impl, 0 cont) and 320 constraints
0.01/0.01 c 130 constraints of type <knapsack>
0.01/0.01 c 106 constraints of type <setppc>
0.01/0.01 c 84 constraints of type <logicor>
0.01/0.01 c transformed objective value is always integral (scale: 1)
0.01/0.01 c Presolving Time: 0.01
0.01/0.01 c - non default parameters ----------------------------------------------------------------------
0.01/0.01 c # SCIP version 1.2.1.3
0.01/0.01 c
0.01/0.01 c # frequency for displaying node information lines
0.01/0.01 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.01 c display/freq = 10000
0.01/0.01 c
0.01/0.01 c # maximal time in seconds to run
0.01/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.01 c limits/time = 1790
0.01/0.01 c
0.01/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.01 c limits/memory = 13950
0.01/0.01 c
0.01/0.01 c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.01 c limits/solutions = 1
0.01/0.01 c
0.01/0.01 c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.01 c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.01 c separating/maxrounds = 1
0.01/0.01 c
0.01/0.01 c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.01 c separating/maxroundsroot = 5
0.01/0.01 c
0.01/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.01/0.01 c # [type: int, range: [1,2], default: 1]
0.01/0.01 c timing/clocktype = 2
0.01/0.01 c
0.01/0.01 c # should presolving try to simplify inequalities
0.01/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.01 c constraints/linear/simplifyinequalities = TRUE
0.01/0.01 c
0.01/0.01 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.01/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.02 c constraints/indicator/addCouplingCons = TRUE
0.01/0.02 c
0.01/0.02 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.02 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.02 c constraints/knapsack/disaggregation = FALSE
0.01/0.02 c
0.01/0.02 c # should presolving try to simplify knapsacks
0.01/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.02 c
0.01/0.02 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.02 c presolving/probing/maxrounds = 0
0.01/0.02 c
0.01/0.02 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.02 c heuristics/coefdiving/freq = -1
0.01/0.02 c
0.01/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.02 c heuristics/coefdiving/maxlpiterquot = 0.075
0.01/0.02 c
0.01/0.02 c # additional number of allowed LP iterations
0.01/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.02 c heuristics/coefdiving/maxlpiterofs = 1500
0.01/0.02 c
0.01/0.02 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.02 c heuristics/crossover/freq = -1
0.01/0.02 c
0.01/0.02 c # number of nodes added to the contingent of the total nodes
0.01/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.02 c heuristics/crossover/nodesofs = 750
0.01/0.02 c
0.01/0.02 c # number of nodes without incumbent change that heuristic should wait
0.01/0.02 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.02 c heuristics/crossover/nwaitingnodes = 100
0.01/0.02 c
0.01/0.02 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.02 c # [type: real, range: [0,1], default: 0.1]
0.01/0.02 c heuristics/crossover/nodesquot = 0.15
0.01/0.02 c
0.01/0.02 c # minimum percentage of integer variables that have to be fixed
0.01/0.02 c # [type: real, range: [0,1], default: 0.666]
0.01/0.02 c heuristics/crossover/minfixingrate = 0.5
0.01/0.02 c
0.01/0.02 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.02 c heuristics/feaspump/freq = -1
0.01/0.02 c
0.01/0.02 c # additional number of allowed LP iterations
0.01/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.02 c heuristics/feaspump/maxlpiterofs = 2000
0.01/0.02 c
0.01/0.02 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.02 c heuristics/fracdiving/freq = -1
0.01/0.02 c
0.01/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.02 c heuristics/fracdiving/maxlpiterquot = 0.075
0.01/0.02 c
0.01/0.02 c # additional number of allowed LP iterations
0.01/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.02 c heuristics/fracdiving/maxlpiterofs = 1500
0.01/0.02 c
0.01/0.02 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.02 c heuristics/guideddiving/freq = -1
0.01/0.02 c
0.01/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.02 c heuristics/guideddiving/maxlpiterquot = 0.075
0.01/0.02 c
0.01/0.02 c # additional number of allowed LP iterations
0.01/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.02 c heuristics/guideddiving/maxlpiterofs = 1500
0.01/0.02 c
0.01/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.02 c heuristics/intdiving/maxlpiterquot = 0.075
0.01/0.02 c
0.01/0.02 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.02 c heuristics/intshifting/freq = -1
0.01/0.02 c
0.01/0.02 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.02 c heuristics/linesearchdiving/freq = -1
0.01/0.02 c
0.01/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.02 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.01/0.02 c
0.01/0.02 c # additional number of allowed LP iterations
0.01/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.02 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.01/0.02 c
0.01/0.02 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.02 c heuristics/nlp/freq = -1
0.01/0.02 c
0.01/0.02 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.02 c heuristics/objpscostdiving/freq = -1
0.01/0.02 c
0.01/0.02 c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.02 c # [type: real, range: [0,1], default: 0.01]
0.01/0.02 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.01/0.02 c
0.01/0.02 c # additional number of allowed LP iterations
0.01/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.02 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.01/0.02 c
0.01/0.02 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.02 c heuristics/oneopt/freq = -1
0.01/0.02 c
0.01/0.02 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.02 c heuristics/pscostdiving/freq = -1
0.01/0.02 c
0.01/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.02 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.01/0.02 c
0.01/0.02 c # additional number of allowed LP iterations
0.01/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.02 c heuristics/pscostdiving/maxlpiterofs = 1500
0.01/0.02 c
0.01/0.02 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.02 c heuristics/rens/freq = -1
0.01/0.02 c
0.01/0.02 c # minimum percentage of integer variables that have to be fixable
0.01/0.02 c # [type: real, range: [0,1], default: 0.5]
0.01/0.02 c heuristics/rens/minfixingrate = 0.3
0.01/0.02 c
0.01/0.02 c # number of nodes added to the contingent of the total nodes
0.01/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.02 c heuristics/rens/nodesofs = 2000
0.01/0.02 c
0.01/0.02 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.02 c heuristics/rootsoldiving/freq = -1
0.01/0.02 c
0.01/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.02 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.01/0.02 c
0.01/0.02 c # additional number of allowed LP iterations
0.01/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.02 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.01/0.02 c
0.01/0.02 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.02 c heuristics/rounding/freq = -1
0.01/0.02 c
0.01/0.02 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.02 c heuristics/shifting/freq = -1
0.01/0.02 c
0.01/0.02 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.02 c heuristics/simplerounding/freq = -1
0.01/0.02 c
0.01/0.02 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.02 c heuristics/trivial/freq = -1
0.01/0.02 c
0.01/0.02 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.02 c heuristics/trysol/freq = -1
0.01/0.02 c
0.01/0.02 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.02 c heuristics/veclendiving/freq = -1
0.01/0.02 c
0.01/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.02 c heuristics/veclendiving/maxlpiterquot = 0.075
0.01/0.02 c
0.01/0.02 c # additional number of allowed LP iterations
0.01/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.02 c heuristics/veclendiving/maxlpiterofs = 1500
0.01/0.02 c
0.01/0.02 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.02 c heuristics/zirounding/freq = -1
0.01/0.02 c
0.01/0.02 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.02 c separating/cmir/freq = -1
0.01/0.02 c
0.01/0.02 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.02 c separating/flowcover/freq = -1
0.01/0.02 c
0.01/0.02 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.02 c separating/rapidlearning/freq = 0
0.01/0.02 c
0.01/0.02 c -----------------------------------------------------------------------------------------------
0.01/0.02 c start solving
0.01/0.02 c
0.01/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.01/0.02 c 0.0s| 1 | 0 | 96 | - |1310k| 0 | 57 | 212 | 320 | 212 | 320 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.08/0.10 c 0.1s| 1 | 0 | 279 | - |1814k| 0 | 104 | 212 | 321 | 212 | 486 | 166 | 0 | 0 | 0.000000e+00 | -- | Inf
0.08/0.15 c 0.1s| 1 | 0 | 393 | - |2553k| 0 | 121 | 212 | 321 | 212 | 571 | 251 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.20 c 0.2s| 1 | 0 | 470 | - |3364k| 0 | 127 | 212 | 321 | 212 | 601 | 281 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 539 | - |4348k| 0 | 123 | 212 | 321 | 212 | 629 | 309 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.3s| 1 | 0 | 611 | - |4440k| 0 | 124 | 212 | 321 | 212 | 635 | 315 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.51 c 0.5s| 1 | 2 | 611 | - |4441k| 0 | 124 | 212 | 321 | 212 | 635 | 315 | 0 | 10 | 0.000000e+00 | -- | Inf
3.69/3.76 c * 3.8s| 4105 | 0 | 29229 | 7.0 |5241k| 31 | - | 212 |2012 | 212 | 404 | 315 |1983 |1540 | 0.000000e+00 | 0.000000e+00 | 0.00%
3.69/3.76 c
3.69/3.76 c SCIP Status : problem is solved [optimal solution found]
3.69/3.76 c Solving Time (sec) : 3.75
3.69/3.76 c Solving Nodes : 4105
3.69/3.76 c Primal Bound : +0.00000000000000e+00 (1 solutions)
3.69/3.76 c Dual Bound : +0.00000000000000e+00
3.69/3.76 c Gap : 0.00 %
3.69/3.76 s SATISFIABLE
3.69/3.76 v -x219 x220 x217 -x218 x215 -x216 -x213 x214 -x211 x212 -x209 -x210 -x207 -x208 -x205 x206 -x203 x204 -x201 x202 -x199 x200 -x197
3.69/3.76 v x198 -x195 x196 -x193 x194 x191 -x192 -x189 -x190 x187 -x188 x185 -x186 x183 -x184 x181 -x182 x179 -x180 -x177 -x178 -x175
3.69/3.76 v -x176 -x173 x174 -x171 -x172 x169 -x170 x167 -x168 -x165 x166 x163 -x164 -x161 x162 -x159 x160 -x157 x158 -x155 x156 x153 -x154
3.69/3.76 v x151 -x152 x149 -x150 -x147 x148 x145 -x146 -x143 x144 -x141 x142 -x139 x140 x137 -x138 x135 -x136 -x133 x134 x131 -x132 x129
3.69/3.76 v -x130 -x128 -x126 -x124 -x122 -x120 -x118 -x116 -x114 -x112 -x110 -x108 -x106 -x104 -x102 -x100 -x98 -x96 -x94 -x92 -x90
3.69/3.76 v -x88 -x86 -x84 -x82 -x80 -x78 -x76 -x74 x72 -x70 -x68 x66 -x64 -x62 -x60 -x58 -x56 x54 -x52 x50 -x48 -x46 -x44 -x42 -x40 -x38
3.69/3.76 v -x36 -x34 -x32 -x30 -x28 x26 x24 -x22 -x20 x18 -x16 -x14 -x12 -x10 x8 x6 -x4 -x2 x127 -x125 x123 -x121 -x119 -x117 x115 -x113
3.69/3.76 v x111 x109 -x107 -x105 -x103 -x101 -x99 -x97 -x95 x93 x91 -x89 -x87 -x85 -x83 -x81 -x79 -x77 -x75 -x73 -x71 -x69 -x67 -x65 -x63
3.69/3.76 v -x61 -x59 -x57 -x55 -x53 -x51 -x49 x47 x45 -x43 -x41 -x39 -x37 -x35 -x33 -x31 -x29 -x27 -x25 -x23 -x21 -x19 -x17 -x15 -x13
3.69/3.76 v -x11 -x9 -x7 -x5 -x3 -x1
3.69/3.76 c SCIP Status : problem is solved [optimal solution found]
3.69/3.76 c Solving Time : 3.75
3.69/3.76 c Original Problem :
3.69/3.76 c Problem name : HOME/instance-3729037-1338678628.opb
3.69/3.76 c Variables : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
3.69/3.76 c Constraints : 332 initial, 332 maximal
3.69/3.76 c Presolved Problem :
3.69/3.76 c Problem name : t_HOME/instance-3729037-1338678628.opb
3.69/3.76 c Variables : 212 (212 binary, 0 integer, 0 implicit integer, 0 continuous)
3.69/3.76 c Constraints : 320 initial, 2012 maximal
3.69/3.76 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.69/3.76 c trivial : 0.00 0 0 0 0 0 0 0 0
3.69/3.76 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.69/3.76 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.69/3.76 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.69/3.76 c implics : 0.00 0 8 0 0 0 0 0 0
3.69/3.76 c probing : 0.00 0 0 0 0 0 0 0 0
3.69/3.76 c knapsack : 0.00 0 0 0 0 0 0 0 0
3.69/3.76 c setppc : 0.00 0 0 0 0 0 12 0 0
3.69/3.76 c linear : 0.00 0 0 0 0 0 0 0 0
3.69/3.76 c logicor : 0.00 0 0 0 0 0 0 0 0
3.69/3.76 c root node : - 0 - - 0 - - - -
3.69/3.76 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.69/3.76 c integral : 0 0 0 2459 0 17 174 0 0 4692
3.69/3.76 c knapsack : 130 5 16374 0 0 1955 40457 365 0 0
3.69/3.76 c setppc : 106 5 14196 0 0 28 11767 0 0 0
3.69/3.76 c linear : 0+ 5 3 0 0 0 0 0 0 0
3.69/3.76 c logicor : 84+ 5 9557 1 0 122 11297 0 0 0
3.69/3.76 c countsols : 0 0 0 1 0 0 0 0 0 0
3.69/3.76 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.69/3.76 c integral : 1.58 0.00 0.00 1.58 0.00
3.69/3.76 c knapsack : 0.23 0.00 0.23 0.00 0.00
3.69/3.76 c setppc : 0.02 0.00 0.02 0.00 0.00
3.69/3.76 c linear : 0.00 0.00 0.00 0.00 0.00
3.69/3.76 c logicor : 0.06 0.00 0.06 0.00 0.00
3.69/3.76 c countsols : 0.00 0.00 0.00 0.00 0.00
3.69/3.76 c Propagators : Time Calls Cutoffs DomReds
3.69/3.76 c vbounds : 0.00 1 0 0
3.69/3.76 c rootredcost : 0.00 0 0 0
3.69/3.76 c pseudoobj : 0.00 0 0 0
3.69/3.76 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.69/3.76 c propagation : 0.14 2105 1659 10314 53.6 30 52.8 -
3.69/3.76 c infeasible LP : 0.01 144 0 0 0.0 0 0.0 0
3.69/3.76 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.69/3.76 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.69/3.76 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.69/3.76 c applied globally : - - - 1962 15.0 - - -
3.69/3.76 c applied locally : - - - 21 61.6 - - -
3.69/3.76 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.69/3.76 c cut pool : 0.00 4 - - 49 - (maximal pool size: 1199)
3.69/3.76 c redcost : 0.01 2407 0 0 0 0
3.69/3.76 c impliedbounds : 0.00 5 0 0 466 0
3.69/3.76 c intobj : 0.00 0 0 0 0 0
3.69/3.76 c cgmip : 0.00 0 0 0 0 0
3.69/3.76 c gomory : 0.07 5 0 0 166 0
3.69/3.76 c strongcg : 0.08 5 0 0 1335 0
3.69/3.76 c cmir : 0.00 0 0 0 0 0
3.69/3.76 c flowcover : 0.00 0 0 0 0 0
3.69/3.76 c clique : 0.00 1 0 0 0 0
3.69/3.76 c zerohalf : 0.00 0 0 0 0 0
3.69/3.76 c mcf : 0.00 1 0 0 0 0
3.69/3.76 c rapidlearning : 0.06 1 0 0 0 1
3.69/3.76 c Pricers : Time Calls Vars
3.69/3.76 c problem variables: 0.00 0 0
3.69/3.76 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.69/3.76 c relpscost : 1.58 2458 17 174 0 0 4692
3.69/3.76 c pscost : 0.00 0 0 0 0 0 0
3.69/3.76 c inference : 0.00 0 0 0 0 0 0
3.69/3.76 c mostinf : 0.00 0 0 0 0 0 0
3.69/3.76 c leastinf : 0.00 0 0 0 0 0 0
3.69/3.76 c fullstrong : 0.00 0 0 0 0 0 0
3.69/3.76 c allfullstrong : 0.00 0 0 0 0 0 0
3.69/3.76 c random : 0.00 0 0 0 0 0 0
3.69/3.76 c Primal Heuristics : Time Calls Found
3.69/3.76 c LP solutions : 0.00 - 1
3.69/3.76 c pseudo solutions : 0.00 - 0
3.69/3.76 c trivial : 0.00 1 0
3.69/3.76 c simplerounding : 0.00 0 0
3.69/3.76 c zirounding : 0.00 0 0
3.69/3.76 c rounding : 0.00 0 0
3.69/3.76 c shifting : 0.00 0 0
3.69/3.76 c intshifting : 0.00 0 0
3.69/3.76 c oneopt : 0.00 0 0
3.69/3.76 c twoopt : 0.00 0 0
3.69/3.76 c fixandinfer : 0.00 0 0
3.69/3.76 c feaspump : 0.00 0 0
3.69/3.76 c coefdiving : 0.00 0 0
3.69/3.76 c pscostdiving : 0.00 0 0
3.69/3.76 c fracdiving : 0.00 0 0
3.69/3.76 c veclendiving : 0.00 0 0
3.69/3.76 c intdiving : 0.00 0 0
3.69/3.76 c actconsdiving : 0.00 0 0
3.69/3.76 c objpscostdiving : 0.00 0 0
3.69/3.76 c rootsoldiving : 0.00 0 0
3.69/3.76 c linesearchdiving : 0.00 0 0
3.69/3.76 c guideddiving : 0.00 0 0
3.69/3.76 c octane : 0.00 0 0
3.69/3.76 c rens : 0.00 0 0
3.69/3.76 c rins : 0.00 0 0
3.69/3.76 c localbranching : 0.00 0 0
3.69/3.76 c mutation : 0.00 0 0
3.69/3.76 c crossover : 0.00 0 0
3.69/3.76 c dins : 0.00 0 0
3.69/3.76 c undercover : 0.00 0 0
3.69/3.76 c nlp : 0.00 0 0
3.69/3.76 c trysol : 0.00 0 0
3.69/3.76 c LP : Time Calls Iterations Iter/call Iter/sec
3.69/3.76 c primal LP : 0.00 0 0 0.00 -
3.69/3.76 c dual LP : 1.27 2606 29229 11.22 22929.56
3.69/3.76 c lex dual LP : 0.00 0 0 0.00 -
3.69/3.76 c barrier LP : 0.00 0 0 0.00 -
3.69/3.76 c diving/probing LP: 0.00 0 0 0.00 -
3.69/3.76 c strong branching : 1.55 1540 26031 16.90 16747.70
3.69/3.76 c (at root node) : - 10 2344 234.40 -
3.69/3.76 c conflict analysis: 0.00 0 0 0.00 -
3.69/3.76 c B&B Tree :
3.69/3.76 c number of runs : 1
3.69/3.76 c nodes : 4105
3.69/3.76 c nodes (total) : 4105
3.69/3.76 c nodes left : 0
3.69/3.76 c max depth : 31
3.69/3.76 c max depth (total): 31
3.69/3.76 c backtracks : 768 (18.7%)
3.69/3.76 c delayed cutoffs : 542
3.69/3.76 c repropagations : 3022 (16012 domain reductions, 508 cutoffs)
3.69/3.76 c avg switch length: 3.47
3.69/3.76 c switching time : 0.12
3.69/3.76 c Solution :
3.69/3.76 c Solutions found : 1 (1 improvements)
3.69/3.76 c First Solution : +0.00000000000000e+00 (in run 1, after 4105 nodes, 3.75 seconds, depth 17, found by <relaxation>)
3.69/3.76 c Primal Bound : +0.00000000000000e+00 (in run 1, after 4105 nodes, 3.75 seconds, depth 17, found by <relaxation>)
3.69/3.76 c Dual Bound : +0.00000000000000e+00
3.69/3.76 c Gap : 0.00 %
3.69/3.76 c Root Dual Bound : +0.00000000000000e+00
3.69/3.76 c Root Iterations : 611
3.69/3.76 c Time complete: 3.76.