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-2664842-1276675597.opb>
0.00/0.02 c original problem has 1444 variables (1444 bin, 0 int, 0 impl, 0 cont) and 1546 constraints
0.00/0.02 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.24 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.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 10152 implications, 200 cliques
0.39/0.42 c presolved problem has 1444 variables (1444 bin, 0 int, 0 impl, 0 cont) and 1546 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 1244 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.42 c transformed objective value is always integral (scale: 1)
0.39/0.42 c Presolving Time: 0.19
0.39/0.42 c - non default parameters ----------------------------------------------------------------------
0.39/0.42 c # SCIP version 1.2.1.2
0.39/0.42 c
0.39/0.42 c # frequency for displaying node information lines
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 100]
0.39/0.42 c display/freq = 10000
0.39/0.42 c
0.39/0.42 c # maximal time in seconds to run
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.42 c limits/time = 1799.98
0.39/0.42 c
0.39/0.42 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.39/0.42 c limits/memory = 1620
0.39/0.42 c
0.39/0.42 c # solving stops, if the given number of solutions were found (-1: no limit)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c limits/solutions = 1
0.39/0.42 c
0.39/0.42 c # maximal number of separation rounds per node (-1: unlimited)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 5]
0.39/0.42 c separating/maxrounds = 1
0.39/0.42 c
0.39/0.42 c # maximal number of separation rounds in the root node (-1: unlimited)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c separating/maxroundsroot = 5
0.39/0.42 c
0.39/0.42 c # should presolving try to simplify inequalities
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.42 c constraints/linear/simplifyinequalities = TRUE
0.39/0.42 c
0.39/0.42 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.39/0.42 c constraints/knapsack/disaggregation = FALSE
0.39/0.42 c
0.39/0.42 c # should presolving try to simplify knapsacks
0.39/0.42 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.39/0.42 c constraints/knapsack/simplifyinequalities = TRUE
0.39/0.42 c
0.39/0.42 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c presolving/probing/maxrounds = 0
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/coefdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/coefdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/coefdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 30]
0.39/0.42 c heuristics/crossover/freq = -1
0.39/0.42 c
0.39/0.42 c # number of nodes added to the contingent of the total nodes
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.42 c heuristics/crossover/nodesofs = 750
0.39/0.42 c
0.39/0.42 c # number of nodes without incumbent change that heuristic should wait
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.39/0.42 c heuristics/crossover/nwaitingnodes = 100
0.39/0.42 c
0.39/0.42 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.39/0.42 c # [type: real, range: [0,1], default: 0.1]
0.39/0.42 c heuristics/crossover/nodesquot = 0.15
0.39/0.42 c
0.39/0.42 c # minimum percentage of integer variables that have to be fixed
0.39/0.42 c # [type: real, range: [0,1], default: 0.666]
0.39/0.42 c heuristics/crossover/minfixingrate = 0.5
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/feaspump/freq = -1
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/feaspump/maxlpiterofs = 2000
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/fracdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/fracdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/fracdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/guideddiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/guideddiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/guideddiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/intdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/intshifting/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/linesearchdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/nlp/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/objpscostdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to total iteration number
0.39/0.42 c # [type: real, range: [0,1], default: 0.01]
0.39/0.42 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/oneopt/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/pscostdiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/pscostdiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c heuristics/rens/freq = -1
0.39/0.42 c
0.39/0.42 c # minimum percentage of integer variables that have to be fixable
0.39/0.42 c # [type: real, range: [0,1], default: 0.5]
0.39/0.42 c heuristics/rens/minfixingrate = 0.3
0.39/0.42 c
0.39/0.42 c # number of nodes added to the contingent of the total nodes
0.39/0.42 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.39/0.42 c heuristics/rens/nodesofs = 2000
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 20]
0.39/0.42 c heuristics/rootsoldiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.39/0.42 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/rounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/shifting/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/simplerounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c heuristics/trivial/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/trysol/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 10]
0.39/0.42 c heuristics/veclendiving/freq = -1
0.39/0.42 c
0.39/0.42 c # maximal fraction of diving LP iterations compared to node LP iterations
0.39/0.42 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.39/0.42 c heuristics/veclendiving/maxlpiterquot = 0.075
0.39/0.42 c
0.39/0.42 c # additional number of allowed LP iterations
0.39/0.42 c # [type: int, range: [0,2147483647], default: 1000]
0.39/0.42 c heuristics/veclendiving/maxlpiterofs = 1500
0.39/0.42 c
0.39/0.42 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 1]
0.39/0.42 c heuristics/zirounding/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c separating/cmir/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: 0]
0.39/0.42 c separating/flowcover/freq = -1
0.39/0.42 c
0.39/0.42 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.39/0.42 c # [type: int, range: [-1,2147483647], default: -1]
0.39/0.42 c separating/rapidlearning/freq = 0
0.39/0.42 c
0.39/0.42 c -----------------------------------------------------------------------------------------------
0.39/0.42 c start solving
0.39/0.42 c
0.39/0.45 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.45 c 0.2s| 1 | 0 | 82 | - |6595k| 0 | 48 |1444 |1546 |1444 |2790 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.09/1.11 c 0.7s| 1 | 0 | 171 | - |6877k| 0 | 65 |1444 |1546 |1444 |2799 | 9 | 0 | 0 | 0.000000e+00 | -- | Inf
1.39/1.40 c 0.9s| 1 | 0 | 448 | - |7068k| 0 | 122 |1444 |1546 |1444 |2813 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
1.98/2.07 c 1.6s| 1 | 0 | 800 | - |7288k| 0 | 166 |1444 |1546 |1444 |2856 | 66 | 0 | 0 | 0.000000e+00 | -- | Inf
3.09/3.19 c 2.7s| 1 | 0 | 1646 | - |7922k| 0 | 402 |1444 |1546 |1444 |2946 | 156 | 0 | 0 | 0.000000e+00 | -- | Inf
5.28/5.32 c 4.8s| 1 | 0 | 2707 | - | 11M| 0 | 585 |1444 |1546 |1444 |3193 | 403 | 0 | 0 | 0.000000e+00 | -- | Inf
12.39/12.49 c 12.0s| 1 | 2 | 2707 | - | 11M| 0 | 585 |1444 |1546 |1444 |3193 | 403 | 0 | 10 | 0.000000e+00 | -- | Inf
22.58/22.61 c *22.0s| 30 | 0 | 5900 | 110.1 | 11M| 28 | - |1444 |1547 |1444 |1351 |1350 | 1 | 349 | 0.000000e+00 | 0.000000e+00 | 0.00%
22.58/22.61 c
22.58/22.61 c SCIP Status : problem is solved [optimal solution found]
22.58/22.61 c Solving Time (sec) : 22.02
22.58/22.61 c Solving Nodes : 30
22.58/22.61 c Primal Bound : +0.00000000000000e+00 (1 solutions)
22.58/22.61 c Dual Bound : +0.00000000000000e+00
22.58/22.61 c Gap : 0.00 %
22.58/22.61 s SATISFIABLE
22.58/22.61 v -x166 -x164 -x158 -x163 -x121 x171 -x113 -x156 -x144 -x135 -x152 -x161 -x122 -x130 -x157 -x146 -x181 -x129 -x111 -x192 -x167 -x154
22.58/22.61 v -x185 -x127 x117 -x184 -x120 -x124 x134 x178 -x168 -x136 -x172 x110 -x187 x190 -x200 -x105 -x151 -x131 -x109 -x106 -x183
22.58/22.61 v -x153 -x182 -x189 -x149 -x195 x104 x198 -x193 -x188 -x128 -x119 -x112 -x191 -x179 -x162 -x107 -x137 -x115 -x175 -x145 -x132 -x108
22.58/22.61 v -x199 x138 -x148 -x174 -x139 -x143 -x197 -x180 -x160 -x155 -x150 -x118 -x114 x116 x196 -x176 -x142 -x103 -x140 x194 -x125
22.58/22.61 v -x101 -x170 -x133 -x123 x159 -x165 x102 -x177 -x173 -x126 -x141 x169 -x186 -x147 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
22.58/22.61 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
22.58/22.61 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 -x41
22.58/22.61 v -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
22.58/22.61 v -x14 x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 x5 -x4 -x3 -x2 -x1
22.58/22.61 c SCIP Status : problem is solved [optimal solution found]
22.58/22.61 c Solving Time : 22.02
22.58/22.61 c Original Problem :
22.58/22.61 c Problem name : HOME/instance-2664842-1276675597.opb
22.58/22.61 c Variables : 1444 (1444 binary, 0 integer, 0 implicit integer, 0 continuous)
22.58/22.61 c Constraints : 1546 initial, 1546 maximal
22.58/22.61 c Presolved Problem :
22.58/22.61 c Problem name : t_HOME/instance-2664842-1276675597.opb
22.58/22.61 c Variables : 1444 (1444 binary, 0 integer, 0 implicit integer, 0 continuous)
22.58/22.61 c Constraints : 1546 initial, 1547 maximal
22.58/22.61 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
22.58/22.61 c trivial : 0.00 0 0 0 0 0 0 0 0
22.58/22.61 c dualfix : 0.00 0 0 0 0 0 0 0 0
22.58/22.61 c boundshift : 0.00 0 0 0 0 0 0 0 0
22.58/22.61 c inttobinary : 0.00 0 0 0 0 0 0 0 0
22.58/22.61 c implics : 0.00 0 0 0 0 0 0 0 0
22.58/22.61 c probing : 0.00 0 0 0 0 0 0 0 0
22.58/22.61 c knapsack : 0.00 0 0 0 0 0 0 0 0
22.58/22.61 c setppc : 0.00 0 0 0 0 0 0 0 0
22.58/22.61 c and : 0.17 0 0 0 0 0 0 0 0
22.58/22.61 c linear : 0.02 0 0 0 0 0 0 0 0
22.58/22.61 c logicor : 0.00 0 0 0 0 0 0 0 0
22.58/22.61 c root node : - 0 - - 0 - - - -
22.58/22.61 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
22.58/22.61 c integral : 0 0 0 37 0 0 13 0 0 56
22.58/22.61 c knapsack : 1 5 96 1 0 0 0 0 0 0
22.58/22.61 c setppc : 200 5 96 1 0 1 105 0 0 0
22.58/22.61 c and : 1244 33 95 1 0 0 1101 2065 0 0
22.58/22.61 c linear : 1 5 95 1 0 0 0 0 0 0
22.58/22.61 c logicor : 100+ 5 23 1 0 0 13 0 0 0
22.58/22.61 c countsols : 0 0 0 1 0 0 0 0 0 0
22.58/22.61 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
22.58/22.61 c integral : 14.14 0.00 0.00 14.14 0.00
22.58/22.61 c knapsack : 0.01 0.01 0.00 0.00 0.00
22.58/22.61 c setppc : 0.00 0.00 0.00 0.00 0.00
22.58/22.61 c and : 0.03 0.02 0.01 0.00 0.00
22.58/22.61 c linear : 0.00 0.00 0.00 0.00 0.00
22.58/22.61 c logicor : 0.00 0.00 0.00 0.00 0.00
22.58/22.61 c countsols : 0.00 0.00 0.00 0.00 0.00
22.58/22.61 c Propagators : Time Calls Cutoffs DomReds
22.58/22.61 c vbounds : 0.00 1 0 0
22.58/22.61 c rootredcost : 0.00 0 0 0
22.58/22.61 c pseudoobj : 0.00 0 0 0
22.58/22.61 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
22.58/22.61 c propagation : 0.00 1 1 1 3.0 0 0.0 -
22.58/22.61 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
22.58/22.61 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
22.58/22.61 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
22.58/22.61 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
22.58/22.61 c applied globally : - - - 1 3.0 - - -
22.58/22.61 c applied locally : - - - 0 0.0 - - -
22.58/22.61 c Separators : Time Calls Cutoffs DomReds Cuts Conss
22.58/22.61 c cut pool : 0.00 4 - - 2 - (maximal pool size: 872)
22.58/22.61 c redcost : 0.00 33 0 0 0 0
22.58/22.61 c impliedbounds : 0.00 5 0 0 457 0
22.58/22.61 c intobj : 0.00 0 0 0 0 0
22.58/22.61 c cgmip : 0.00 0 0 0 0 0
22.58/22.61 c gomory : 1.52 5 0 0 637 0
22.58/22.61 c strongcg : 1.15 5 0 0 2430 0
22.58/22.61 c cmir : 0.00 0 0 0 0 0
22.58/22.61 c flowcover : 0.00 0 0 0 0 0
22.58/22.61 c clique : 0.01 5 0 0 31 0
22.58/22.61 c zerohalf : 0.00 0 0 0 0 0
22.58/22.61 c mcf : 0.01 1 0 0 0 0
22.58/22.61 c rapidlearning : 0.23 1 0 0 0 0
22.58/22.61 c Pricers : Time Calls Vars
22.58/22.61 c problem variables: 0.00 0 0
22.58/22.61 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
22.58/22.61 c relpscost : 14.14 36 0 13 0 0 56
22.58/22.61 c pscost : 0.00 0 0 0 0 0 0
22.58/22.61 c inference : 0.00 0 0 0 0 0 0
22.58/22.61 c mostinf : 0.00 0 0 0 0 0 0
22.58/22.61 c leastinf : 0.00 0 0 0 0 0 0
22.58/22.61 c fullstrong : 0.00 0 0 0 0 0 0
22.58/22.61 c allfullstrong : 0.00 0 0 0 0 0 0
22.58/22.61 c random : 0.00 0 0 0 0 0 0
22.58/22.61 c Primal Heuristics : Time Calls Found
22.58/22.61 c LP solutions : 0.00 - 1
22.58/22.61 c pseudo solutions : 0.00 - 0
22.58/22.61 c trivial : 0.00 1 0
22.58/22.61 c simplerounding : 0.00 0 0
22.58/22.61 c zirounding : 0.00 0 0
22.58/22.61 c rounding : 0.00 0 0
22.58/22.61 c shifting : 0.00 0 0
22.58/22.61 c intshifting : 0.00 0 0
22.58/22.61 c oneopt : 0.00 0 0
22.58/22.61 c twoopt : 0.00 0 0
22.58/22.61 c fixandinfer : 0.00 0 0
22.58/22.61 c feaspump : 0.00 0 0
22.58/22.61 c coefdiving : 0.00 0 0
22.58/22.61 c pscostdiving : 0.00 0 0
22.58/22.61 c fracdiving : 0.00 0 0
22.58/22.61 c veclendiving : 0.00 0 0
22.58/22.61 c intdiving : 0.00 0 0
22.58/22.61 c actconsdiving : 0.00 0 0
22.58/22.61 c objpscostdiving : 0.00 0 0
22.58/22.61 c rootsoldiving : 0.00 0 0
22.58/22.61 c linesearchdiving : 0.00 0 0
22.58/22.61 c guideddiving : 0.00 0 0
22.58/22.61 c octane : 0.00 0 0
22.58/22.61 c rens : 0.00 0 0
22.58/22.61 c rins : 0.00 0 0
22.58/22.61 c localbranching : 0.00 0 0
22.58/22.61 c mutation : 0.00 0 0
22.58/22.61 c crossover : 0.00 0 0
22.58/22.61 c dins : 0.00 0 0
22.58/22.61 c undercover : 0.00 0 0
22.58/22.61 c nlp : 0.00 0 0
22.58/22.61 c trysol : 0.00 0 0
22.58/22.61 c LP : Time Calls Iterations Iter/call Iter/sec
22.58/22.61 c primal LP : 0.64 0 0 0.00 0.00
22.58/22.61 c dual LP : 3.84 68 5900 86.76 1536.46
22.58/22.61 c lex dual LP : 0.00 0 0 0.00 -
22.58/22.61 c barrier LP : 0.00 0 0 0.00 -
22.58/22.61 c diving/probing LP: 0.00 0 0 0.00 -
22.58/22.61 c strong branching : 14.13 349 27631 79.17 1955.48
22.58/22.61 c (at root node) : - 10 8514 851.40 -
22.58/22.61 c conflict analysis: 0.00 0 0 0.00 -
22.58/22.61 c B&B Tree :
22.58/22.61 c number of runs : 1
22.58/22.61 c nodes : 30
22.58/22.61 c nodes (total) : 30
22.58/22.61 c nodes left : 0
22.58/22.61 c max depth : 28
22.58/22.61 c max depth (total): 28
22.58/22.61 c backtracks : 0 (0.0%)
22.58/22.61 c delayed cutoffs : 0
22.58/22.61 c repropagations : 1 (10 domain reductions, 0 cutoffs)
22.58/22.61 c avg switch length: 2.00
22.58/22.61 c switching time : 0.66
22.58/22.61 c Solution :
22.58/22.61 c Solutions found : 1 (1 improvements)
22.58/22.61 c First Solution : +0.00000000000000e+00 (in run 1, after 30 nodes, 22.01 seconds, depth 28, found by <relaxation>)
22.58/22.61 c Primal Bound : +0.00000000000000e+00 (in run 1, after 30 nodes, 22.01 seconds, depth 28, found by <relaxation>)
22.58/22.61 c Dual Bound : +0.00000000000000e+00
22.58/22.61 c Gap : 0.00 %
22.58/22.61 c Root Dual Bound : +0.00000000000000e+00
22.58/22.61 c Root Iterations : 2707
22.58/22.64 c Time complete: 22.63.