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-3450267-1307112059.opb>
0.00/0.01 c original problem has 1460 variables (1460 bin, 0 int, 0 impl, 0 cont) and 1762 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.02 c presolving:
0.02/0.05 c (round 1) 0 del vars, 1460 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 101 upgd conss, 10280 impls, 199 clqs
0.02/0.05 c (round 2) 1260 del vars, 1460 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 10280 impls, 0 clqs
0.02/0.06 c presolving (3 rounds):
0.02/0.06 c 1260 deleted vars, 1460 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.02/0.06 c 10280 implications, 0 cliques
0.02/0.06 c presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 302 constraints
0.02/0.06 c 201 constraints of type <knapsack>
0.02/0.06 c 100 constraints of type <setppc>
0.02/0.06 c 1 constraints of type <linear>
0.02/0.06 c transformed objective value is always integral (scale: 1)
0.02/0.06 c Presolving Time: 0.04
0.02/0.06 c - non default parameters ----------------------------------------------------------------------
0.02/0.06 c # SCIP version 2.0.1.5
0.02/0.06 c
0.02/0.06 c # frequency for displaying node information lines
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.02/0.06 c display/freq = 10000
0.02/0.06 c
0.02/0.06 c # maximal time in seconds to run
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.06 c limits/time = 1800
0.02/0.06 c
0.02/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.02/0.06 c limits/memory = 13950
0.02/0.06 c
0.02/0.06 c # solving stops, if the given number of solutions were found (-1: no limit)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.06 c limits/solutions = 1
0.02/0.06 c
0.02/0.06 c # maximal number of separation rounds per node (-1: unlimited)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 5]
0.02/0.06 c separating/maxrounds = 1
0.02/0.06 c
0.02/0.06 c # maximal number of separation rounds in the root node (-1: unlimited)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.06 c separating/maxroundsroot = 5
0.02/0.06 c
0.02/0.06 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.02/0.06 c # [type: int, range: [1,2], default: 1]
0.02/0.06 c timing/clocktype = 2
0.02/0.06 c
0.02/0.06 c # belongs reading time to solving time?
0.02/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.06 c timing/reading = TRUE
0.02/0.06 c
0.02/0.06 c # should presolving try to simplify inequalities
0.02/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.06 c constraints/linear/simplifyinequalities = TRUE
0.02/0.06 c
0.02/0.06 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.02/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.06 c constraints/indicator/addCouplingCons = TRUE
0.02/0.06 c
0.02/0.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.02/0.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.02/0.06 c constraints/knapsack/disaggregation = FALSE
0.02/0.06 c
0.02/0.06 c # should presolving try to simplify knapsacks
0.02/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.02/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.02/0.06 c
0.02/0.06 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.06 c presolving/probing/maxrounds = 0
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.06 c heuristics/coefdiving/freq = -1
0.02/0.06 c
0.02/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.06 c heuristics/coefdiving/maxlpiterquot = 0.075
0.02/0.06 c
0.02/0.06 c # additional number of allowed LP iterations
0.02/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.06 c heuristics/coefdiving/maxlpiterofs = 1500
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 30]
0.02/0.06 c heuristics/crossover/freq = -1
0.02/0.06 c
0.02/0.06 c # number of nodes added to the contingent of the total nodes
0.02/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.06 c heuristics/crossover/nodesofs = 750
0.02/0.06 c
0.02/0.06 c # number of nodes without incumbent change that heuristic should wait
0.02/0.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.02/0.06 c heuristics/crossover/nwaitingnodes = 100
0.02/0.06 c
0.02/0.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.02/0.06 c # [type: real, range: [0,1], default: 0.1]
0.02/0.06 c heuristics/crossover/nodesquot = 0.15
0.02/0.06 c
0.02/0.06 c # minimum percentage of integer variables that have to be fixed
0.02/0.06 c # [type: real, range: [0,1], default: 0.666]
0.02/0.06 c heuristics/crossover/minfixingrate = 0.5
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.06 c heuristics/feaspump/freq = -1
0.02/0.06 c
0.02/0.06 c # additional number of allowed LP iterations
0.02/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.06 c heuristics/feaspump/maxlpiterofs = 2000
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.06 c heuristics/fracdiving/freq = -1
0.02/0.06 c
0.02/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.06 c heuristics/fracdiving/maxlpiterquot = 0.075
0.02/0.06 c
0.02/0.06 c # additional number of allowed LP iterations
0.02/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.06 c heuristics/fracdiving/maxlpiterofs = 1500
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.06 c heuristics/guideddiving/freq = -1
0.02/0.06 c
0.02/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.06 c heuristics/guideddiving/maxlpiterquot = 0.075
0.02/0.06 c
0.02/0.06 c # additional number of allowed LP iterations
0.02/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.06 c heuristics/guideddiving/maxlpiterofs = 1500
0.02/0.06 c
0.02/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.06 c heuristics/intdiving/maxlpiterquot = 0.075
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.06 c heuristics/intshifting/freq = -1
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.06 c heuristics/linesearchdiving/freq = -1
0.02/0.06 c
0.02/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.06 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.02/0.06 c
0.02/0.06 c # additional number of allowed LP iterations
0.02/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.06 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.06 c heuristics/objpscostdiving/freq = -1
0.02/0.06 c
0.02/0.06 c # maximal fraction of diving LP iterations compared to total iteration number
0.02/0.06 c # [type: real, range: [0,1], default: 0.01]
0.02/0.06 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.02/0.06 c
0.02/0.06 c # additional number of allowed LP iterations
0.02/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.06 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.06 c heuristics/oneopt/freq = -1
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.06 c heuristics/pscostdiving/freq = -1
0.02/0.06 c
0.02/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.06 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.02/0.06 c
0.02/0.06 c # additional number of allowed LP iterations
0.02/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.06 c heuristics/pscostdiving/maxlpiterofs = 1500
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.06 c heuristics/rens/freq = -1
0.02/0.06 c
0.02/0.06 c # minimum percentage of integer variables that have to be fixable
0.02/0.06 c # [type: real, range: [0,1], default: 0.5]
0.02/0.06 c heuristics/rens/minfixingrate = 0.3
0.02/0.06 c
0.02/0.06 c # number of nodes added to the contingent of the total nodes
0.02/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.02/0.06 c heuristics/rens/nodesofs = 2000
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.02/0.06 c heuristics/rootsoldiving/freq = -1
0.02/0.06 c
0.02/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.02/0.06 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.02/0.06 c
0.02/0.06 c # additional number of allowed LP iterations
0.02/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.06 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.06 c heuristics/rounding/freq = -1
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.06 c heuristics/shiftandpropagate/freq = -1
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.06 c heuristics/shifting/freq = -1
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.06 c heuristics/simplerounding/freq = -1
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.06 c heuristics/subnlp/freq = -1
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.06 c heuristics/trivial/freq = -1
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.06 c heuristics/trysol/freq = -1
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.06 c heuristics/undercover/freq = -1
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.02/0.06 c heuristics/veclendiving/freq = -1
0.02/0.06 c
0.02/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.02/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.02/0.06 c heuristics/veclendiving/maxlpiterquot = 0.075
0.02/0.06 c
0.02/0.06 c # additional number of allowed LP iterations
0.02/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.02/0.06 c heuristics/veclendiving/maxlpiterofs = 1500
0.02/0.06 c
0.02/0.06 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.02/0.06 c heuristics/zirounding/freq = -1
0.02/0.06 c
0.02/0.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.06 c separating/cmir/freq = -1
0.02/0.06 c
0.02/0.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.02/0.06 c separating/flowcover/freq = -1
0.02/0.06 c
0.02/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.02/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.02/0.06 c separating/rapidlearning/freq = 0
0.02/0.06 c
0.02/0.06 c -----------------------------------------------------------------------------------------------
0.02/0.06 c start solving
0.02/0.06 c
0.02/0.06 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.02/0.06 c 0.1s| 1 | 0 | 63 | - |4138k| 0 | 32 | 200 | 302 | 200 | 302 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.10 c y 0.1s| 1 | 0 | 63 | - |4502k| 0 | - | 200 | 302 | 200 | 302 | 0 | 0 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.09/0.11 c 0.1s| 1 | 0 | 63 | - |4426k| 0 | - | 200 | 302 | 200 | 302 | 0 | 0 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.09/0.11 c
0.09/0.11 c SCIP Status : problem is solved [optimal solution found]
0.09/0.11 c Solving Time (sec) : 0.11
0.09/0.11 c Solving Nodes : 1
0.09/0.11 c Primal Bound : +0.00000000000000e+00 (1 solutions)
0.09/0.11 c Dual Bound : +0.00000000000000e+00
0.09/0.11 c Gap : 0.00 %
0.09/0.11 s SATISFIABLE
0.09/0.11 v -x179 -x159 -x121 -x148 -x151 -x132 x175 x193 -x195 -x136 x184 -x112 -x147 -x119 x156 x182 -x141 x127 -x134 -x186 -x171 -x135 -x169
0.09/0.11 v x118 -x117 -x144 -x106 -x133 -x113 x163 -x124 x167 -x200 -x145 -x105 -x181 -x142 -x108 -x115 x107 -x129 -x158 -x185 -x172
0.09/0.11 v x161 -x160 -x139 -x137 x109 -x198 -x153 -x183 -x187 -x114 -x196 -x188 -x154 -x140 x126 -x104 -x197 -x111 -x192 -x116 -x170
0.09/0.11 v x173 -x102 -x166 x152 -x149 -x130 -x125 -x110 -x103 -x131 -x168 -x174 x155 -x138 -x194 x150 -x180 -x143 -x101 -x190 -x177 -x164
0.09/0.11 v -x157 x123 -x122 -x128 -x146 -x178 -x165 -x199 -x162 -x176 -x189 -x120 -x191 -x100 -x99 x98 -x97 x96 -x95 -x94 -x93 -x92 -x91
0.09/0.11 v -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 -x65
0.09/0.11 v -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 -x39
0.09/0.11 v -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 -x13
0.09/0.11 v -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 x1
0.09/0.11 c SCIP Status : problem is solved [optimal solution found]
0.09/0.11 c Total Time : 0.11
0.09/0.11 c solving : 0.11
0.09/0.11 c presolving : 0.04 (included in solving)
0.09/0.11 c reading : 0.01 (included in solving)
0.09/0.11 c Original Problem :
0.09/0.11 c Problem name : HOME/instance-3450267-1307112059.opb
0.09/0.11 c Variables : 1460 (1460 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.11 c Constraints : 1762 initial, 1762 maximal
0.09/0.11 c Presolved Problem :
0.09/0.11 c Problem name : t_HOME/instance-3450267-1307112059.opb
0.09/0.11 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.11 c Constraints : 302 initial, 302 maximal
0.09/0.11 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.09/0.11 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.11 c dualfix : 0.00 1260 0 0 0 0 0 0 0 0
0.09/0.11 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.11 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.11 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.11 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.11 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.11 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.11 c setppc : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.11 c linear : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.11 c pseudoboolean : 0.00 0 0 0 0 0 1460 0 0 0
0.09/0.11 c root node : - 0 - - 0 - - - - -
0.09/0.11 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.09/0.11 c integral : 0 0 0 0 0 4 0 0 0 0 0 0
0.09/0.11 c knapsack : 201 1 1 0 0 1 0 0 0 65 0 0
0.09/0.11 c setppc : 100 1 1 0 0 1 0 0 0 0 0 0
0.09/0.11 c linear : 1 1 1 0 0 1 0 0 0 0 0 0
0.09/0.11 c countsols : 0 0 0 0 0 3 0 0 0 0 0 0
0.09/0.11 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.09/0.11 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.11 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.11 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.11 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.11 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.11 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.09/0.11 c vbounds : 0 0 0 0
0.09/0.11 c rootredcost : 0 0 0 0
0.09/0.11 c pseudoobj : 0 0 0 0
0.09/0.11 c Propagator Timings : TotalTime Propagate Resprop
0.09/0.11 c vbounds : 0.00 0.00 0.00
0.09/0.11 c rootredcost : 0.00 0.00 0.00
0.09/0.11 c pseudoobj : 0.00 0.00 0.00
0.09/0.11 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.11 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.11 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.11 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.11 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.11 c pseudo solution : 0.00 1 0 0 0.0 0 0.0 -
0.09/0.11 c applied globally : - - - 0 0.0 - - -
0.09/0.11 c applied locally : - - - 0 0.0 - - -
0.09/0.11 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.11 c cut pool : 0.00 0 - - 0 - (maximal pool size: 69)
0.09/0.11 c redcost : 0.00 1 0 0 0 0
0.09/0.11 c impliedbounds : 0.00 1 0 0 0 0
0.09/0.11 c intobj : 0.00 0 0 0 0 0
0.09/0.11 c gomory : 0.01 1 0 0 0 0
0.09/0.11 c cgmip : 0.00 0 0 0 0 0
0.09/0.11 c closecuts : 0.00 0 0 0 0 0
0.09/0.11 c strongcg : 0.01 1 0 0 80 0
0.09/0.11 c cmir : 0.00 0 0 0 0 0
0.09/0.11 c flowcover : 0.00 0 0 0 0 0
0.09/0.11 c clique : 0.00 1 0 0 0 0
0.09/0.11 c zerohalf : 0.00 0 0 0 0 0
0.09/0.11 c mcf : 0.00 1 0 0 0 0
0.09/0.11 c oddcycle : 0.00 0 0 0 0 0
0.09/0.11 c rapidlearning : 0.02 1 0 0 0 0
0.09/0.11 c Pricers : Time Calls Vars
0.09/0.11 c problem variables: 0.00 0 0
0.09/0.11 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.11 c pscost : 0.00 0 0 0 0 0 0
0.09/0.11 c inference : 0.00 0 0 0 0 0 0
0.09/0.11 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.11 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.11 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.11 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.11 c random : 0.00 0 0 0 0 0 0
0.09/0.11 c relpscost : 0.00 0 0 0 0 0 0
0.09/0.11 c Primal Heuristics : Time Calls Found
0.09/0.11 c LP solutions : 0.00 - 0
0.09/0.11 c pseudo solutions : 0.00 - 0
0.09/0.11 c trivial : 0.00 1 0
0.09/0.11 c shiftandpropagate: 0.00 0 0
0.09/0.11 c simplerounding : 0.00 0 0
0.09/0.11 c zirounding : 0.00 0 0
0.09/0.11 c rounding : 0.00 0 0
0.09/0.11 c shifting : 0.00 0 0
0.09/0.11 c intshifting : 0.00 0 0
0.09/0.11 c oneopt : 0.00 0 0
0.09/0.11 c twoopt : 0.00 0 0
0.09/0.11 c fixandinfer : 0.00 0 0
0.09/0.11 c feaspump : 0.00 0 0
0.09/0.11 c clique : 0.00 0 0
0.09/0.11 c coefdiving : 0.00 0 0
0.09/0.11 c pscostdiving : 0.00 0 0
0.09/0.11 c fracdiving : 0.00 0 0
0.09/0.11 c veclendiving : 0.00 0 0
0.09/0.11 c intdiving : 0.00 0 0
0.09/0.11 c actconsdiving : 0.00 0 0
0.09/0.11 c objpscostdiving : 0.00 0 0
0.09/0.11 c rootsoldiving : 0.00 0 0
0.09/0.11 c linesearchdiving : 0.00 0 0
0.09/0.11 c guideddiving : 0.00 0 0
0.09/0.11 c octane : 0.00 0 0
0.09/0.11 c rens : 0.00 0 0
0.09/0.11 c rins : 0.00 0 0
0.09/0.11 c localbranching : 0.00 0 0
0.09/0.11 c mutation : 0.00 0 0
0.09/0.11 c crossover : 0.00 0 0
0.09/0.11 c dins : 0.00 0 0
0.09/0.11 c vbounds : 0.00 0 0
0.09/0.11 c undercover : 0.00 0 0
0.09/0.11 c subnlp : 0.00 0 0
0.09/0.11 c trysol : 0.00 0 0
0.09/0.11 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.11 c primal LP : 0.00 0 0 0.00 -
0.09/0.11 c dual LP : 0.00 1 63 63.00 -
0.09/0.11 c lex dual LP : 0.00 0 0 0.00 -
0.09/0.11 c barrier LP : 0.00 0 0 0.00 -
0.09/0.11 c diving/probing LP: 0.00 0 0 0.00 -
0.09/0.11 c strong branching : 0.00 0 0 0.00 -
0.09/0.11 c (at root node) : - 0 0 0.00 -
0.09/0.11 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.11 c B&B Tree :
0.09/0.11 c number of runs : 1
0.09/0.11 c nodes : 1
0.09/0.11 c nodes (total) : 1
0.09/0.11 c nodes left : 0
0.09/0.11 c max depth : 0
0.09/0.11 c max depth (total): 0
0.09/0.11 c backtracks : 0 (0.0%)
0.09/0.11 c delayed cutoffs : 0
0.09/0.11 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.09/0.11 c avg switch length: 2.00
0.09/0.11 c switching time : 0.00
0.09/0.11 c Solution :
0.09/0.11 c Solutions found : 1 (1 improvements)
0.09/0.11 c First Solution : +0.00000000000000e+00 (in run 1, after 1 nodes, 0.10 seconds, depth 0, found by <trysol>)
0.09/0.11 c Primal Bound : +0.00000000000000e+00 (in run 1, after 1 nodes, 0.10 seconds, depth 0, found by <trysol>)
0.09/0.11 c Dual Bound : +0.00000000000000e+00
0.09/0.11 c Gap : 0.00 %
0.09/0.11 c Root Dual Bound : +0.00000000000000e+00
0.09/0.11 c Root Iterations : 63
0.09/0.12 c Time complete: 0.11.