0.00/0.00 c SCIP version 2.0.1.4 [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-3451940-1307113101.opb>
0.00/0.01 c original problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 302 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.04 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 10184 impls, 200 clqs
0.00/0.07 c presolving (2 rounds):
0.00/0.07 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.07 c 10184 implications, 200 cliques
0.00/0.07 c presolved problem has 1448 variables (1448 bin, 0 int, 0 impl, 0 cont) and 1550 constraints
0.00/0.07 c 1 constraints of type <knapsack>
0.00/0.07 c 300 constraints of type <setppc>
0.00/0.07 c 1248 constraints of type <and>
0.00/0.07 c 1 constraints of type <linear>
0.00/0.07 c transformed objective value is always integral (scale: 1)
0.00/0.07 c Presolving Time: 0.06
0.00/0.07 c - non default parameters ----------------------------------------------------------------------
0.00/0.07 c # SCIP version 2.0.1.4
0.00/0.07 c
0.00/0.07 c # frequency for displaying node information lines
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.07 c display/freq = 10000
0.00/0.07 c
0.00/0.07 c # maximal time in seconds to run
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/time = 1800
0.00/0.07 c
0.00/0.07 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.07 c limits/memory = 13950
0.00/0.07 c
0.00/0.07 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c limits/solutions = 1
0.00/0.07 c
0.00/0.07 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.07 c separating/maxrounds = 1
0.00/0.07 c
0.00/0.07 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c separating/maxroundsroot = 5
0.00/0.07 c
0.00/0.07 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.07 c # [type: int, range: [1,2], default: 1]
0.00/0.07 c timing/clocktype = 2
0.00/0.07 c
0.00/0.07 c # belongs reading time to solving time?
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c timing/reading = TRUE
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify inequalities
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/linear/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/indicator/addCouplingCons = TRUE
0.00/0.07 c
0.00/0.07 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.07 c constraints/knapsack/disaggregation = FALSE
0.00/0.07 c
0.00/0.07 c # should presolving try to simplify knapsacks
0.00/0.07 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.07 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.07 c
0.00/0.07 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c presolving/probing/maxrounds = 0
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/coefdiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.07 c heuristics/crossover/freq = -1
0.00/0.07 c
0.00/0.07 c # number of nodes added to the contingent of the total nodes
0.00/0.07 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.07 c heuristics/crossover/nodesofs = 750
0.00/0.07 c
0.00/0.07 c # number of nodes without incumbent change that heuristic should wait
0.00/0.07 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.07 c heuristics/crossover/nwaitingnodes = 100
0.00/0.07 c
0.00/0.07 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.07 c # [type: real, range: [0,1], default: 0.1]
0.00/0.07 c heuristics/crossover/nodesquot = 0.15
0.00/0.07 c
0.00/0.07 c # minimum percentage of integer variables that have to be fixed
0.00/0.07 c # [type: real, range: [0,1], default: 0.666]
0.00/0.07 c heuristics/crossover/minfixingrate = 0.5
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.07 c heuristics/feaspump/freq = -1
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/fracdiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/guideddiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/intshifting/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/linesearchdiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.07 c heuristics/objpscostdiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.07 c # [type: real, range: [0,1], default: 0.01]
0.00/0.07 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/oneopt/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/pscostdiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c heuristics/rens/freq = -1
0.00/0.07 c
0.00/0.07 c # minimum percentage of integer variables that have to be fixable
0.00/0.07 c # [type: real, range: [0,1], default: 0.5]
0.00/0.07 c heuristics/rens/minfixingrate = 0.3
0.00/0.07 c
0.00/0.07 c # number of nodes added to the contingent of the total nodes
0.00/0.07 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.07 c heuristics/rens/nodesofs = 2000
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.07 c heuristics/rootsoldiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.07 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/rounding/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c heuristics/shiftandpropagate/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/shifting/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/simplerounding/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/subnlp/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c heuristics/trivial/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/trysol/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c heuristics/undercover/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.07 c heuristics/veclendiving/freq = -1
0.00/0.07 c
0.00/0.07 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.07 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.07 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.07 c
0.00/0.07 c # additional number of allowed LP iterations
0.00/0.07 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.07 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.07 c
0.00/0.07 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.07 c heuristics/zirounding/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c separating/cmir/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.07 c separating/flowcover/freq = -1
0.00/0.07 c
0.00/0.07 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.07 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.07 c separating/rapidlearning/freq = 0
0.00/0.07 c
0.00/0.07 c -----------------------------------------------------------------------------------------------
0.00/0.07 c start solving
0.00/0.07 c
0.06/0.08 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.06/0.08 c 0.1s| 1 | 0 | 125 | - |6139k| 0 | 71 |1448 |1550 |1448 |2798 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.3s| 1 | 0 | 152 | - |6442k| 0 | 69 |1448 |1560 |1448 |2805 | 7 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.41 c 0.4s| 1 | 0 | 191 | - |6768k| 0 | 83 |1448 |1560 |1448 |2814 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.63 c 0.6s| 1 | 0 | 211 | - |6903k| 0 | 85 |1448 |1560 |1448 |2820 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
0.79/0.87 c 0.9s| 1 | 0 | 244 | - |7057k| 0 | 90 |1448 |1560 |1448 |2823 | 25 | 0 | 0 | 0.000000e+00 | -- | Inf
1.10/1.14 c 1.1s| 1 | 0 | 302 | - |7320k| 0 | 92 |1448 |1560 |1448 |2829 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
1.69/1.76 c 1.8s| 1 | 2 | 302 | - |7321k| 0 | 92 |1448 |1560 |1448 |2829 | 31 | 0 | 10 | 0.000000e+00 | -- | Inf
2.59/2.69 c * 2.7s| 50 | 0 | 1492 | 24.3 |7220k| 34 | - |1448 |1562 |1448 | 526 | 341 | 2 | 405 | 0.000000e+00 | 0.000000e+00 | 0.00%
2.59/2.69 c
2.59/2.69 c SCIP Status : problem is solved [optimal solution found]
2.59/2.69 c Solving Time (sec) : 2.69
2.59/2.69 c Solving Nodes : 50
2.59/2.69 c Primal Bound : +0.00000000000000e+00 (1 solutions)
2.59/2.69 c Dual Bound : +0.00000000000000e+00
2.59/2.69 c Gap : 0.00 %
2.59/2.69 s SATISFIABLE
2.59/2.69 v -x162 -x134 -x175 -x180 -x186 -x172 -x132 -x166 -x142 -x153 -x118 -x129 -x113 -x140 -x161 -x133 -x200 x152 -x195 x119 -x189 -x177
2.59/2.69 v -x109 -x188 -x144 -x165 -x107 -x135 -x196 -x106 -x198 -x176 -x146 -x139 -x182 -x197 x105 x158 -x147 x145 x126 x121 -x181 -x192
2.59/2.69 v -x114 -x171 -x125 -x199 -x138 -x104 -x151 -x149 -x115 x108 -x185 -x120 -x174 -x143 -x157 -x103 -x190 -x155 x154 -x148 -x170
2.59/2.69 v x159 -x123 -x124 -x183 -x130 -x168 -x102 -x111 -x110 -x169 -x112 -x137 -x173 -x141 -x127 -x164 -x191 -x128 x101 -x179 -x167
2.59/2.69 v -x160 -x156 -x131 -x117 -x163 x122 -x150 -x193 x136 -x194 x116 x178 -x187 -x184 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
2.59/2.69 v -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 x68 -x67
2.59/2.69 v -x66 -x65 -x64 -x63 -x62 x61 -x60 -x59 -x58 -x57 -x56 x55 -x54 -x53 -x52 -x51 -x50 -x49 x48 -x47 -x46 -x45 -x44 -x43 -x42
2.59/2.69 v -x41 x40 -x39 -x38 -x37 -x36 -x35 x34 x33 x32 -x31 -x30 -x29 -x28 x27 -x26 -x25 -x24 -x23 -x22 -x21 -x20 -x19 x18 x17 -x16 x15
2.59/2.69 v -x14 -x13 -x12 x11 -x10 -x9 -x8 -x7 x6 -x5 -x4 -x3 x2 -x1
2.59/2.69 c SCIP Status : problem is solved [optimal solution found]
2.59/2.69 c Total Time : 2.69
2.59/2.69 c solving : 2.69
2.59/2.69 c presolving : 0.06 (included in solving)
2.59/2.69 c reading : 0.01 (included in solving)
2.59/2.69 c Original Problem :
2.59/2.69 c Problem name : HOME/instance-3451940-1307113101.opb
2.59/2.69 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
2.59/2.69 c Constraints : 302 initial, 302 maximal
2.59/2.69 c Presolved Problem :
2.59/2.69 c Problem name : t_HOME/instance-3451940-1307113101.opb
2.59/2.69 c Variables : 1448 (1448 binary, 0 integer, 0 implicit integer, 0 continuous)
2.59/2.69 c Constraints : 1550 initial, 1562 maximal
2.59/2.69 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
2.59/2.69 c trivial : 0.00 0 0 0 0 0 0 0 0 0
2.59/2.69 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
2.59/2.69 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
2.59/2.69 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
2.59/2.69 c implics : 0.00 0 0 0 0 0 0 0 0 0
2.59/2.69 c probing : 0.00 0 0 0 0 0 0 0 0 0
2.59/2.69 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
2.59/2.69 c setppc : 0.00 0 0 0 0 0 0 0 0 0
2.59/2.69 c and : 0.04 0 0 0 0 0 0 0 0 0
2.59/2.69 c linear : 0.00 0 0 0 0 0 0 0 0 0
2.59/2.69 c logicor : 0.00 0 0 0 0 0 0 0 0 0
2.59/2.69 c root node : - 0 - - 0 - - - - -
2.59/2.69 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
2.59/2.69 c integral : 0 0 0 50 0 3 0 0 1 0 0 94
2.59/2.69 c knapsack : 1 5 116 2 0 0 0 0 0 0 0 0
2.59/2.69 c setppc : 300 5 116 2 0 0 0 2 198 0 0 0
2.59/2.69 c and : 1248 52 114 2 0 0 4 0 1816 311 0 0
2.59/2.69 c linear : 1+ 6 114 1 0 0 0 0 0 0 0 0
2.59/2.69 c logicor : 0+ 0 4 0 0 0 0 0 2 0 0 0
2.59/2.69 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
2.59/2.69 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
2.59/2.69 c integral : 1.42 0.00 0.00 1.42 0.00 0.00 0.00
2.59/2.69 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.59/2.69 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.59/2.69 c and : 0.01 0.01 0.00 0.00 0.00 0.00 0.00
2.59/2.69 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.59/2.69 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.59/2.69 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.59/2.69 c Propagators : #Propagate #Resprop Cutoffs DomReds
2.59/2.69 c vbounds : 0 0 0 0
2.59/2.69 c rootredcost : 0 0 0 0
2.59/2.69 c pseudoobj : 0 0 0 0
2.59/2.69 c Propagator Timings : TotalTime Propagate Resprop
2.59/2.69 c vbounds : 0.00 0.00 0.00
2.59/2.69 c rootredcost : 0.00 0.00 0.00
2.59/2.69 c pseudoobj : 0.00 0.00 0.00
2.59/2.69 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.59/2.69 c propagation : 0.00 2 2 2 3.0 0 0.0 -
2.59/2.69 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.59/2.69 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.59/2.69 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.59/2.69 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.59/2.69 c applied globally : - - - 2 3.0 - - -
2.59/2.69 c applied locally : - - - 0 0.0 - - -
2.59/2.69 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.59/2.69 c cut pool : 0.00 4 - - 7 - (maximal pool size: 235)
2.59/2.69 c redcost : 0.00 52 0 0 0 0
2.59/2.69 c impliedbounds : 0.00 5 0 0 2 0
2.59/2.69 c intobj : 0.00 0 0 0 0 0
2.59/2.69 c gomory : 0.52 5 0 0 197 0
2.59/2.69 c cgmip : 0.00 0 0 0 0 0
2.59/2.69 c closecuts : 0.00 0 0 0 0 0
2.59/2.69 c strongcg : 0.44 5 0 0 2500 0
2.59/2.69 c cmir : 0.00 0 0 0 0 0
2.59/2.69 c flowcover : 0.00 0 0 0 0 0
2.59/2.69 c clique : 0.01 5 0 0 25 0
2.59/2.69 c zerohalf : 0.00 0 0 0 0 0
2.59/2.69 c mcf : 0.00 1 0 0 0 0
2.59/2.69 c oddcycle : 0.00 0 0 0 0 0
2.59/2.69 c rapidlearning : 0.05 1 0 0 0 10
2.59/2.69 c Pricers : Time Calls Vars
2.59/2.69 c problem variables: 0.00 0 0
2.59/2.69 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.59/2.69 c relpscost : 1.42 48 0 1 0 0 94
2.59/2.69 c pscost : 0.00 0 0 0 0 0 0
2.59/2.69 c inference : 0.00 0 0 0 0 0 0
2.59/2.69 c mostinf : 0.00 0 0 0 0 0 0
2.59/2.69 c leastinf : 0.00 0 0 0 0 0 0
2.59/2.69 c fullstrong : 0.00 0 0 0 0 0 0
2.59/2.69 c allfullstrong : 0.00 0 0 0 0 0 0
2.59/2.69 c random : 0.00 0 0 0 0 0 0
2.59/2.69 c Primal Heuristics : Time Calls Found
2.59/2.69 c LP solutions : 0.00 - 1
2.59/2.69 c pseudo solutions : 0.00 - 0
2.59/2.69 c trivial : 0.00 1 0
2.59/2.69 c shiftandpropagate: 0.00 0 0
2.59/2.69 c simplerounding : 0.00 0 0
2.59/2.69 c zirounding : 0.00 0 0
2.59/2.69 c rounding : 0.00 0 0
2.59/2.69 c shifting : 0.00 0 0
2.59/2.69 c intshifting : 0.00 0 0
2.59/2.69 c oneopt : 0.00 0 0
2.59/2.69 c twoopt : 0.00 0 0
2.59/2.69 c fixandinfer : 0.00 0 0
2.59/2.69 c feaspump : 0.00 0 0
2.59/2.69 c clique : 0.00 0 0
2.59/2.69 c coefdiving : 0.00 0 0
2.59/2.69 c pscostdiving : 0.00 0 0
2.59/2.69 c fracdiving : 0.00 0 0
2.59/2.69 c veclendiving : 0.00 0 0
2.59/2.69 c intdiving : 0.00 0 0
2.59/2.69 c actconsdiving : 0.00 0 0
2.59/2.69 c objpscostdiving : 0.00 0 0
2.59/2.69 c rootsoldiving : 0.00 0 0
2.59/2.69 c linesearchdiving : 0.00 0 0
2.59/2.69 c guideddiving : 0.00 0 0
2.59/2.69 c octane : 0.00 0 0
2.59/2.69 c rens : 0.00 0 0
2.59/2.69 c rins : 0.00 0 0
2.59/2.69 c localbranching : 0.00 0 0
2.59/2.69 c mutation : 0.00 0 0
2.59/2.69 c crossover : 0.00 0 0
2.59/2.69 c dins : 0.00 0 0
2.59/2.69 c vbounds : 0.00 0 0
2.59/2.69 c undercover : 0.00 0 0
2.59/2.69 c subnlp : 0.00 0 0
2.59/2.69 c trysol : 0.00 0 0
2.59/2.69 c LP : Time Calls Iterations Iter/call Iter/sec
2.59/2.69 c primal LP : 0.01 0 0 0.00 0.00
2.59/2.69 c dual LP : 0.13 96 1492 15.54 11678.42
2.59/2.69 c lex dual LP : 0.00 0 0 0.00 -
2.59/2.69 c barrier LP : 0.00 0 0 0.00 -
2.59/2.69 c diving/probing LP: 0.00 0 0 0.00 -
2.59/2.69 c strong branching : 1.41 405 13340 32.94 9446.58
2.59/2.69 c (at root node) : - 10 4628 462.80 -
2.59/2.69 c conflict analysis: 0.00 0 0 0.00 -
2.59/2.69 c B&B Tree :
2.59/2.69 c number of runs : 1
2.59/2.69 c nodes : 50
2.59/2.69 c nodes (total) : 50
2.59/2.69 c nodes left : 0
2.59/2.69 c max depth : 34
2.59/2.69 c max depth (total): 34
2.59/2.69 c backtracks : 1 (2.0%)
2.59/2.69 c delayed cutoffs : 0
2.59/2.69 c repropagations : 1 (16 domain reductions, 0 cutoffs)
2.59/2.69 c avg switch length: 2.00
2.59/2.69 c switching time : 0.02
2.59/2.69 c Solution :
2.59/2.69 c Solutions found : 1 (1 improvements)
2.59/2.69 c First Solution : +0.00000000000000e+00 (in run 1, after 50 nodes, 2.69 seconds, depth 34, found by <relaxation>)
2.59/2.69 c Primal Bound : +0.00000000000000e+00 (in run 1, after 50 nodes, 2.69 seconds, depth 34, found by <relaxation>)
2.59/2.69 c Dual Bound : +0.00000000000000e+00
2.59/2.69 c Gap : 0.00 %
2.59/2.69 c Root Dual Bound : +0.00000000000000e+00
2.59/2.69 c Root Iterations : 302
2.69/2.70 c Time complete: 2.7.