0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: 947bdb7-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3691542-1338028260.opb>
0.00/0.00 c original problem has 252 variables (252 bin, 0 int, 0 impl, 0 cont) and 206 constraints
0.00/0.00 c problem read in 0.00
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 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 206 upgd conss, 0 impls, 26 clqs
0.00/0.02 c presolving (2 rounds):
0.00/0.02 c 0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 0 implications, 26 cliques
0.00/0.02 c presolved problem has 252 variables (252 bin, 0 int, 0 impl, 0 cont) and 206 constraints
0.00/0.02 c 26 constraints of type <setppc>
0.00/0.02 c 180 constraints of type <logicor>
0.00/0.02 c transformed objective value is always integral (scale: 1)
0.00/0.02 c Presolving Time: 0.01
0.00/0.02 c - non default parameters ----------------------------------------------------------------------
0.00/0.02 c # SCIP version 2.1.1.4
0.00/0.02 c
0.00/0.02 c # maximal time in seconds to run
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/time = 1797
0.00/0.02 c
0.00/0.02 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.02 c limits/memory = 13950
0.00/0.02 c
0.00/0.02 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c limits/solutions = 1
0.00/0.02 c
0.00/0.02 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.02 c separating/maxrounds = 1
0.00/0.02 c
0.00/0.02 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/maxroundsroot = 5
0.00/0.02 c
0.00/0.02 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.02 c # [type: int, range: [1,2], default: 1]
0.00/0.02 c timing/clocktype = 2
0.00/0.02 c
0.00/0.02 c # belongs reading time to solving time?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c timing/reading = TRUE
0.00/0.02 c
0.00/0.02 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.02 c constraints/knapsack/disaggregation = FALSE
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/coefdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.02 c heuristics/crossover/freq = -1
0.00/0.02 c
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/crossover/nodesofs = 750
0.00/0.02 c
0.00/0.02 c # number of nodes without incumbent change that heuristic should wait
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.02 c heuristics/crossover/nwaitingnodes = 100
0.00/0.02 c
0.00/0.02 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.02 c # [type: real, range: [0,1], default: 0.1]
0.00/0.02 c heuristics/crossover/nodesquot = 0.15
0.00/0.02 c
0.00/0.02 c # minimum percentage of integer variables that have to be fixed
0.00/0.02 c # [type: real, range: [0,1], default: 0.666]
0.00/0.02 c heuristics/crossover/minfixingrate = 0.5
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/feaspump/freq = -1
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/fracdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/guideddiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/intshifting/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/linesearchdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/objpscostdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.02 c # [type: real, range: [0,1], default: 0.01]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/oneopt/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/pscostdiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/rens/freq = -1
0.00/0.02 c
0.00/0.02 c # minimum percentage of integer variables that have to be fixable
0.00/0.02 c # [type: real, range: [0,1], default: 0.5]
0.00/0.02 c heuristics/rens/minfixingrate = 0.3
0.00/0.02 c
0.00/0.02 c # number of nodes added to the contingent of the total nodes
0.00/0.02 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02 c heuristics/rens/nodesofs = 2000
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02 c heuristics/rootsoldiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/rounding/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/shiftandpropagate/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/shifting/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/simplerounding/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/subnlp/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/trivial/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/trysol/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c heuristics/undercover/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02 c heuristics/veclendiving/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.02 c
0.00/0.02 c # additional number of allowed LP iterations
0.00/0.02 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/zirounding/freq = -1
0.00/0.02 c
0.00/0.02 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c propagating/probing/maxprerounds = 0
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/cmir/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02 c separating/flowcover/freq = -1
0.00/0.02 c
0.00/0.02 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c separating/rapidlearning/freq = 0
0.00/0.02 c
0.00/0.02 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02 c heuristics/indoneopt/freq = -1
0.00/0.02 c
0.00/0.02 c -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.00/0.02 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.02 c 0.0s| 1 | 0 | 74 | - |1162k| 0 | 50 | 252 | 206 | 252 | 206 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 99 | - |1510k| 0 | 53 | 252 | 266 | 252 | 212 | 6 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.13 c 0.1s| 1 | 0 | 183 | - |1548k| 0 | 54 | 252 | 266 | 252 | 215 | 9 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 486 | - |1591k| 0 | 47 | 252 | 266 | 252 | 219 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.16 c 0.2s| 1 | 0 | 510 | - |1701k| 0 | 51 | 252 | 266 | 252 | 226 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.17 c 0.2s| 1 | 0 | 552 | - |1946k| 0 | 52 | 252 | 266 | 252 | 231 | 25 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.18 c 0.2s| 1 | 2 | 552 | - |1947k| 0 | 52 | 252 | 266 | 252 | 231 | 25 | 0 | 10 | 0.000000e+00 | -- | Inf
0.59/0.60 c 0.6s| 100 | 27 | 1602 | 10.6 |2046k| 21 | - | 252 | 296 | 252 | 219 | 25 | 30 | 690 | 0.000000e+00 | -- | Inf
0.68/0.71 c * 0.7s| 138 | 0 | 1890 | 9.8 |2046k| 21 | - | 252 | 314 | 252 | 219 | 25 | 48 | 881 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.68/0.71 c
0.68/0.71 c SCIP Status : problem is solved [optimal solution found]
0.68/0.71 c Solving Time (sec) : 0.71
0.68/0.71 c Solving Nodes : 138
0.68/0.71 c Primal Bound : +0.00000000000000e+00 (1 solutions)
0.68/0.71 c Dual Bound : +0.00000000000000e+00
0.68/0.71 c Gap : 0.00 %
0.68/0.71 s SATISFIABLE
0.68/0.71 v -x157 x155 -x1 -x8 -x7 -x78 -x77 -x82 -x152 -x73 -x161 -x149 -x162 x6 -x5 -x79 -x163 -x14 -x153 -x167 -x10 -x141 x41 -x31 -x30
0.68/0.71 v -x166 -x158 -x70 -x65 -x62 -x59 -x164 -x147 -x80 -x126 -x119 -x32 -x146 -x116 -x34 -x114 -x117 -x61 x123 -x33 -x63 -x121 -x120
0.68/0.71 v -x165 -x37 -x36 -x66 -x38 -x2 -x27 x26 -x25 -x24 -x22 -x20 -x17 -x16 -x40 -x35 -x28 -x125 -x12 -x68 -x29 -x69 x74 x145 -x71
0.68/0.71 v -x11 -x154 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x89 -x88 x87 -x86 -x75 -x85 -x122 -x42 -x151 -x90 -x57 -x113 -x115 -x83
0.68/0.71 v -x143 -x186 -x185 -x184 -x183 x182 -x181 -x3 x58 -x67 -x84 -x144 -x4 -x174 x173 -x172 -x171 -x170 -x169 -x15 -x159 -x112 -x111
0.68/0.71 v -x110 -x109 -x108 -x107 x106 -x105 -x103 -x102 -x101 -x99 -x118 -x18 -x148 -x9 -x39 -x76 -x56 -x55 -x53 -x52 x51 -x49 -x47
0.68/0.71 v -x46 -x45 -x44 -x43 -x210 -x209 -x208 -x207 -x206 -x205 -x21 -x50 -x246 -x245 -x244 -x243 x242 -x241 -x13 -x252 -x251 -x250 -x249
0.68/0.71 v -x248 -x247 -x168 -x72 -x156 -x48 -x124 -x100 -x104 -x140 -x139 -x138 -x137 x136 -x134 -x133 -x132 -x131 -x130 -x129 -x128
0.68/0.71 v -x127 -x180 -x179 -x178 x177 -x176 -x175 -x142 -x240 x239 -x238 -x237 -x236 -x235 -x54 -x228 -x227 x226 -x225 -x224 -x223
0.68/0.71 v -x150 -x204 -x203 -x202 -x201 -x200 x199 -x160 -x216 -x215 -x214 x213 -x212 -x211 -x64 -x23 -x192 -x191 x190 -x189 -x188 -x187
0.68/0.71 v -x60 -x234 -x233 -x232 -x231 -x230 x229 -x81 x222 -x221 -x220 -x219 -x218 -x217 -x135 x198 -x197 -x196 -x195 -x194 -x193 -x19
0.68/0.71 c SCIP Status : problem is solved [optimal solution found]
0.68/0.71 c Total Time : 0.71
0.68/0.71 c solving : 0.71
0.68/0.71 c presolving : 0.01 (included in solving)
0.68/0.71 c reading : 0.00 (included in solving)
0.68/0.71 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
0.68/0.71 c Original Problem :
0.68/0.71 c Problem name : HOME/instance-3691542-1338028260.opb
0.68/0.71 c Variables : 252 (252 binary, 0 integer, 0 implicit integer, 0 continuous)
0.68/0.71 c Constraints : 206 initial, 206 maximal
0.68/0.71 c Objective sense : minimize
0.68/0.71 c Presolved Problem :
0.68/0.71 c Problem name : t_HOME/instance-3691542-1338028260.opb
0.68/0.71 c Variables : 252 (252 binary, 0 integer, 0 implicit integer, 0 continuous)
0.68/0.71 c Constraints : 206 initial, 314 maximal
0.68/0.71 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.68/0.71 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.68/0.71 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.68/0.71 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.68/0.71 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.68/0.71 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.68/0.71 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.68/0.71 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.68/0.71 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.68/0.71 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.68/0.71 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.68/0.71 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.68/0.71 c setppc : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.68/0.71 c linear : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.68/0.71 c logicor : 0.00 0.00 0 0 0 0 0 0 0 0 0
0.68/0.71 c root node : - - 0 - - 0 - - - - -
0.68/0.71 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
0.68/0.71 c integral : 0 0 0 0 145 0 3 0 18 83 0 0 174
0.68/0.71 c setppc : 26 26 5 325 1 0 0 861 0 1057 0 0 0
0.68/0.71 c linear : 0+ 60 5 49 0 0 0 0 0 0 0 0 0
0.68/0.71 c logicor : 180+ 228 5 153 1 0 0 29 0 35 0 0 0
0.68/0.71 c countsols : 0 0 0 0 1 0 2 0 0 0 0 0 0
0.68/0.71 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
0.68/0.71 c integral : 0.48 0.00 0.00 0.00 0.48 0.00 0.00 0.00
0.68/0.71 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.68/0.71 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.68/0.71 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.68/0.71 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.68/0.71 c Propagators : #Propagate #ResProp Cutoffs DomReds
0.68/0.71 c rootredcost : 0 0 0 0
0.68/0.71 c pseudoobj : 0 0 0 0
0.68/0.71 c vbounds : 0 0 0 0
0.68/0.71 c redcost : 150 0 0 0
0.68/0.71 c probing : 0 0 0 0
0.68/0.71 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
0.68/0.71 c rootredcost : 0.00 0.00 0.00 0.00 0.00
0.68/0.71 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
0.68/0.71 c vbounds : 0.00 0.00 0.00 0.00 0.00
0.68/0.71 c redcost : 0.00 0.00 0.00 0.00 0.00
0.68/0.71 c probing : 0.00 0.00 0.00 0.00 0.00
0.68/0.71 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.68/0.71 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.68/0.71 c infeasible LP : 0.00 32 31 333 27.7 0 0.0 0
0.68/0.71 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.68/0.71 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.68/0.71 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.68/0.71 c applied globally : - - - 48 17.7 - - -
0.68/0.71 c applied locally : - - - 0 0.0 - - -
0.68/0.71 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
0.68/0.71 c cut pool : 0.00 4 - - 3 - (maximal pool size: 198)
0.68/0.71 c closecuts : 0.00 0.00 0 0 0 0 0
0.68/0.71 c impliedbounds : 0.00 0.00 5 0 0 0 0
0.68/0.71 c intobj : 0.00 0.00 0 0 0 0 0
0.68/0.71 c gomory : 0.02 0.00 5 0 0 226 0
0.68/0.71 c cgmip : 0.00 0.00 0 0 0 0 0
0.68/0.71 c strongcg : 0.03 0.00 5 0 0 655 0
0.68/0.71 c cmir : 0.00 0.00 0 0 0 0 0
0.68/0.71 c flowcover : 0.00 0.00 0 0 0 0 0
0.68/0.71 c clique : 0.00 0.00 5 0 0 0 0
0.68/0.71 c zerohalf : 0.00 0.00 0 0 0 0 0
0.68/0.71 c mcf : 0.00 0.00 1 0 0 0 0
0.68/0.71 c oddcycle : 0.00 0.00 0 0 0 0 0
0.68/0.71 c rapidlearning : 0.08 0.00 1 0 0 0 60
0.68/0.71 c Pricers : ExecTime SetupTime Calls Vars
0.68/0.71 c problem variables: 0.00 - 0 0
0.68/0.71 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
0.68/0.71 c relpscost : 0.48 0.00 144 18 83 0 0 174
0.68/0.71 c pscost : 0.00 0.00 0 0 0 0 0 0
0.68/0.71 c inference : 0.00 0.00 0 0 0 0 0 0
0.68/0.71 c mostinf : 0.00 0.00 0 0 0 0 0 0
0.68/0.71 c leastinf : 0.00 0.00 0 0 0 0 0 0
0.68/0.72 c fullstrong : 0.00 0.00 0 0 0 0 0 0
0.68/0.72 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
0.68/0.72 c random : 0.00 0.00 0 0 0 0 0 0
0.68/0.72 c Primal Heuristics : ExecTime SetupTime Calls Found
0.68/0.72 c LP solutions : 0.00 - - 1
0.68/0.72 c pseudo solutions : 0.00 - - 0
0.68/0.72 c smallcard : 0.00 0.00 0 0
0.68/0.72 c trivial : 0.00 0.00 1 0
0.68/0.72 c shiftandpropagate: 0.00 0.00 0 0
0.68/0.72 c simplerounding : 0.00 0.00 0 0
0.68/0.72 c zirounding : 0.00 0.00 0 0
0.68/0.72 c rounding : 0.00 0.00 0 0
0.68/0.72 c shifting : 0.00 0.00 0 0
0.68/0.72 c intshifting : 0.00 0.00 0 0
0.68/0.72 c oneopt : 0.00 0.00 0 0
0.68/0.72 c twoopt : 0.00 0.00 0 0
0.68/0.72 c indtwoopt : 0.00 0.00 0 0
0.68/0.72 c indoneopt : 0.00 0.00 0 0
0.68/0.72 c fixandinfer : 0.00 0.00 0 0
0.68/0.72 c feaspump : 0.00 0.00 0 0
0.68/0.72 c clique : 0.00 0.00 0 0
0.68/0.72 c indrounding : 0.00 0.00 0 0
0.68/0.72 c indcoefdiving : 0.00 0.00 0 0
0.68/0.72 c coefdiving : 0.00 0.00 0 0
0.68/0.72 c pscostdiving : 0.00 0.00 0 0
0.68/0.72 c nlpdiving : 0.00 0.00 0 0
0.68/0.72 c fracdiving : 0.00 0.00 0 0
0.68/0.72 c veclendiving : 0.00 0.00 0 0
0.68/0.72 c intdiving : 0.00 0.00 0 0
0.68/0.72 c actconsdiving : 0.00 0.00 0 0
0.68/0.72 c objpscostdiving : 0.00 0.00 0 0
0.68/0.72 c rootsoldiving : 0.00 0.00 0 0
0.68/0.72 c linesearchdiving : 0.00 0.00 0 0
0.68/0.72 c guideddiving : 0.00 0.00 0 0
0.68/0.72 c octane : 0.00 0.00 0 0
0.68/0.72 c rens : 0.00 0.00 0 0
0.68/0.72 c rins : 0.00 0.00 0 0
0.68/0.72 c localbranching : 0.00 0.00 0 0
0.68/0.72 c mutation : 0.00 0.00 0 0
0.68/0.72 c crossover : 0.00 0.00 0 0
0.68/0.72 c dins : 0.00 0.00 0 0
0.68/0.72 c vbounds : 0.00 0.00 0 0
0.68/0.72 c undercover : 0.00 0.00 0 0
0.68/0.72 c subnlp : 0.00 0.00 0 0
0.68/0.72 c trysol : 0.00 0.00 0 0
0.68/0.72 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
0.68/0.72 c primal LP : 0.00 1 0 0.00 - 0.00 1
0.68/0.72 c dual LP : 0.06 182 1890 10.44 31955.90 0.00 1
0.68/0.72 c lex dual LP : 0.00 0 0 0.00 -
0.68/0.72 c barrier LP : 0.00 0 0 0.00 - 0.00 0
0.68/0.72 c diving/probing LP: 0.00 0 0 0.00 -
0.68/0.72 c strong branching : 0.47 881 13401 15.21 28632.29
0.68/0.72 c (at root node) : - 10 475 47.50 -
0.68/0.72 c conflict analysis: 0.00 0 0 0.00 -
0.68/0.72 c B&B Tree :
0.68/0.72 c number of runs : 1
0.68/0.72 c nodes : 138
0.68/0.72 c nodes (total) : 138
0.68/0.72 c nodes left : 0
0.68/0.72 c max depth : 21
0.68/0.72 c max depth (total): 21
0.68/0.72 c backtracks : 14 (10.1%)
0.68/0.72 c delayed cutoffs : 0
0.68/0.72 c repropagations : 22 (131 domain reductions, 0 cutoffs)
0.68/0.72 c avg switch length: 2.68
0.68/0.72 c switching time : 0.00
0.68/0.72 c Solution :
0.68/0.72 c Solutions found : 1 (1 improvements)
0.68/0.72 c First Solution : +0.00000000000000e+00 (in run 1, after 138 nodes, 0.71 seconds, depth 17, found by <relaxation>)
0.68/0.72 c Primal Bound : +0.00000000000000e+00 (in run 1, after 138 nodes, 0.71 seconds, depth 17, found by <relaxation>)
0.68/0.72 c Dual Bound : +0.00000000000000e+00
0.68/0.72 c Gap : 0.00 %
0.68/0.72 c Root Dual Bound : +0.00000000000000e+00
0.68/0.72 c Root Iterations : 552
0.68/0.72 c Time complete: 0.72.