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-1870754-1245218154.opb>
0.00/0.04 c original problem has 3274 variables (3274 bin, 0 int, 0 impl, 0 cont) and 3376 constraints
0.04/0.07 c No objective function, only one solution is needed.
0.04/0.07 c start presolving problem
0.04/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.39 c heuristics/guideddiving/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/fracdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/fracdiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/fracdiving/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/feaspump/maxlpiterofs = c 2000
0.29/0.39 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 20]
0.29/0.39 c heuristics/feaspump/freq = c -1
0.29/0.39 c # minimum percentage of integer variables that have to be fixed
0.29/0.39 c # [type: real, range: [0,1], default: 0.666]
0.29/0.39 c heuristics/crossover/minfixingrate = c 0.5
0.29/0.39 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.29/0.39 c # [type: real, range: [0,1], default: 0.1]
0.29/0.39 c heuristics/crossover/nodesquot = c 0.15
0.29/0.39 c # number of nodes without incumbent change that heuristic should wait
0.29/0.39 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.29/0.39 c heuristics/crossover/nwaitingnodes = c 100
0.29/0.39 c # number of nodes added to the contingent of the total nodes
0.29/0.39 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.29/0.39 c heuristics/crossover/nodesofs = c 750
0.29/0.39 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 30]
0.29/0.39 c heuristics/crossover/freq = c -1
0.29/0.39 c # additional number of allowed LP iterations
0.29/0.39 c # [type: int, range: [0,2147483647], default: 1000]
0.29/0.39 c heuristics/coefdiving/maxlpiterofs = c 1500
0.29/0.39 c # maximal fraction of diving LP iterations compared to node LP iterations
0.29/0.39 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.29/0.39 c heuristics/coefdiving/maxlpiterquot = c 0.075
0.29/0.39 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 10]
0.29/0.39 c heuristics/coefdiving/freq = c -1
0.29/0.39 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c presolving/probing/maxrounds = c 0
0.29/0.39 c # should presolving try to simplify knapsacks
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.29/0.39 c constraints/knapsack/simplifyinequalities = c TRUE
0.29/0.39 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.29/0.39 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.29/0.39 c constraints/knapsack/disaggregation = c FALSE
0.29/0.39 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c constraints/knapsack/maxnumcardlift = c 0
0.29/0.39 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.48 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.48 c 0.2s| 1 | 0 | 102 | 14M| 0 | 61 |3274 |3376 |3376 |3274 |6450 | 0 | 0 | 0 | 3.000000e+01 | -- | Inf
0.79/0.83 c 0.6s| 1 | 0 | 108 | 14M| 0 | 61 |3274 |3376 |3376 |3274 |6451 | 1 | 0 | 0 | 3.000000e+01 | -- | Inf
1.10/1.18 c 0.9s| 1 | 0 | 156 | 14M| 0 | 63 |3274 |3376 |3376 |3274 |6453 | 3 | 0 | 0 | 3.000000e+01 | -- | Inf
2.39/2.49 c 2.2s| 1 | 0 | 170 | 14M| 0 | 63 |3274 |3376 |3376 |3274 |6454 | 4 | 0 | 0 | 3.000000e+01 | -- | Inf
3.79/3.85 c 3.6s| 1 | 0 | 176 | 14M| 0 | 63 |3274 |3376 |3376 |3274 |6455 | 5 | 0 | 0 | 3.000000e+01 | -- | Inf
5.19/5.29 c 5.0s| 1 | 0 | 190 | 14M| 0 | 62 |3274 |3376 |3376 |3274 |6456 | 6 | 0 | 0 | 3.000000e+01 | -- | Inf
11.48/11.59 c 11.3s| 1 | 2 | 190 | 14M| 0 | 62 |3274 |3376 |3376 |3274 |6456 | 6 | 0 | 33 | 3.000000e+01 | -- | Inf
323.32/323.45 c 320s| 10000 | 3621 |522392 | 73M| 63 | 66 |3274 |5227 |1259 |3274 | 646 | 448k|6850 | 11k| 3.000000e+01 | -- | Inf
574.24/574.46 c 569s| 20000 | 6467 | 1010k| 120M| 73 | 67 |3274 |5198 |2577 |3274 | 797 | 810k| 15k| 16k| 3.000000e+01 | -- | Inf
656.62/656.88 c * 651s| 23570 | 6394 | 1175k| 120M| 73 | - |3274 |5132 | 452 |3274 | 689 | 927k| 18k| 17k| 3.000000e+01 | 4.200000e+01 | 40.00%
656.62/656.88 c
656.62/656.88 c SCIP Status : solving was interrupted [solution limit reached]
656.62/656.88 c Solving Time (sec) : 650.53
656.62/656.88 c Solving Nodes : 23570
656.62/656.88 c Primal Bound : +4.20000000000000e+01 (1 solutions)
656.62/656.88 c Dual Bound : +3.00000000000000e+01
656.62/656.88 c Gap : 40.00 %
656.62/656.89 c NODE 23570
656.62/656.89 c DUAL BOUND 30
656.62/656.89 c PRIMAL BOUND 42
656.62/656.89 c GAP 0.4
656.62/656.89 s SATISFIABLE
656.62/656.89 v x196 -x137 -x130 -x172 -x140 x179 -x127 -x159 -x181 -x123 -x121 -x133 -x175 -x112 -x188 -x113 -x147 x119 -x156 -x152 x185 -x154
656.62/656.89 v -x142 -x136 -x126 x186 -x105 -x171 -x117 -x144 -x163 -x106 -x149 -x124 -x110 -x102 -x193 -x177 -x169 -x167 x160 -x151 -x148
656.62/656.89 v -x141 -x139 -x135 x134 -x109 -x104 -x200 -x145 -x115 -x166 -x161 -x107 -x129 -x158 x153 -x183 -x187 -x114 -x164 x197 -x101 x198
656.62/656.89 v x195 x190 -x184 -x182 -x157 -x132 -x125 -x122 -x118 -x108 -x111 -x192 -x116 -x170 -x173 -x103 -x131 -x168 -x174 -x155 -x138
656.62/656.89 v -x194 -x150 -x180 -x143 -x128 x146 -x178 -x165 -x199 -x162 -x176 x189 x120 -x191 -x100 -x99 -x98 -x97 -x96 -x95 x94 x93 -x92
656.62/656.89 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
656.62/656.89 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
656.62/656.89 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
656.62/656.89 v -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 x6 -x5 -x4 -x3 -x2 -x1
656.62/656.89 c SCIP Status : solving was interrupted [solution limit reached]
656.62/656.89 c Solving Time : 650.53
656.62/656.89 c Original Problem :
656.62/656.89 c Problem name : HOME/instance-1870754-1245218154.opb
656.62/656.89 c Variables : 3274 (3274 binary, 0 integer, 0 implicit integer, 0 continuous)
656.62/656.89 c Constraints : 3376 initial, 3376 maximal
656.62/656.89 c Presolved Problem :
656.62/656.89 c Problem name : t_HOME/instance-1870754-1245218154.opb
656.62/656.89 c Variables : 3274 (3274 binary, 0 integer, 0 implicit integer, 0 continuous)
656.62/656.89 c Constraints : 3376 initial, 5528 maximal
656.62/656.89 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
656.62/656.89 c trivial : 0.00 0 0 0 0 0 0 0 0
656.62/656.89 c dualfix : 0.00 0 0 0 0 0 0 0 0
656.62/656.89 c boundshift : 0.00 0 0 0 0 0 0 0 0
656.62/656.89 c inttobinary : 0.00 0 0 0 0 0 0 0 0
656.62/656.89 c implics : 0.00 0 0 0 0 0 0 0 0
656.62/656.89 c probing : 0.00 0 0 0 0 0 0 0 0
656.62/656.89 c knapsack : 0.00 0 0 0 0 0 0 0 0
656.62/656.89 c setppc : 0.00 0 0 0 0 0 0 0 0
656.62/656.89 c and : 0.11 0 0 0 0 0 0 0 0
656.62/656.89 c linear : 0.02 0 0 0 0 0 0 0 0
656.62/656.89 c logicor : 0.00 0 0 0 0 0 0 0 0
656.62/656.89 c root node : - 0 - - 0 - - - -
656.62/656.89 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
656.62/656.89 c integral : 0 0 0 22216 0 245 1877 0 0 31022
656.62/656.89 c knapsack : 1 5 102491 5419 0 5 43 0 0 0
656.62/656.89 c setppc : 200 5 102492 5419 0 260 245130 0 0 0
656.62/656.89 c and : 3074 18236 102232 5419 0 959 4063362 928543 0 0
656.62/656.89 c linear : 1 5 101273 1 0 0 0 0 0 0
656.62/656.89 c logicor : 100+ 5 38391 1 0 36 50232 0 0 0
656.62/656.89 c countsols : 0 0 0 1 0 0 0 0 0 0
656.62/656.89 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
656.62/656.89 c integral : 149.90 0.00 0.00 149.90 0.00
656.62/656.89 c knapsack : 0.09 0.00 0.04 0.05 0.00
656.62/656.89 c setppc : 1.45 0.00 1.33 0.12 0.00
656.62/656.89 c and : 57.39 27.65 23.46 6.28 0.00
656.62/656.89 c linear : 1.99 0.00 1.99 0.00 0.00
656.62/656.89 c logicor : 2.57 0.00 2.57 0.00 0.00
656.62/656.89 c countsols : 0.00 0.00 0.00 0.00 0.00
656.62/656.89 c Propagators : Time Calls Cutoffs DomReds
656.62/656.89 c rootredcost : 0.04 0 0 0
656.62/656.89 c pseudoobj : 31.92 102498 0 0
656.62/656.89 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
656.62/656.89 c propagation : 0.01 1260 1255 1693 13.7 20 28.8 -
656.62/656.89 c infeasible LP : 14.26 6551 6296 56739 46.9 171 2.8 0
656.62/656.89 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
656.62/656.89 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
656.62/656.89 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
656.62/656.89 c applied globally : - - - 18430 53.7 - - -
656.62/656.89 c applied locally : - - - 0 0.0 - - -
656.62/656.89 c Separators : Time Calls Cutoffs DomReds Cuts Conss
656.62/656.89 c cut pool : 0.00 4 - - 4 - (maximal pool size: 14)
656.62/656.89 c redcost : 7.03 18236 0 0 0 0
656.62/656.89 c impliedbounds : 0.00 5 0 0 0 0
656.62/656.89 c intobj : 0.00 0 0 0 0 0
656.62/656.89 c gomory : 3.34 5 0 0 1000 0
656.62/656.89 c strongcg : 1.23 5 0 0 2500 0
656.62/656.89 c cmir : 0.00 0 0 0 0 0
656.62/656.89 c flowcover : 0.00 0 0 0 0 0
656.62/656.89 c clique : 0.01 5 0 0 0 0
656.62/656.89 c zerohalf : 0.00 0 0 0 0 0
656.62/656.89 c mcf : 0.07 2 0 0 0 0
656.62/656.89 c Pricers : Time Calls Vars
656.62/656.89 c problem variables: 0.00 0 0
656.62/656.89 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
656.62/656.89 c relpscost : 149.82 16797 245 1877 0 0 31022
656.62/656.89 c pscost : 0.00 0 0 0 0 0 0
656.62/656.89 c inference : 0.00 0 0 0 0 0 0
656.62/656.89 c mostinf : 0.00 0 0 0 0 0 0
656.62/656.89 c leastinf : 0.00 0 0 0 0 0 0
656.62/656.89 c fullstrong : 0.00 0 0 0 0 0 0
656.62/656.89 c allfullstrong : 0.00 0 0 0 0 0 0
656.62/656.89 c random : 0.00 0 0 0 0 0 0
656.62/656.89 c Primal Heuristics : Time Calls Found
656.62/656.89 c LP solutions : 0.03 - 1
656.62/656.89 c pseudo solutions : 0.00 - 0
656.62/656.89 c simplerounding : 0.00 0 0
656.62/656.89 c rounding : 0.00 0 0
656.62/656.89 c shifting : 0.00 0 0
656.62/656.89 c intshifting : 0.00 0 0
656.62/656.89 c oneopt : 0.00 0 0
656.62/656.89 c fixandinfer : 0.00 0 0
656.62/656.89 c feaspump : 0.00 0 0
656.62/656.89 c coefdiving : 0.00 0 0
656.62/656.89 c pscostdiving : 0.00 0 0
656.62/656.89 c fracdiving : 0.00 0 0
656.62/656.89 c veclendiving : 0.00 0 0
656.62/656.89 c intdiving : 0.00 0 0
656.62/656.89 c actconsdiving : 0.00 0 0
656.62/656.89 c objpscostdiving : 0.00 0 0
656.62/656.89 c rootsoldiving : 0.00 0 0
656.62/656.89 c linesearchdiving : 0.00 0 0
656.62/656.89 c guideddiving : 0.00 0 0
656.62/656.89 c octane : 0.00 0 0
656.62/656.89 c rens : 0.00 0 0
656.62/656.89 c rins : 0.00 0 0
656.62/656.89 c localbranching : 0.00 0 0
656.62/656.89 c mutation : 0.00 0 0
656.62/656.89 c crossover : 0.00 0 0
656.62/656.89 c dins : 0.00 0 0
656.62/656.89 c LP : Time Calls Iterations Iter/call Iter/sec
656.62/656.89 c primal LP : 16.07 0 0 0.00 0.00
656.62/656.89 c dual LP : 274.58 46831 1175613 25.10 4281.50
656.62/656.89 c barrier LP : 0.00 0 0 0.00 -
656.62/656.89 c diving/probing LP: 0.00 0 0 0.00 -
656.62/656.89 c strong branching : 148.59 17997 443501 24.64 2984.73
656.62/656.89 c (at root node) : - 33 7186 217.76 -
656.62/656.89 c conflict analysis: 0.00 0 0 0.00 -
656.62/656.89 c B&B Tree :
656.62/656.89 c number of runs : 1
656.62/656.89 c nodes : 23570
656.62/656.89 c nodes (total) : 23570
656.62/656.89 c nodes left : 6394
656.62/656.89 c max depth : 73
656.62/656.89 c max depth (total): 73
656.62/656.89 c backtracks : 1547 (6.6%)
656.62/656.89 c delayed cutoffs : 96
656.62/656.89 c repropagations : 29790 (107877 domain reductions, 27 cutoffs)
656.62/656.89 c avg switch length: 4.47
656.62/656.89 c switching time : 41.14
656.62/656.89 c Solution :
656.62/656.89 c Solutions found : 1 (1 improvements)
656.62/656.89 c Primal Bound : +4.20000000000000e+01 (in run 1, after 23570 nodes, 650.50 seconds, depth 37, found by <relaxation>)
656.62/656.89 c Dual Bound : +3.00000000000000e+01
656.62/656.89 c Gap : 40.00 %
656.62/656.89 c Root Dual Bound : +3.00000000000000e+01
656.92/657.12 c Time complete: 656.96.