0.01/0.04 c SCIP version 1.1.0.7
0.01/0.04 c LP-Solver Clp 1.8.2
0.01/0.04 c user parameter file <scip.set> not found - using default parameters
0.01/0.04 c read problem <HOME/instance-1870755-1245218168.opb>
0.01/0.04 c original problem has 3274 variables (3274 bin, 0 int, 0 impl, 0 cont) and 3376 constraints
0.01/0.07 c No objective function, only one solution is needed.
0.01/0.07 c start presolving problem
0.01/0.07 c presolving:
0.19/0.24 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 24792 impls, 200 clqs
0.29/0.38 c presolving (2 rounds):
0.29/0.38 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.38 c 24792 implications, 200 cliques
0.29/0.38 c presolved problem has 3274 variables (3274 bin, 0 int, 0 impl, 0 cont) and 3376 constraints
0.29/0.38 c 1 constraints of type <knapsack>
0.29/0.38 c 200 constraints of type <setppc>
0.29/0.38 c 3074 constraints of type <and>
0.29/0.38 c 1 constraints of type <linear>
0.29/0.38 c 100 constraints of type <logicor>
0.29/0.38 c transformed objective value is always integral (scale: 1)
0.29/0.38 c Presolving Time: 0.15
0.29/0.38 c SATUNSAT-NLC
0.29/0.38 c -----------------------------------------------------------------------------------------------
0.29/0.38 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.38 c separating/flowcover/freq = c -1
0.29/0.38 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.38 c separating/cmir/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/veclendiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/veclendiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/veclendiving/freq = c -1
0.29/0.38 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.38 c heuristics/simplerounding/freq = c -1
0.29/0.38 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/shifting/freq = c -1
0.29/0.38 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.38 c heuristics/rounding/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.29/0.38 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.29/0.38 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.38 c heuristics/rootsoldiving/freq = c -1
0.29/0.38 c # number of nodes added to the contingent of the total nodes
0.29/0.38 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.38 c heuristics/rens/nodesofs = c 2000
0.29/0.38 c # minimum percentage of integer variables that have to be fixable
0.29/0.38 c # [type: real, range: [0,1], default: 0.5]
0.29/0.38 c heuristics/rens/minfixingrate = c 0.3
0.29/0.38 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.38 c heuristics/rens/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/pscostdiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/pscostdiving/freq = c -1
0.29/0.38 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.38 c heuristics/oneopt/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.38 c # [type: real, range: [0,1], default: 0.01]
0.29/0.38 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.29/0.38 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.38 c heuristics/objpscostdiving/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/linesearchdiving/freq = c -1
0.29/0.38 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/intshifting/freq = c -1
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/intdiving/maxlpiterquot = c 0.075
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/guideddiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/guideddiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/guideddiving/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/fracdiving/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.38 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.38 c heuristics/feaspump/freq = c -1
0.29/0.38 c # minimum percentage of integer variables that have to be fixed
0.29/0.38 c # [type: real, range: [0,1], default: 0.666]
0.29/0.38 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.38 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.38 c # [type: real, range: [0,1], default: 0.1]
0.29/0.38 c heuristics/crossover/nodesquot = c 0.15
0.29/0.38 c # number of nodes without incumbent change that heuristic should wait
0.29/0.38 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.38 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.38 c # number of nodes added to the contingent of the total nodes
0.29/0.38 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.38 c heuristics/crossover/nodesofs = c 750
0.29/0.38 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.38 c heuristics/crossover/freq = c -1
0.29/0.38 c # additional number of allowed LP iterations
0.29/0.38 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.38 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.38 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.38 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.38 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.38 c heuristics/coefdiving/freq = c -1
0.29/0.38 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.38 c presolving/probing/maxrounds = c 0
0.29/0.38 c # should presolving try to simplify knapsacks
0.29/0.38 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.38 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.38 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.38 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.38 c constraints/knapsack/disaggregation = c FALSE
0.29/0.38 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.38 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.38 c # should presolving try to simplify inequalities
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.39 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.39 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c separating/maxroundsroot = c 5
0.29/0.39 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.39 c separating/maxrounds = c 1
0.29/0.39 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c limits/solutions = c 1
0.29/0.39 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.39 c limits/memory = c 1620
0.29/0.39 c # maximal time in seconds to run
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.39 c limits/time = c 1791
0.29/0.39 c # frequency for displaying node information lines
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.39 c display/freq = c 10000
0.29/0.39 c -----------------------------------------------------------------------------------------------
0.29/0.39 c start solving problem
0.29/0.39 c
0.39/0.46 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.46 c 0.2s| 1 | 0 | 73 | 14M| 0 | 60 |3274 |3376 |3376 |3274 |6450 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.79/0.83 c 0.6s| 1 | 0 | 135 | 14M| 0 | 62 |3274 |3376 |3376 |3274 |6452 | 2 | 0 | 0 | 3.000000e+01 | -- | Inf
1.19/1.21 c 1.0s| 1 | 0 | 183 | 14M| 0 | 63 |3274 |3376 |3376 |3274 |6454 | 4 | 0 | 0 | 3.000000e+01 | -- | Inf
2.59/2.68 c 2.4s| 1 | 0 | 226 | 14M| 0 | 63 |3274 |3376 |3376 |3274 |6455 | 5 | 0 | 0 | 3.000000e+01 | -- | Inf
4.39/4.44 c 4.2s| 1 | 0 | 347 | 14M| 0 | 68 |3274 |3376 |3376 |3274 |6456 | 6 | 0 | 0 | 3.000000e+01 | -- | Inf
6.60/6.67 c 6.4s| 1 | 0 | 902 | 14M| 0 | 67 |3274 |3376 |3376 |3274 |6457 | 7 | 0 | 0 | 3.000000e+01 | -- | Inf
16.49/16.54 c 16.2s| 1 | 2 | 902 | 14M| 0 | 67 |3274 |3376 |3376 |3274 |6457 | 7 | 0 | 33 | 3.000000e+01 | -- | Inf
82.17/82.24 c *81.6s| 1430 | 437 | 79834 | 22M| 33 | - |3274 |3455 | 432 |3274 | 783 | 56k| 79 |5240 | 3.000000e+01 | 4.100000e+01 | 36.67%
82.17/82.24 c
82.17/82.24 c SCIP Status : solving was interrupted [solution limit reached]
82.17/82.24 c Solving Time (sec) : 81.60
82.17/82.24 c Solving Nodes : 1430
82.17/82.24 c Primal Bound : +4.10000000000000e+01 (1 solutions)
82.17/82.24 c Dual Bound : +3.00000000000002e+01
82.17/82.24 c Gap : 36.67 %
82.17/82.25 c NODE 1430
82.17/82.25 c DUAL BOUND 30
82.17/82.25 c PRIMAL BOUND 41
82.17/82.25 c GAP 0.366667
82.17/82.25 s SATISFIABLE
82.17/82.25 v -x196 -x137 -x130 -x172 -x140 -x179 -x127 -x159 -x181 -x123 -x121 -x133 x175 -x112 -x188 -x113 -x147 -x119 -x156 x152 -x185 -x154
82.17/82.25 v -x142 -x136 -x126 -x186 -x105 -x171 -x117 -x144 -x163 -x106 x149 -x124 -x110 -x102 -x193 x177 -x169 -x167 -x160 -x151 -x148
82.17/82.25 v -x141 -x139 -x135 -x134 x109 -x104 x200 -x145 -x115 -x166 -x161 -x107 -x129 x158 -x153 -x183 -x187 -x114 -x164 -x197 -x101
82.17/82.25 v -x198 x195 -x190 -x184 -x182 x157 -x132 -x125 -x122 -x118 -x108 -x111 -x192 x116 -x170 x173 -x103 -x131 -x168 -x174 -x155 x138
82.17/82.25 v -x194 x150 -x180 -x143 -x128 -x146 -x178 x165 -x199 -x162 -x176 x189 -x120 -x191 -x100 x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
82.17/82.25 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
82.17/82.25 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
82.17/82.25 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 -x14
82.17/82.25 v -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
82.17/82.25 c SCIP Status : solving was interrupted [solution limit reached]
82.17/82.25 c Solving Time : 81.60
82.17/82.25 c Original Problem :
82.17/82.25 c Problem name : HOME/instance-1870755-1245218168.opb
82.17/82.25 c Variables : 3274 (3274 binary, 0 integer, 0 implicit integer, 0 continuous)
82.17/82.25 c Constraints : 3376 initial, 3376 maximal
82.17/82.25 c Presolved Problem :
82.17/82.25 c Problem name : t_HOME/instance-1870755-1245218168.opb
82.17/82.25 c Variables : 3274 (3274 binary, 0 integer, 0 implicit integer, 0 continuous)
82.17/82.25 c Constraints : 3376 initial, 3455 maximal
82.17/82.25 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
82.17/82.25 c trivial : 0.00 0 0 0 0 0 0 0 0
82.17/82.25 c dualfix : 0.00 0 0 0 0 0 0 0 0
82.17/82.25 c boundshift : 0.00 0 0 0 0 0 0 0 0
82.17/82.25 c inttobinary : 0.00 0 0 0 0 0 0 0 0
82.17/82.25 c implics : 0.00 0 0 0 0 0 0 0 0
82.17/82.25 c probing : 0.00 0 0 0 0 0 0 0 0
82.17/82.25 c knapsack : 0.01 0 0 0 0 0 0 0 0
82.17/82.25 c setppc : 0.00 0 0 0 0 0 0 0 0
82.17/82.25 c and : 0.12 0 0 0 0 0 0 0 0
82.17/82.25 c linear : 0.02 0 0 0 0 0 0 0 0
82.17/82.25 c logicor : 0.00 0 0 0 0 0 0 0 0
82.17/82.25 c root node : - 0 - - 0 - - - -
82.17/82.25 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
82.17/82.25 c integral : 0 0 0 1619 0 54 423 0 0 2102
82.17/82.25 c knapsack : 1 5 4836 335 0 0 0 0 0 0
82.17/82.25 c setppc : 200 5 4836 335 0 39 14318 0 0 0
82.17/82.25 c and : 3074 1238 4797 335 0 40 260960 57349 0 0
82.17/82.25 c linear : 1 5 4757 1 0 0 0 0 0 0
82.17/82.25 c logicor : 100+ 5 1441 1 0 0 1069 0 0 0
82.17/82.25 c countsols : 0 0 0 1 0 0 0 0 0 0
82.17/82.25 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
82.17/82.25 c integral : 34.39 0.00 0.00 34.39 0.00
82.17/82.25 c knapsack : 0.00 0.00 0.00 0.00 0.00
82.17/82.25 c setppc : 0.10 0.00 0.08 0.02 0.00
82.17/82.25 c and : 4.00 2.14 1.53 0.33 0.00
82.17/82.25 c linear : 0.12 0.00 0.12 0.00 0.00
82.17/82.25 c logicor : 0.02 0.00 0.02 0.00 0.00
82.17/82.25 c countsols : 0.00 0.00 0.00 0.00 0.00
82.17/82.25 c Propagators : Time Calls Cutoffs DomReds
82.17/82.25 c rootredcost : 0.00 0 0 0
82.17/82.25 c pseudoobj : 1.69 4837 0 0
82.17/82.25 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
82.17/82.25 c propagation : 0.00 79 79 79 2.5 0 0.0 -
82.17/82.25 c infeasible LP : 0.22 245 0 0 0.0 0 0.0 0
82.17/82.25 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
82.17/82.25 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
82.17/82.25 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
82.17/82.25 c applied globally : - - - 79 2.5 - - -
82.17/82.25 c applied locally : - - - 0 0.0 - - -
82.17/82.25 c Separators : Time Calls Cutoffs DomReds Cuts Conss
82.17/82.25 c cut pool : 0.00 4 - - 0 - (maximal pool size: 28)
82.17/82.25 c redcost : 0.46 1238 0 0 0 0
82.17/82.25 c impliedbounds : 0.01 5 0 0 0 0
82.17/82.25 c intobj : 0.00 0 0 0 0 0
82.17/82.25 c gomory : 3.15 5 0 0 1000 0
82.17/82.25 c strongcg : 2.21 5 0 0 2073 0
82.17/82.25 c cmir : 0.00 0 0 0 0 0
82.17/82.25 c flowcover : 0.00 0 0 0 0 0
82.17/82.25 c clique : 0.03 5 0 0 0 0
82.17/82.25 c zerohalf : 0.00 0 0 0 0 0
82.17/82.25 c mcf : 0.07 2 0 0 0 0
82.17/82.25 c Pricers : Time Calls Vars
82.17/82.25 c problem variables: 0.00 0 0
82.17/82.25 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
82.17/82.25 c relpscost : 34.38 1284 54 423 0 0 2102
82.17/82.25 c pscost : 0.00 0 0 0 0 0 0
82.17/82.25 c inference : 0.00 0 0 0 0 0 0
82.17/82.25 c mostinf : 0.00 0 0 0 0 0 0
82.17/82.25 c leastinf : 0.00 0 0 0 0 0 0
82.17/82.25 c fullstrong : 0.00 0 0 0 0 0 0
82.17/82.25 c allfullstrong : 0.00 0 0 0 0 0 0
82.17/82.25 c random : 0.00 0 0 0 0 0 0
82.17/82.25 c Primal Heuristics : Time Calls Found
82.17/82.25 c LP solutions : 0.00 - 1
82.17/82.25 c pseudo solutions : 0.00 - 0
82.17/82.25 c simplerounding : 0.00 0 0
82.17/82.25 c rounding : 0.00 0 0
82.17/82.25 c shifting : 0.00 0 0
82.17/82.25 c intshifting : 0.00 0 0
82.17/82.25 c oneopt : 0.00 0 0
82.17/82.25 c fixandinfer : 0.00 0 0
82.17/82.25 c feaspump : 0.00 0 0
82.17/82.25 c coefdiving : 0.00 0 0
82.17/82.25 c pscostdiving : 0.00 0 0
82.17/82.25 c fracdiving : 0.00 0 0
82.17/82.25 c veclendiving : 0.00 0 0
82.17/82.25 c intdiving : 0.00 0 0
82.17/82.25 c actconsdiving : 0.00 0 0
82.17/82.25 c objpscostdiving : 0.00 0 0
82.17/82.25 c rootsoldiving : 0.00 0 0
82.17/82.25 c linesearchdiving : 0.00 0 0
82.17/82.25 c guideddiving : 0.00 0 0
82.17/82.25 c octane : 0.00 0 0
82.17/82.25 c rens : 0.00 0 0
82.17/82.25 c rins : 0.00 0 0
82.17/82.25 c localbranching : 0.00 0 0
82.17/82.25 c mutation : 0.00 0 0
82.17/82.25 c crossover : 0.00 0 0
82.17/82.25 c dins : 0.00 0 0
82.17/82.25 c LP : Time Calls Iterations Iter/call Iter/sec
82.17/82.25 c primal LP : 8.87 0 0 0.00 0.00
82.17/82.25 c dual LP : 20.72 3096 79834 25.79 3852.99
82.17/82.25 c barrier LP : 0.00 0 0 0.00 -
82.17/82.25 c diving/probing LP: 0.00 0 0 0.00 -
82.17/82.25 c strong branching : 34.25 5240 146952 28.04 4290.57
82.17/82.25 c (at root node) : - 33 10310 312.42 -
82.17/82.25 c conflict analysis: 0.00 0 0 0.00 -
82.17/82.25 c B&B Tree :
82.17/82.25 c number of runs : 1
82.17/82.25 c nodes : 1430
82.17/82.25 c nodes (total) : 1430
82.17/82.25 c nodes left : 437
82.17/82.25 c max depth : 33
82.17/82.25 c max depth (total): 33
82.17/82.25 c backtracks : 99 (6.9%)
82.17/82.25 c delayed cutoffs : 0
82.17/82.25 c repropagations : 637 (2003 domain reductions, 0 cutoffs)
82.17/82.25 c avg switch length: 3.15
82.17/82.25 c switching time : 10.15
82.17/82.25 c Solution :
82.17/82.25 c Solutions found : 1 (1 improvements)
82.17/82.25 c Primal Bound : +4.10000000000000e+01 (in run 1, after 1430 nodes, 81.60 seconds, depth 23, found by <relaxation>)
82.17/82.25 c Dual Bound : +3.00000000000002e+01
82.17/82.25 c Gap : 36.67 %
82.17/82.25 c Root Dual Bound : +3.00000000000000e+01
82.27/82.32 c Time complete: 82.29.