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-3488208-1307788242.opb>
0.00/0.02 c original problem has 3290 variables (3290 bin, 0 int, 0 impl, 0 cont) and 3592 constraints
0.00/0.02 c problem read
0.00/0.02 c No objective function, only one solution is needed.
0.00/0.02 c presolving settings loaded
0.00/0.03 c presolving:
0.00/0.07 c (round 1) 0 del vars, 3490 del conss, 200 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 101 upgd conss, 24920 impls, 199 clqs
0.00/0.08 c (round 2) 3090 del vars, 3490 del conss, 200 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 301 upgd conss, 24920 impls, 0 clqs
0.00/0.09 c presolving (3 rounds):
0.00/0.09 c 3090 deleted vars, 3490 deleted constraints, 200 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.09 c 24920 implications, 0 cliques
0.00/0.09 c presolved problem has 200 variables (200 bin, 0 int, 0 impl, 0 cont) and 302 constraints
0.00/0.09 c 201 constraints of type <knapsack>
0.00/0.09 c 100 constraints of type <setppc>
0.00/0.09 c 1 constraints of type <linear>
0.00/0.09 c transformed objective value is always integral (scale: 1)
0.00/0.09 c Presolving Time: 0.06
0.00/0.09 c - non default parameters ----------------------------------------------------------------------
0.00/0.09 c # SCIP version 2.0.1.5
0.00/0.09 c
0.00/0.09 c # frequency for displaying node information lines
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.09 c display/freq = 10000
0.00/0.09 c
0.00/0.09 c # maximal time in seconds to run
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.09 c limits/time = 1797
0.00/0.09 c
0.00/0.09 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.09 c limits/memory = 13950
0.00/0.09 c
0.00/0.09 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.09 c limits/solutions = 1
0.00/0.09 c
0.00/0.09 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.09 c separating/maxrounds = 1
0.00/0.09 c
0.00/0.09 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.09 c separating/maxroundsroot = 5
0.00/0.09 c
0.00/0.09 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.09 c # [type: int, range: [1,2], default: 1]
0.00/0.09 c timing/clocktype = 2
0.00/0.09 c
0.00/0.09 c # belongs reading time to solving time?
0.00/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.09 c timing/reading = TRUE
0.00/0.09 c
0.00/0.09 c # should presolving try to simplify inequalities
0.00/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.09 c constraints/linear/simplifyinequalities = TRUE
0.00/0.09 c
0.00/0.09 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.09 c constraints/indicator/addCouplingCons = TRUE
0.00/0.09 c
0.00/0.09 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.09 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.09 c constraints/knapsack/disaggregation = FALSE
0.00/0.09 c
0.00/0.09 c # should presolving try to simplify knapsacks
0.00/0.09 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.09 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.09 c
0.00/0.09 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.09 c presolving/probing/maxrounds = 0
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/coefdiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.09 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.09 c heuristics/crossover/freq = -1
0.00/0.09 c
0.00/0.09 c # number of nodes added to the contingent of the total nodes
0.00/0.09 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.09 c heuristics/crossover/nodesofs = 750
0.00/0.09 c
0.00/0.09 c # number of nodes without incumbent change that heuristic should wait
0.00/0.09 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.09 c heuristics/crossover/nwaitingnodes = 100
0.00/0.09 c
0.00/0.09 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.09 c # [type: real, range: [0,1], default: 0.1]
0.00/0.09 c heuristics/crossover/nodesquot = 0.15
0.00/0.09 c
0.00/0.09 c # minimum percentage of integer variables that have to be fixed
0.00/0.09 c # [type: real, range: [0,1], default: 0.666]
0.00/0.09 c heuristics/crossover/minfixingrate = 0.5
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.09 c heuristics/feaspump/freq = -1
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/fracdiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.09 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/guideddiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.09 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.09 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/intshifting/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/linesearchdiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.09 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.09 c heuristics/objpscostdiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.09 c # [type: real, range: [0,1], default: 0.01]
0.00/0.09 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.09 c heuristics/oneopt/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/pscostdiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.09 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.09 c heuristics/rens/freq = -1
0.00/0.09 c
0.00/0.09 c # minimum percentage of integer variables that have to be fixable
0.00/0.09 c # [type: real, range: [0,1], default: 0.5]
0.00/0.09 c heuristics/rens/minfixingrate = 0.3
0.00/0.09 c
0.00/0.09 c # number of nodes added to the contingent of the total nodes
0.00/0.09 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.09 c heuristics/rens/nodesofs = 2000
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.09 c heuristics/rootsoldiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.09 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.09 c heuristics/rounding/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.09 c heuristics/shiftandpropagate/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/shifting/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.09 c heuristics/simplerounding/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.09 c heuristics/subnlp/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.09 c heuristics/trivial/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.09 c heuristics/trysol/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.09 c heuristics/undercover/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.09 c heuristics/veclendiving/freq = -1
0.00/0.09 c
0.00/0.09 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.09 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.09 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.09 c
0.00/0.09 c # additional number of allowed LP iterations
0.00/0.09 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.09 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.09 c
0.00/0.09 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.09 c heuristics/zirounding/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.09 c separating/cmir/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.09 c separating/flowcover/freq = -1
0.00/0.09 c
0.00/0.09 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.09 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.09 c separating/rapidlearning/freq = 0
0.00/0.09 c
0.00/0.09 c -----------------------------------------------------------------------------------------------
0.00/0.09 c start solving
0.00/0.09 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 | 68 | - |8627k| 0 | 38 | 200 | 302 | 200 | 302 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.08/0.17 c 0.2s| 1 | 0 | 240 | - |9003k| 0 | 120 | 200 | 302 | 200 | 334 | 32 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 287 | - |9025k| 0 | 140 | 200 | 302 | 200 | 376 | 74 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.29 c 0.3s| 1 | 0 | 295 | - |9028k| 0 | 144 | 200 | 302 | 200 | 382 | 80 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.74 c 0.7s| 1 | 2 | 295 | - |9029k| 0 | 144 | 200 | 302 | 200 | 382 | 80 | 0 | 9 | 0.000000e+00 | -- | Inf
7.28/7.36 c * 7.4s| 814 | 0 | 15380 | 18.6 |9332k| 38 | - | 200 | 833 | 200 | 371 | 80 | 547 |1115 | 0.000000e+00 | 0.000000e+00 | 0.00%
7.28/7.36 c
7.28/7.36 c SCIP Status : problem is solved [optimal solution found]
7.28/7.36 c Solving Time (sec) : 7.35
7.28/7.36 c Solving Nodes : 814
7.28/7.36 c Primal Bound : +0.00000000000000e+00 (1 solutions)
7.28/7.36 c Dual Bound : +0.00000000000000e+00
7.28/7.36 c Gap : 0.00 %
7.28/7.36 s SATISFIABLE
7.28/7.36 v -x197 -x164 -x113 -x185 -x170 -x158 x132 -x171 -x135 -x150 -x104 -x166 x160 -x144 -x119 -x110 x106 -x157 x146 x114 -x192 -x180
7.28/7.36 v -x161 -x145 -x128 -x122 -x154 -x112 -x151 -x124 -x134 -x178 x172 -x136 -x187 -x181 -x168 -x163 -x156 -x152 -x131 -x118 -x117
7.28/7.36 v -x109 -x105 -x198 x190 -x200 -x183 -x123 -x153 -x182 -x189 x193 -x149 -x195 -x191 -x179 -x162 -x107 -x175 -x137 -x115 -x101 x188
7.28/7.36 v x184 -x167 -x133 -x130 -x129 -x127 -x121 -x120 -x111 -x108 -x155 -x199 -x138 -x148 -x174 x139 -x143 -x116 -x196 x176 -x142
7.28/7.36 v -x103 x140 -x194 x125 -x159 -x165 -x102 -x177 -x173 -x126 -x141 x169 -x186 -x147 -x100 x99 x98 -x97 -x96 -x95 -x94 -x93 -x92
7.28/7.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 -x66
7.28/7.36 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
7.28/7.36 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
7.28/7.36 v -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 x3 -x2 -x1
7.28/7.36 c SCIP Status : problem is solved [optimal solution found]
7.28/7.36 c Total Time : 7.35
7.28/7.36 c solving : 7.35
7.28/7.36 c presolving : 0.06 (included in solving)
7.28/7.36 c reading : 0.02 (included in solving)
7.28/7.36 c Original Problem :
7.28/7.36 c Problem name : HOME/instance-3488208-1307788242.opb
7.28/7.36 c Variables : 3290 (3290 binary, 0 integer, 0 implicit integer, 0 continuous)
7.28/7.36 c Constraints : 3592 initial, 3592 maximal
7.28/7.36 c Presolved Problem :
7.28/7.36 c Problem name : t_HOME/instance-3488208-1307788242.opb
7.28/7.36 c Variables : 200 (200 binary, 0 integer, 0 implicit integer, 0 continuous)
7.28/7.36 c Constraints : 302 initial, 833 maximal
7.28/7.36 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
7.28/7.36 c trivial : 0.00 0 0 0 0 0 0 0 0 0
7.28/7.36 c dualfix : 0.00 3090 0 0 0 0 0 0 0 0
7.28/7.36 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
7.28/7.36 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
7.28/7.36 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
7.28/7.36 c implics : 0.00 0 0 0 0 0 0 0 0 0
7.28/7.36 c probing : 0.00 0 0 0 0 0 0 0 0 0
7.28/7.36 c knapsack : 0.01 0 0 0 0 0 0 0 0 0
7.28/7.36 c setppc : 0.00 0 0 0 0 0 0 0 0 0
7.28/7.36 c linear : 0.01 0 0 0 0 0 0 0 0 0
7.28/7.36 c logicor : 0.00 0 0 0 0 0 0 0 0 0
7.28/7.36 c pseudoboolean : 0.01 0 0 0 0 0 3490 200 0 0
7.28/7.36 c root node : - 0 - - 0 - - - - -
7.28/7.36 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
7.28/7.36 c integral : 0 0 0 605 0 3 0 6 269 0 0 872
7.28/7.36 c knapsack : 201 4 2636 1 0 0 5854 16 3377 228 0 0
7.28/7.36 c setppc : 100 4 2487 0 0 0 457 0 109 0 0 0
7.28/7.36 c linear : 1 4 2620 1 0 0 0 11 0 0 0 0
7.28/7.36 c logicor : 0+ 0 1047 0 0 0 698 8 518 0 0 0
7.28/7.36 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
7.28/7.36 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
7.28/7.36 c integral : 5.96 0.00 0.00 5.96 0.00 0.00 0.00
7.28/7.36 c knapsack : 0.03 0.01 0.02 0.00 0.00 0.00 0.00
7.28/7.36 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
7.28/7.36 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
7.28/7.36 c logicor : 0.01 0.00 0.01 0.00 0.00 0.00 0.00
7.28/7.36 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
7.28/7.36 c Propagators : #Propagate #Resprop Cutoffs DomReds
7.28/7.36 c vbounds : 0 0 0 0
7.28/7.36 c rootredcost : 0 0 0 0
7.28/7.36 c pseudoobj : 0 0 0 0
7.28/7.36 c Propagator Timings : TotalTime Propagate Resprop
7.28/7.36 c vbounds : 0.00 0.00 0.00
7.28/7.36 c rootredcost : 0.00 0.00 0.00
7.28/7.36 c pseudoobj : 0.00 0.00 0.00
7.28/7.36 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
7.28/7.36 c propagation : 0.00 14 14 98 50.9 0 0.0 -
7.28/7.36 c infeasible LP : 0.02 341 271 2046 31.2 0 0.0 0
7.28/7.36 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
7.28/7.36 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
7.28/7.36 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
7.28/7.36 c applied globally : - - - 531 18.6 - - -
7.28/7.36 c applied locally : - - - 16 36.9 - - -
7.28/7.36 c Separators : Time Calls Cutoffs DomReds Cuts Conss
7.28/7.36 c cut pool : 0.00 3 - - 0 - (maximal pool size: 80)
7.28/7.36 c redcost : 0.00 452 0 0 0 0
7.28/7.36 c impliedbounds : 0.00 4 0 0 0 0
7.28/7.36 c intobj : 0.00 0 0 0 0 0
7.28/7.36 c gomory : 0.10 4 0 0 0 0
7.28/7.36 c cgmip : 0.00 0 0 0 0 0
7.28/7.36 c closecuts : 0.00 0 0 0 0 0
7.28/7.36 c strongcg : 0.08 4 0 0 80 0
7.28/7.36 c cmir : 0.00 0 0 0 0 0
7.28/7.36 c flowcover : 0.00 0 0 0 0 0
7.28/7.36 c clique : 0.00 1 0 0 0 0
7.28/7.36 c zerohalf : 0.00 0 0 0 0 0
7.28/7.36 c mcf : 0.00 1 0 0 0 0
7.28/7.36 c oddcycle : 0.00 0 0 0 0 0
7.28/7.36 c rapidlearning : 0.03 1 0 0 0 0
7.28/7.36 c Pricers : Time Calls Vars
7.28/7.36 c problem variables: 0.00 0 0
7.28/7.36 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
7.28/7.36 c relpscost : 5.96 604 6 269 0 0 872
7.28/7.36 c pscost : 0.00 0 0 0 0 0 0
7.28/7.36 c inference : 0.00 0 0 0 0 0 0
7.28/7.36 c mostinf : 0.00 0 0 0 0 0 0
7.28/7.36 c leastinf : 0.00 0 0 0 0 0 0
7.28/7.36 c fullstrong : 0.00 0 0 0 0 0 0
7.28/7.36 c allfullstrong : 0.00 0 0 0 0 0 0
7.28/7.36 c random : 0.00 0 0 0 0 0 0
7.28/7.36 c Primal Heuristics : Time Calls Found
7.28/7.36 c LP solutions : 0.00 - 1
7.28/7.36 c pseudo solutions : 0.00 - 0
7.28/7.36 c trivial : 0.00 1 0
7.28/7.36 c shiftandpropagate: 0.00 0 0
7.28/7.36 c simplerounding : 0.00 0 0
7.28/7.36 c zirounding : 0.00 0 0
7.28/7.36 c rounding : 0.00 0 0
7.28/7.36 c shifting : 0.00 0 0
7.28/7.36 c intshifting : 0.00 0 0
7.28/7.36 c oneopt : 0.00 0 0
7.28/7.36 c twoopt : 0.00 0 0
7.28/7.36 c fixandinfer : 0.00 0 0
7.28/7.36 c feaspump : 0.00 0 0
7.28/7.36 c clique : 0.00 0 0
7.28/7.36 c coefdiving : 0.00 0 0
7.28/7.36 c pscostdiving : 0.00 0 0
7.28/7.36 c fracdiving : 0.00 0 0
7.28/7.36 c veclendiving : 0.00 0 0
7.28/7.36 c intdiving : 0.00 0 0
7.28/7.36 c actconsdiving : 0.00 0 0
7.28/7.36 c objpscostdiving : 0.00 0 0
7.28/7.36 c rootsoldiving : 0.00 0 0
7.28/7.36 c linesearchdiving : 0.00 0 0
7.28/7.36 c guideddiving : 0.00 0 0
7.28/7.36 c octane : 0.00 0 0
7.28/7.36 c rens : 0.00 0 0
7.28/7.36 c rins : 0.00 0 0
7.28/7.36 c localbranching : 0.00 0 0
7.28/7.36 c mutation : 0.00 0 0
7.28/7.36 c crossover : 0.00 0 0
7.28/7.36 c dins : 0.00 0 0
7.28/7.36 c vbounds : 0.00 0 0
7.28/7.36 c undercover : 0.00 0 0
7.28/7.36 c subnlp : 0.00 0 0
7.28/7.36 c trysol : 0.00 0 0
7.28/7.36 c LP : Time Calls Iterations Iter/call Iter/sec
7.28/7.36 c primal LP : 0.00 0 0 0.00 -
7.28/7.36 c dual LP : 0.94 948 15380 16.22 16341.97
7.28/7.36 c lex dual LP : 0.00 0 0 0.00 -
7.28/7.36 c barrier LP : 0.00 0 0 0.00 -
7.28/7.36 c diving/probing LP: 0.00 0 0 0.00 -
7.28/7.36 c strong branching : 5.95 1115 67069 60.15 11276.63
7.28/7.36 c (at root node) : - 9 1965 218.33 -
7.28/7.36 c conflict analysis: 0.00 0 0 0.00 -
7.28/7.36 c B&B Tree :
7.28/7.36 c number of runs : 1
7.28/7.36 c nodes : 814
7.28/7.36 c nodes (total) : 814
7.28/7.36 c nodes left : 0
7.28/7.36 c max depth : 38
7.28/7.36 c max depth (total): 38
7.28/7.36 c backtracks : 164 (20.1%)
7.28/7.36 c delayed cutoffs : 8
7.28/7.36 c repropagations : 881 (657 domain reductions, 5 cutoffs)
7.28/7.36 c avg switch length: 4.89
7.28/7.36 c switching time : 0.03
7.28/7.36 c Solution :
7.28/7.36 c Solutions found : 1 (1 improvements)
7.28/7.36 c First Solution : +0.00000000000000e+00 (in run 1, after 814 nodes, 7.35 seconds, depth 22, found by <relaxation>)
7.28/7.36 c Primal Bound : +0.00000000000000e+00 (in run 1, after 814 nodes, 7.35 seconds, depth 22, found by <relaxation>)
7.28/7.36 c Dual Bound : +0.00000000000000e+00
7.28/7.36 c Gap : 0.00 %
7.28/7.36 c Root Dual Bound : +0.00000000000000e+00
7.28/7.36 c Root Iterations : 295
7.28/7.37 c Time complete: 7.37.