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-2664853-1276676683.opb>
0.00/0.02 c original problem has 1458 variables (1458 bin, 0 int, 0 impl, 0 cont) and 1560 constraints
0.00/0.02 c problem read
0.00/0.02 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, 10264 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 10264 implications, 200 cliques
0.39/0.42 c presolved problem has 1458 variables (1458 bin, 0 int, 0 impl, 0 cont) and 1560 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 1258 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.21
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.47 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.47 c 0.2s| 1 | 0 | 121 | - |6655k| 0 | 90 |1458 |1560 |1458 |2818 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
1.19/1.25 c 0.8s| 1 | 0 | 143 | - |7089k| 0 | 92 |1458 |1560 |1458 |2824 | 6 | 0 | 0 | 0.000000e+00 | -- | Inf
1.59/1.60 c 1.2s| 1 | 0 | 210 | - |7483k| 0 | 114 |1458 |1560 |1458 |2834 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
2.20/2.27 c 1.9s| 1 | 0 | 427 | - |7842k| 0 | 157 |1458 |1560 |1458 |2850 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
3.09/3.11 c 2.7s| 1 | 0 | 741 | - |8262k| 0 | 169 |1458 |1560 |1458 |2895 | 77 | 0 | 0 | 0.000000e+00 | -- | Inf
4.40/4.44 c 4.0s| 1 | 0 | 1854 | - |8598k| 0 | 350 |1458 |1560 |1458 |2948 | 130 | 0 | 0 | 0.000000e+00 | -- | Inf
9.19/9.26 c 8.7s| 1 | 2 | 1854 | - |8599k| 0 | 350 |1458 |1560 |1458 |2948 | 130 | 0 | 11 | 0.000000e+00 | -- | Inf
16.40/16.40 c *15.7s| 32 | 0 | 3980 | 68.6 |8717k| 31 | - |1458 |1560 |1458 |1025 | 824 | 0 | 426 | 0.000000e+00 | 0.000000e+00 | 0.00%
16.40/16.40 c
16.40/16.40 c SCIP Status : problem is solved [optimal solution found]
16.40/16.40 c Solving Time (sec) : 15.72
16.40/16.40 c Solving Nodes : 32
16.40/16.40 c Primal Bound : +0.00000000000000e+00 (1 solutions)
16.40/16.40 c Dual Bound : +0.00000000000000e+00
16.40/16.40 c Gap : 0.00 %
16.40/16.41 s SATISFIABLE
16.40/16.41 v -x128 -x141 x182 -x146 x136 -x166 -x181 -x185 -x156 -x153 -x179 -x178 -x149 -x152 -x124 -x133 -x188 -x189 x147 -x139 -x197 -x191
16.40/16.41 v -x163 -x130 -x192 -x194 x106 x170 -x140 -x109 x117 x107 -x196 x187 -x168 -x190 -x148 -x171 -x161 -x160 -x158 -x154 -x151 -x114
16.40/16.41 v -x173 -x199 -x176 -x177 -x193 -x172 -x143 -x135 -x162 -x125 -x195 -x120 -x200 -x157 -x167 -x134 -x113 -x111 x131 -x121 -x183
16.40/16.41 v x123 x174 x180 -x169 -x198 -x159 -x137 -x132 -x122 -x119 -x112 -x105 -x118 -x150 -x142 -x103 -x104 -x165 -x115 -x155 -x101
16.40/16.41 v -x144 -x116 x110 x108 -x145 -x186 -x129 -x126 -x138 x164 -x127 -x175 -x184 -x102 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
16.40/16.41 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 -x66
16.40/16.41 v -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
16.40/16.41 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
16.40/16.41 v -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 x5 -x4 -x3 x2 -x1
16.40/16.41 c SCIP Status : problem is solved [optimal solution found]
16.40/16.41 c Solving Time : 15.72
16.40/16.41 c Original Problem :
16.40/16.41 c Problem name : HOME/instance-2664853-1276676683.opb
16.40/16.41 c Variables : 1458 (1458 binary, 0 integer, 0 implicit integer, 0 continuous)
16.40/16.41 c Constraints : 1560 initial, 1560 maximal
16.40/16.41 c Presolved Problem :
16.40/16.41 c Problem name : t_HOME/instance-2664853-1276676683.opb
16.40/16.41 c Variables : 1458 (1458 binary, 0 integer, 0 implicit integer, 0 continuous)
16.40/16.41 c Constraints : 1560 initial, 1560 maximal
16.40/16.41 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
16.40/16.41 c trivial : 0.00 0 0 0 0 0 0 0 0
16.40/16.41 c dualfix : 0.00 0 0 0 0 0 0 0 0
16.40/16.41 c boundshift : 0.00 0 0 0 0 0 0 0 0
16.40/16.41 c inttobinary : 0.00 0 0 0 0 0 0 0 0
16.40/16.41 c implics : 0.00 0 0 0 0 0 0 0 0
16.40/16.41 c probing : 0.00 0 0 0 0 0 0 0 0
16.40/16.41 c knapsack : 0.00 0 0 0 0 0 0 0 0
16.40/16.41 c setppc : 0.00 0 0 0 0 0 0 0 0
16.40/16.41 c and : 0.18 0 0 0 0 0 0 0 0
16.40/16.41 c linear : 0.01 0 0 0 0 0 0 0 0
16.40/16.41 c logicor : 0.00 0 0 0 0 0 0 0 0
16.40/16.41 c root node : - 0 - - 0 - - - -
16.40/16.41 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
16.40/16.41 c integral : 0 0 0 46 0 0 35 0 0 62
16.40/16.41 c knapsack : 1 5 113 1 0 0 0 0 0 0
16.40/16.41 c setppc : 200 5 113 1 0 0 86 0 0 0
16.40/16.41 c and : 1258 36 113 1 0 0 1143 1183 0 0
16.40/16.41 c linear : 1 5 113 1 0 0 0 0 0 0
16.40/16.41 c logicor : 100 5 23 1 0 0 17 0 0 0
16.40/16.41 c countsols : 0 0 0 1 0 0 0 0 0 0
16.40/16.41 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
16.40/16.41 c integral : 9.92 0.00 0.00 9.92 0.00
16.40/16.41 c knapsack : 0.01 0.01 0.00 0.00 0.00
16.40/16.41 c setppc : 0.01 0.00 0.01 0.00 0.00
16.40/16.41 c and : 0.04 0.04 0.00 0.00 0.00
16.40/16.41 c linear : 0.00 0.00 0.00 0.00 0.00
16.40/16.41 c logicor : 0.00 0.00 0.00 0.00 0.00
16.40/16.41 c countsols : 0.00 0.00 0.00 0.00 0.00
16.40/16.41 c Propagators : Time Calls Cutoffs DomReds
16.40/16.41 c vbounds : 0.00 1 0 0
16.40/16.41 c rootredcost : 0.00 0 0 0
16.40/16.41 c pseudoobj : 0.00 0 0 0
16.40/16.41 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
16.40/16.41 c propagation : 0.00 0 0 0 0.0 0 0.0 -
16.40/16.41 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
16.40/16.41 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
16.40/16.41 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
16.40/16.41 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
16.40/16.41 c applied globally : - - - 0 0.0 - - -
16.40/16.41 c applied locally : - - - 0 0.0 - - -
16.40/16.41 c Separators : Time Calls Cutoffs DomReds Cuts Conss
16.40/16.41 c cut pool : 0.00 4 - - 2 - (maximal pool size: 457)
16.40/16.41 c redcost : 0.00 36 0 0 0 0
16.40/16.41 c impliedbounds : 0.00 5 0 0 100 0
16.40/16.41 c intobj : 0.00 0 0 0 0 0
16.40/16.41 c cgmip : 0.00 0 0 0 0 0
16.40/16.41 c gomory : 1.36 5 0 0 69 0
16.40/16.41 c strongcg : 1.11 5 0 0 2299 0
16.40/16.41 c cmir : 0.00 0 0 0 0 0
16.40/16.41 c flowcover : 0.00 0 0 0 0 0
16.40/16.41 c clique : 0.01 5 0 0 35 0
16.40/16.41 c zerohalf : 0.00 0 0 0 0 0
16.40/16.41 c mcf : 0.01 1 0 0 0 0
16.40/16.41 c rapidlearning : 0.25 1 0 0 0 0
16.40/16.41 c Pricers : Time Calls Vars
16.40/16.41 c problem variables: 0.00 0 0
16.40/16.41 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
16.40/16.41 c relpscost : 9.92 45 0 35 0 0 62
16.40/16.41 c pscost : 0.00 0 0 0 0 0 0
16.40/16.41 c inference : 0.00 0 0 0 0 0 0
16.40/16.41 c mostinf : 0.00 0 0 0 0 0 0
16.40/16.41 c leastinf : 0.00 0 0 0 0 0 0
16.40/16.41 c fullstrong : 0.00 0 0 0 0 0 0
16.40/16.41 c allfullstrong : 0.00 0 0 0 0 0 0
16.40/16.41 c random : 0.00 0 0 0 0 0 0
16.40/16.41 c Primal Heuristics : Time Calls Found
16.40/16.41 c LP solutions : 0.00 - 1
16.40/16.41 c pseudo solutions : 0.00 - 0
16.40/16.41 c trivial : 0.00 1 0
16.40/16.41 c simplerounding : 0.00 0 0
16.40/16.41 c zirounding : 0.00 0 0
16.40/16.41 c rounding : 0.00 0 0
16.40/16.41 c shifting : 0.00 0 0
16.40/16.41 c intshifting : 0.00 0 0
16.40/16.41 c oneopt : 0.00 0 0
16.40/16.41 c twoopt : 0.00 0 0
16.40/16.41 c fixandinfer : 0.00 0 0
16.40/16.41 c feaspump : 0.00 0 0
16.40/16.41 c coefdiving : 0.00 0 0
16.40/16.41 c pscostdiving : 0.00 0 0
16.40/16.41 c fracdiving : 0.00 0 0
16.40/16.41 c veclendiving : 0.00 0 0
16.40/16.41 c intdiving : 0.00 0 0
16.40/16.41 c actconsdiving : 0.00 0 0
16.40/16.41 c objpscostdiving : 0.00 0 0
16.40/16.41 c rootsoldiving : 0.00 0 0
16.40/16.41 c linesearchdiving : 0.00 0 0
16.40/16.41 c guideddiving : 0.00 0 0
16.40/16.41 c octane : 0.00 0 0
16.40/16.41 c rens : 0.00 0 0
16.40/16.41 c rins : 0.00 0 0
16.40/16.41 c localbranching : 0.00 0 0
16.40/16.41 c mutation : 0.00 0 0
16.40/16.41 c crossover : 0.00 0 0
16.40/16.41 c dins : 0.00 0 0
16.40/16.41 c undercover : 0.00 0 0
16.40/16.41 c nlp : 0.00 0 0
16.40/16.41 c trysol : 0.00 0 0
16.40/16.41 c LP : Time Calls Iterations Iter/call Iter/sec
16.40/16.41 c primal LP : 0.45 0 0 0.00 0.00
16.40/16.41 c dual LP : 2.22 76 3980 52.37 1792.79
16.40/16.41 c lex dual LP : 0.00 0 0 0.00 -
16.40/16.41 c barrier LP : 0.00 0 0 0.00 -
16.40/16.41 c diving/probing LP: 0.00 0 0 0.00 -
16.40/16.41 c strong branching : 9.91 426 27309 64.11 2755.70
16.40/16.41 c (at root node) : - 11 7239 658.09 -
16.40/16.41 c conflict analysis: 0.00 0 0 0.00 -
16.40/16.41 c B&B Tree :
16.40/16.41 c number of runs : 1
16.40/16.41 c nodes : 32
16.40/16.41 c nodes (total) : 32
16.40/16.41 c nodes left : 0
16.40/16.41 c max depth : 31
16.40/16.41 c max depth (total): 31
16.40/16.41 c backtracks : 0 (0.0%)
16.40/16.41 c delayed cutoffs : 0
16.40/16.41 c repropagations : 0 (0 domain reductions, 0 cutoffs)
16.40/16.41 c avg switch length: 2.00
16.40/16.41 c switching time : 0.46
16.40/16.41 c Solution :
16.40/16.41 c Solutions found : 1 (1 improvements)
16.40/16.41 c First Solution : +0.00000000000000e+00 (in run 1, after 32 nodes, 15.72 seconds, depth 31, found by <relaxation>)
16.40/16.41 c Primal Bound : +0.00000000000000e+00 (in run 1, after 32 nodes, 15.72 seconds, depth 31, found by <relaxation>)
16.40/16.41 c Dual Bound : +0.00000000000000e+00
16.40/16.41 c Gap : 0.00 %
16.40/16.41 c Root Dual Bound : +0.00000000000000e+00
16.40/16.41 c Root Iterations : 1854
16.40/16.43 c Time complete: 16.42.