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-2666272-1276675601.opb>
0.00/0.03 c original problem has 1444 variables (1444 bin, 0 int, 0 impl, 0 cont) and 1546 constraints
0.00/0.03 c problem read
0.00/0.03 c No objective function, only one solution is needed.
0.00/0.03 c presolving settings loaded
0.00/0.04 c presolving:
0.19/0.23 c (round 1) 0 del vars, 0 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 10152 impls, 200 clqs
0.39/0.40 c presolving (2 rounds):
0.39/0.40 c 0 deleted vars, 0 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.39/0.40 c 10152 implications, 200 cliques
0.39/0.40 c presolved problem has 1444 variables (1444 bin, 0 int, 0 impl, 0 cont) and 1546 constraints
0.39/0.40 c 1 constraints of type <knapsack>
0.39/0.40 c 200 constraints of type <setppc>
0.39/0.40 c 1244 constraints of type <and>
0.39/0.40 c 1 constraints of type <linear>
0.39/0.40 c 100 constraints of type <logicor>
0.39/0.40 c transformed objective value is always integral (scale: 1)
0.39/0.40 c Presolving Time: 0.19
0.39/0.40 c - non default parameters ----------------------------------------------------------------------
0.39/0.40 c # SCIP version 1.2.1.2
0.39/0.40 c
0.39/0.40 c # frequency for displaying node information lines
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.40 c display/freq = 10000
0.39/0.40 c
0.39/0.40 c # maximal time in seconds to run
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.40 c limits/time = 1799.98
0.39/0.40 c
0.39/0.40 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.40 c limits/memory = 1620
0.39/0.40 c
0.39/0.40 c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.40 c limits/solutions = 1
0.39/0.40 c
0.39/0.40 c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.40 c separating/maxrounds = 1
0.39/0.40 c
0.39/0.40 c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.40 c separating/maxroundsroot = 5
0.39/0.40 c
0.39/0.40 c # should presolving try to simplify inequalities
0.39/0.40 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.40 c constraints/linear/simplifyinequalities = TRUE
0.39/0.40 c
0.39/0.40 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.40 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.40 c constraints/knapsack/disaggregation = FALSE
0.39/0.40 c
0.39/0.40 c # should presolving try to simplify knapsacks
0.39/0.40 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.40 c constraints/knapsack/simplifyinequalities = TRUE
0.39/0.40 c
0.39/0.40 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.40 c presolving/probing/maxrounds = 0
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40 c heuristics/coefdiving/freq = -1
0.39/0.40 c
0.39/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.40 c heuristics/coefdiving/maxlpiterquot = 0.075
0.39/0.40 c
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/coefdiving/maxlpiterofs = 1500
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.40 c heuristics/crossover/freq = -1
0.39/0.40 c
0.39/0.40 c # number of nodes added to the contingent of the total nodes
0.39/0.40 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.40 c heuristics/crossover/nodesofs = 750
0.39/0.40 c
0.39/0.40 c # number of nodes without incumbent change that heuristic should wait
0.39/0.40 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.40 c heuristics/crossover/nwaitingnodes = 100
0.39/0.40 c
0.39/0.40 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.40 c # [type: real, range: [0,1], default: 0.1]
0.39/0.40 c heuristics/crossover/nodesquot = 0.15
0.39/0.40 c
0.39/0.40 c # minimum percentage of integer variables that have to be fixed
0.39/0.40 c # [type: real, range: [0,1], default: 0.666]
0.39/0.40 c heuristics/crossover/minfixingrate = 0.5
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.40 c heuristics/feaspump/freq = -1
0.39/0.40 c
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/feaspump/maxlpiterofs = 2000
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40 c heuristics/fracdiving/freq = -1
0.39/0.40 c
0.39/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.40 c heuristics/fracdiving/maxlpiterquot = 0.075
0.39/0.40 c
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/fracdiving/maxlpiterofs = 1500
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40 c heuristics/guideddiving/freq = -1
0.39/0.40 c
0.39/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.40 c heuristics/guideddiving/maxlpiterquot = 0.075
0.39/0.40 c
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/guideddiving/maxlpiterofs = 1500
0.39/0.40 c
0.39/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.40 c heuristics/intdiving/maxlpiterquot = 0.075
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40 c heuristics/intshifting/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40 c heuristics/linesearchdiving/freq = -1
0.39/0.40 c
0.39/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.40 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.39/0.40 c
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.40 c heuristics/nlp/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.40 c heuristics/objpscostdiving/freq = -1
0.39/0.40 c
0.39/0.40 c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.40 c # [type: real, range: [0,1], default: 0.01]
0.39/0.40 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.39/0.40 c
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.40 c heuristics/oneopt/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40 c heuristics/pscostdiving/freq = -1
0.39/0.40 c
0.39/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.40 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.39/0.40 c
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/pscostdiving/maxlpiterofs = 1500
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.40 c heuristics/rens/freq = -1
0.39/0.40 c
0.39/0.40 c # minimum percentage of integer variables that have to be fixable
0.39/0.40 c # [type: real, range: [0,1], default: 0.5]
0.39/0.40 c heuristics/rens/minfixingrate = 0.3
0.39/0.40 c
0.39/0.40 c # number of nodes added to the contingent of the total nodes
0.39/0.40 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.40 c heuristics/rens/nodesofs = 2000
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.40 c heuristics/rootsoldiving/freq = -1
0.39/0.40 c
0.39/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.40 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.39/0.40 c
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.40 c heuristics/rounding/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40 c heuristics/shifting/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.40 c heuristics/simplerounding/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.40 c heuristics/trivial/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.40 c heuristics/trysol/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.40 c heuristics/veclendiving/freq = -1
0.39/0.40 c
0.39/0.40 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.40 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.40 c heuristics/veclendiving/maxlpiterquot = 0.075
0.39/0.40 c
0.39/0.40 c # additional number of allowed LP iterations
0.39/0.40 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.40 c heuristics/veclendiving/maxlpiterofs = 1500
0.39/0.40 c
0.39/0.40 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.40 c heuristics/zirounding/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.40 c separating/cmir/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.40 c separating/flowcover/freq = -1
0.39/0.40 c
0.39/0.40 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.39/0.40 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.40 c separating/rapidlearning/freq = 0
0.39/0.40 c
0.39/0.40 c -----------------------------------------------------------------------------------------------
0.39/0.40 c start solving
0.39/0.40 c
0.39/0.46 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.46 c 0.2s| 1 | 0 | 216 | - |6595k| 0 | 62 |1444 |1546 |1444 |2790 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.09/1.12 c 0.7s| 1 | 0 | 279 | - |6847k| 0 | 76 |1444 |1546 |1444 |2813 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
1.39/1.40 c 1.0s| 1 | 0 | 407 | - |6882k| 0 | 78 |1444 |1546 |1444 |2824 | 34 | 0 | 0 | 0.000000e+00 | -- | Inf
1.79/1.85 c 1.4s| 1 | 0 | 580 | - |6999k| 0 | 60 |1444 |1546 |1444 |2831 | 41 | 0 | 0 | 0.000000e+00 | -- | Inf
1.99/2.07 c 1.6s| 1 | 0 | 640 | - |7114k| 0 | 104 |1444 |1546 |1444 |2842 | 52 | 0 | 0 | 0.000000e+00 | -- | Inf
2.49/2.50 c 2.1s| 1 | 0 | 679 | - |7540k| 0 | 95 |1444 |1546 |1444 |2860 | 70 | 0 | 0 | 0.000000e+00 | -- | Inf
3.09/3.43 c 3.0s| 1 | 2 | 679 | - |7540k| 0 | 95 |1444 |1546 |1444 |2860 | 70 | 0 | 10 | 0.000000e+00 | -- | Inf
6.29/6.35 c * 5.8s| 55 | 0 | 2348 | 30.9 |7538k| 27 | - |1444 |1546 |1444 | 509 | 426 | 0 | 541 | 0.000000e+00 | 0.000000e+00 | 0.00%
6.29/6.35 c
6.29/6.35 c SCIP Status : problem is solved [optimal solution found]
6.29/6.35 c Solving Time (sec) : 5.85
6.29/6.35 c Solving Nodes : 55
6.29/6.35 c Primal Bound : +0.00000000000000e+00 (1 solutions)
6.29/6.35 c Dual Bound : +0.00000000000000e+00
6.29/6.35 c Gap : 0.00 %
6.29/6.36 s SATISFIABLE
6.29/6.36 v -x166 -x164 -x158 -x163 -x121 -x171 -x113 -x156 -x144 -x135 -x152 -x161 -x122 -x130 -x157 -x146 -x181 -x129 -x111 -x192 -x167 -x154
6.29/6.36 v -x185 -x127 -x117 -x184 -x120 -x124 -x134 -x178 -x168 -x136 -x172 -x110 -x187 -x190 -x200 -x105 -x151 -x131 -x109 x106 x183
6.29/6.36 v -x153 -x182 -x189 -x149 -x195 -x104 -x198 -x193 -x188 -x128 -x119 -x112 -x191 x179 -x162 -x107 -x137 -x115 -x175 -x145 -x132
6.29/6.36 v -x108 -x199 -x138 -x148 -x174 -x139 -x143 x197 -x180 -x160 -x155 -x150 -x118 -x114 -x116 -x196 x176 -x142 -x103 x140 x194
6.29/6.36 v -x125 x101 x170 x133 x123 -x159 x165 x102 -x177 x173 -x126 x141 -x169 -x186 -x147 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
6.29/6.36 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
6.29/6.36 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
6.29/6.36 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
6.29/6.36 v x15 -x14 -x13 x12 -x11 x10 -x9 x8 -x7 -x6 -x5 x4 x3 -x2 -x1
6.29/6.36 c SCIP Status : problem is solved [optimal solution found]
6.29/6.36 c Solving Time : 5.85
6.29/6.36 c Original Problem :
6.29/6.36 c Problem name : HOME/instance-2666272-1276675601.opb
6.29/6.36 c Variables : 1444 (1444 binary, 0 integer, 0 implicit integer, 0 continuous)
6.29/6.36 c Constraints : 1546 initial, 1546 maximal
6.29/6.36 c Presolved Problem :
6.29/6.36 c Problem name : t_HOME/instance-2666272-1276675601.opb
6.29/6.36 c Variables : 1444 (1444 binary, 0 integer, 0 implicit integer, 0 continuous)
6.29/6.36 c Constraints : 1546 initial, 1546 maximal
6.29/6.36 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
6.29/6.36 c trivial : 0.00 0 0 0 0 0 0 0 0
6.29/6.36 c dualfix : 0.00 0 0 0 0 0 0 0 0
6.29/6.36 c boundshift : 0.00 0 0 0 0 0 0 0 0
6.29/6.36 c inttobinary : 0.00 0 0 0 0 0 0 0 0
6.29/6.36 c implics : 0.00 0 0 0 0 0 0 0 0
6.29/6.36 c probing : 0.00 0 0 0 0 0 0 0 0
6.29/6.36 c knapsack : 0.00 0 0 0 0 0 0 0 0
6.29/6.36 c setppc : 0.00 0 0 0 0 0 0 0 0
6.29/6.36 c and : 0.17 0 0 0 0 0 0 0 0
6.29/6.36 c linear : 0.00 0 0 0 0 0 0 0 0
6.29/6.36 c logicor : 0.00 0 0 0 0 0 0 0 0
6.29/6.36 c root node : - 0 - - 0 - - - -
6.29/6.36 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
6.29/6.36 c integral : 0 0 0 63 0 0 7 0 0 108
6.29/6.36 c knapsack : 1 5 155 4 0 0 0 0 0 0
6.29/6.36 c setppc : 200 5 155 4 0 0 145 0 0 0
6.29/6.36 c and : 1244 59 155 4 0 0 2028 382 0 0
6.29/6.36 c linear : 1 5 155 1 0 0 0 0 0 0
6.29/6.36 c logicor : 100 5 35 1 0 0 25 0 0 0
6.29/6.36 c countsols : 0 0 0 1 0 0 0 0 0 0
6.29/6.36 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
6.29/6.36 c integral : 3.36 0.00 0.00 3.36 0.00
6.29/6.36 c knapsack : 0.02 0.02 0.00 0.00 0.00
6.29/6.36 c setppc : 0.00 0.00 0.00 0.00 0.00
6.29/6.36 c and : 0.08 0.05 0.03 0.00 0.00
6.29/6.36 c linear : 0.00 0.00 0.00 0.00 0.00
6.29/6.36 c logicor : 0.00 0.00 0.00 0.00 0.00
6.29/6.36 c countsols : 0.00 0.00 0.00 0.00 0.00
6.29/6.36 c Propagators : Time Calls Cutoffs DomReds
6.29/6.36 c vbounds : 0.00 1 0 0
6.29/6.36 c rootredcost : 0.00 0 0 0
6.29/6.36 c pseudoobj : 0.00 0 0 0
6.29/6.36 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
6.29/6.36 c propagation : 0.00 0 0 0 0.0 0 0.0 -
6.29/6.36 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
6.29/6.36 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
6.29/6.36 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
6.29/6.36 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
6.29/6.36 c applied globally : - - - 0 0.0 - - -
6.29/6.36 c applied locally : - - - 0 0.0 - - -
6.29/6.36 c Separators : Time Calls Cutoffs DomReds Cuts Conss
6.29/6.36 c cut pool : 0.00 4 - - 1 - (maximal pool size: 252)
6.29/6.36 c redcost : 0.00 59 0 0 0 0
6.29/6.36 c impliedbounds : 0.00 5 0 0 38 0
6.29/6.36 c intobj : 0.00 0 0 0 0 0
6.29/6.36 c cgmip : 0.00 0 0 0 0 0
6.29/6.36 c gomory : 0.78 5 0 0 627 0
6.29/6.36 c strongcg : 0.61 5 0 0 1854 0
6.29/6.36 c cmir : 0.00 0 0 0 0 0
6.29/6.36 c flowcover : 0.00 0 0 0 0 0
6.29/6.36 c clique : 0.01 5 0 0 30 0
6.29/6.36 c zerohalf : 0.00 0 0 0 0 0
6.29/6.36 c mcf : 0.00 1 0 0 0 0
6.29/6.36 c rapidlearning : 0.23 1 0 0 0 0
6.29/6.36 c Pricers : Time Calls Vars
6.29/6.36 c problem variables: 0.00 0 0
6.29/6.36 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
6.29/6.36 c relpscost : 3.36 59 0 7 0 0 108
6.29/6.36 c pscost : 0.00 0 0 0 0 0 0
6.29/6.36 c inference : 0.00 0 0 0 0 0 0
6.29/6.36 c mostinf : 0.00 0 0 0 0 0 0
6.29/6.36 c leastinf : 0.00 0 0 0 0 0 0
6.29/6.36 c fullstrong : 0.00 0 0 0 0 0 0
6.29/6.36 c allfullstrong : 0.00 0 0 0 0 0 0
6.29/6.36 c random : 0.00 0 0 0 0 0 0
6.29/6.36 c Primal Heuristics : Time Calls Found
6.29/6.36 c LP solutions : 0.00 - 1
6.29/6.36 c pseudo solutions : 0.00 - 0
6.29/6.36 c trivial : 0.00 1 0
6.29/6.36 c simplerounding : 0.00 0 0
6.29/6.36 c zirounding : 0.00 0 0
6.29/6.36 c rounding : 0.00 0 0
6.29/6.36 c shifting : 0.00 0 0
6.29/6.36 c intshifting : 0.00 0 0
6.29/6.36 c oneopt : 0.00 0 0
6.29/6.36 c twoopt : 0.00 0 0
6.29/6.36 c fixandinfer : 0.00 0 0
6.29/6.36 c feaspump : 0.00 0 0
6.29/6.36 c coefdiving : 0.00 0 0
6.29/6.36 c pscostdiving : 0.00 0 0
6.29/6.36 c fracdiving : 0.00 0 0
6.29/6.36 c veclendiving : 0.00 0 0
6.29/6.36 c intdiving : 0.00 0 0
6.29/6.36 c actconsdiving : 0.00 0 0
6.29/6.36 c objpscostdiving : 0.00 0 0
6.29/6.36 c rootsoldiving : 0.00 0 0
6.29/6.36 c linesearchdiving : 0.00 0 0
6.29/6.36 c guideddiving : 0.00 0 0
6.29/6.36 c octane : 0.00 0 0
6.29/6.36 c rens : 0.00 0 0
6.29/6.36 c rins : 0.00 0 0
6.29/6.36 c localbranching : 0.00 0 0
6.29/6.36 c mutation : 0.00 0 0
6.29/6.36 c crossover : 0.00 0 0
6.29/6.36 c dins : 0.00 0 0
6.29/6.36 c undercover : 0.00 0 0
6.29/6.36 c nlp : 0.00 0 0
6.29/6.36 c trysol : 0.00 0 0
6.29/6.36 c LP : Time Calls Iterations Iter/call Iter/sec
6.29/6.36 c primal LP : 0.01 0 0 0.00 0.00
6.29/6.36 c dual LP : 0.50 119 2348 19.73 4696.00
6.29/6.36 c lex dual LP : 0.00 0 0 0.00 -
6.29/6.36 c barrier LP : 0.00 0 0 0.00 -
6.29/6.36 c diving/probing LP: 0.00 0 0 0.00 -
6.29/6.36 c strong branching : 3.34 541 16294 30.12 4878.44
6.29/6.36 c (at root node) : - 10 2177 217.70 -
6.29/6.36 c conflict analysis: 0.00 0 0 0.00 -
6.29/6.36 c B&B Tree :
6.29/6.36 c number of runs : 1
6.29/6.36 c nodes : 55
6.29/6.36 c nodes (total) : 55
6.29/6.36 c nodes left : 0
6.29/6.36 c max depth : 27
6.29/6.36 c max depth (total): 27
6.29/6.36 c backtracks : 2 (3.6%)
6.29/6.36 c delayed cutoffs : 0
6.29/6.36 c repropagations : 0 (0 domain reductions, 0 cutoffs)
6.29/6.36 c avg switch length: 2.00
6.29/6.36 c switching time : 0.02
6.29/6.36 c Solution :
6.29/6.36 c Solutions found : 1 (1 improvements)
6.29/6.36 c First Solution : +0.00000000000000e+00 (in run 1, after 55 nodes, 5.85 seconds, depth 27, found by <relaxation>)
6.29/6.36 c Primal Bound : +0.00000000000000e+00 (in run 1, after 55 nodes, 5.85 seconds, depth 27, found by <relaxation>)
6.29/6.36 c Dual Bound : +0.00000000000000e+00
6.29/6.36 c Gap : 0.00 %
6.29/6.36 c Root Dual Bound : +0.00000000000000e+00
6.29/6.36 c Root Iterations : 679
6.29/6.38 c Time complete: 6.37.