0.00/0.01 c SCIP version 1.1.0.7
0.00/0.01 c LP-Solver Clp 1.8.2
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c read problem <HOME/instance-1867991-1245114058.opb>
0.00/0.01 c original problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 332 constraints
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c start presolving problem
0.00/0.02 c presolving:
0.00/0.03 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 252 impls, 0 clqs
0.00/0.03 c (round 2) 8 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 332 upgd conss, 5244 impls, 0 clqs
0.00/0.03 c presolving (3 rounds):
0.00/0.03 c 8 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 5244 implications, 0 cliques
0.00/0.03 c presolved problem has 212 variables (212 bin, 0 int, 0 impl, 0 cont) and 332 constraints
0.00/0.03 c 130 constraints of type <knapsack>
0.00/0.03 c 202 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.01
0.00/0.03 c SATUNSAT-LIN
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 = c -1
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 = c -1
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 = c 1500
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 = c 0.075
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 = c -1
0.00/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/simplerounding/freq = c -1
0.00/0.04 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/shifting/freq = c -1
0.00/0.04 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/rounding/freq = c -1
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.04 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.04 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.04 c heuristics/rootsoldiving/freq = c -1
0.00/0.04 c # number of nodes added to the contingent of the total nodes
0.00/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.04 c heuristics/rens/nodesofs = c 2000
0.00/0.04 c # minimum percentage of integer variables that have to be fixable
0.00/0.04 c # [type: real, range: [0,1], default: 0.5]
0.00/0.04 c heuristics/rens/minfixingrate = c 0.3
0.00/0.04 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c heuristics/rens/freq = c -1
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.04 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/pscostdiving/freq = c -1
0.00/0.04 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c heuristics/oneopt/freq = c -1
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.04 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.04 c # [type: real, range: [0,1], default: 0.01]
0.00/0.04 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.04 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.04 c heuristics/objpscostdiving/freq = c -1
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.04 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/linesearchdiving/freq = c -1
0.00/0.04 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/intshifting/freq = c -1
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.04 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/guideddiving/freq = c -1
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.04 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/fracdiving/freq = c -1
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.04 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.04 c heuristics/feaspump/freq = c -1
0.00/0.04 c # minimum percentage of integer variables that have to be fixed
0.00/0.04 c # [type: real, range: [0,1], default: 0.666]
0.00/0.04 c heuristics/crossover/minfixingrate = c 0.5
0.00/0.04 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.04 c # [type: real, range: [0,1], default: 0.1]
0.00/0.04 c heuristics/crossover/nodesquot = c 0.15
0.00/0.04 c # number of nodes without incumbent change that heuristic should wait
0.00/0.04 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.04 c heuristics/crossover/nwaitingnodes = c 100
0.00/0.04 c # number of nodes added to the contingent of the total nodes
0.00/0.04 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.04 c heuristics/crossover/nodesofs = c 750
0.00/0.04 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.04 c heuristics/crossover/freq = c -1
0.00/0.04 c # additional number of allowed LP iterations
0.00/0.04 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04 c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.04 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.04 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04 c heuristics/coefdiving/freq = c -1
0.00/0.04 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c presolving/probing/maxrounds = c 0
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.04 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.04 c constraints/knapsack/disaggregation = c FALSE
0.00/0.04 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c constraints/knapsack/maxnumcardlift = c 0
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = c TRUE
0.00/0.04 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c separating/maxroundsroot = c 5
0.00/0.04 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.04 c separating/maxrounds = c 1
0.00/0.04 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c limits/solutions = c 1
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = c 1620
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = c 1791
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = c 10000
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving problem
0.00/0.04 c
0.00/0.05 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.05 c 0.0s| 1 | 0 | 145 |1260k| 0 | 76 | 212 | 332 | 332 | 212 | 324 | 0 | 0 | 0 | 2.700000e+01 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 279 |1922k| 0 | 139 | 212 | 332 | 332 | 212 | 494 | 170 | 0 | 0 | 2.837124e+01 | -- | Inf
0.19/0.26 c 0.2s| 1 | 0 | 453 |3139k| 0 | 204 | 212 | 332 | 332 | 212 | 741 | 417 | 0 | 0 | 3.061224e+01 | -- | Inf
0.39/0.40 c 0.4s| 1 | 0 | 577 |3461k| 0 | 201 | 212 | 332 | 332 | 212 | 743 | 419 | 0 | 0 | 3.077468e+01 | -- | Inf
0.49/0.55 c 0.5s| 1 | 0 | 714 |3670k| 0 | 202 | 212 | 332 | 332 | 212 | 745 | 421 | 0 | 0 | 3.092895e+01 | -- | Inf
0.69/0.71 c 0.7s| 1 | 0 | 792 |4053k| 0 | 200 | 212 | 332 | 332 | 212 | 747 | 423 | 0 | 0 | 3.096059e+01 | -- | Inf
1.59/1.64 c 1.6s| 1 | 2 | 792 |4054k| 0 | 200 | 212 | 332 | 332 | 212 | 747 | 423 | 0 | 25 | 3.096059e+01 | -- | Inf
7.19/7.20 c * 7.1s| 100 | 43 | 5278 |4243k| 15 | - | 212 | 371 | 49 | 212 | 512 | 423 | 39 |1171 | 3.167422e+01 | 5.800000e+01 | 83.11%
7.19/7.20 c
7.19/7.20 c SCIP Status : solving was interrupted [solution limit reached]
7.19/7.20 c Solving Time (sec) : 7.11
7.19/7.20 c Solving Nodes : 100
7.19/7.20 c Primal Bound : +5.80000000000000e+01 (1 solutions)
7.19/7.20 c Dual Bound : +3.16742241287739e+01
7.19/7.20 c Gap : 83.11 %
7.19/7.20 c NODE 100
7.19/7.20 c DUAL BOUND 31.6742
7.19/7.20 c PRIMAL BOUND 58
7.19/7.20 c GAP 0.831142
7.19/7.20 s SATISFIABLE
7.19/7.20 v -x219 x220 -x217 x218 x215 -x216 x213 -x214 x211 -x212 -x209 -x210 -x207 -x208 x205 -x206 x203 -x204 x201 -x202 x199 -x200 x197
7.19/7.20 v -x198 x195 -x196 x193 -x194 x191 -x192 -x189 x190 -x187 x188 -x185 x186 -x183 x184 -x181 x182 -x179 x180 -x177 -x178 -x175 -x176
7.19/7.20 v -x173 -x174 -x171 -x172 -x169 x170 -x167 x168 -x165 x166 x163 -x164 x161 -x162 x159 -x160 x157 -x158 x155 -x156 x153 -x154
7.19/7.20 v -x151 x152 -x149 x150 -x147 x148 -x145 x146 x143 -x144 x141 -x142 x139 -x140 -x137 x138 -x135 x136 x133 -x134 -x131 x132 -x129
7.19/7.20 v x130 x128 x126 -x124 -x122 -x120 -x118 -x116 -x114 -x112 x110 x108 -x106 -x104 -x102 -x100 -x98 -x96 -x94 x92 x90 -x88 -x86
7.19/7.20 v -x84 -x82 -x80 -x78 -x76 -x74 -x72 -x70 -x68 -x66 -x64 -x62 -x60 -x58 -x56 -x54 -x52 -x50 x48 x46 x44 -x42 -x40 -x38 -x36
7.19/7.20 v -x34 -x32 -x30 -x28 -x26 -x24 -x22 -x20 -x18 -x16 -x14 -x12 -x10 -x8 -x6 -x4 -x2 -x127 -x125 -x123 -x121 -x119 -x117 -x115 -x113
7.19/7.20 v -x111 -x109 -x107 -x105 -x103 -x101 -x99 -x97 -x95 -x93 -x91 -x89 -x87 -x85 -x83 -x81 -x79 -x77 -x75 -x73 -x71 x69 x67 x65
7.19/7.20 v -x63 -x61 -x59 -x57 -x55 -x53 x51 x49 -x47 -x45 -x43 -x41 -x39 -x37 -x35 -x33 -x31 -x29 -x27 -x25 x23 x21 -x19 -x17 -x15 -x13
7.19/7.20 v -x11 -x9 -x7 x5 x3 -x1
7.19/7.20 c SCIP Status : solving was interrupted [solution limit reached]
7.19/7.20 c Solving Time : 7.11
7.19/7.20 c Original Problem :
7.19/7.20 c Problem name : HOME/instance-1867991-1245114058.opb
7.19/7.20 c Variables : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
7.19/7.20 c Constraints : 332 initial, 332 maximal
7.19/7.20 c Presolved Problem :
7.19/7.20 c Problem name : t_HOME/instance-1867991-1245114058.opb
7.19/7.20 c Variables : 212 (212 binary, 0 integer, 0 implicit integer, 0 continuous)
7.19/7.20 c Constraints : 332 initial, 371 maximal
7.19/7.20 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
7.19/7.20 c trivial : 0.00 0 0 0 0 0 0 0 0
7.19/7.20 c dualfix : 0.00 0 0 0 0 0 0 0 0
7.19/7.20 c boundshift : 0.00 0 0 0 0 0 0 0 0
7.19/7.20 c inttobinary : 0.00 0 0 0 0 0 0 0 0
7.19/7.20 c implics : 0.00 0 8 0 0 0 0 0 0
7.19/7.20 c probing : 0.00 0 0 0 0 0 0 0 0
7.19/7.20 c knapsack : 0.00 0 0 0 0 0 0 0 0
7.19/7.20 c logicor : 0.01 0 0 0 0 0 0 0 0
7.19/7.20 c root node : - 0 - - 0 - - - -
7.19/7.20 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
7.19/7.20 c integral : 0 0 0 99 0 4 71 0 0 142
7.19/7.20 c knapsack : 130 5 355 0 0 23 1088 177 0 0
7.19/7.20 c logicor : 202+ 5 223 1 0 0 485 0 0 0
7.19/7.20 c countsols : 0 0 0 1 0 0 0 0 0 0
7.19/7.20 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
7.19/7.20 c integral : 5.80 0.00 0.00 5.80 0.00
7.19/7.20 c knapsack : 0.02 0.01 0.01 0.00 0.00
7.19/7.20 c logicor : 0.00 0.00 0.00 0.00 0.00
7.19/7.20 c countsols : 0.00 0.00 0.00 0.00 0.00
7.19/7.20 c Propagators : Time Calls Cutoffs DomReds
7.19/7.20 c rootredcost : 0.00 0 0 0
7.19/7.20 c pseudoobj : 0.00 364 0 0
7.19/7.20 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
7.19/7.20 c propagation : 0.00 20 19 110 35.4 0 0.0 -
7.19/7.20 c infeasible LP : 0.00 1 0 0 0.0 0 0.0 0
7.19/7.20 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
7.19/7.20 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
7.19/7.20 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
7.19/7.20 c applied globally : - - - 39 15.0 - - -
7.19/7.20 c applied locally : - - - 0 0.0 - - -
7.19/7.20 c Separators : Time Calls Cutoffs DomReds Cuts Conss
7.19/7.20 c cut pool : 0.00 4 - - 144 - (maximal pool size: 1541)
7.19/7.20 c redcost : 0.00 83 0 0 0 0
7.19/7.20 c impliedbounds : 0.00 5 0 0 555 0
7.19/7.20 c intobj : 0.00 0 0 0 0 0
7.19/7.20 c gomory : 0.25 5 0 0 306 0
7.19/7.20 c strongcg : 0.22 5 0 0 997 0
7.19/7.20 c cmir : 0.00 0 0 0 0 0
7.19/7.20 c flowcover : 0.00 0 0 0 0 0
7.19/7.20 c clique : 0.01 1 0 0 0 0
7.19/7.20 c zerohalf : 0.00 0 0 0 0 0
7.19/7.20 c mcf : 0.00 1 0 0 0 0
7.19/7.20 c Pricers : Time Calls Vars
7.19/7.20 c problem variables: 0.00 0 0
7.19/7.20 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
7.19/7.20 c relpscost : 5.80 98 4 71 0 0 142
7.19/7.20 c pscost : 0.00 0 0 0 0 0 0
7.19/7.20 c inference : 0.00 0 0 0 0 0 0
7.19/7.20 c mostinf : 0.00 0 0 0 0 0 0
7.19/7.20 c leastinf : 0.00 0 0 0 0 0 0
7.19/7.20 c fullstrong : 0.00 0 0 0 0 0 0
7.19/7.20 c allfullstrong : 0.00 0 0 0 0 0 0
7.19/7.20 c random : 0.00 0 0 0 0 0 0
7.19/7.20 c Primal Heuristics : Time Calls Found
7.19/7.20 c LP solutions : 0.00 - 1
7.19/7.20 c pseudo solutions : 0.00 - 0
7.19/7.20 c simplerounding : 0.00 0 0
7.19/7.20 c rounding : 0.00 0 0
7.19/7.20 c shifting : 0.00 0 0
7.19/7.20 c intshifting : 0.00 0 0
7.19/7.20 c oneopt : 0.00 0 0
7.19/7.20 c fixandinfer : 0.00 0 0
7.19/7.20 c feaspump : 0.00 0 0
7.19/7.20 c coefdiving : 0.00 0 0
7.19/7.20 c pscostdiving : 0.00 0 0
7.19/7.20 c fracdiving : 0.00 0 0
7.19/7.20 c veclendiving : 0.00 0 0
7.19/7.20 c intdiving : 0.00 0 0
7.19/7.20 c actconsdiving : 0.00 0 0
7.19/7.20 c objpscostdiving : 0.00 0 0
7.19/7.20 c rootsoldiving : 0.00 0 0
7.19/7.20 c linesearchdiving : 0.00 0 0
7.19/7.20 c guideddiving : 0.00 0 0
7.19/7.20 c octane : 0.00 0 0
7.19/7.20 c rens : 0.00 0 0
7.19/7.20 c rins : 0.00 0 0
7.19/7.20 c localbranching : 0.00 0 0
7.19/7.20 c mutation : 0.00 0 0
7.19/7.20 c crossover : 0.00 0 0
7.19/7.20 c dins : 0.00 0 0
7.19/7.20 c LP : Time Calls Iterations Iter/call Iter/sec
7.19/7.20 c primal LP : 0.01 0 0 0.00 0.00
7.19/7.20 c dual LP : 0.73 105 5278 50.27 7230.14
7.19/7.20 c barrier LP : 0.00 0 0 0.00 -
7.19/7.20 c diving/probing LP: 0.00 0 0 0.00 -
7.19/7.20 c strong branching : 5.79 1171 46153 39.41 7971.16
7.19/7.20 c (at root node) : - 25 4020 160.80 -
7.19/7.20 c conflict analysis: 0.00 0 0 0.00 -
7.19/7.20 c B&B Tree :
7.19/7.20 c number of runs : 1
7.19/7.20 c nodes : 100
7.19/7.20 c nodes (total) : 100
7.19/7.20 c nodes left : 43
7.19/7.20 c max depth : 15
7.19/7.20 c max depth (total): 15
7.19/7.20 c backtracks : 6 (6.0%)
7.19/7.20 c delayed cutoffs : 0
7.19/7.20 c repropagations : 36 (70 domain reductions, 0 cutoffs)
7.19/7.20 c avg switch length: 2.29
7.19/7.20 c switching time : 0.02
7.19/7.20 c Solution :
7.19/7.20 c Solutions found : 1 (1 improvements)
7.19/7.20 c Primal Bound : +5.80000000000000e+01 (in run 1, after 100 nodes, 7.11 seconds, depth 14, found by <relaxation>)
7.19/7.20 c Dual Bound : +3.16742241287739e+01
7.19/7.20 c Gap : 83.11 %
7.19/7.20 c Root Dual Bound : +3.09605890829204e+01
7.19/7.21 c Time complete: 7.2.