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