0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [Expressions interpreter: NONE]
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-2665802-1276279250.opb>
0.00/0.01 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 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.02 c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.03 c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.03 c presolving (3 rounds):
0.00/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 8 implications, 68 cliques
0.00/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.03 c 1 constraints of type <knapsack>
0.00/0.03 c 68 constraints of type <setppc>
0.00/0.03 c 4 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.00
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1800
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = 5
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = FALSE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/coefdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = -1
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = 750
0.00/0.03 c
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = 100
0.00/0.03 c
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = 0.15
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixed
0.00/0.03 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = 0.5
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/feaspump/freq = -1
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/fracdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/guideddiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/intshifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/linesearchdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/nlp/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/objpscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03 c # [type: real, range: [0,1], default: 0.01]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/oneopt/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/pscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/rens/freq = -1
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixable
0.00/0.03 c # [type: real, range: [0,1], default: 0.5]
0.00/0.03 c heuristics/rens/minfixingrate = 0.3
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/rens/nodesofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/rootsoldiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/rounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/shifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/simplerounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/trivial/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/trysol/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03 c heuristics/veclendiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # additional number of allowed LP iterations
0.00/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/zirounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/cmir/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c separating/flowcover/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.04 c
0.00/0.04 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.04 c 0.0s| 1 | 0 | 51 | - | 743k| 0 | 45 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.24 c 0.2s| 1 | 0 | 76 | - |1224k| 0 | 48 | 169 | 221 | 169 | 84 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 98 | - |1501k| 0 | 46 | 169 | 221 | 169 | 94 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.28 c 0.2s| 1 | 0 | 113 | - |1811k| 0 | 46 | 169 | 221 | 169 | 98 | 25 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.2s| 1 | 0 | 142 | - |2116k| 0 | 49 | 169 | 221 | 169 | 103 | 30 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 182 | - |2446k| 0 | 47 | 169 | 221 | 169 | 111 | 38 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.39 c 0.3s| 1 | 0 | 208 | - |2359k| 0 | 45 | 169 | 141 | 169 | 111 | 38 | 0 | 10 | 0.000000e+00 | -- | Inf
0.39/0.42 c 0.3s| 1 | 0 | 229 | - |2351k| 0 | 42 | 169 | 134 | 169 | 111 | 38 | 0 | 16 | 0.000000e+00 | -- | Inf
0.39/0.44 c 0.4s| 1 | 0 | 257 | - |2303k| 0 | 0 | 169 | 88 | 169 | 111 | 38 | 0 | 21 | 0.000000e+00 | -- | Inf
0.39/0.44 c (run 1, node 1) restarting after 82 global fixings of integer variables
0.39/0.44 c
0.39/0.44 c (restart) converted 37 cuts from the global cut pool into linear constraints
0.39/0.44 c
0.39/0.44 c presolving:
0.39/0.45 c (round 1) 82 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 24 impls, 66 clqs
0.39/0.45 c (round 2) 82 del vars, 10 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 53 upgd conss, 24 impls, 66 clqs
0.39/0.46 c presolving (3 rounds):
0.39/0.46 c 82 deleted vars, 10 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.46 c 24 implications, 66 cliques
0.39/0.46 c presolved problem has 87 variables (87 bin, 0 int, 0 impl, 0 cont) and 115 constraints
0.39/0.46 c 17 constraints of type <knapsack>
0.39/0.46 c 71 constraints of type <setppc>
0.39/0.46 c 27 constraints of type <logicor>
0.39/0.46 c transformed objective value is always integral (scale: 1)
0.39/0.46 c Presolving Time: 0.02
0.39/0.46 c
0.39/0.46 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.46 c 0.4s| 1 | 0 | 306 | - | 888k| 0 | 0 | 87 | 115 | 87 | 92 | 0 | 0 | 21 | 0.000000e+00 | -- | Inf
0.39/0.46 c * 0.4s| 1 | 0 | 306 | - | 890k| 0 | - | 87 | 115 | 87 | 92 | 0 | 0 | 21 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.39/0.46 c
0.39/0.46 c SCIP Status : problem is solved [optimal solution found]
0.39/0.46 c Solving Time (sec) : 0.39
0.39/0.46 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
0.39/0.46 c Primal Bound : +0.00000000000000e+00 (1 solutions)
0.39/0.46 c Dual Bound : +0.00000000000000e+00
0.39/0.46 c Gap : 0.00 %
0.39/0.46 s SATISFIABLE
0.39/0.46 v -x169 -x168 -x167 -x166 -x165 -x164 -x163 -x162 -x161 -x160 x159 -x158 -x157 -x156 -x155 -x154 -x153 x152 -x151 -x150 -x149 -x148
0.39/0.46 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 x132 -x131 -x130 -x129 -x128 x127
0.39/0.46 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 x112 -x111 -x110 -x109 -x108 -x107 -x106
0.39/0.46 v -x105 -x104 -x103 x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 x83 -x82
0.39/0.46 v -x81 -x80 -x79 -x78 x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57
0.39/0.46 v -x56 -x55 -x54 x53 -x52 -x51 -x50 -x49 -x48 -x47 -x46 x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31
0.39/0.46 v x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 -x21 x20 -x19 -x18 -x17 -x16 -x15 -x14 x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5
0.39/0.46 v -x4 -x3 -x2 -x1
0.39/0.46 c SCIP Status : problem is solved [optimal solution found]
0.39/0.46 c Solving Time : 0.39
0.39/0.46 c Original Problem :
0.39/0.46 c Problem name : HOME/instance-2665802-1276279250.opb
0.39/0.46 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.46 c Constraints : 101 initial, 101 maximal
0.39/0.46 c Presolved Problem :
0.39/0.46 c Problem name : t_HOME/instance-2665802-1276279250.opb
0.39/0.46 c Variables : 87 (87 binary, 0 integer, 0 implicit integer, 0 continuous)
0.39/0.46 c Constraints : 115 initial, 115 maximal
0.39/0.46 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.39/0.46 c trivial : 0.00 82 0 0 0 0 0 0 0
0.39/0.46 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.39/0.46 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.39/0.46 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.39/0.47 c implics : 0.00 0 0 0 0 0 0 0 0
0.39/0.47 c probing : 0.00 0 0 0 0 0 0 0 0
0.39/0.47 c knapsack : 0.00 0 0 0 0 0 0 0 0
0.39/0.47 c setppc : 0.02 0 0 0 0 0 0 0 0
0.39/0.47 c linear : 0.00 0 0 0 0 0 35 0 0
0.39/0.47 c logicor : 0.00 0 0 0 0 0 3 0 0
0.39/0.47 c root node : - 82 - - 82 - - - -
0.39/0.47 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.39/0.47 c integral : 0 0 0 5 0 0 15 0 0 0
0.39/0.47 c knapsack : 17 6 6 2 0 0 0 0 0 0
0.39/0.47 c setppc : 71 6 6 2 0 0 67 0 0 0
0.39/0.47 c logicor : 27 6 2 2 0 0 0 0 0 0
0.39/0.47 c countsols : 0 0 0 2 0 0 0 0 0 0
0.39/0.47 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.39/0.47 c integral : 0.09 0.00 0.00 0.09 0.00
0.39/0.47 c knapsack : 0.00 0.00 0.00 0.00 0.00
0.39/0.47 c setppc : 0.00 0.00 0.00 0.00 0.00
0.39/0.47 c logicor : 0.00 0.00 0.00 0.00 0.00
0.39/0.47 c countsols : 0.00 0.00 0.00 0.00 0.00
0.39/0.47 c Propagators : Time Calls Cutoffs DomReds
0.39/0.47 c vbounds : 0.00 2 0 0
0.39/0.47 c rootredcost : 0.00 0 0 0
0.39/0.47 c pseudoobj : 0.00 0 0 0
0.39/0.47 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.39/0.47 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.39/0.47 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.47 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.47 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.39/0.47 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.39/0.47 c applied globally : - - - 0 0.0 - - -
0.39/0.47 c applied locally : - - - 0 0.0 - - -
0.39/0.47 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.39/0.47 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.39/0.47 c redcost : 0.00 6 0 0 0 0
0.39/0.47 c impliedbounds : 0.00 5 0 0 0 0
0.39/0.47 c intobj : 0.00 0 0 0 0 0
0.39/0.47 c cgmip : 0.00 0 0 0 0 0
0.39/0.47 c gomory : 0.05 5 0 0 5 0
0.39/0.47 c strongcg : 0.03 5 0 0 355 0
0.39/0.47 c cmir : 0.00 0 0 0 0 0
0.39/0.47 c flowcover : 0.00 0 0 0 0 0
0.39/0.47 c clique : 0.02 5 0 0 23 0
0.39/0.47 c zerohalf : 0.00 0 0 0 0 0
0.39/0.47 c mcf : 0.00 1 0 0 0 0
0.39/0.47 c rapidlearning : 0.15 1 0 0 0 148
0.39/0.47 c Pricers : Time Calls Vars
0.39/0.47 c problem variables: 0.00 0 0
0.39/0.47 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.39/0.47 c relpscost : 0.09 3 0 15 0 0 0
0.39/0.47 c pscost : 0.00 0 0 0 0 0 0
0.39/0.47 c inference : 0.00 0 0 0 0 0 0
0.39/0.47 c mostinf : 0.00 0 0 0 0 0 0
0.39/0.47 c leastinf : 0.00 0 0 0 0 0 0
0.39/0.47 c fullstrong : 0.00 0 0 0 0 0 0
0.39/0.47 c allfullstrong : 0.00 0 0 0 0 0 0
0.39/0.47 c random : 0.00 0 0 0 0 0 0
0.39/0.47 c Primal Heuristics : Time Calls Found
0.39/0.47 c LP solutions : 0.00 - 1
0.39/0.47 c pseudo solutions : 0.00 - 0
0.39/0.47 c trivial : 0.00 1 0
0.39/0.47 c simplerounding : 0.00 0 0
0.39/0.47 c zirounding : 0.00 0 0
0.39/0.47 c rounding : 0.00 0 0
0.39/0.47 c shifting : 0.00 0 0
0.39/0.47 c intshifting : 0.00 0 0
0.39/0.47 c oneopt : 0.00 0 0
0.39/0.47 c twoopt : 0.00 0 0
0.39/0.47 c fixandinfer : 0.00 0 0
0.39/0.47 c feaspump : 0.00 0 0
0.39/0.47 c coefdiving : 0.00 0 0
0.39/0.47 c pscostdiving : 0.00 0 0
0.39/0.47 c fracdiving : 0.00 0 0
0.39/0.47 c veclendiving : 0.00 0 0
0.39/0.47 c intdiving : 0.00 0 0
0.39/0.47 c actconsdiving : 0.00 0 0
0.39/0.47 c objpscostdiving : 0.00 0 0
0.39/0.47 c rootsoldiving : 0.00 0 0
0.39/0.47 c linesearchdiving : 0.00 0 0
0.39/0.47 c guideddiving : 0.00 0 0
0.39/0.47 c octane : 0.00 0 0
0.39/0.47 c rens : 0.00 0 0
0.39/0.47 c rins : 0.00 0 0
0.39/0.47 c localbranching : 0.00 0 0
0.39/0.47 c mutation : 0.00 0 0
0.39/0.47 c crossover : 0.00 0 0
0.39/0.47 c dins : 0.00 0 0
0.39/0.47 c undercover : 0.00 0 0
0.39/0.47 c nlp : 0.00 0 0
0.39/0.47 c trysol : 0.00 0 0
0.39/0.47 c LP : Time Calls Iterations Iter/call Iter/sec
0.39/0.47 c primal LP : 0.00 0 0 0.00 -
0.39/0.47 c dual LP : 0.01 10 306 30.60 30600.00
0.39/0.47 c lex dual LP : 0.00 0 0 0.00 -
0.39/0.47 c barrier LP : 0.00 0 0 0.00 -
0.39/0.47 c diving/probing LP: 0.00 0 0 0.00 -
0.39/0.47 c strong branching : 0.09 21 1502 71.52 16688.89
0.39/0.47 c (at root node) : - 21 1502 71.52 -
0.39/0.47 c conflict analysis: 0.00 0 0 0.00 -
0.39/0.47 c B&B Tree :
0.39/0.47 c number of runs : 2
0.39/0.47 c nodes : 1
0.39/0.47 c nodes (total) : 2
0.39/0.47 c nodes left : 0
0.39/0.47 c max depth : 0
0.39/0.47 c max depth (total): 0
0.39/0.47 c backtracks : 0 (0.0%)
0.39/0.47 c delayed cutoffs : 0
0.39/0.47 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.39/0.47 c avg switch length: 2.00
0.39/0.47 c switching time : 0.00
0.39/0.47 c Solution :
0.39/0.47 c Solutions found : 1 (1 improvements)
0.39/0.47 c First Solution : +0.00000000000000e+00 (in run 2, after 1 nodes, 0.39 seconds, depth 0, found by <relaxation>)
0.39/0.47 c Primal Bound : +0.00000000000000e+00 (in run 2, after 1 nodes, 0.39 seconds, depth 0, found by <relaxation>)
0.39/0.47 c Dual Bound : +0.00000000000000e+00
0.39/0.47 c Gap : 0.00 %
0.39/0.47 c Root Dual Bound : +0.00000000000000e+00
0.39/0.47 c Root Iterations : 306
0.39/0.47 c Time complete: 0.47.