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-2665947-1276327199.opb>
0.00/0.01 c original problem has 180 variables (180 bin, 0 int, 0 impl, 0 cont) and 152 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.01/0.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 152 upgd conss, 0 impls, 22 clqs
0.01/0.03 c presolving (2 rounds):
0.01/0.03 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.03 c 0 implications, 22 cliques
0.01/0.03 c presolved problem has 180 variables (180 bin, 0 int, 0 impl, 0 cont) and 152 constraints
0.01/0.03 c 22 constraints of type <setppc>
0.01/0.03 c 130 constraints of type <logicor>
0.01/0.03 c transformed objective value is always integral (scale: 1)
0.01/0.03 c Presolving Time: 0.00
0.01/0.03 c - non default parameters ----------------------------------------------------------------------
0.01/0.03 c # SCIP version 1.2.1.2
0.01/0.03 c
0.01/0.03 c # frequency for displaying node information lines
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.03 c display/freq = 10000
0.01/0.03 c
0.01/0.03 c # maximal time in seconds to run
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/time = 1799.99
0.01/0.03 c
0.01/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/memory = 1620
0.01/0.03 c
0.01/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c limits/solutions = 1
0.01/0.03 c
0.01/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.03 c separating/maxrounds = 1
0.01/0.03 c
0.01/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c separating/maxroundsroot = 5
0.01/0.03 c
0.01/0.03 c # should presolving try to simplify inequalities
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/linear/simplifyinequalities = TRUE
0.01/0.03 c
0.01/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.03 c constraints/knapsack/disaggregation = FALSE
0.01/0.03 c
0.01/0.03 c # should presolving try to simplify knapsacks
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.03 c
0.01/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c presolving/probing/maxrounds = 0
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/coefdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.03 c heuristics/crossover/freq = -1
0.01/0.03 c
0.01/0.03 c # number of nodes added to the contingent of the total nodes
0.01/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.03 c heuristics/crossover/nodesofs = 750
0.01/0.03 c
0.01/0.03 c # number of nodes without incumbent change that heuristic should wait
0.01/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.03 c heuristics/crossover/nwaitingnodes = 100
0.01/0.03 c
0.01/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.03 c # [type: real, range: [0,1], default: 0.1]
0.01/0.03 c heuristics/crossover/nodesquot = 0.15
0.01/0.03 c
0.01/0.03 c # minimum percentage of integer variables that have to be fixed
0.01/0.03 c # [type: real, range: [0,1], default: 0.666]
0.01/0.03 c heuristics/crossover/minfixingrate = 0.5
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03 c heuristics/feaspump/freq = -1
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/fracdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/guideddiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/intshifting/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/linesearchdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/nlp/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03 c heuristics/objpscostdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.03 c # [type: real, range: [0,1], default: 0.01]
0.01/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/oneopt/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/pscostdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c heuristics/rens/freq = -1
0.01/0.03 c
0.01/0.03 c # minimum percentage of integer variables that have to be fixable
0.01/0.03 c # [type: real, range: [0,1], default: 0.5]
0.01/0.03 c heuristics/rens/minfixingrate = 0.3
0.01/0.03 c
0.01/0.03 c # number of nodes added to the contingent of the total nodes
0.01/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.03 c heuristics/rens/nodesofs = 2000
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03 c heuristics/rootsoldiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/rounding/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/shifting/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/simplerounding/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c heuristics/trivial/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/trysol/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/veclendiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/zirounding/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c separating/cmir/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c separating/flowcover/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c separating/rapidlearning/freq = 0
0.01/0.03 c
0.01/0.03 c -----------------------------------------------------------------------------------------------
0.01/0.03 c start solving
0.01/0.03 c
0.01/0.03 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.01/0.03 c 0.0s| 1 | 0 | 57 | - | 735k| 0 | 54 | 180 | 152 | 180 | 152 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.10 c 0.1s| 1 | 0 | 88 | - | 951k| 0 | 56 | 180 | 152 | 180 | 156 | 4 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.12 c 0.1s| 1 | 0 | 99 | - |1032k| 0 | 59 | 180 | 152 | 180 | 157 | 5 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 162 | - |1124k| 0 | 52 | 180 | 152 | 180 | 161 | 9 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.18 c 0.1s| 1 | 0 | 219 | - |1291k| 0 | 63 | 180 | 152 | 180 | 166 | 14 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.21 c 0.2s| 1 | 0 | 320 | - |1459k| 0 | 71 | 180 | 152 | 180 | 172 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.2s| 1 | 2 | 320 | - |1460k| 0 | 71 | 180 | 152 | 180 | 172 | 20 | 0 | 14 | 0.000000e+00 | -- | Inf
1.29/1.36 c * 1.2s| 92 | 0 | 1318 | 11.0 |1534k| 18 | - | 180 | 165 | 180 | 164 | 20 | 13 | 825 | 0.000000e+00 | 0.000000e+00 | 0.00%
1.29/1.36 c
1.29/1.36 c SCIP Status : problem is solved [optimal solution found]
1.29/1.36 c Solving Time (sec) : 1.17
1.29/1.36 c Solving Nodes : 92
1.29/1.36 c Primal Bound : +0.00000000000000e+00 (1 solutions)
1.29/1.36 c Dual Bound : +0.00000000000000e+00
1.29/1.36 c Gap : 0.00 %
1.29/1.36 s SATISFIABLE
1.29/1.36 v x108 -x105 -x42 -x17 -x23 -x21 -x44 -x38 -x41 -x40 -x96 -x90 x88 -x87 -x85 -x98 -x92 -x102 -x106 -x100 -x79 -x24 -x101 -x12 -x10
1.29/1.36 v -x9 -x6 -x2 -x8 -x3 -x5 -x78 -x77 x37 -x15 -x81 -x82 -x11 -x43 -x1 x7 -x86 -x91 -x93 -x83 -x13 -x73 x22 -x39 -x48 -x104 -x75
1.29/1.36 v -x19 -x84 -x60 -x58 -x57 -x56 -x55 -x54 -x53 -x52 x51 -x50 -x49 -x145 -x144 -x143 -x142 -x141 -x89 -x46 -x16 -x72 -x71 -x69
1.29/1.36 v x68 -x66 -x65 -x64 -x63 -x62 -x76 -x140 -x139 -x138 x137 -x136 -x4 x35 -x34 -x32 -x31 -x29 -x28 -x27 -x25 -x107 -x94 -x103 -x155
1.29/1.36 v -x154 -x153 x152 -x151 -x67 -x59 -x33 -x26 -x20 -x165 -x164 -x163 -x162 -x161 -x45 -x18 -x120 -x119 -x118 -x117 -x115 x114
1.29/1.36 v -x113 -x112 -x111 -x110 -x109 x74 -x47 -x97 -x175 -x174 -x173 -x172 x171 -x95 -x180 -x179 x178 -x177 -x176 -x36 -x116 -x135
1.29/1.36 v -x134 -x133 -x132 x131 -x99 -x170 x169 -x168 -x167 -x166 -x70 -x130 -x129 x128 -x127 -x126 -x14 x160 -x159 -x158 -x157 -x156
1.29/1.36 v -x80 -x125 x124 -x123 -x122 -x121 -x61 x150 -x149 -x148 -x147 -x146 -x30
1.29/1.36 c SCIP Status : problem is solved [optimal solution found]
1.29/1.36 c Solving Time : 1.17
1.29/1.36 c Original Problem :
1.29/1.36 c Problem name : HOME/instance-2665947-1276327199.opb
1.29/1.36 c Variables : 180 (180 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.36 c Constraints : 152 initial, 152 maximal
1.29/1.36 c Presolved Problem :
1.29/1.36 c Problem name : t_HOME/instance-2665947-1276327199.opb
1.29/1.36 c Variables : 180 (180 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.36 c Constraints : 152 initial, 165 maximal
1.29/1.36 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.29/1.36 c trivial : 0.00 0 0 0 0 0 0 0 0
1.29/1.36 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.29/1.36 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.29/1.36 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.29/1.36 c implics : 0.00 0 0 0 0 0 0 0 0
1.29/1.36 c probing : 0.00 0 0 0 0 0 0 0 0
1.29/1.36 c setppc : 0.00 0 0 0 0 0 0 0 0
1.29/1.36 c logicor : 0.00 0 0 0 0 0 0 0 0
1.29/1.36 c root node : - 0 - - 0 - - - -
1.29/1.36 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.29/1.36 c integral : 0 0 0 121 0 11 89 0 0 122
1.29/1.36 c setppc : 22 5 232 1 0 0 493 0 0 0
1.29/1.36 c logicor : 130+ 5 99 1 0 0 14 0 0 0
1.29/1.36 c countsols : 0 0 0 1 0 0 0 0 0 0
1.29/1.36 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.29/1.36 c integral : 0.89 0.00 0.00 0.89 0.00
1.29/1.36 c setppc : 0.00 0.00 0.00 0.00 0.00
1.29/1.36 c logicor : 0.00 0.00 0.00 0.00 0.00
1.29/1.36 c countsols : 0.00 0.00 0.00 0.00 0.00
1.29/1.36 c Propagators : Time Calls Cutoffs DomReds
1.29/1.36 c vbounds : 0.00 1 0 0
1.29/1.36 c rootredcost : 0.00 0 0 0
1.29/1.36 c pseudoobj : 0.00 0 0 0
1.29/1.37 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.29/1.37 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.37 c infeasible LP : 0.00 19 12 90 18.1 0 0.0 0
1.29/1.37 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.37 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.37 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.37 c applied globally : - - - 13 12.1 - - -
1.29/1.37 c applied locally : - - - 0 0.0 - - -
1.29/1.37 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.29/1.37 c cut pool : 0.00 4 - - 13 - (maximal pool size: 231)
1.29/1.37 c redcost : 0.00 79 0 0 0 0
1.29/1.37 c impliedbounds : 0.00 5 0 0 0 0
1.29/1.37 c intobj : 0.00 0 0 0 0 0
1.29/1.37 c cgmip : 0.00 0 0 0 0 0
1.29/1.37 c gomory : 0.05 5 0 0 400 0
1.29/1.37 c strongcg : 0.05 5 0 0 538 0
1.29/1.37 c cmir : 0.00 0 0 0 0 0
1.29/1.37 c flowcover : 0.00 0 0 0 0 0
1.29/1.37 c clique : 0.00 5 0 0 0 0
1.29/1.37 c zerohalf : 0.00 0 0 0 0 0
1.29/1.37 c mcf : 0.00 1 0 0 0 0
1.29/1.37 c rapidlearning : 0.02 1 0 0 0 0
1.29/1.37 c Pricers : Time Calls Vars
1.29/1.37 c problem variables: 0.00 0 0
1.29/1.37 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.29/1.37 c relpscost : 0.89 120 11 89 0 0 122
1.29/1.37 c pscost : 0.00 0 0 0 0 0 0
1.29/1.37 c inference : 0.00 0 0 0 0 0 0
1.29/1.37 c mostinf : 0.00 0 0 0 0 0 0
1.29/1.37 c leastinf : 0.00 0 0 0 0 0 0
1.29/1.37 c fullstrong : 0.00 0 0 0 0 0 0
1.29/1.37 c allfullstrong : 0.00 0 0 0 0 0 0
1.29/1.37 c random : 0.00 0 0 0 0 0 0
1.29/1.37 c Primal Heuristics : Time Calls Found
1.29/1.37 c LP solutions : 0.00 - 1
1.29/1.37 c pseudo solutions : 0.00 - 0
1.29/1.37 c trivial : 0.00 1 0
1.29/1.37 c simplerounding : 0.00 0 0
1.29/1.37 c zirounding : 0.00 0 0
1.29/1.37 c rounding : 0.00 0 0
1.29/1.37 c shifting : 0.00 0 0
1.29/1.37 c intshifting : 0.00 0 0
1.29/1.37 c oneopt : 0.00 0 0
1.29/1.37 c twoopt : 0.00 0 0
1.29/1.37 c fixandinfer : 0.00 0 0
1.29/1.37 c feaspump : 0.00 0 0
1.29/1.37 c coefdiving : 0.00 0 0
1.29/1.37 c pscostdiving : 0.00 0 0
1.29/1.37 c fracdiving : 0.00 0 0
1.29/1.37 c veclendiving : 0.00 0 0
1.29/1.37 c intdiving : 0.00 0 0
1.29/1.37 c actconsdiving : 0.00 0 0
1.29/1.37 c objpscostdiving : 0.00 0 0
1.29/1.37 c rootsoldiving : 0.00 0 0
1.29/1.37 c linesearchdiving : 0.00 0 0
1.29/1.37 c guideddiving : 0.00 0 0
1.29/1.37 c octane : 0.00 0 0
1.29/1.37 c rens : 0.00 0 0
1.29/1.37 c rins : 0.00 0 0
1.29/1.37 c localbranching : 0.00 0 0
1.29/1.37 c mutation : 0.00 0 0
1.29/1.37 c crossover : 0.00 0 0
1.29/1.37 c dins : 0.00 0 0
1.29/1.37 c undercover : 0.00 0 0
1.29/1.37 c nlp : 0.00 0 0
1.29/1.37 c trysol : 0.00 0 0
1.29/1.37 c LP : Time Calls Iterations Iter/call Iter/sec
1.29/1.37 c primal LP : 0.00 0 0 0.00 -
1.29/1.37 c dual LP : 0.11 145 1318 9.09 11981.82
1.29/1.37 c lex dual LP : 0.00 0 0 0.00 -
1.29/1.37 c barrier LP : 0.00 0 0 0.00 -
1.29/1.37 c diving/probing LP: 0.00 0 0 0.00 -
1.29/1.37 c strong branching : 0.89 825 14198 17.21 15952.81
1.29/1.37 c (at root node) : - 14 804 57.43 -
1.29/1.37 c conflict analysis: 0.00 0 0 0.00 -
1.29/1.37 c B&B Tree :
1.29/1.37 c number of runs : 1
1.29/1.37 c nodes : 92
1.29/1.37 c nodes (total) : 92
1.29/1.37 c nodes left : 0
1.29/1.37 c max depth : 18
1.29/1.37 c max depth (total): 18
1.29/1.37 c backtracks : 11 (12.0%)
1.29/1.37 c delayed cutoffs : 0
1.29/1.37 c repropagations : 19 (28 domain reductions, 0 cutoffs)
1.29/1.37 c avg switch length: 3.59
1.29/1.37 c switching time : 0.01
1.29/1.37 c Solution :
1.29/1.37 c Solutions found : 1 (1 improvements)
1.29/1.37 c First Solution : +0.00000000000000e+00 (in run 1, after 92 nodes, 1.17 seconds, depth 18, found by <relaxation>)
1.29/1.37 c Primal Bound : +0.00000000000000e+00 (in run 1, after 92 nodes, 1.17 seconds, depth 18, found by <relaxation>)
1.29/1.37 c Dual Bound : +0.00000000000000e+00
1.29/1.37 c Gap : 0.00 %
1.29/1.37 c Root Dual Bound : +0.00000000000000e+00
1.29/1.37 c Root Iterations : 320
1.29/1.37 c Time complete: 1.36.