0.00/0.00 c SCIP version 1.2.1.2 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: Clp 1.11.1] [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-2664848-1276676473.opb>
0.00/0.02 c original problem has 1460 variables (1460 bin, 0 int, 0 impl, 0 cont) and 1562 constraints
0.00/0.02 c problem read
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c presolving settings loaded
0.00/0.04 c presolving:
0.19/0.22 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.29/0.39 c presolving (2 rounds):
0.29/0.39 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.29/0.39 c 10280 implications, 200 cliques
0.29/0.39 c presolved problem has 1460 variables (1460 bin, 0 int, 0 impl, 0 cont) and 1562 constraints
0.29/0.39 c 1 constraints of type <knapsack>
0.29/0.39 c 200 constraints of type <setppc>
0.29/0.39 c 1260 constraints of type <and>
0.29/0.39 c 1 constraints of type <linear>
0.29/0.39 c 100 constraints of type <logicor>
0.29/0.39 c transformed objective value is always integral (scale: 1)
0.29/0.39 c Presolving Time: 0.19
0.29/0.39 c - non default parameters ----------------------------------------------------------------------
0.29/0.39 c # SCIP version 1.2.1.2
0.29/0.39 c
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 = 10000
0.29/0.39 c
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 = 1799.98
0.29/0.39 c
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 = 1620
0.29/0.39 c
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 = 1
0.29/0.39 c
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 = 1
0.29/0.39 c
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 = 5
0.29/0.39 c
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 = TRUE
0.29/0.39 c
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 = FALSE
0.29/0.39 c
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 = TRUE
0.29/0.39 c
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 = 0
0.29/0.39 c
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 = -1
0.29/0.39 c
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 = 0.075
0.29/0.39 c
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 = 1500
0.29/0.39 c
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 = -1
0.29/0.39 c
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 = 750
0.29/0.39 c
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 = 100
0.29/0.39 c
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 = 0.15
0.29/0.39 c
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 = 0.5
0.29/0.39 c
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 = -1
0.29/0.39 c
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 = 2000
0.29/0.39 c
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 = -1
0.29/0.39 c
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 = 0.075
0.29/0.39 c
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 = 1500
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <guideddiving> (-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/guideddiving/freq = -1
0.29/0.39 c
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/guideddiving/maxlpiterquot = 0.075
0.29/0.39 c
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/guideddiving/maxlpiterofs = 1500
0.29/0.39 c
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/intdiving/maxlpiterquot = 0.075
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <intshifting> (-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/intshifting/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <linesearchdiving> (-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/linesearchdiving/freq = -1
0.29/0.39 c
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/linesearchdiving/maxlpiterquot = 0.075
0.29/0.39 c
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/linesearchdiving/maxlpiterofs = 1500
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/nlp/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <objpscostdiving> (-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/objpscostdiving/freq = -1
0.29/0.39 c
0.29/0.39 c # maximal fraction of diving LP iterations compared to total iteration number
0.29/0.39 c # [type: real, range: [0,1], default: 0.01]
0.29/0.39 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.29/0.39 c
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/objpscostdiving/maxlpiterofs = 1500
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/oneopt/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <pscostdiving> (-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/pscostdiving/freq = -1
0.29/0.39 c
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/pscostdiving/maxlpiterquot = 0.075
0.29/0.39 c
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/pscostdiving/maxlpiterofs = 1500
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c heuristics/rens/freq = -1
0.29/0.39 c
0.29/0.39 c # minimum percentage of integer variables that have to be fixable
0.29/0.39 c # [type: real, range: [0,1], default: 0.5]
0.29/0.39 c heuristics/rens/minfixingrate = 0.3
0.29/0.39 c
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/rens/nodesofs = 2000
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <rootsoldiving> (-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/rootsoldiving/freq = -1
0.29/0.39 c
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.01]
0.29/0.39 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.29/0.39 c
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/rootsoldiving/maxlpiterofs = 1500
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/rounding/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <shifting> (-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/shifting/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/simplerounding/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c heuristics/trivial/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/trysol/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <veclendiving> (-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/veclendiving/freq = -1
0.29/0.39 c
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/veclendiving/maxlpiterquot = 0.075
0.29/0.39 c
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/veclendiving/maxlpiterofs = 1500
0.29/0.39 c
0.29/0.39 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 1]
0.29/0.39 c heuristics/zirounding/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c separating/cmir/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: 0]
0.29/0.39 c separating/flowcover/freq = -1
0.29/0.39 c
0.29/0.39 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.29/0.39 c # [type: int, range: [-1,2147483647], default: -1]
0.29/0.39 c separating/rapidlearning/freq = 0
0.29/0.39 c
0.29/0.39 c -----------------------------------------------------------------------------------------------
0.29/0.39 c start solving
0.29/0.39 c
0.39/0.43 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.43 c 0.2s| 1 | 0 | 119 | - |6666k| 0 | 85 |1460 |1562 |1460 |2822 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.09/1.15 c 0.8s| 1 | 0 | 149 | - |7028k| 0 | 82 |1460 |1562 |1460 |2829 | 7 | 0 | 0 | 0.000000e+00 | -- | Inf
1.39/1.47 c 1.1s| 1 | 0 | 172 | - |7341k| 0 | 88 |1460 |1562 |1460 |2838 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
1.79/1.86 c 1.4s| 1 | 0 | 225 | - |7712k| 0 | 110 |1460 |1562 |1460 |2846 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
2.29/2.35 c 1.9s| 1 | 0 | 294 | - |7813k| 0 | 120 |1460 |1562 |1460 |2855 | 33 | 0 | 0 | 0.000000e+00 | -- | Inf
2.89/2.91 c 2.5s| 1 | 0 | 389 | - |8071k| 0 | 143 |1460 |1562 |1460 |2868 | 46 | 0 | 0 | 0.000000e+00 | -- | Inf
4.79/4.82 c 4.4s| 1 | 2 | 389 | - |8072k| 0 | 143 |1460 |1562 |1460 |2868 | 46 | 0 | 9 | 0.000000e+00 | -- | Inf
9.59/9.66 c * 9.1s| 31 | 0 | 2674 | 76.2 |8081k| 30 | - |1460 |1562 |1460 | 893 | 802 | 0 | 382 | 0.000000e+00 | 0.000000e+00 | 0.00%
9.59/9.66 c
9.59/9.66 c SCIP Status : problem is solved [optimal solution found]
9.59/9.66 c Solving Time (sec) : 9.06
9.59/9.66 c Solving Nodes : 31
9.59/9.66 c Primal Bound : +0.00000000000000e+00 (1 solutions)
9.59/9.66 c Dual Bound : +0.00000000000000e+00
9.59/9.66 c Gap : 0.00 %
9.59/9.66 s SATISFIABLE
9.59/9.66 v -x179 -x159 -x121 -x148 -x151 -x132 -x175 -x193 -x195 x136 -x184 -x112 -x147 -x119 -x156 -x182 -x141 -x127 -x134 -x186 -x171 -x135
9.59/9.66 v -x169 -x118 -x117 -x144 x106 x133 -x113 x163 -x124 -x167 -x200 -x145 -x105 -x181 -x142 -x108 -x115 -x107 -x129 -x158 -x185
9.59/9.66 v x172 x161 -x160 -x139 -x137 x109 -x198 -x153 -x183 -x187 -x114 -x196 x188 -x154 -x140 -x126 x104 -x197 x111 -x192 -x116 -x170
9.59/9.66 v -x173 -x102 -x166 -x152 x149 -x130 -x125 -x110 -x103 -x131 -x168 -x174 -x155 -x138 -x194 -x150 -x180 -x143 x101 x190 -x177
9.59/9.66 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.59/9.66 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.59/9.66 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.59/9.66 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 x15
9.59/9.67 v -x14 -x13 -x12 -x11 -x10 -x9 x8 x7 -x6 x5 -x4 -x3 x2 -x1
9.59/9.67 c SCIP Status : problem is solved [optimal solution found]
9.59/9.67 c Solving Time : 9.06
9.59/9.67 c Original Problem :
9.59/9.67 c Problem name : HOME/instance-2664848-1276676473.opb
9.59/9.67 c Variables : 1460 (1460 binary, 0 integer, 0 implicit integer, 0 continuous)
9.59/9.67 c Constraints : 1562 initial, 1562 maximal
9.59/9.67 c Presolved Problem :
9.59/9.67 c Problem name : t_HOME/instance-2664848-1276676473.opb
9.59/9.67 c Variables : 1460 (1460 binary, 0 integer, 0 implicit integer, 0 continuous)
9.59/9.67 c Constraints : 1562 initial, 1562 maximal
9.59/9.67 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
9.59/9.67 c trivial : 0.00 0 0 0 0 0 0 0 0
9.59/9.67 c dualfix : 0.00 0 0 0 0 0 0 0 0
9.59/9.67 c boundshift : 0.00 0 0 0 0 0 0 0 0
9.59/9.67 c inttobinary : 0.00 0 0 0 0 0 0 0 0
9.59/9.67 c implics : 0.00 0 0 0 0 0 0 0 0
9.59/9.67 c probing : 0.00 0 0 0 0 0 0 0 0
9.59/9.67 c knapsack : 0.00 0 0 0 0 0 0 0 0
9.59/9.67 c setppc : 0.00 0 0 0 0 0 0 0 0
9.59/9.67 c and : 0.16 0 0 0 0 0 0 0 0
9.59/9.67 c linear : 0.01 0 0 0 0 0 0 0 0
9.59/9.67 c logicor : 0.00 0 0 0 0 0 0 0 0
9.59/9.67 c root node : - 0 - - 0 - - - -
9.59/9.67 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
9.59/9.67 c integral : 0 0 0 42 0 0 15 0 0 60
9.59/9.67 c knapsack : 1 5 99 1 0 0 0 0 0 0
9.59/9.67 c setppc : 200 5 99 1 0 0 111 0 0 0
9.59/9.67 c and : 1260 35 99 1 0 0 1179 765 0 0
9.59/9.67 c linear : 1 5 99 1 0 0 0 0 0 0
9.59/9.67 c logicor : 100 5 23 1 0 0 13 0 0 0
9.59/9.67 c countsols : 0 0 0 1 0 0 0 0 0 0
9.59/9.67 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
9.59/9.67 c integral : 5.83 0.00 0.00 5.83 0.00
9.59/9.67 c knapsack : 0.01 0.01 0.00 0.00 0.00
9.59/9.67 c setppc : 0.00 0.00 0.00 0.00 0.00
9.59/9.67 c and : 0.03 0.03 0.00 0.00 0.00
9.59/9.67 c linear : 0.00 0.00 0.00 0.00 0.00
9.59/9.67 c logicor : 0.00 0.00 0.00 0.00 0.00
9.59/9.67 c countsols : 0.00 0.00 0.00 0.00 0.00
9.59/9.67 c Propagators : Time Calls Cutoffs DomReds
9.59/9.67 c vbounds : 0.00 1 0 0
9.59/9.67 c rootredcost : 0.00 0 0 0
9.59/9.67 c pseudoobj : 0.00 0 0 0
9.59/9.67 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
9.59/9.67 c propagation : 0.00 0 0 0 0.0 0 0.0 -
9.59/9.67 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
9.59/9.67 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
9.59/9.67 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
9.59/9.67 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
9.59/9.67 c applied globally : - - - 0 0.0 - - -
9.59/9.67 c applied locally : - - - 0 0.0 - - -
9.59/9.67 c Separators : Time Calls Cutoffs DomReds Cuts Conss
9.59/9.67 c cut pool : 0.00 4 - - 8 - (maximal pool size: 305)
9.59/9.67 c redcost : 0.00 35 0 0 0 0
9.59/9.67 c impliedbounds : 0.00 5 0 0 10 0
9.59/9.67 c intobj : 0.00 0 0 0 0 0
9.59/9.67 c cgmip : 0.00 0 0 0 0 0
9.59/9.67 c gomory : 1.12 5 0 0 304 0
9.59/9.67 c strongcg : 0.77 5 0 0 1762 0
9.59/9.67 c cmir : 0.00 0 0 0 0 0
9.59/9.67 c flowcover : 0.00 0 0 0 0 0
9.59/9.67 c clique : 0.01 5 0 0 30 0
9.59/9.67 c zerohalf : 0.00 0 0 0 0 0
9.59/9.67 c mcf : 0.00 1 0 0 0 0
9.59/9.67 c rapidlearning : 0.23 1 0 0 0 0
9.59/9.67 c Pricers : Time Calls Vars
9.59/9.67 c problem variables: 0.00 0 0
9.59/9.67 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
9.59/9.67 c relpscost : 5.83 41 0 15 0 0 60
9.59/9.67 c pscost : 0.00 0 0 0 0 0 0
9.59/9.67 c inference : 0.00 0 0 0 0 0 0
9.59/9.67 c mostinf : 0.00 0 0 0 0 0 0
9.59/9.67 c leastinf : 0.00 0 0 0 0 0 0
9.59/9.67 c fullstrong : 0.00 0 0 0 0 0 0
9.59/9.67 c allfullstrong : 0.00 0 0 0 0 0 0
9.59/9.67 c random : 0.00 0 0 0 0 0 0
9.59/9.67 c Primal Heuristics : Time Calls Found
9.59/9.67 c LP solutions : 0.00 - 1
9.59/9.67 c pseudo solutions : 0.00 - 0
9.59/9.67 c trivial : 0.01 1 0
9.59/9.67 c simplerounding : 0.00 0 0
9.59/9.67 c zirounding : 0.00 0 0
9.59/9.67 c rounding : 0.00 0 0
9.59/9.67 c shifting : 0.00 0 0
9.59/9.67 c intshifting : 0.00 0 0
9.59/9.67 c oneopt : 0.00 0 0
9.59/9.67 c twoopt : 0.00 0 0
9.59/9.67 c fixandinfer : 0.00 0 0
9.59/9.67 c feaspump : 0.00 0 0
9.59/9.67 c coefdiving : 0.00 0 0
9.59/9.67 c pscostdiving : 0.00 0 0
9.59/9.67 c fracdiving : 0.00 0 0
9.59/9.67 c veclendiving : 0.00 0 0
9.59/9.67 c intdiving : 0.00 0 0
9.59/9.67 c actconsdiving : 0.00 0 0
9.59/9.67 c objpscostdiving : 0.00 0 0
9.59/9.67 c rootsoldiving : 0.00 0 0
9.59/9.67 c linesearchdiving : 0.00 0 0
9.59/9.67 c guideddiving : 0.00 0 0
9.59/9.67 c octane : 0.00 0 0
9.59/9.67 c rens : 0.00 0 0
9.59/9.67 c rins : 0.00 0 0
9.59/9.67 c localbranching : 0.00 0 0
9.59/9.67 c mutation : 0.00 0 0
9.59/9.67 c crossover : 0.00 0 0
9.59/9.67 c dins : 0.00 0 0
9.59/9.67 c undercover : 0.00 0 0
9.59/9.67 c nlp : 0.00 0 0
9.59/9.67 c trysol : 0.00 0 0
9.59/9.67 c LP : Time Calls Iterations Iter/call Iter/sec
9.59/9.67 c primal LP : 0.17 0 0 0.00 0.00
9.59/9.67 c dual LP : 0.60 76 2674 35.18 4456.67
9.59/9.67 c lex dual LP : 0.00 0 0 0.00 -
9.59/9.67 c barrier LP : 0.00 0 0 0.00 -
9.59/9.67 c diving/probing LP: 0.00 0 0 0.00 -
9.59/9.67 c strong branching : 5.82 382 31545 82.58 5420.10
9.59/9.67 c (at root node) : - 9 5741 637.89 -
9.59/9.67 c conflict analysis: 0.00 0 0 0.00 -
9.59/9.67 c B&B Tree :
9.59/9.67 c number of runs : 1
9.59/9.67 c nodes : 31
9.59/9.67 c nodes (total) : 31
9.59/9.67 c nodes left : 0
9.59/9.67 c max depth : 30
9.59/9.67 c max depth (total): 30
9.59/9.67 c backtracks : 0 (0.0%)
9.59/9.67 c delayed cutoffs : 0
9.59/9.67 c repropagations : 0 (0 domain reductions, 0 cutoffs)
9.59/9.67 c avg switch length: 2.00
9.59/9.67 c switching time : 0.18
9.59/9.67 c Solution :
9.59/9.67 c Solutions found : 1 (1 improvements)
9.59/9.67 c First Solution : +0.00000000000000e+00 (in run 1, after 31 nodes, 9.06 seconds, depth 30, found by <relaxation>)
9.59/9.67 c Primal Bound : +0.00000000000000e+00 (in run 1, after 31 nodes, 9.06 seconds, depth 30, found by <relaxation>)
9.59/9.67 c Dual Bound : +0.00000000000000e+00
9.59/9.67 c Gap : 0.00 %
9.59/9.67 c Root Dual Bound : +0.00000000000000e+00
9.59/9.67 c Root Iterations : 389
9.59/9.69 c Time complete: 9.67.