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-2665952-1276327804.opb>
0.00/0.01 c original problem has 150 variables (150 bin, 0 int, 0 impl, 0 cont) and 130 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.01 c presolving:
0.00/0.02 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 130 upgd conss, 0 impls, 20 clqs
0.00/0.03 c presolving (2 rounds):
0.00/0.03 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.03 c 0 implications, 20 cliques
0.00/0.03 c presolved problem has 150 variables (150 bin, 0 int, 0 impl, 0 cont) and 130 constraints
0.00/0.03 c 20 constraints of type <setppc>
0.00/0.03 c 110 constraints of type <logicor>
0.00/0.03 c transformed objective value is always integral (scale: 1)
0.00/0.03 c Presolving Time: 0.00
0.00/0.03 c - non default parameters ----------------------------------------------------------------------
0.00/0.03 c # SCIP version 1.2.1.2
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 = 1799.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 # 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 # 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.03 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.03 c 0.0s| 1 | 0 | 56 | - | 632k| 0 | 46 | 150 | 130 | 150 | 130 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.10/0.16 c 0.1s| 1 | 0 | 85 | - | 946k| 0 | 46 | 150 | 229 | 150 | 134 | 4 | 0 | 0 | 0.000000e+00 | -- | Inf
0.10/0.17 c 0.1s| 1 | 0 | 138 | - |1019k| 0 | 41 | 150 | 229 | 150 | 140 | 10 | 0 | 0 | 0.000000e+00 | -- | Inf
0.10/0.18 c 0.1s| 1 | 0 | 177 | - |1085k| 0 | 32 | 150 | 229 | 150 | 144 | 14 | 0 | 0 | 0.000000e+00 | -- | Inf
0.10/0.19 c 0.1s| 1 | 0 | 226 | - |1141k| 0 | 36 | 150 | 229 | 150 | 153 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.21 c 0.1s| 1 | 0 | 254 | - |1179k| 0 | 34 | 150 | 229 | 150 | 157 | 27 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 2 | 254 | - |1180k| 0 | 34 | 150 | 229 | 150 | 157 | 27 | 0 | 11 | 0.000000e+00 | -- | Inf
0.49/0.53 c * 0.4s| 34 | 0 | 496 | 7.3 |1220k| 14 | - | 150 | 229 | 150 | 137 | 27 | 0 | 343 | 0.000000e+00 | 0.000000e+00 | 0.00%
0.49/0.53 c
0.49/0.53 c SCIP Status : problem is solved [optimal solution found]
0.49/0.53 c Solving Time (sec) : 0.43
0.49/0.53 c Solving Nodes : 34
0.49/0.53 c Primal Bound : +0.00000000000000e+00 (1 solutions)
0.49/0.53 c Dual Bound : +0.00000000000000e+00
0.49/0.53 c Gap : 0.00 %
0.49/0.53 s SATISFIABLE
0.49/0.53 v -x56 -x51 -x77 -x74 -x71 -x60 -x48 -x43 -x42 -x41 -x57 -x53 -x72 -x54 -x100 -x95 -x94 -x92 -x38 -x34 -x76 -x44 -x91 -x47 -x69 -x68
0.49/0.53 v -x67 -x66 -x64 -x63 -x37 -x59 -x79 -x98 x96 -x58 x33 -x55 -x46 -x32 -x36 -x62 -x10 -x6 -x5 -x4 -x3 -x2 -x1 x130 -x129 -x128
0.49/0.53 v -x127 -x126 -x97 -x50 -x45 x70 -x78 x52 -x29 -x28 -x26 -x25 -x23 -x22 -x120 -x119 -x118 -x117 x116 x24 -x8 -x61 -x31 -x99
0.49/0.53 v -x35 -x9 -x65 -x125 -x124 -x123 x122 -x121 x75 -x110 x109 -x108 -x107 -x106 x7 -x105 -x104 x103 -x102 -x101 -x21 -x73 x115 -x114
0.49/0.53 v -x113 -x112 -x111 -x93 x49 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 x81 -x40 -x20 -x19 -x17 -x16 -x15 -x14 -x13 -x12
0.49/0.53 v -x11 -x140 -x139 -x138 -x137 x136 x18 -x135 -x134 -x133 x132 -x131 -x27 -x145 x144 -x143 -x142 -x141 -x39 -x80 -x150 -x149 x148
0.49/0.53 v -x147 -x146 -x30
0.49/0.53 c SCIP Status : problem is solved [optimal solution found]
0.49/0.53 c Solving Time : 0.43
0.49/0.53 c Original Problem :
0.49/0.53 c Problem name : HOME/instance-2665952-1276327804.opb
0.49/0.53 c Variables : 150 (150 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.53 c Constraints : 130 initial, 130 maximal
0.49/0.53 c Presolved Problem :
0.49/0.53 c Problem name : t_HOME/instance-2665952-1276327804.opb
0.49/0.53 c Variables : 150 (150 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.53 c Constraints : 130 initial, 229 maximal
0.49/0.53 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.49/0.53 c trivial : 0.00 0 0 0 0 0 0 0 0
0.49/0.53 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.49/0.53 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.49/0.53 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.49/0.53 c implics : 0.00 0 0 0 0 0 0 0 0
0.49/0.53 c probing : 0.00 0 0 0 0 0 0 0 0
0.49/0.53 c setppc : 0.00 0 0 0 0 0 0 0 0
0.49/0.53 c linear : 0.00 0 0 0 0 0 0 0 0
0.49/0.53 c logicor : 0.00 0 0 0 0 0 0 0 0
0.49/0.53 c root node : - 0 - - 0 - - - -
0.49/0.53 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.49/0.53 c integral : 0 0 0 34 0 0 0 0 0 66
0.49/0.53 c setppc : 20 5 55 1 0 0 169 0 0 0
0.49/0.53 c linear : 0+ 5 53 0 0 0 0 0 0 0
0.49/0.53 c logicor : 110 5 26 1 0 0 3 0 0 0
0.49/0.53 c countsols : 0 0 0 1 0 0 0 0 0 0
0.49/0.53 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.49/0.53 c integral : 0.28 0.00 0.00 0.28 0.00
0.49/0.53 c setppc : 0.00 0.00 0.00 0.00 0.00
0.49/0.53 c linear : 0.00 0.00 0.00 0.00 0.00
0.49/0.53 c logicor : 0.00 0.00 0.00 0.00 0.00
0.49/0.53 c countsols : 0.00 0.00 0.00 0.00 0.00
0.49/0.53 c Propagators : Time Calls Cutoffs DomReds
0.49/0.53 c vbounds : 0.00 1 0 0
0.49/0.53 c rootredcost : 0.00 0 0 0
0.49/0.53 c pseudoobj : 0.00 0 0 0
0.49/0.53 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.53 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.53 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.53 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.53 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.53 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.53 c applied globally : - - - 0 0.0 - - -
0.49/0.53 c applied locally : - - - 0 0.0 - - -
0.49/0.53 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.49/0.53 c cut pool : 0.00 4 - - 0 - (maximal pool size: 197)
0.49/0.53 c redcost : 0.00 38 0 0 0 0
0.49/0.53 c impliedbounds : 0.00 5 0 0 0 0
0.49/0.53 c intobj : 0.00 0 0 0 0 0
0.49/0.53 c cgmip : 0.00 0 0 0 0 0
0.49/0.53 c gomory : 0.02 5 0 0 533 0
0.49/0.53 c strongcg : 0.03 5 0 0 543 0
0.49/0.53 c cmir : 0.00 0 0 0 0 0
0.49/0.53 c flowcover : 0.00 0 0 0 0 0
0.49/0.53 c clique : 0.00 5 0 0 0 0
0.49/0.53 c zerohalf : 0.00 0 0 0 0 0
0.49/0.53 c mcf : 0.00 1 0 0 0 0
0.49/0.53 c rapidlearning : 0.08 1 0 0 0 99
0.49/0.53 c Pricers : Time Calls Vars
0.49/0.53 c problem variables: 0.00 0 0
0.49/0.53 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.49/0.53 c relpscost : 0.28 33 0 0 0 0 66
0.49/0.53 c pscost : 0.00 0 0 0 0 0 0
0.49/0.53 c inference : 0.00 0 0 0 0 0 0
0.49/0.53 c mostinf : 0.00 0 0 0 0 0 0
0.49/0.53 c leastinf : 0.00 0 0 0 0 0 0
0.49/0.53 c fullstrong : 0.00 0 0 0 0 0 0
0.49/0.53 c allfullstrong : 0.00 0 0 0 0 0 0
0.49/0.53 c random : 0.00 0 0 0 0 0 0
0.49/0.53 c Primal Heuristics : Time Calls Found
0.49/0.53 c LP solutions : 0.00 - 1
0.49/0.53 c pseudo solutions : 0.00 - 0
0.49/0.53 c trivial : 0.00 1 0
0.49/0.53 c simplerounding : 0.00 0 0
0.49/0.53 c zirounding : 0.00 0 0
0.49/0.53 c rounding : 0.00 0 0
0.49/0.53 c shifting : 0.00 0 0
0.49/0.53 c intshifting : 0.00 0 0
0.49/0.53 c oneopt : 0.00 0 0
0.49/0.53 c twoopt : 0.00 0 0
0.49/0.53 c fixandinfer : 0.00 0 0
0.49/0.53 c feaspump : 0.00 0 0
0.49/0.53 c coefdiving : 0.00 0 0
0.49/0.53 c pscostdiving : 0.00 0 0
0.49/0.53 c fracdiving : 0.00 0 0
0.49/0.53 c veclendiving : 0.00 0 0
0.49/0.53 c intdiving : 0.00 0 0
0.49/0.53 c actconsdiving : 0.00 0 0
0.49/0.53 c objpscostdiving : 0.00 0 0
0.49/0.53 c rootsoldiving : 0.00 0 0
0.49/0.53 c linesearchdiving : 0.00 0 0
0.49/0.53 c guideddiving : 0.00 0 0
0.49/0.53 c octane : 0.00 0 0
0.49/0.53 c rens : 0.00 0 0
0.49/0.53 c rins : 0.00 0 0
0.49/0.53 c localbranching : 0.00 0 0
0.49/0.53 c mutation : 0.00 0 0
0.49/0.53 c crossover : 0.00 0 0
0.49/0.53 c dins : 0.00 0 0
0.49/0.53 c undercover : 0.00 0 0
0.49/0.53 c nlp : 0.00 0 0
0.49/0.53 c trysol : 0.00 0 0
0.49/0.53 c LP : Time Calls Iterations Iter/call Iter/sec
0.49/0.53 c primal LP : 0.00 0 0 0.00 -
0.49/0.53 c dual LP : 0.02 39 496 12.72 24800.00
0.49/0.53 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.53 c barrier LP : 0.00 0 0 0.00 -
0.49/0.53 c diving/probing LP: 0.00 0 0 0.00 -
0.49/0.53 c strong branching : 0.28 343 3936 11.48 14057.14
0.49/0.53 c (at root node) : - 11 224 20.36 -
0.49/0.53 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.53 c B&B Tree :
0.49/0.53 c number of runs : 1
0.49/0.53 c nodes : 34
0.49/0.53 c nodes (total) : 34
0.49/0.53 c nodes left : 0
0.49/0.53 c max depth : 14
0.49/0.53 c max depth (total): 14
0.49/0.53 c backtracks : 2 (5.9%)
0.49/0.53 c delayed cutoffs : 0
0.49/0.53 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.49/0.53 c avg switch length: 2.29
0.49/0.53 c switching time : 0.00
0.49/0.53 c Solution :
0.49/0.53 c Solutions found : 1 (1 improvements)
0.49/0.53 c First Solution : +0.00000000000000e+00 (in run 1, after 34 nodes, 0.43 seconds, depth 11, found by <relaxation>)
0.49/0.53 c Primal Bound : +0.00000000000000e+00 (in run 1, after 34 nodes, 0.43 seconds, depth 11, found by <relaxation>)
0.49/0.53 c Dual Bound : +0.00000000000000e+00
0.49/0.53 c Gap : 0.00 %
0.49/0.53 c Root Dual Bound : +0.00000000000000e+00
0.49/0.53 c Root Iterations : 254
0.49/0.54 c Time complete: 0.53.