0.00/0.01 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
0.00/0.01 c Copyright (c) 2002-2010 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01 c
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c reading problem <HOME/instance-2704008-1278548316.opb>
0.00/0.01 c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.01 c problem read
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.02 c (round 1) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.03 c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.03 c presolving (3 rounds):
0.00/0.03 c 0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 8 implications, 68 cliques
0.00/0.03 c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.03 c 1 constraints of type <knapsack>
0.00/0.03 c 72 constraints of type <setppc>
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 - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.3
0.00/0.03 c
0.00/0.03 c # frequency for displaying node information lines
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03 c display/freq = 10000
0.00/0.03 c
0.00/0.03 c # maximal time in seconds to run
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/time = 1789.99
0.00/0.03 c
0.00/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03 c limits/memory = 1620
0.00/0.03 c
0.00/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c limits/solutions = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03 c separating/maxrounds = 1
0.00/0.03 c
0.00/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/maxroundsroot = 5
0.00/0.03 c
0.00/0.03 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.03 c # [type: int, range: [1,2], default: 1]
0.00/0.03 c timing/clocktype = 2
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify inequalities
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/linear/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/indicator/addCouplingCons = TRUE
0.00/0.03 c
0.00/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03 c constraints/knapsack/disaggregation = FALSE
0.00/0.03 c
0.00/0.03 c # should presolving try to simplify knapsacks
0.00/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.03 c
0.00/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c presolving/probing/maxrounds = 0
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <coefdiving> (-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/coefdiving/freq = -1
0.00/0.03 c
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/coefdiving/maxlpiterquot = 0.075
0.00/0.03 c
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/coefdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03 c heuristics/crossover/freq = -1
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/crossover/nodesofs = 750
0.00/0.03 c
0.00/0.03 c # number of nodes without incumbent change that heuristic should wait
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03 c heuristics/crossover/nwaitingnodes = 100
0.00/0.03 c
0.00/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03 c # [type: real, range: [0,1], default: 0.1]
0.00/0.03 c heuristics/crossover/nodesquot = 0.15
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixed
0.00/0.03 c # [type: real, range: [0,1], default: 0.666]
0.00/0.03 c heuristics/crossover/minfixingrate = 0.5
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/feaspump/freq = -1
0.00/0.03 c
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/feaspump/maxlpiterofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <fracdiving> (-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/fracdiving/freq = -1
0.00/0.03 c
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/fracdiving/maxlpiterquot = 0.075
0.00/0.03 c
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/fracdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <guideddiving> (-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/guideddiving/freq = -1
0.00/0.03 c
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/guideddiving/maxlpiterquot = 0.075
0.00/0.03 c
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/guideddiving/maxlpiterofs = 1500
0.00/0.03 c
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/intdiving/maxlpiterquot = 0.075
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <intshifting> (-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/intshifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-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/linesearchdiving/freq = -1
0.00/0.03 c
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/linesearchdiving/maxlpiterquot = 0.075
0.00/0.03 c
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/linesearchdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/nlp/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/objpscostdiving/freq = -1
0.00/0.03 c
0.00/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.03 c # [type: real, range: [0,1], default: 0.01]
0.00/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.03 c
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/objpscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/oneopt/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <pscostdiving> (-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/pscostdiving/freq = -1
0.00/0.03 c
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/pscostdiving/maxlpiterquot = 0.075
0.00/0.03 c
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/pscostdiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/rens/freq = -1
0.00/0.03 c
0.00/0.03 c # minimum percentage of integer variables that have to be fixable
0.00/0.03 c # [type: real, range: [0,1], default: 0.5]
0.00/0.03 c heuristics/rens/minfixingrate = 0.3
0.00/0.03 c
0.00/0.03 c # number of nodes added to the contingent of the total nodes
0.00/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03 c heuristics/rens/nodesofs = 2000
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.03 c heuristics/rootsoldiving/freq = -1
0.00/0.03 c
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.01]
0.00/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.03 c
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/rootsoldiving/maxlpiterofs = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/rounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <shifting> (-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/shifting/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/simplerounding/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.03 c heuristics/trivial/freq = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/trysol/freq = -1
0.00/0.03 c
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 = -1
0.00/0.03 c
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 = 0.075
0.00/0.03 c
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 = 1500
0.00/0.03 c
0.00/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.03 c heuristics/zirounding/freq = -1
0.00/0.03 c
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 = -1
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 = -1
0.00/0.03 c
0.00/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03 c separating/rapidlearning/freq = 0
0.00/0.03 c
0.00/0.03 c -----------------------------------------------------------------------------------------------
0.00/0.03 c start solving
0.00/0.03 c
0.00/0.04 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.04 c 0.0s| 1 | 0 | 95 | - | 743k| 0 | 42 | 169 | 73 | 169 | 73 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.20/0.22 c 0.2s| 1 | 0 | 144 | - |1147k| 0 | 48 | 169 | 209 | 169 | 88 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
0.20/0.24 c 0.2s| 1 | 0 | 203 | - |1397k| 0 | 56 | 169 | 209 | 169 | 95 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
0.20/0.27 c 0.3s| 1 | 0 | 242 | - |1666k| 0 | 57 | 169 | 209 | 169 | 104 | 31 | 0 | 0 | 0.000000e+00 | -- | Inf
0.20/0.30 c 0.3s| 1 | 0 | 322 | - |1892k| 0 | 59 | 169 | 209 | 169 | 110 | 37 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 391 | - |1911k| 0 | 65 | 169 | 209 | 169 | 116 | 43 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.56 c 0.5s| 1 | 0 | 416 | - |1884k| 0 | 65 | 169 | 183 | 169 | 116 | 43 | 0 | 11 | 0.000000e+00 | -- | Inf
0.69/0.74 c 0.7s| 1 | 2 | 416 | - |1885k| 0 | 65 | 169 | 183 | 169 | 116 | 43 | 0 | 20 | 0.000000e+00 | -- | Inf
2.20/2.27 c * 2.3s| 10 | 0 | 1496 | 120.0 |1920k| 6 | - | 169 | 171 | 169 | 97 | 43 | 0 | 216 | 0.000000e+00 | 0.000000e+00 | 0.00%
2.20/2.27 c
2.20/2.27 c SCIP Status : problem is solved [optimal solution found]
2.20/2.27 c Solving Time (sec) : 2.25
2.20/2.27 c Solving Nodes : 10
2.20/2.27 c Primal Bound : +0.00000000000000e+00 (1 solutions)
2.20/2.27 c Dual Bound : +0.00000000000000e+00
2.20/2.27 c Gap : 0.00 %
2.20/2.27 s SATISFIABLE
2.20/2.27 v -x169 -x168 -x167 -x166 -x165 -x164 x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 x152 -x151 -x150 -x149 -x148
2.20/2.27 v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 x136 -x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127
2.20/2.27 v -x126 -x125 -x124 -x123 -x122 -x121 -x120 x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 x109 -x108 -x107 -x106
2.20/2.27 v -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 x92 -x91 -x90 x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82
2.20/2.27 v -x81 -x80 -x79 x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 x62 -x61 -x60 -x59 -x58 -x57 -x56
2.20/2.27 v -x55 -x54 -x53 -x52 x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31
2.20/2.27 v x30 -x29 -x28 -x27 -x26 -x25 -x24 -x23 -x22 x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5
2.20/2.27 v -x4 x3 -x2 -x1
2.20/2.27 c SCIP Status : problem is solved [optimal solution found]
2.20/2.27 c Solving Time : 2.25
2.20/2.27 c Original Problem :
2.20/2.27 c Problem name : HOME/instance-2704008-1278548316.opb
2.20/2.27 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.20/2.27 c Constraints : 101 initial, 101 maximal
2.20/2.27 c Presolved Problem :
2.20/2.27 c Problem name : t_HOME/instance-2704008-1278548316.opb
2.20/2.27 c Variables : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
2.20/2.27 c Constraints : 73 initial, 209 maximal
2.20/2.27 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.20/2.27 c trivial : 0.00 0 0 0 0 0 0 0 0
2.20/2.27 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.20/2.27 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.20/2.27 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.20/2.27 c implics : 0.00 0 0 0 0 0 0 0 0
2.20/2.27 c probing : 0.00 0 0 0 0 0 0 0 0
2.20/2.27 c knapsack : 0.00 0 0 0 0 0 0 0 0
2.20/2.27 c setppc : 0.00 0 0 0 0 0 0 0 0
2.20/2.27 c linear : 0.00 0 0 0 0 0 28 0 0
2.20/2.27 c root node : - 4 - - 4 - - - -
2.20/2.27 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.20/2.27 c integral : 0 0 0 31 0 2 100 0 0 12
2.20/2.27 c knapsack : 1 5 38 1 0 0 0 0 0 0
2.20/2.27 c setppc : 72 5 38 1 0 0 210 0 0 0
2.20/2.27 c linear : 0+ 5 37 0 0 0 0 2 0 0
2.20/2.27 c countsols : 0 0 0 1 0 0 0 0 0 0
2.20/2.27 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.20/2.27 c integral : 1.85 0.00 0.00 1.85 0.00
2.20/2.27 c knapsack : 0.00 0.00 0.00 0.00 0.00
2.20/2.27 c setppc : 0.00 0.00 0.00 0.00 0.00
2.20/2.27 c linear : 0.00 0.00 0.00 0.00 0.00
2.20/2.27 c countsols : 0.00 0.00 0.00 0.00 0.00
2.20/2.27 c Propagators : Time Calls Cutoffs DomReds
2.20/2.27 c vbounds : 0.00 1 0 0
2.20/2.27 c rootredcost : 0.00 0 0 0
2.20/2.27 c pseudoobj : 0.00 0 0 0
2.20/2.27 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.20/2.27 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.20/2.27 c infeasible LP : 0.00 1 0 0 0.0 0 0.0 0
2.20/2.27 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.20/2.27 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.20/2.27 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.20/2.27 c applied globally : - - - 0 0.0 - - -
2.20/2.27 c applied locally : - - - 0 0.0 - - -
2.20/2.27 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.20/2.27 c cut pool : 0.00 4 - - 11 - (maximal pool size: 245)
2.20/2.27 c redcost : 0.00 14 0 0 0 0
2.20/2.27 c impliedbounds : 0.00 5 0 0 0 0
2.20/2.27 c intobj : 0.00 0 0 0 0 0
2.20/2.27 c cgmip : 0.00 0 0 0 0 0
2.20/2.27 c gomory : 0.04 5 0 0 0 0
2.20/2.27 c strongcg : 0.04 5 0 0 231 0
2.20/2.27 c cmir : 0.00 0 0 0 0 0
2.20/2.27 c flowcover : 0.00 0 0 0 0 0
2.20/2.27 c clique : 0.00 5 0 0 29 0
2.20/2.27 c zerohalf : 0.00 0 0 0 0 0
2.20/2.27 c mcf : 0.00 1 0 0 0 0
2.20/2.27 c rapidlearning : 0.16 1 0 0 0 136
2.20/2.27 c Pricers : Time Calls Vars
2.20/2.27 c problem variables: 0.00 0 0
2.20/2.27 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.20/2.27 c relpscost : 1.85 30 2 100 0 0 12
2.20/2.27 c pscost : 0.00 0 0 0 0 0 0
2.20/2.27 c inference : 0.00 0 0 0 0 0 0
2.20/2.27 c mostinf : 0.00 0 0 0 0 0 0
2.20/2.27 c leastinf : 0.00 0 0 0 0 0 0
2.20/2.27 c fullstrong : 0.00 0 0 0 0 0 0
2.20/2.27 c allfullstrong : 0.00 0 0 0 0 0 0
2.20/2.27 c random : 0.00 0 0 0 0 0 0
2.20/2.27 c Primal Heuristics : Time Calls Found
2.20/2.27 c LP solutions : 0.00 - 1
2.20/2.27 c pseudo solutions : 0.00 - 0
2.20/2.27 c trivial : 0.00 1 0
2.20/2.27 c simplerounding : 0.00 0 0
2.20/2.27 c zirounding : 0.00 0 0
2.20/2.27 c rounding : 0.00 0 0
2.20/2.27 c shifting : 0.00 0 0
2.20/2.27 c intshifting : 0.00 0 0
2.20/2.27 c oneopt : 0.00 0 0
2.20/2.27 c twoopt : 0.00 0 0
2.20/2.27 c fixandinfer : 0.00 0 0
2.20/2.27 c feaspump : 0.00 0 0
2.20/2.27 c coefdiving : 0.00 0 0
2.20/2.27 c pscostdiving : 0.00 0 0
2.20/2.27 c fracdiving : 0.00 0 0
2.20/2.27 c veclendiving : 0.00 0 0
2.20/2.27 c intdiving : 0.00 0 0
2.20/2.27 c actconsdiving : 0.00 0 0
2.20/2.27 c objpscostdiving : 0.00 0 0
2.20/2.27 c rootsoldiving : 0.00 0 0
2.20/2.27 c linesearchdiving : 0.00 0 0
2.20/2.27 c guideddiving : 0.00 0 0
2.20/2.27 c octane : 0.00 0 0
2.20/2.27 c rens : 0.00 0 0
2.20/2.27 c rins : 0.00 0 0
2.20/2.27 c localbranching : 0.00 0 0
2.20/2.27 c mutation : 0.00 0 0
2.20/2.27 c crossover : 0.00 0 0
2.20/2.27 c dins : 0.00 0 0
2.20/2.27 c undercover : 0.00 0 0
2.20/2.27 c nlp : 0.00 0 0
2.20/2.27 c trysol : 0.00 0 0
2.20/2.27 c LP : Time Calls Iterations Iter/call Iter/sec
2.20/2.27 c primal LP : 0.00 0 0 0.00 -
2.20/2.27 c dual LP : 0.12 37 1496 40.43 12262.70
2.20/2.27 c lex dual LP : 0.00 0 0 0.00 -
2.20/2.27 c barrier LP : 0.00 0 0 0.00 -
2.20/2.27 c diving/probing LP: 0.00 0 0 0.00 -
2.20/2.27 c strong branching : 1.85 216 21686 100.40 11728.95
2.20/2.27 c (at root node) : - 20 3685 184.25 -
2.20/2.27 c conflict analysis: 0.00 0 0 0.00 -
2.20/2.27 c B&B Tree :
2.20/2.27 c number of runs : 1
2.20/2.27 c nodes : 10
2.20/2.27 c nodes (total) : 10
2.20/2.27 c nodes left : 0
2.20/2.27 c max depth : 6
2.20/2.27 c max depth (total): 6
2.20/2.27 c backtracks : 0 (0.0%)
2.20/2.27 c delayed cutoffs : 0
2.20/2.27 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.20/2.27 c avg switch length: 2.00
2.20/2.27 c switching time : 0.00
2.20/2.27 c Solution :
2.20/2.27 c Solutions found : 1 (1 improvements)
2.20/2.27 c First Solution : +0.00000000000000e+00 (in run 1, after 10 nodes, 2.25 seconds, depth 6, found by <relaxation>)
2.20/2.27 c Primal Bound : +0.00000000000000e+00 (in run 1, after 10 nodes, 2.25 seconds, depth 6, found by <relaxation>)
2.20/2.27 c Dual Bound : +0.00000000000000e+00
2.20/2.27 c Gap : 0.00 %
2.20/2.27 c Root Dual Bound : +0.00000000000000e+00
2.20/2.27 c Root Iterations : 416
2.20/2.28 c Time complete: 2.27.