0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2] [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-2666278-1276676478.opb>
0.01/0.03 c original problem has 1460 variables (1460 bin, 0 int, 0 impl, 0 cont) and 1562 constraints
0.01/0.03 c problem read
0.01/0.03 c No objective function, only one solution is needed.
0.01/0.03 c presolving settings loaded
0.01/0.04 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, 10280 impls, 200 clqs
0.39/0.42 c presolving (2 rounds):
0.39/0.42 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.42 c 10280 implications, 200 cliques
0.39/0.42 c presolved problem has 1460 variables (1460 bin, 0 int, 0 impl, 0 cont) and 1562 constraints
0.39/0.42 c 1 constraints of type <knapsack>
0.39/0.42 c 200 constraints of type <setppc>
0.39/0.42 c 1260 constraints of type <and>
0.39/0.42 c 1 constraints of type <linear>
0.39/0.42 c 100 constraints of type <logicor>
0.39/0.43 c transformed objective value is always integral (scale: 1)
0.39/0.43 c Presolving Time: 0.21
0.39/0.43 c - non default parameters ----------------------------------------------------------------------
0.39/0.43 c # SCIP version 1.2.1.2
0.39/0.43 c
0.39/0.43 c # frequency for displaying node information lines
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.43 c display/freq = 10000
0.39/0.43 c
0.39/0.43 c # maximal time in seconds to run
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.43 c limits/time = 1799.98
0.39/0.43 c
0.39/0.43 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.43 c limits/memory = 1620
0.39/0.43 c
0.39/0.43 c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c limits/solutions = 1
0.39/0.43 c
0.39/0.43 c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.43 c separating/maxrounds = 1
0.39/0.43 c
0.39/0.43 c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c separating/maxroundsroot = 5
0.39/0.43 c
0.39/0.43 c # should presolving try to simplify inequalities
0.39/0.43 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.43 c constraints/linear/simplifyinequalities = TRUE
0.39/0.43 c
0.39/0.43 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.43 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.43 c constraints/knapsack/disaggregation = FALSE
0.39/0.43 c
0.39/0.43 c # should presolving try to simplify knapsacks
0.39/0.43 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.43 c constraints/knapsack/simplifyinequalities = TRUE
0.39/0.43 c
0.39/0.43 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c presolving/probing/maxrounds = 0
0.39/0.43 c
0.39/0.43 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/coefdiving/freq = -1
0.39/0.43 c
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/coefdiving/maxlpiterquot = 0.075
0.39/0.43 c
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/coefdiving/maxlpiterofs = 1500
0.39/0.43 c
0.39/0.43 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.43 c heuristics/crossover/freq = -1
0.39/0.43 c
0.39/0.43 c # number of nodes added to the contingent of the total nodes
0.39/0.43 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.43 c heuristics/crossover/nodesofs = 750
0.39/0.43 c
0.39/0.43 c # number of nodes without incumbent change that heuristic should wait
0.39/0.43 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.43 c heuristics/crossover/nwaitingnodes = 100
0.39/0.43 c
0.39/0.43 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.43 c # [type: real, range: [0,1], default: 0.1]
0.39/0.43 c heuristics/crossover/nodesquot = 0.15
0.39/0.43 c
0.39/0.43 c # minimum percentage of integer variables that have to be fixed
0.39/0.43 c # [type: real, range: [0,1], default: 0.666]
0.39/0.43 c heuristics/crossover/minfixingrate = 0.5
0.39/0.43 c
0.39/0.43 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.43 c heuristics/feaspump/freq = -1
0.39/0.43 c
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/feaspump/maxlpiterofs = 2000
0.39/0.43 c
0.39/0.43 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/fracdiving/freq = -1
0.39/0.43 c
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/fracdiving/maxlpiterquot = 0.075
0.39/0.43 c
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/fracdiving/maxlpiterofs = 1500
0.39/0.43 c
0.39/0.43 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/guideddiving/freq = -1
0.39/0.43 c
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/guideddiving/maxlpiterquot = 0.075
0.39/0.43 c
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/guideddiving/maxlpiterofs = 1500
0.39/0.43 c
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/intdiving/maxlpiterquot = 0.075
0.39/0.43 c
0.39/0.43 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/intshifting/freq = -1
0.39/0.43 c
0.39/0.43 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/linesearchdiving/freq = -1
0.39/0.43 c
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.39/0.43 c
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.39/0.43 c
0.39/0.43 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.43 c heuristics/nlp/freq = -1
0.39/0.43 c
0.39/0.43 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.43 c heuristics/objpscostdiving/freq = -1
0.39/0.43 c
0.39/0.43 c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.43 c # [type: real, range: [0,1], default: 0.01]
0.39/0.43 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.39/0.43 c
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.39/0.43 c
0.39/0.43 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.43 c heuristics/oneopt/freq = -1
0.39/0.43 c
0.39/0.43 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/pscostdiving/freq = -1
0.39/0.43 c
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.39/0.43 c
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/pscostdiving/maxlpiterofs = 1500
0.39/0.43 c
0.39/0.43 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.43 c heuristics/rens/freq = -1
0.39/0.43 c
0.39/0.43 c # minimum percentage of integer variables that have to be fixable
0.39/0.43 c # [type: real, range: [0,1], default: 0.5]
0.39/0.43 c heuristics/rens/minfixingrate = 0.3
0.39/0.43 c
0.39/0.43 c # number of nodes added to the contingent of the total nodes
0.39/0.43 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.43 c heuristics/rens/nodesofs = 2000
0.39/0.43 c
0.39/0.43 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.43 c heuristics/rootsoldiving/freq = -1
0.39/0.43 c
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.43 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.39/0.43 c
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.39/0.43 c
0.39/0.43 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.43 c heuristics/rounding/freq = -1
0.39/0.43 c
0.39/0.43 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/shifting/freq = -1
0.39/0.43 c
0.39/0.43 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.43 c heuristics/simplerounding/freq = -1
0.39/0.43 c
0.39/0.43 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.43 c heuristics/trivial/freq = -1
0.39/0.43 c
0.39/0.43 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.43 c heuristics/trysol/freq = -1
0.39/0.43 c
0.39/0.43 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.43 c heuristics/veclendiving/freq = -1
0.39/0.43 c
0.39/0.43 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.43 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.43 c heuristics/veclendiving/maxlpiterquot = 0.075
0.39/0.43 c
0.39/0.43 c # additional number of allowed LP iterations
0.39/0.43 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.43 c heuristics/veclendiving/maxlpiterofs = 1500
0.39/0.43 c
0.39/0.43 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.43 c heuristics/zirounding/freq = -1
0.39/0.43 c
0.39/0.43 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.43 c separating/cmir/freq = -1
0.39/0.43 c
0.39/0.43 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.43 c separating/flowcover/freq = -1
0.39/0.43 c
0.39/0.43 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.39/0.43 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.43 c separating/rapidlearning/freq = 0
0.39/0.43 c
0.39/0.43 c -----------------------------------------------------------------------------------------------
0.39/0.43 c start solving
0.39/0.43 c
0.39/0.47 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.39/0.47 c 0.3s| 1 | 0 | 152 | - |6666k| 0 | 78 |1460 |1562 |1460 |2822 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.19/1.23 c 0.8s| 1 | 0 | 195 | - |6955k| 0 | 104 |1460 |1562 |1460 |2832 | 10 | 0 | 0 | 0.000000e+00 | -- | Inf
1.69/1.77 c 1.3s| 1 | 0 | 331 | - |7301k| 0 | 106 |1460 |1562 |1460 |2840 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
2.29/2.32 c 1.9s| 1 | 0 | 446 | - |7634k| 0 | 125 |1460 |1562 |1460 |2851 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
3.09/3.12 c 2.7s| 1 | 0 | 605 | - |7911k| 0 | 127 |1460 |1562 |1460 |2863 | 41 | 0 | 0 | 0.000000e+00 | -- | Inf
3.79/3.84 c 3.4s| 1 | 0 | 742 | - |8171k| 0 | 111 |1460 |1562 |1460 |2888 | 66 | 0 | 0 | 0.000000e+00 | -- | Inf
5.09/5.19 c 4.7s| 1 | 2 | 742 | - |8172k| 0 | 111 |1460 |1562 |1460 |2888 | 66 | 0 | 9 | 0.000000e+00 | -- | Inf
9.68/9.75 c * 9.2s| 54 | 0 | 2760 | 38.1 |8142k| 26 | - |1460 |1562 |1460 | 546 | 506 | 0 | 633 | 0.000000e+00 | 0.000000e+00 | 0.00%
9.68/9.76 c
9.68/9.76 c SCIP Status : problem is solved [optimal solution found]
9.68/9.76 c Solving Time (sec) : 9.21
9.68/9.76 c Solving Nodes : 54
9.68/9.76 c Primal Bound : +0.00000000000000e+00 (1 solutions)
9.68/9.76 c Dual Bound : +0.00000000000000e+00
9.68/9.76 c Gap : 0.00 %
9.68/9.76 s SATISFIABLE
9.68/9.76 v -x179 -x159 -x121 -x148 -x151 -x132 -x175 x193 -x195 -x136 -x184 -x112 -x147 -x119 -x156 -x182 -x141 -x127 -x134 -x186 -x171 -x135
9.68/9.76 v -x169 -x118 -x117 -x144 -x106 -x133 -x113 -x163 -x124 -x167 -x200 -x145 -x105 -x181 -x142 -x108 -x115 -x107 -x129 -x158 -x185
9.68/9.76 v -x172 -x161 -x160 -x139 -x137 x109 -x198 -x153 -x183 -x187 -x114 x196 -x188 x154 -x140 -x126 -x104 -x197 -x111 -x192 -x116
9.68/9.76 v x170 x173 x102 -x166 x152 x149 x130 -x125 -x110 -x103 x131 -x168 -x174 -x155 -x138 x194 x150 x180 -x143 -x101 -x190 -x177
9.68/9.76 v -x164 -x157 -x123 -x122 -x128 -x146 -x178 -x165 -x199 -x162 -x176 -x189 x120 -x191 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
9.68/9.76 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
9.68/9.76 v -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 x51 -x50 -x49 -x48 -x47 -x46 -x45 -x44 -x43 -x42
9.68/9.76 v -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 x32 -x31 -x30 -x29 x28 -x27 -x26 -x25 -x24 x23 -x22 -x21 -x20 -x19 -x18 x17 x16
9.68/9.76 v -x15 -x14 x13 -x12 x11 -x10 -x9 x8 x7 x6 x5 x4 -x3 -x2 x1
9.68/9.76 c SCIP Status : problem is solved [optimal solution found]
9.68/9.76 c Solving Time : 9.21
9.68/9.76 c Original Problem :
9.68/9.76 c Problem name : HOME/instance-2666278-1276676478.opb
9.68/9.76 c Variables : 1460 (1460 binary, 0 integer, 0 implicit integer, 0 continuous)
9.68/9.76 c Constraints : 1562 initial, 1562 maximal
9.68/9.76 c Presolved Problem :
9.68/9.76 c Problem name : t_HOME/instance-2666278-1276676478.opb
9.68/9.76 c Variables : 1460 (1460 binary, 0 integer, 0 implicit integer, 0 continuous)
9.68/9.76 c Constraints : 1562 initial, 1562 maximal
9.68/9.76 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
9.68/9.76 c trivial : 0.00 0 0 0 0 0 0 0 0
9.68/9.76 c dualfix : 0.00 0 0 0 0 0 0 0 0
9.68/9.76 c boundshift : 0.00 0 0 0 0 0 0 0 0
9.68/9.76 c inttobinary : 0.00 0 0 0 0 0 0 0 0
9.68/9.76 c implics : 0.00 0 0 0 0 0 0 0 0
9.68/9.76 c probing : 0.00 0 0 0 0 0 0 0 0
9.68/9.76 c knapsack : 0.00 0 0 0 0 0 0 0 0
9.68/9.76 c setppc : 0.01 0 0 0 0 0 0 0 0
9.68/9.76 c and : 0.18 0 0 0 0 0 0 0 0
9.68/9.76 c linear : 0.02 0 0 0 0 0 0 0 0
9.68/9.76 c logicor : 0.00 0 0 0 0 0 0 0 0
9.68/9.76 c root node : - 0 - - 0 - - - -
9.68/9.76 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
9.68/9.76 c integral : 0 0 0 66 0 0 16 0 0 106
9.68/9.76 c knapsack : 1 5 160 1 0 0 0 0 0 0
9.68/9.76 c setppc : 200 5 160 1 0 0 124 0 0 0
9.68/9.76 c and : 1260 58 160 1 0 0 1966 472 0 0
9.68/9.76 c linear : 1 5 160 1 0 0 0 0 0 0
9.68/9.76 c logicor : 100 5 39 1 0 0 32 0 0 0
9.68/9.76 c countsols : 0 0 0 1 0 0 0 0 0 0
9.68/9.76 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
9.68/9.76 c integral : 5.30 0.00 0.00 5.30 0.00
9.68/9.76 c knapsack : 0.02 0.01 0.01 0.00 0.00
9.68/9.76 c setppc : 0.00 0.00 0.00 0.00 0.00
9.68/9.76 c and : 0.03 0.02 0.01 0.00 0.00
9.68/9.76 c linear : 0.01 0.00 0.01 0.00 0.00
9.68/9.76 c logicor : 0.00 0.00 0.00 0.00 0.00
9.68/9.76 c countsols : 0.00 0.00 0.00 0.00 0.00
9.68/9.76 c Propagators : Time Calls Cutoffs DomReds
9.68/9.76 c vbounds : 0.00 1 0 0
9.68/9.76 c rootredcost : 0.00 0 0 0
9.68/9.76 c pseudoobj : 0.00 0 0 0
9.68/9.76 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
9.68/9.76 c propagation : 0.00 0 0 0 0.0 0 0.0 -
9.68/9.76 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
9.68/9.76 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
9.68/9.76 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
9.68/9.76 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
9.68/9.76 c applied globally : - - - 0 0.0 - - -
9.68/9.76 c applied locally : - - - 0 0.0 - - -
9.68/9.76 c Separators : Time Calls Cutoffs DomReds Cuts Conss
9.68/9.76 c cut pool : 0.00 4 - - 2 - (maximal pool size: 331)
9.68/9.76 c redcost : 0.00 58 0 0 0 0
9.68/9.76 c impliedbounds : 0.00 5 0 0 51 0
9.68/9.76 c intobj : 0.00 0 0 0 0 0
9.68/9.76 c cgmip : 0.00 0 0 0 0 0
9.68/9.76 c gomory : 1.52 5 0 0 51 0
9.68/9.76 c strongcg : 1.02 5 0 0 2250 0
9.68/9.76 c cmir : 0.00 0 0 0 0 0
9.68/9.76 c flowcover : 0.00 0 0 0 0 0
9.68/9.76 c clique : 0.01 5 0 0 30 0
9.68/9.76 c zerohalf : 0.00 0 0 0 0 0
9.68/9.76 c mcf : 0.01 1 0 0 0 0
9.68/9.76 c rapidlearning : 0.23 1 0 0 0 0
9.68/9.76 c Pricers : Time Calls Vars
9.68/9.76 c problem variables: 0.00 0 0
9.68/9.76 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
9.68/9.76 c relpscost : 5.30 65 0 16 0 0 106
9.68/9.76 c pscost : 0.00 0 0 0 0 0 0
9.68/9.76 c inference : 0.00 0 0 0 0 0 0
9.68/9.76 c mostinf : 0.00 0 0 0 0 0 0
9.68/9.76 c leastinf : 0.00 0 0 0 0 0 0
9.68/9.76 c fullstrong : 0.00 0 0 0 0 0 0
9.68/9.76 c allfullstrong : 0.00 0 0 0 0 0 0
9.68/9.76 c random : 0.00 0 0 0 0 0 0
9.68/9.76 c Primal Heuristics : Time Calls Found
9.68/9.76 c LP solutions : 0.00 - 1
9.68/9.76 c pseudo solutions : 0.00 - 0
9.68/9.76 c trivial : 0.00 1 0
9.68/9.76 c simplerounding : 0.00 0 0
9.68/9.76 c zirounding : 0.00 0 0
9.68/9.76 c rounding : 0.00 0 0
9.68/9.76 c shifting : 0.00 0 0
9.68/9.76 c intshifting : 0.00 0 0
9.68/9.76 c oneopt : 0.00 0 0
9.68/9.76 c twoopt : 0.00 0 0
9.68/9.76 c fixandinfer : 0.00 0 0
9.68/9.76 c feaspump : 0.00 0 0
9.68/9.76 c coefdiving : 0.00 0 0
9.68/9.76 c pscostdiving : 0.00 0 0
9.68/9.76 c fracdiving : 0.00 0 0
9.68/9.76 c veclendiving : 0.00 0 0
9.68/9.76 c intdiving : 0.00 0 0
9.68/9.76 c actconsdiving : 0.00 0 0
9.68/9.76 c objpscostdiving : 0.00 0 0
9.68/9.76 c rootsoldiving : 0.00 0 0
9.68/9.76 c linesearchdiving : 0.00 0 0
9.68/9.76 c guideddiving : 0.00 0 0
9.68/9.76 c octane : 0.00 0 0
9.68/9.76 c rens : 0.00 0 0
9.68/9.76 c rins : 0.00 0 0
9.68/9.76 c localbranching : 0.00 0 0
9.68/9.76 c mutation : 0.00 0 0
9.68/9.76 c crossover : 0.00 0 0
9.68/9.76 c dins : 0.00 0 0
9.68/9.76 c undercover : 0.00 0 0
9.68/9.76 c nlp : 0.00 0 0
9.68/9.76 c trysol : 0.00 0 0
9.68/9.76 c LP : Time Calls Iterations Iter/call Iter/sec
9.68/9.76 c primal LP : 0.01 0 0 0.00 0.00
9.68/9.76 c dual LP : 0.70 115 2760 24.00 3942.86
9.68/9.76 c lex dual LP : 0.00 0 0 0.00 -
9.68/9.76 c barrier LP : 0.00 0 0 0.00 -
9.68/9.76 c diving/probing LP: 0.00 0 0 0.00 -
9.68/9.76 c strong branching : 5.29 633 21874 34.56 4134.97
9.68/9.76 c (at root node) : - 9 2844 316.00 -
9.68/9.76 c conflict analysis: 0.00 0 0 0.00 -
9.68/9.76 c B&B Tree :
9.68/9.76 c number of runs : 1
9.68/9.76 c nodes : 54
9.68/9.76 c nodes (total) : 54
9.68/9.76 c nodes left : 0
9.68/9.76 c max depth : 26
9.68/9.76 c max depth (total): 26
9.68/9.76 c backtracks : 2 (3.7%)
9.68/9.76 c delayed cutoffs : 0
9.68/9.76 c repropagations : 0 (0 domain reductions, 0 cutoffs)
9.68/9.76 c avg switch length: 2.00
9.68/9.76 c switching time : 0.03
9.68/9.76 c Solution :
9.68/9.76 c Solutions found : 1 (1 improvements)
9.68/9.76 c First Solution : +0.00000000000000e+00 (in run 1, after 54 nodes, 9.21 seconds, depth 26, found by <relaxation>)
9.68/9.76 c Primal Bound : +0.00000000000000e+00 (in run 1, after 54 nodes, 9.21 seconds, depth 26, found by <relaxation>)
9.68/9.76 c Dual Bound : +0.00000000000000e+00
9.68/9.76 c Gap : 0.00 %
9.68/9.76 c Root Dual Bound : +0.00000000000000e+00
9.68/9.76 c Root Iterations : 742
9.68/9.78 c Time complete: 9.77.