0.00/0.04 c SCIP version 1.1.0.7
0.00/0.04 c LP-Solver SoPlex 1.4.1
0.00/0.04 c user parameter file <scip.set> not found - using default parameters
0.00/0.04 c read problem <HOME/instance-1870698-1245215919.opb>
0.00/0.04 c original problem has 3238 variables (3238 bin, 0 int, 0 impl, 0 cont) and 3340 constraints
0.00/0.07 c No objective function, only one solution is needed.
0.00/0.07 c start presolving problem
0.00/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, 24504 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 24504 implications, 200 cliques
0.29/0.38 c presolved problem has 3238 variables (3238 bin, 0 int, 0 impl, 0 cont) and 3340 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 3038 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.13
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.38 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.38 c constraints/linear/simplifyinequalities = c TRUE
0.29/0.38 c # maximal number of separation rounds in the root node (-1: unlimited)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.38 c separating/maxroundsroot = c 5
0.29/0.38 c # maximal number of separation rounds per node (-1: unlimited)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 5]
0.29/0.38 c separating/maxrounds = c 1
0.29/0.38 c # solving stops, if the given number of solutions were found (-1: no limit)
0.29/0.38 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.38 c limits/solutions = c 1
0.29/0.38 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.38 c limits/memory = c 1620
0.29/0.38 c # maximal time in seconds to run
0.29/0.38 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.29/0.38 c limits/time = c 1791
0.29/0.38 c # frequency for displaying node information lines
0.29/0.38 c # [type: int, range: [-1,2147483647], default: 100]
0.29/0.38 c display/freq = c 10000
0.29/0.38 c -----------------------------------------------------------------------------------------------
0.29/0.38 c start solving problem
0.29/0.38 c
0.39/0.47 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.47 c 0.2s| 1 | 0 | 93 | 14M| 0 | 60 |3238 |3340 |3340 |3238 |6378 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.79/0.82 c 0.6s| 1 | 0 | 101 | 14M| 0 | 61 |3238 |3340 |3340 |3238 |6379 | 1 | 0 | 0 | 3.000000e+01 | -- | Inf
1.10/1.13 c 0.9s| 1 | 0 | 113 | 14M| 0 | 61 |3238 |3340 |3340 |3238 |6381 | 3 | 0 | 0 | 3.000000e+01 | -- | Inf
1.39/1.42 c 1.1s| 1 | 0 | 125 | 14M| 0 | 63 |3238 |3340 |3340 |3238 |6382 | 4 | 0 | 0 | 3.000000e+01 | -- | Inf
2.69/2.78 c 2.5s| 1 | 0 | 165 | 14M| 0 | 63 |3238 |3340 |3340 |3238 |6383 | 5 | 0 | 0 | 3.000000e+01 | -- | Inf
4.09/4.19 c 3.9s| 1 | 0 | 207 | 14M| 0 | 63 |3238 |3340 |3340 |3238 |6384 | 6 | 0 | 0 | 3.000000e+01 | -- | Inf
11.69/11.79 c 11.5s| 1 | 2 | 207 | 14M| 0 | 63 |3238 |3340 |3340 |3238 |6384 | 6 | 0 | 33 | 3.000000e+01 | -- | Inf
257.50/257.66 c 255s| 10000 | 3003 |359371 | 82M| 52 | 98 |3238 |4633 |1526 |3238 | 696 | 238k|8239 |9601 | 3.000000e+01 | -- | Inf
318.38/318.54 c * 315s| 12997 | 2988 |470424 | 82M| 56 | - |3238 |4574 | 422 |3238 | 695 | 298k| 11k| 10k| 3.000000e+01 | 4.200000e+01 | 40.00%
318.38/318.54 c
318.38/318.54 c SCIP Status : solving was interrupted [solution limit reached]
318.38/318.54 c Solving Time (sec) : 315.12
318.38/318.54 c Solving Nodes : 12997
318.38/318.54 c Primal Bound : +4.20000000000000e+01 (1 solutions)
318.38/318.54 c Dual Bound : +3.00000000000000e+01
318.38/318.54 c Gap : 40.00 %
318.38/318.55 c NODE 12997
318.38/318.55 c DUAL BOUND 30
318.38/318.55 c PRIMAL BOUND 42
318.38/318.55 c GAP 0.4
318.38/318.55 s SATISFIABLE
318.38/318.55 v -x162 -x111 -x139 -x121 -x180 -x119 -x108 -x154 -x172 -x132 x190 -x166 -x129 -x153 -x198 -x113 x140 -x200 -x155 x189 -x179 x156
318.38/318.55 v x152 -x149 -x109 x188 -x151 -x144 -x165 -x135 -x115 -x146 x147 -x126 -x106 -x182 x197 -x102 -x195 -x161 -x133 -x105 -x104 -x192
318.38/318.55 v -x114 x171 -x125 -x138 -x185 -x174 x143 x157 x170 x159 -x123 x103 -x101 -x199 -x196 -x186 x181 -x177 -x176 -x175 -x167 -x158
318.38/318.55 v -x148 -x145 -x142 -x134 -x120 -x118 -x117 -x110 -x107 -x124 -x131 -x183 -x130 -x168 -x169 -x112 -x137 -x173 -x141 -x127 -x164
318.38/318.55 v -x160 -x191 -x128 -x163 -x122 -x150 -x193 -x136 -x194 -x116 -x178 -x187 -x184 -x100 -x99 x98 -x97 -x96 -x95 -x94 -x93 x92
318.38/318.55 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 -x65
318.38/318.55 v -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
318.38/318.55 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
318.38/318.55 v -x14 -x13 -x12 -x11 x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 x1
318.38/318.55 c SCIP Status : solving was interrupted [solution limit reached]
318.38/318.55 c Solving Time : 315.12
318.38/318.55 c Original Problem :
318.38/318.55 c Problem name : HOME/instance-1870698-1245215919.opb
318.38/318.55 c Variables : 3238 (3238 binary, 0 integer, 0 implicit integer, 0 continuous)
318.38/318.55 c Constraints : 3340 initial, 3340 maximal
318.38/318.55 c Presolved Problem :
318.38/318.55 c Problem name : t_HOME/instance-1870698-1245215919.opb
318.38/318.55 c Variables : 3238 (3238 binary, 0 integer, 0 implicit integer, 0 continuous)
318.38/318.55 c Constraints : 3340 initial, 5066 maximal
318.38/318.55 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
318.38/318.55 c trivial : 0.00 0 0 0 0 0 0 0 0
318.38/318.55 c dualfix : 0.00 0 0 0 0 0 0 0 0
318.38/318.55 c boundshift : 0.00 0 0 0 0 0 0 0 0
318.38/318.55 c inttobinary : 0.00 0 0 0 0 0 0 0 0
318.38/318.55 c implics : 0.00 0 0 0 0 0 0 0 0
318.38/318.55 c probing : 0.00 0 0 0 0 0 0 0 0
318.38/318.55 c knapsack : 0.00 0 0 0 0 0 0 0 0
318.38/318.55 c setppc : 0.01 0 0 0 0 0 0 0 0
318.38/318.55 c and : 0.09 0 0 0 0 0 0 0 0
318.38/318.55 c linear : 0.02 0 0 0 0 0 0 0 0
318.38/318.55 c logicor : 0.00 0 0 0 0 0 0 0 0
318.38/318.55 c root node : - 0 - - 0 - - - -
318.38/318.55 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
318.38/318.55 c integral : 0 0 0 9895 0 205 1072 0 0 16704
318.38/318.55 c knapsack : 1 5 58139 720 0 1 30 0 0 0
318.38/318.55 c setppc : 200 5 58141 720 0 130 164654 0 0 0
318.38/318.55 c and : 3038 9482 58011 720 0 526 2727641 298456 0 0
318.38/318.55 c linear : 1 5 57485 1 0 1 6 0 0 0
318.38/318.55 c logicor : 100+ 5 22520 1 0 17 23880 0 0 0
318.38/318.55 c countsols : 0 0 0 1 0 0 0 0 0 0
318.38/318.55 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
318.38/318.55 c integral : 80.41 0.00 0.00 80.41 0.00
318.38/318.55 c knapsack : 0.05 0.00 0.05 0.00 0.00
318.38/318.55 c setppc : 0.79 0.00 0.76 0.03 0.00
318.38/318.55 c and : 27.71 12.96 14.04 0.71 0.00
318.38/318.55 c linear : 1.22 0.00 1.22 0.00 0.00
318.38/318.55 c logicor : 1.41 0.00 1.41 0.00 0.00
318.38/318.55 c countsols : 0.00 0.00 0.00 0.00 0.00
318.38/318.55 c Propagators : Time Calls Cutoffs DomReds
318.38/318.55 c rootredcost : 0.00 0 0 0
318.38/318.55 c pseudoobj : 17.75 58143 0 0
318.38/318.55 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
318.38/318.55 c propagation : 0.01 675 673 838 10.0 12 34.5 -
318.38/318.55 c infeasible LP : 8.28 3771 3398 35997 40.6 68 2.1 0
318.38/318.55 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
318.38/318.55 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
318.38/318.55 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
318.38/318.55 c applied globally : - - - 11084 48.3 - - -
318.38/318.55 c applied locally : - - - 0 0.0 - - -
318.38/318.55 c Separators : Time Calls Cutoffs DomReds Cuts Conss
318.38/318.55 c cut pool : 0.00 4 - - 2 - (maximal pool size: 28)
318.38/318.55 c redcost : 3.33 9482 0 0 0 0
318.38/318.55 c impliedbounds : 0.00 5 0 0 0 0
318.38/318.55 c intobj : 0.00 0 0 0 0 0
318.38/318.55 c gomory : 2.08 5 0 0 1500 0
318.38/318.55 c strongcg : 1.37 5 0 0 2500 0
318.38/318.55 c cmir : 0.00 0 0 0 0 0
318.38/318.55 c flowcover : 0.00 0 0 0 0 0
318.38/318.55 c clique : 0.01 5 0 0 0 0
318.38/318.55 c zerohalf : 0.00 0 0 0 0 0
318.38/318.55 c mcf : 0.08 2 0 0 0 0
318.38/318.55 c Pricers : Time Calls Vars
318.38/318.55 c problem variables: 0.00 0 0
318.38/318.55 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
318.38/318.55 c relpscost : 80.37 9175 205 1072 0 0 16704
318.38/318.55 c pscost : 0.00 0 0 0 0 0 0
318.38/318.55 c inference : 0.00 0 0 0 0 0 0
318.38/318.55 c mostinf : 0.00 0 0 0 0 0 0
318.38/318.55 c leastinf : 0.00 0 0 0 0 0 0
318.38/318.55 c fullstrong : 0.00 0 0 0 0 0 0
318.38/318.55 c allfullstrong : 0.00 0 0 0 0 0 0
318.38/318.55 c random : 0.00 0 0 0 0 0 0
318.38/318.55 c Primal Heuristics : Time Calls Found
318.38/318.55 c LP solutions : 0.02 - 1
318.38/318.55 c pseudo solutions : 0.00 - 0
318.38/318.55 c simplerounding : 0.00 0 0
318.38/318.55 c rounding : 0.00 0 0
318.38/318.55 c shifting : 0.00 0 0
318.38/318.55 c intshifting : 0.00 0 0
318.38/318.55 c oneopt : 0.00 0 0
318.38/318.55 c fixandinfer : 0.00 0 0
318.38/318.55 c feaspump : 0.00 0 0
318.38/318.55 c coefdiving : 0.00 0 0
318.38/318.55 c pscostdiving : 0.00 0 0
318.38/318.55 c fracdiving : 0.00 0 0
318.38/318.55 c veclendiving : 0.00 0 0
318.38/318.55 c intdiving : 0.00 0 0
318.38/318.55 c actconsdiving : 0.00 0 0
318.38/318.55 c objpscostdiving : 0.00 0 0
318.38/318.55 c rootsoldiving : 0.00 0 0
318.38/318.55 c linesearchdiving : 0.00 0 0
318.38/318.55 c guideddiving : 0.00 0 0
318.38/318.55 c octane : 0.00 0 0
318.38/318.55 c rens : 0.00 0 0
318.38/318.55 c rins : 0.00 0 0
318.38/318.55 c localbranching : 0.00 0 0
318.38/318.55 c mutation : 0.00 0 0
318.38/318.55 c crossover : 0.00 0 0
318.38/318.55 c dins : 0.00 0 0
318.38/318.55 c LP : Time Calls Iterations Iter/call Iter/sec
318.38/318.55 c primal LP : 9.62 0 0 0.00 0.00
318.38/318.55 c dual LP : 116.96 23120 470424 20.35 4022.09
318.38/318.55 c barrier LP : 0.00 0 0 0.00 -
318.38/318.55 c diving/probing LP: 0.00 0 0 0.00 -
318.38/318.55 c strong branching : 79.76 10396 222628 21.41 2791.22
318.38/318.55 c (at root node) : - 33 8789 266.33 -
318.38/318.55 c conflict analysis: 0.00 0 0 0.00 -
318.38/318.55 c B&B Tree :
318.38/318.55 c number of runs : 1
318.38/318.55 c nodes : 12997
318.38/318.55 c nodes (total) : 12997
318.38/318.55 c nodes left : 2988
318.38/318.55 c max depth : 56
318.38/318.55 c max depth (total): 56
318.38/318.55 c backtracks : 897 (6.9%)
318.38/318.55 c delayed cutoffs : 34
318.38/318.55 c repropagations : 17165 (35860 domain reductions, 22 cutoffs)
318.38/318.55 c avg switch length: 4.39
318.38/318.55 c switching time : 24.69
318.38/318.55 c Solution :
318.38/318.55 c Solutions found : 1 (1 improvements)
318.38/318.55 c Primal Bound : +4.20000000000000e+01 (in run 1, after 12997 nodes, 315.10 seconds, depth 36, found by <relaxation>)
318.38/318.55 c Dual Bound : +3.00000000000000e+01
318.38/318.55 c Gap : 40.00 %
318.38/318.55 c Root Dual Bound : +3.00000000000000e+01
318.57/318.71 c Time complete: 318.59.