0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
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-3729040-1338680101.opb>
0.00/0.01 c original problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 332 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.01 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 252 impls, 0 clqs
0.00/0.02 c (round 2) 8 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 5244 impls, 0 clqs
0.00/0.02 c (round 3) 8 del vars, 8 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 5244 impls, 0 clqs
0.00/0.02 c (round 4) 8 del vars, 12 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 5244 impls, 0 clqs
0.00/0.02 c presolving (5 rounds):
0.00/0.02 c 8 deleted vars, 12 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02 c 5244 implications, 0 cliques
0.00/0.02 c presolved problem has 212 variables (212 bin, 0 int, 0 impl, 0 cont) and 320 constraints
0.00/0.02 c 130 constraints of type <knapsack>
0.00/0.02 c 106 constraints of type <setppc>
0.00/0.02 c 84 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.0.1.5
0.00/0.02 c
0.00/0.02 c # frequency for displaying node information lines
0.00/0.02 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.02 c display/freq = 10000
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 presolving try to simplify inequalities
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/linear/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/indicator/addCouplingCons = 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 # should presolving try to simplify knapsacks
0.00/0.02 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.02 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.02 c
0.00/0.02 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.02 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.02 c presolving/probing/maxrounds = 0
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 # 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 -----------------------------------------------------------------------------------------------
0.00/0.02 c start solving
0.00/0.02 c
0.00/0.03 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.03 c 0.0s| 1 | 0 | 99 | - |1369k| 0 | 57 | 212 | 320 | 212 | 320 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.00/0.07 c y 0.1s| 1 | 0 | 99 | - |2091k| 0 | - | 212 | 320 | 212 | 320 | 0 | 0 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.00/0.07 c 0.1s| 1 | 0 | 99 | - |1896k| 0 | - | 212 | 320 | 212 | 320 | 0 | 0 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.00/0.07 c
0.00/0.07 c SCIP Status : problem is solved [optimal solution found]
0.00/0.07 c Solving Time (sec) : 0.07
0.00/0.07 c Solving Nodes : 1
0.00/0.07 c Primal Bound : +0.00000000000000e+00 (1 solutions)
0.00/0.07 c Dual Bound : +0.00000000000000e+00
0.00/0.07 c Gap : 0.00 %
0.00/0.07 s SATISFIABLE
0.00/0.07 v x219 -x220 x217 -x218 -x215 x216 -x213 x214 -x211 x212 -x209 -x210 -x207 -x208 -x205 -x206 x203 -x204 x201 -x202 x199 -x200 x197
0.00/0.07 v -x198 x195 -x196 x193 -x194 -x191 x192 -x189 x190 -x187 x188 -x185 x186 -x183 -x184 -x181 x182 -x179 -x180 -x177 x178 -x175
0.00/0.07 v -x176 -x173 -x174 x171 -x172 x169 -x170 x167 -x168 -x165 x166 x163 -x164 -x161 x162 x159 -x160 x157 -x158 -x155 x156 -x153 x154
0.00/0.07 v x151 -x152 x149 -x150 -x147 x148 -x145 x146 x143 -x144 x141 -x142 x139 -x140 x137 -x138 -x135 x136 -x133 x134 -x131 x132
0.00/0.07 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
0.00/0.07 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
0.00/0.07 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
0.00/0.07 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
0.00/0.08 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
0.00/0.08 v -x13 x11 x9 -x7 -x5 -x3 x1
0.00/0.08 c SCIP Status : problem is solved [optimal solution found]
0.00/0.08 c Total Time : 0.07
0.00/0.08 c solving : 0.07
0.00/0.08 c presolving : 0.01 (included in solving)
0.00/0.08 c reading : 0.00 (included in solving)
0.00/0.08 c Original Problem :
0.00/0.08 c Problem name : HOME/instance-3729040-1338680101.opb
0.00/0.08 c Variables : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.08 c Constraints : 332 initial, 332 maximal
0.00/0.08 c Presolved Problem :
0.00/0.08 c Problem name : t_HOME/instance-3729040-1338680101.opb
0.00/0.08 c Variables : 212 (212 binary, 0 integer, 0 implicit integer, 0 continuous)
0.00/0.08 c Constraints : 320 initial, 320 maximal
0.00/0.08 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.00/0.08 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.08 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.08 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.08 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.08 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.08 c implics : 0.00 0 8 0 0 0 0 0 0 0
0.00/0.08 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.08 c knapsack : 0.01 0 0 0 0 0 0 0 0 0
0.00/0.08 c setppc : 0.00 0 0 0 0 0 12 0 0 0
0.00/0.08 c linear : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.08 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.00/0.08 c root node : - 0 - - 0 - - - - -
0.00/0.08 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.00/0.08 c integral : 0 0 0 0 0 4 0 0 0 0 0 0
0.00/0.08 c knapsack : 130 1 1 0 0 1 0 0 0 190 0 0
0.00/0.08 c setppc : 106 1 1 0 0 1 0 0 0 0 0 0
0.00/0.08 c logicor : 84 1 1 0 0 1 0 0 0 0 0 0
0.00/0.08 c countsols : 0 0 0 0 0 3 0 0 0 0 0 0
0.00/0.08 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.00/0.08 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.08 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.08 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.08 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.08 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.00/0.08 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.00/0.08 c vbounds : 0 0 0 0
0.00/0.08 c rootredcost : 0 0 0 0
0.00/0.08 c pseudoobj : 0 0 0 0
0.00/0.08 c Propagator Timings : TotalTime Propagate Resprop
0.00/0.08 c vbounds : 0.00 0.00 0.00
0.00/0.08 c rootredcost : 0.00 0.00 0.00
0.00/0.08 c pseudoobj : 0.00 0.00 0.00
0.00/0.08 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.00/0.08 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.00/0.08 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.08 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.08 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.00/0.08 c pseudo solution : 0.00 1 0 0 0.0 0 0.0 -
0.00/0.08 c applied globally : - - - 0 0.0 - - -
0.00/0.08 c applied locally : - - - 0 0.0 - - -
0.00/0.08 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.00/0.08 c cut pool : 0.00 0 - - 0 - (maximal pool size: 410)
0.00/0.08 c redcost : 0.00 1 0 0 0 0
0.00/0.08 c impliedbounds : 0.00 1 0 0 211 0
0.00/0.08 c intobj : 0.00 0 0 0 0 0
0.00/0.08 c gomory : 0.00 1 0 0 147 0
0.00/0.08 c cgmip : 0.00 0 0 0 0 0
0.00/0.08 c closecuts : 0.00 0 0 0 0 0
0.00/0.08 c strongcg : 0.00 1 0 0 147 0
0.00/0.08 c cmir : 0.00 0 0 0 0 0
0.00/0.08 c flowcover : 0.00 0 0 0 0 0
0.00/0.08 c clique : 0.01 1 0 0 0 0
0.00/0.08 c zerohalf : 0.00 0 0 0 0 0
0.00/0.08 c mcf : 0.00 1 0 0 0 0
0.00/0.08 c oddcycle : 0.00 0 0 0 0 0
0.00/0.08 c rapidlearning : 0.04 1 0 0 0 0
0.00/0.08 c Pricers : Time Calls Vars
0.00/0.08 c problem variables: 0.00 0 0
0.00/0.08 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.00/0.08 c pscost : 0.00 0 0 0 0 0 0
0.00/0.08 c inference : 0.00 0 0 0 0 0 0
0.00/0.08 c mostinf : 0.00 0 0 0 0 0 0
0.00/0.08 c leastinf : 0.00 0 0 0 0 0 0
0.00/0.08 c fullstrong : 0.00 0 0 0 0 0 0
0.00/0.08 c allfullstrong : 0.00 0 0 0 0 0 0
0.00/0.08 c random : 0.00 0 0 0 0 0 0
0.00/0.08 c relpscost : 0.00 0 0 0 0 0 0
0.00/0.08 c Primal Heuristics : Time Calls Found
0.00/0.08 c LP solutions : 0.00 - 0
0.00/0.08 c pseudo solutions : 0.00 - 0
0.00/0.08 c trivial : 0.00 1 0
0.00/0.08 c shiftandpropagate: 0.00 0 0
0.00/0.08 c simplerounding : 0.00 0 0
0.00/0.08 c zirounding : 0.00 0 0
0.00/0.08 c rounding : 0.00 0 0
0.00/0.08 c shifting : 0.00 0 0
0.00/0.08 c intshifting : 0.00 0 0
0.00/0.08 c oneopt : 0.00 0 0
0.00/0.08 c twoopt : 0.00 0 0
0.00/0.08 c fixandinfer : 0.00 0 0
0.00/0.08 c feaspump : 0.00 0 0
0.00/0.08 c clique : 0.00 0 0
0.00/0.08 c coefdiving : 0.00 0 0
0.00/0.08 c pscostdiving : 0.00 0 0
0.00/0.08 c fracdiving : 0.00 0 0
0.00/0.08 c veclendiving : 0.00 0 0
0.00/0.08 c intdiving : 0.00 0 0
0.00/0.08 c actconsdiving : 0.00 0 0
0.00/0.08 c objpscostdiving : 0.00 0 0
0.00/0.08 c rootsoldiving : 0.00 0 0
0.00/0.08 c linesearchdiving : 0.00 0 0
0.00/0.08 c guideddiving : 0.00 0 0
0.00/0.08 c octane : 0.00 0 0
0.00/0.08 c rens : 0.00 0 0
0.00/0.08 c rins : 0.00 0 0
0.00/0.08 c localbranching : 0.00 0 0
0.00/0.08 c mutation : 0.00 0 0
0.00/0.08 c crossover : 0.00 0 0
0.00/0.08 c dins : 0.00 0 0
0.00/0.08 c vbounds : 0.00 0 0
0.00/0.08 c undercover : 0.00 0 0
0.00/0.08 c subnlp : 0.00 0 0
0.00/0.08 c trysol : 0.00 0 0
0.00/0.08 c LP : Time Calls Iterations Iter/call Iter/sec
0.00/0.08 c primal LP : 0.00 0 0 0.00 -
0.00/0.08 c dual LP : 0.00 1 99 99.00 -
0.00/0.08 c lex dual LP : 0.00 0 0 0.00 -
0.00/0.08 c barrier LP : 0.00 0 0 0.00 -
0.00/0.08 c diving/probing LP: 0.00 0 0 0.00 -
0.00/0.08 c strong branching : 0.00 0 0 0.00 -
0.00/0.08 c (at root node) : - 0 0 0.00 -
0.00/0.08 c conflict analysis: 0.00 0 0 0.00 -
0.00/0.08 c B&B Tree :
0.00/0.08 c number of runs : 1
0.00/0.08 c nodes : 1
0.00/0.08 c nodes (total) : 1
0.00/0.08 c nodes left : 0
0.00/0.08 c max depth : 0
0.00/0.08 c max depth (total): 0
0.00/0.08 c backtracks : 0 (0.0%)
0.00/0.08 c delayed cutoffs : 0
0.00/0.08 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.00/0.08 c avg switch length: 2.00
0.00/0.08 c switching time : 0.00
0.00/0.08 c Solution :
0.00/0.08 c Solutions found : 1 (1 improvements)
0.00/0.08 c First Solution : +0.00000000000000e+00 (in run 1, after 1 nodes, 0.07 seconds, depth 0, found by <trysol>)
0.00/0.08 c Primal Bound : +0.00000000000000e+00 (in run 1, after 1 nodes, 0.07 seconds, depth 0, found by <trysol>)
0.00/0.08 c Dual Bound : +0.00000000000000e+00
0.00/0.08 c Gap : 0.00 %
0.00/0.08 c Root Dual Bound : +0.00000000000000e+00
0.00/0.08 c Root Iterations : 99
0.00/0.08 c Time complete: 0.08.