0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 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-3488226-1307788424.opb>
0.00/0.01 c original problem has 3262 variables (3262 bin, 0 int, 0 impl, 0 cont) and 3564 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.03 c presolving:
0.00/0.06 c (round 1) 0 del vars, 3462 del conss, 200 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 101 upgd conss, 24696 impls, 199 clqs
0.00/0.07 c (round 2) 3062 del vars, 3462 del conss, 200 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 24696 impls, 0 clqs
0.00/0.08 c presolving (3 rounds):
0.00/0.08 c 3062 deleted vars, 3462 deleted constraints, 200 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.08 c 24696 implications, 0 cliques
0.00/0.08 c presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 302 constraints
0.00/0.08 c 201 constraints of type <knapsack>
0.00/0.08 c 100 constraints of type <setppc>
0.00/0.08 c 1 constraints of type <linear>
0.00/0.08 c transformed objective value is always integral (scale: 1)
0.00/0.08 c Presolving Time: 0.06
0.00/0.08 c - non default parameters ----------------------------------------------------------------------
0.00/0.08 c # SCIP version 2.0.1.5
0.00/0.08 c
0.00/0.08 c # frequency for displaying node information lines
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.08 c display/freq = 10000
0.00/0.08 c
0.00/0.08 c # maximal time in seconds to run
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.08 c limits/time = 1797
0.00/0.08 c
0.00/0.08 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.08 c limits/memory = 13950
0.00/0.08 c
0.00/0.08 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c limits/solutions = 1
0.00/0.08 c
0.00/0.08 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.08 c separating/maxrounds = 1
0.00/0.08 c
0.00/0.08 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c separating/maxroundsroot = 5
0.00/0.08 c
0.00/0.08 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.08 c # [type: int, range: [1,2], default: 1]
0.00/0.08 c timing/clocktype = 2
0.00/0.08 c
0.00/0.08 c # belongs reading time to solving time?
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c timing/reading = TRUE
0.00/0.08 c
0.00/0.08 c # should presolving try to simplify inequalities
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/linear/simplifyinequalities = TRUE
0.00/0.08 c
0.00/0.08 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/indicator/addCouplingCons = TRUE
0.00/0.08 c
0.00/0.08 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.08 c constraints/knapsack/disaggregation = FALSE
0.00/0.08 c
0.00/0.08 c # should presolving try to simplify knapsacks
0.00/0.08 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.08 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.08 c
0.00/0.08 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c presolving/probing/maxrounds = 0
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/coefdiving/freq = -1
0.00/0.08 c
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.08 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.08 c
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.08 c heuristics/crossover/freq = -1
0.00/0.08 c
0.00/0.08 c # number of nodes added to the contingent of the total nodes
0.00/0.08 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.08 c heuristics/crossover/nodesofs = 750
0.00/0.08 c
0.00/0.08 c # number of nodes without incumbent change that heuristic should wait
0.00/0.08 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.08 c heuristics/crossover/nwaitingnodes = 100
0.00/0.08 c
0.00/0.08 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.08 c # [type: real, range: [0,1], default: 0.1]
0.00/0.08 c heuristics/crossover/nodesquot = 0.15
0.00/0.08 c
0.00/0.08 c # minimum percentage of integer variables that have to be fixed
0.00/0.08 c # [type: real, range: [0,1], default: 0.666]
0.00/0.08 c heuristics/crossover/minfixingrate = 0.5
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.08 c heuristics/feaspump/freq = -1
0.00/0.08 c
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/fracdiving/freq = -1
0.00/0.08 c
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.08 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.08 c
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/guideddiving/freq = -1
0.00/0.08 c
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.08 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.08 c
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.08 c
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.08 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/intshifting/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/linesearchdiving/freq = -1
0.00/0.08 c
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.08 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.08 c
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.08 c heuristics/objpscostdiving/freq = -1
0.00/0.08 c
0.00/0.08 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.08 c # [type: real, range: [0,1], default: 0.01]
0.00/0.08 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.08 c
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.08 c heuristics/oneopt/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/pscostdiving/freq = -1
0.00/0.08 c
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.08 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.08 c
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.08 c heuristics/rens/freq = -1
0.00/0.08 c
0.00/0.08 c # minimum percentage of integer variables that have to be fixable
0.00/0.08 c # [type: real, range: [0,1], default: 0.5]
0.00/0.08 c heuristics/rens/minfixingrate = 0.3
0.00/0.08 c
0.00/0.08 c # number of nodes added to the contingent of the total nodes
0.00/0.08 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.08 c heuristics/rens/nodesofs = 2000
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.08 c heuristics/rootsoldiving/freq = -1
0.00/0.08 c
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.08 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.08 c
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.08 c heuristics/rounding/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.08 c heuristics/shiftandpropagate/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/shifting/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.08 c heuristics/simplerounding/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.08 c heuristics/subnlp/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.08 c heuristics/trivial/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.08 c heuristics/trysol/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.08 c heuristics/undercover/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.08 c heuristics/veclendiving/freq = -1
0.00/0.08 c
0.00/0.08 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.08 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.08 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.08 c
0.00/0.08 c # additional number of allowed LP iterations
0.00/0.08 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.08 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.08 c
0.00/0.08 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.08 c heuristics/zirounding/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.08 c separating/cmir/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.08 c separating/flowcover/freq = -1
0.00/0.08 c
0.00/0.08 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.08 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.08 c separating/rapidlearning/freq = 0
0.00/0.08 c
0.00/0.08 c -----------------------------------------------------------------------------------------------
0.00/0.08 c start solving
0.00/0.08 c
0.00/0.09 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.09 c 0.1s| 1 | 0 | 65 | - |8561k| 0 | 36 | 200 | 302 | 200 | 302 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.15 c 0.2s| 1 | 0 | 233 | - |8840k| 0 | 119 | 200 | 302 | 200 | 331 | 29 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.20 c 0.2s| 1 | 0 | 270 | - |8865k| 0 | 143 | 200 | 302 | 200 | 381 | 79 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.26 c 0.3s| 1 | 0 | 274 | - |8869k| 0 | 146 | 200 | 302 | 200 | 387 | 85 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.69 c 0.7s| 1 | 2 | 274 | - |8869k| 0 | 146 | 200 | 302 | 200 | 387 | 85 | 0 | 11 | 0.000000e+00 | -- | Inf
13.69/13.74 c *13.7s| 7368 | 0 |120776 | 16.4 | 10M| 39 | - | 200 |4174 | 200 | 379 | 85 |4558 |1444 | 0.000000e+00 | 0.000000e+00 | 0.00%
13.69/13.74 c
13.69/13.74 c SCIP Status : problem is solved [optimal solution found]
13.69/13.74 c Solving Time (sec) : 13.74
13.69/13.74 c Solving Nodes : 7368
13.69/13.74 c Primal Bound : +0.00000000000000e+00 (1 solutions)
13.69/13.74 c Dual Bound : +0.00000000000000e+00
13.69/13.74 c Gap : 0.00 %
13.69/13.74 s SATISFIABLE
13.69/13.74 v x160 -x183 -x118 -x165 -x126 -x157 -x148 -x158 -x196 -x181 -x167 -x156 -x142 -x131 x198 x197 -x163 -x137 x110 -x171 -x107 -x103
13.69/13.74 v -x144 -x130 x125 -x122 -x113 -x119 -x159 -x192 -x195 -x164 -x179 -x175 -x188 -x145 -x191 -x151 -x169 x102 -x152 x146 -x140 -x135
13.69/13.74 v -x112 -x105 x134 -x143 -x190 -x186 x189 -x123 -x194 x136 -x114 -x138 x154 -x141 -x162 -x200 -x109 x185 -x101 -x193 -x178
13.69/13.74 v -x172 -x170 -x155 x139 -x124 -x120 x117 -x116 -x108 -x104 -x128 -x147 -x168 -x153 -x184 -x132 -x180 -x106 -x115 -x187 -x129
13.69/13.74 v -x199 -x161 -x149 -x127 -x182 -x174 -x150 -x121 -x133 -x177 -x173 x111 -x166 -x176 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92
13.69/13.74 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
13.69/13.74 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 -x40
13.69/13.74 v -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 -x14
13.69/13.74 v -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
13.69/13.74 c SCIP Status : problem is solved [optimal solution found]
13.69/13.74 c Total Time : 13.74
13.69/13.74 c solving : 13.74
13.69/13.74 c presolving : 0.06 (included in solving)
13.69/13.74 c reading : 0.02 (included in solving)
13.69/13.74 c Original Problem :
13.69/13.74 c Problem name : HOME/instance-3488226-1307788424.opb
13.69/13.74 c Variables : 3262 (3262 binary, 0 integer, 0 implicit integer, 0 continuous)
13.69/13.74 c Constraints : 3564 initial, 3564 maximal
13.69/13.74 c Presolved Problem :
13.69/13.74 c Problem name : t_HOME/instance-3488226-1307788424.opb
13.69/13.74 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
13.69/13.74 c Constraints : 302 initial, 4213 maximal
13.69/13.74 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
13.69/13.74 c trivial : 0.00 0 0 0 0 0 0 0 0 0
13.69/13.74 c dualfix : 0.00 3062 0 0 0 0 0 0 0 0
13.69/13.74 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
13.69/13.74 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
13.69/13.74 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
13.69/13.74 c implics : 0.00 0 0 0 0 0 0 0 0 0
13.69/13.74 c probing : 0.00 0 0 0 0 0 0 0 0 0
13.69/13.74 c knapsack : 0.01 0 0 0 0 0 0 0 0 0
13.69/13.74 c setppc : 0.00 0 0 0 0 0 0 0 0 0
13.69/13.74 c linear : 0.01 0 0 0 0 0 0 0 0 0
13.69/13.74 c logicor : 0.00 0 0 0 0 0 0 0 0 0
13.69/13.74 c pseudoboolean : 0.01 0 0 0 0 0 3462 200 0 0
13.69/13.74 c root node : - 0 - - 0 - - - - -
13.69/13.74 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
13.69/13.74 c integral : 0 0 0 4056 0 3 0 7 307 0 0 7704
13.69/13.74 c knapsack : 201 4 20360 1 0 0 65507 156 32038 256 0 0
13.69/13.74 c setppc : 100 4 19278 1 0 0 6678 3 1240 0 0 0
13.69/13.74 c linear : 1 4 20201 1 0 0 5 40 75 0 0 0
13.69/13.74 c logicor : 0+ 0 9248 0 0 0 5551 84 4154 0 0 0
13.69/13.74 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
13.69/13.74 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
13.69/13.74 c integral : 6.93 0.00 0.00 6.93 0.00 0.00 0.00
13.69/13.74 c knapsack : 0.17 0.01 0.14 0.00 0.00 0.00 0.03
13.69/13.74 c setppc : 0.01 0.00 0.01 0.00 0.00 0.00 0.00
13.69/13.74 c linear : 0.02 0.00 0.02 0.00 0.00 0.00 0.00
13.69/13.74 c logicor : 0.12 0.00 0.11 0.00 0.00 0.00 0.01
13.69/13.74 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
13.69/13.74 c Propagators : #Propagate #Resprop Cutoffs DomReds
13.69/13.74 c vbounds : 0 0 0 0
13.69/13.74 c rootredcost : 0 0 0 0
13.69/13.74 c pseudoobj : 0 0 0 0
13.69/13.74 c Propagator Timings : TotalTime Propagate Resprop
13.69/13.74 c vbounds : 0.00 0.00 0.00
13.69/13.74 c rootredcost : 0.00 0.00 0.00
13.69/13.74 c pseudoobj : 0.00 0.00 0.00
13.69/13.74 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
13.69/13.74 c propagation : 0.01 157 154 1145 47.8 2 51.0 -
13.69/13.74 c infeasible LP : 0.22 3256 2273 19621 32.5 17 23.6 0
13.69/13.74 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
13.69/13.74 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
13.69/13.74 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
13.69/13.74 c applied globally : - - - 4553 19.7 - - -
13.69/13.74 c applied locally : - - - 5 42.8 - - -
13.69/13.74 c Separators : Time Calls Cutoffs DomReds Cuts Conss
13.69/13.74 c cut pool : 0.00 3 - - 0 - (maximal pool size: 61)
13.69/13.74 c redcost : 0.01 3866 0 0 0 0
13.69/13.74 c impliedbounds : 0.00 4 0 0 0 0
13.69/13.74 c intobj : 0.00 0 0 0 0 0
13.69/13.74 c gomory : 0.09 4 0 0 0 0
13.69/13.74 c cgmip : 0.00 0 0 0 0 0
13.69/13.74 c closecuts : 0.00 0 0 0 0 0
13.69/13.74 c strongcg : 0.07 4 0 0 61 0
13.69/13.74 c cmir : 0.00 0 0 0 0 0
13.69/13.74 c flowcover : 0.00 0 0 0 0 0
13.69/13.74 c clique : 0.00 1 0 0 0 0
13.69/13.74 c zerohalf : 0.00 0 0 0 0 0
13.69/13.74 c mcf : 0.00 1 0 0 0 0
13.69/13.74 c oddcycle : 0.00 0 0 0 0 0
13.69/13.74 c rapidlearning : 0.03 1 0 0 0 0
13.69/13.74 c Pricers : Time Calls Vars
13.69/13.74 c problem variables: 0.00 0 0
13.69/13.74 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
13.69/13.74 c relpscost : 6.93 4055 7 307 0 0 7704
13.69/13.74 c pscost : 0.00 0 0 0 0 0 0
13.69/13.74 c inference : 0.00 0 0 0 0 0 0
13.69/13.74 c mostinf : 0.00 0 0 0 0 0 0
13.69/13.74 c leastinf : 0.00 0 0 0 0 0 0
13.69/13.74 c fullstrong : 0.00 0 0 0 0 0 0
13.69/13.74 c allfullstrong : 0.00 0 0 0 0 0 0
13.69/13.74 c random : 0.00 0 0 0 0 0 0
13.69/13.74 c Primal Heuristics : Time Calls Found
13.69/13.74 c LP solutions : 0.00 - 1
13.69/13.74 c pseudo solutions : 0.00 - 0
13.69/13.74 c trivial : 0.00 1 0
13.69/13.74 c shiftandpropagate: 0.00 0 0
13.69/13.74 c simplerounding : 0.00 0 0
13.69/13.74 c zirounding : 0.00 0 0
13.69/13.74 c rounding : 0.00 0 0
13.69/13.74 c shifting : 0.00 0 0
13.69/13.74 c intshifting : 0.00 0 0
13.69/13.74 c oneopt : 0.00 0 0
13.69/13.74 c twoopt : 0.00 0 0
13.69/13.74 c fixandinfer : 0.00 0 0
13.69/13.74 c feaspump : 0.00 0 0
13.69/13.74 c clique : 0.00 0 0
13.69/13.74 c coefdiving : 0.00 0 0
13.69/13.74 c pscostdiving : 0.00 0 0
13.69/13.74 c fracdiving : 0.00 0 0
13.69/13.74 c veclendiving : 0.00 0 0
13.69/13.74 c intdiving : 0.00 0 0
13.69/13.74 c actconsdiving : 0.00 0 0
13.69/13.74 c objpscostdiving : 0.00 0 0
13.69/13.74 c rootsoldiving : 0.00 0 0
13.69/13.74 c linesearchdiving : 0.00 0 0
13.69/13.74 c guideddiving : 0.00 0 0
13.69/13.74 c octane : 0.00 0 0
13.69/13.74 c rens : 0.00 0 0
13.69/13.74 c rins : 0.00 0 0
13.69/13.74 c localbranching : 0.00 0 0
13.69/13.74 c mutation : 0.00 0 0
13.69/13.74 c crossover : 0.00 0 0
13.69/13.74 c dins : 0.00 0 0
13.69/13.74 c vbounds : 0.00 0 0
13.69/13.74 c undercover : 0.00 0 0
13.69/13.74 c subnlp : 0.00 0 0
13.69/13.74 c trysol : 0.00 0 0
13.69/13.74 c LP : Time Calls Iterations Iter/call Iter/sec
13.69/13.74 c primal LP : 0.00 0 0 0.00 -
13.69/13.74 c dual LP : 5.37 7313 120776 16.52 22506.21
13.69/13.74 c lex dual LP : 0.00 0 0 0.00 -
13.69/13.74 c barrier LP : 0.00 0 0 0.00 -
13.69/13.74 c diving/probing LP: 0.00 0 0 0.00 -
13.69/13.74 c strong branching : 6.88 1444 87518 60.61 12716.06
13.69/13.74 c (at root node) : - 11 1991 181.00 -
13.69/13.74 c conflict analysis: 0.00 0 0 0.00 -
13.69/13.74 c B&B Tree :
13.69/13.74 c number of runs : 1
13.69/13.74 c nodes : 7368
13.69/13.74 c nodes (total) : 7368
13.69/13.74 c nodes left : 0
13.69/13.74 c max depth : 39
13.69/13.74 c max depth (total): 39
13.69/13.74 c backtracks : 1526 (20.7%)
13.69/13.74 c delayed cutoffs : 74
13.69/13.74 c repropagations : 5793 (6876 domain reductions, 31 cutoffs)
13.69/13.74 c avg switch length: 3.90
13.69/13.74 c switching time : 0.25
13.69/13.74 c Solution :
13.69/13.74 c Solutions found : 1 (1 improvements)
13.69/13.74 c First Solution : +0.00000000000000e+00 (in run 1, after 7368 nodes, 13.73 seconds, depth 21, found by <relaxation>)
13.69/13.74 c Primal Bound : +0.00000000000000e+00 (in run 1, after 7368 nodes, 13.73 seconds, depth 21, found by <relaxation>)
13.69/13.74 c Dual Bound : +0.00000000000000e+00
13.69/13.74 c Gap : 0.00 %
13.69/13.74 c Root Dual Bound : +0.00000000000000e+00
13.69/13.74 c Root Iterations : 274
13.69/13.75 c Time complete: 13.74.