0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: NONE] [Expressions interpreter: NONE]
0.00/0.00 c Copyright (c) 2002-2010 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-2664433-1276302933.opb>
0.03/0.06 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.03/0.06 c problem read
0.03/0.06 c No objective function, only one solution is needed.
0.03/0.06 c presolving settings loaded
0.03/0.06 c [src/scip/lpi_none.c:41] ERROR: there is no LP solver linked to the binary (LPS=none); you should set the parameter <lp/solvefreq> to <-1> to avoid solving LPs
0.03/0.07 c presolving:
0.09/0.12 c (round 1) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.09/0.13 c (round 2) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.09/0.15 c presolving (3 rounds):
0.09/0.15 c 0 deleted vars, 143 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.15 c 242 implications, 22 cliques
0.09/0.15 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2564 constraints
0.09/0.15 c 1 constraints of type <knapsack>
0.09/0.15 c 22 constraints of type <setppc>
0.09/0.15 c 2541 constraints of type <logicor>
0.09/0.15 c transformed objective value is always integral (scale: 1)
0.09/0.15 c Presolving Time: 0.06
0.09/0.15 c - non default parameters ----------------------------------------------------------------------
0.09/0.15 c # SCIP version 1.2.1.2
0.09/0.15 c
0.09/0.15 c # frequency for displaying node information lines
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 100]
0.09/0.15 c display/freq = 10000
0.09/0.15 c
0.09/0.15 c # maximal time in seconds to run
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/time = 1799.95
0.09/0.15 c
0.09/0.15 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.09/0.15 c limits/memory = 1620
0.09/0.15 c
0.09/0.15 c # solving stops, if the given number of solutions were found (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c limits/solutions = 1
0.09/0.15 c
0.09/0.15 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c lp/solvefreq = -1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds per node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 5]
0.09/0.15 c separating/maxrounds = 1
0.09/0.15 c
0.09/0.15 c # maximal number of separation rounds in the root node (-1: unlimited)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/maxroundsroot = 5
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify inequalities
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/linear/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.09/0.15 c constraints/knapsack/disaggregation = FALSE
0.09/0.15 c
0.09/0.15 c # should presolving try to simplify knapsacks
0.09/0.15 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.09/0.15 c constraints/knapsack/simplifyinequalities = TRUE
0.09/0.15 c
0.09/0.15 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c presolving/probing/maxrounds = 0
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/coefdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/coefdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/coefdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 30]
0.09/0.15 c heuristics/crossover/freq = -1
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/crossover/nodesofs = 750
0.09/0.15 c
0.09/0.15 c # number of nodes without incumbent change that heuristic should wait
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.09/0.15 c heuristics/crossover/nwaitingnodes = 100
0.09/0.15 c
0.09/0.15 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.09/0.15 c # [type: real, range: [0,1], default: 0.1]
0.09/0.15 c heuristics/crossover/nodesquot = 0.15
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixed
0.09/0.15 c # [type: real, range: [0,1], default: 0.666]
0.09/0.15 c heuristics/crossover/minfixingrate = 0.5
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/feaspump/freq = -1
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/feaspump/maxlpiterofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/fracdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/fracdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/fracdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/guideddiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/guideddiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/guideddiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/intdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/intshifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/linesearchdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/nlp/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/objpscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to total iteration number
0.09/0.15 c # [type: real, range: [0,1], default: 0.01]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/oneopt/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/pscostdiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/pscostdiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/rens/freq = -1
0.09/0.15 c
0.09/0.15 c # minimum percentage of integer variables that have to be fixable
0.09/0.15 c # [type: real, range: [0,1], default: 0.5]
0.09/0.15 c heuristics/rens/minfixingrate = 0.3
0.09/0.15 c
0.09/0.15 c # number of nodes added to the contingent of the total nodes
0.09/0.15 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.09/0.15 c heuristics/rens/nodesofs = 2000
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 20]
0.09/0.15 c heuristics/rootsoldiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/rounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/shifting/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/simplerounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c heuristics/trivial/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/trysol/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 10]
0.09/0.15 c heuristics/veclendiving/freq = -1
0.09/0.15 c
0.09/0.15 c # maximal fraction of diving LP iterations compared to node LP iterations
0.09/0.15 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.09/0.15 c heuristics/veclendiving/maxlpiterquot = 0.075
0.09/0.15 c
0.09/0.15 c # additional number of allowed LP iterations
0.09/0.15 c # [type: int, range: [0,2147483647], default: 1000]
0.09/0.15 c heuristics/veclendiving/maxlpiterofs = 1500
0.09/0.15 c
0.09/0.15 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 1]
0.09/0.15 c heuristics/zirounding/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/cmir/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: 0]
0.09/0.15 c separating/flowcover/freq = -1
0.09/0.15 c
0.09/0.15 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.09/0.15 c # [type: int, range: [-1,2147483647], default: -1]
0.09/0.15 c separating/rapidlearning/freq = 0
0.09/0.15 c
0.09/0.15 c -----------------------------------------------------------------------------------------------
0.09/0.15 c start solving
0.09/0.15 c
0.09/0.15 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.15 c 0.1s| 1 | 2 | 0 | - |2396k| 0 | - | 231 |2564 | 0 | 0 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
3.79/3.80 c 3.5s| 10000 | 8503 | 0 | 0.0 |7049k| 91 | - | 231 |4028 | 0 | 0 | 0 |2335 | 0 | 0.000000e+00 | -- | Inf
8.28/8.37 c * 7.9s| 19280 | 0 | 0 | 0.0 |4145k| 91 | - | 231 |6523 | 0 | 0 | 0 |7137 | 0 | 0.000000e+00 | 0.000000e+00 | 0.00%
8.28/8.37 c
8.28/8.37 c SCIP Status : problem is solved [optimal solution found]
8.28/8.37 c Solving Time (sec) : 7.87
8.28/8.37 c Solving Nodes : 19280
8.28/8.37 c Primal Bound : +0.00000000000000e+00 (1 solutions)
8.28/8.37 c Dual Bound : +0.00000000000000e+00
8.28/8.37 c Gap : 0.00 %
8.28/8.38 s SATISFIABLE
8.28/8.38 v -x221 -x211 -x201 -x191 -x181 -x171 -x161 -x151 x141 -x131 x231 -x210 -x200 -x190 -x180 -x170 -x160 -x150 -x140 -x130 -x230 x220
8.28/8.38 v -x199 -x189 -x179 -x169 -x159 -x149 -x139 -x129 -x229 -x219 x209 -x188 -x178 -x168 -x158 -x148 -x138 -x128 -x228 -x218 -x208
8.28/8.38 v -x198 -x177 -x167 x157 -x147 -x137 -x127 -x227 -x217 -x207 -x197 -x187 -x166 -x156 -x146 -x136 x126 -x226 -x216 -x206 -x196
8.28/8.38 v -x186 x176 -x155 -x145 -x135 -x125 -x225 -x215 -x205 x195 -x185 -x175 -x165 -x144 -x134 -x124 -x224 -x214 -x204 -x194 -x184
8.28/8.38 v -x174 x164 -x154 -x133 -x123 -x223 -x213 -x203 -x193 -x183 -x173 -x163 -x153 x143 -x122 -x222 -x212 -x202 -x192 x182 -x172 -x162
8.28/8.38 v -x152 -x142 -x132 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104
8.28/8.38 v -x103 x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 x83 -x82 -x81 -x80
8.28/8.38 v -x79 -x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 x67 -x66 -x65 -x64 -x63 x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54
8.28/8.38 v -x53 -x52 -x51 -x50 -x49 x48 -x47 -x46 -x45 -x44 -x43 -x42 x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 x31 -x30 -x29
8.28/8.38 v -x28 -x27 -x26 -x25 -x24 -x23 -x22 x11 x21 -x10 -x20 -x9 -x19 -x8 -x18 -x7 -x17 -x6 -x16 -x5 -x15 -x4 -x14 -x3 -x13 -x2 -x12
8.28/8.38 v -x1
8.28/8.38 c SCIP Status : problem is solved [optimal solution found]
8.28/8.38 c Solving Time : 7.87
8.28/8.38 c Original Problem :
8.28/8.38 c Problem name : HOME/instance-2664433-1276302933.opb
8.28/8.38 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
8.28/8.38 c Constraints : 2707 initial, 2707 maximal
8.28/8.38 c Presolved Problem :
8.28/8.38 c Problem name : t_HOME/instance-2664433-1276302933.opb
8.28/8.38 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
8.28/8.38 c Constraints : 2564 initial, 6523 maximal
8.28/8.38 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
8.28/8.38 c trivial : 0.00 0 0 0 0 0 0 0 0
8.28/8.38 c dualfix : 0.00 0 0 0 0 0 0 0 0
8.28/8.38 c boundshift : 0.00 0 0 0 0 0 0 0 0
8.28/8.38 c inttobinary : 0.00 0 0 0 0 0 0 0 0
8.28/8.38 c implics : 0.00 0 0 0 0 0 0 0 0
8.28/8.38 c probing : 0.00 0 0 0 0 0 0 0 0
8.28/8.38 c knapsack : 0.01 0 0 0 0 0 0 0 0
8.28/8.38 c setppc : 0.00 0 0 0 0 0 0 0 0
8.28/8.38 c linear : 0.02 0 0 0 0 0 143 0 0
8.28/8.38 c logicor : 0.03 0 0 0 0 0 0 0 0
8.28/8.38 c root node : - 0 - - 0 - - - -
8.28/8.38 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
8.28/8.38 c integral : 0 0 0 0 0 0 0 0 0 0
8.28/8.38 c knapsack : 1 0 42655 0 17790 743 63286 0 0 0
8.28/8.38 c setppc : 22 0 42140 0 17790 1193 43809 0 0 0
8.28/8.38 c logicor : 2541+ 0 33857 0 17791 736 95004 0 0 0
8.28/8.38 c countsols : 0 0 0 0 17791 0 0 0 0 0
8.28/8.38 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
8.28/8.38 c integral : 0.00 0.00 0.00 0.00 0.00
8.28/8.38 c knapsack : 0.50 0.00 0.37 0.00 0.13
8.28/8.38 c setppc : 0.36 0.00 0.30 0.00 0.06
8.28/8.38 c logicor : 4.09 0.00 1.43 0.00 2.66
8.28/8.38 c countsols : 0.01 0.00 0.00 0.00 0.01
8.28/8.38 c Propagators : Time Calls Cutoffs DomReds
8.28/8.38 c vbounds : 0.01 1 0 0
8.28/8.38 c rootredcost : 0.01 0 0 0
8.28/8.38 c pseudoobj : 0.01 0 0 0
8.28/8.38 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
8.28/8.38 c propagation : 0.22 2672 2672 13993 22.2 95 24.8 -
8.28/8.38 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
8.28/8.38 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
8.28/8.38 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
8.28/8.38 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
8.28/8.38 c applied globally : - - - 6944 16.9 - - -
8.28/8.38 c applied locally : - - - 193 34.8 - - -
8.28/8.38 c Separators : Time Calls Cutoffs DomReds Cuts Conss
8.28/8.38 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
8.28/8.38 c redcost : 0.00 0 0 0 0 0
8.28/8.38 c impliedbounds : 0.00 0 0 0 0 0
8.28/8.38 c intobj : 0.00 0 0 0 0 0
8.28/8.38 c cgmip : 0.00 0 0 0 0 0
8.28/8.38 c gomory : 0.00 0 0 0 0 0
8.28/8.38 c strongcg : 0.00 0 0 0 0 0
8.28/8.38 c cmir : 0.00 0 0 0 0 0
8.28/8.38 c flowcover : 0.00 0 0 0 0 0
8.28/8.38 c clique : 0.00 0 0 0 0 0
8.28/8.38 c zerohalf : 0.00 0 0 0 0 0
8.28/8.38 c mcf : 0.00 0 0 0 0 0
8.28/8.38 c rapidlearning : 0.00 0 0 0 0 0
8.28/8.38 c Pricers : Time Calls Vars
8.28/8.38 c problem variables: 0.00 0 0
8.28/8.38 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
8.28/8.38 c relpscost : 0.00 0 0 0 0 0 0
8.28/8.38 c pscost : 0.00 0 0 0 0 0 0
8.28/8.38 c inference : 0.48 17790 0 0 0 0 35580
8.28/8.38 c mostinf : 0.00 0 0 0 0 0 0
8.28/8.38 c leastinf : 0.00 0 0 0 0 0 0
8.28/8.38 c fullstrong : 0.00 0 0 0 0 0 0
8.28/8.38 c allfullstrong : 0.00 0 0 0 0 0 0
8.28/8.38 c random : 0.00 0 0 0 0 0 0
8.28/8.38 c Primal Heuristics : Time Calls Found
8.28/8.38 c LP solutions : 0.00 - 0
8.28/8.38 c pseudo solutions : 0.02 - 1
8.28/8.38 c trivial : 0.00 1 0
8.28/8.38 c simplerounding : 0.00 0 0
8.28/8.38 c zirounding : 0.00 0 0
8.28/8.38 c rounding : 0.00 0 0
8.28/8.38 c shifting : 0.00 0 0
8.28/8.38 c intshifting : 0.00 0 0
8.28/8.38 c oneopt : 0.00 0 0
8.28/8.38 c twoopt : 0.00 0 0
8.28/8.38 c fixandinfer : 0.00 0 0
8.28/8.38 c feaspump : 0.00 0 0
8.28/8.38 c coefdiving : 0.00 0 0
8.28/8.38 c pscostdiving : 0.00 0 0
8.28/8.38 c fracdiving : 0.00 0 0
8.28/8.38 c veclendiving : 0.00 0 0
8.28/8.38 c intdiving : 0.00 0 0
8.28/8.38 c actconsdiving : 0.00 0 0
8.28/8.38 c objpscostdiving : 0.00 0 0
8.28/8.38 c rootsoldiving : 0.00 0 0
8.28/8.38 c linesearchdiving : 0.00 0 0
8.28/8.38 c guideddiving : 0.00 0 0
8.28/8.38 c octane : 0.00 0 0
8.28/8.38 c rens : 0.00 0 0
8.28/8.38 c rins : 0.00 0 0
8.28/8.38 c localbranching : 0.00 0 0
8.28/8.38 c mutation : 0.00 0 0
8.28/8.38 c crossover : 0.00 0 0
8.28/8.38 c dins : 0.00 0 0
8.28/8.38 c undercover : 0.00 0 0
8.28/8.38 c nlp : 0.00 0 0
8.28/8.38 c trysol : 0.00 0 0
8.28/8.38 c LP : Time Calls Iterations Iter/call Iter/sec
8.28/8.38 c primal LP : 0.00 0 0 0.00 -
8.28/8.38 c dual LP : 0.00 0 0 0.00 -
8.28/8.38 c lex dual LP : 0.00 0 0 0.00 -
8.28/8.38 c barrier LP : 0.00 0 0 0.00 -
8.28/8.38 c diving/probing LP: 0.00 0 0 0.00 -
8.28/8.38 c strong branching : 0.00 0 0 0.00 -
8.28/8.38 c (at root node) : - 0 0 0.00 -
8.28/8.38 c conflict analysis: 0.00 0 0 0.00 -
8.28/8.38 c B&B Tree :
8.28/8.38 c number of runs : 1
8.28/8.38 c nodes : 19280
8.28/8.38 c nodes (total) : 19280
8.28/8.38 c nodes left : 0
8.28/8.38 c max depth : 91
8.28/8.38 c max depth (total): 91
8.28/8.38 c backtracks : 1263 (6.6%)
8.28/8.38 c delayed cutoffs : 1227
8.28/8.38 c repropagations : 3506 (62117 domain reductions, 1183 cutoffs)
8.28/8.38 c avg switch length: 4.64
8.28/8.38 c switching time : 1.13
8.28/8.38 c Solution :
8.28/8.38 c Solutions found : 1 (1 improvements)
8.28/8.38 c First Solution : +0.00000000000000e+00 (in run 1, after 19280 nodes, 7.84 seconds, depth 53, found by <relaxation>)
8.28/8.38 c Primal Bound : +0.00000000000000e+00 (in run 1, after 19280 nodes, 7.84 seconds, depth 53, found by <relaxation>)
8.28/8.38 c Dual Bound : +0.00000000000000e+00
8.28/8.38 c Gap : 0.00 %
8.28/8.38 c Root Dual Bound : +0.00000000000000e+00
8.28/8.38 c Root Iterations : 0
8.28/8.40 c Time complete: 8.39.