0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
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-3451263-1307639846.opb>
0.00/0.02 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 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.02 c presolving:
0.00/0.04 c (round 1) 0 del vars, 143 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.00/0.05 c (round 2) 0 del vars, 143 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.00/0.05 c (round 3) 0 del vars, 264 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.00/0.05 c presolving (4 rounds):
0.00/0.05 c 0 deleted vars, 264 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.05 c 242 implications, 22 cliques
0.00/0.05 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2443 constraints
0.00/0.05 c 1 constraints of type <knapsack>
0.00/0.05 c 22 constraints of type <setppc>
0.00/0.05 c 2420 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 1)
0.00/0.05 c Presolving Time: 0.03
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 2.0.1.5
0.00/0.05 c
0.00/0.05 c # frequency for displaying node information lines
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05 c display/freq = 10000
0.00/0.05 c
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/time = 1800
0.00/0.05 c
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/memory = 13950
0.00/0.05 c
0.00/0.05 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c limits/solutions = 1
0.00/0.05 c
0.00/0.05 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.05 c separating/maxrounds = 1
0.00/0.05 c
0.00/0.05 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/maxroundsroot = 5
0.00/0.05 c
0.00/0.05 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.05 c # [type: int, range: [1,2], default: 1]
0.00/0.05 c timing/clocktype = 2
0.00/0.05 c
0.00/0.05 c # belongs reading time to solving time?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c timing/reading = TRUE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify inequalities
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/linear/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/indicator/addCouplingCons = TRUE
0.00/0.05 c
0.00/0.05 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.05 c constraints/knapsack/disaggregation = FALSE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify knapsacks
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c presolving/probing/maxrounds = 0
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/coefdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.05 c heuristics/crossover/freq = -1
0.00/0.05 c
0.00/0.05 c # number of nodes added to the contingent of the total nodes
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05 c heuristics/crossover/nodesofs = 750
0.00/0.05 c
0.00/0.05 c # number of nodes without incumbent change that heuristic should wait
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.05 c heuristics/crossover/nwaitingnodes = 100
0.00/0.05 c
0.00/0.05 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.05 c # [type: real, range: [0,1], default: 0.1]
0.00/0.05 c heuristics/crossover/nodesquot = 0.15
0.00/0.05 c
0.00/0.05 c # minimum percentage of integer variables that have to be fixed
0.00/0.05 c # [type: real, range: [0,1], default: 0.666]
0.00/0.05 c heuristics/crossover/minfixingrate = 0.5
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/feaspump/freq = -1
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/fracdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/guideddiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/intshifting/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/linesearchdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/objpscostdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.05 c # [type: real, range: [0,1], default: 0.01]
0.00/0.05 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/oneopt/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/pscostdiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/rens/freq = -1
0.00/0.05 c
0.00/0.05 c # minimum percentage of integer variables that have to be fixable
0.00/0.05 c # [type: real, range: [0,1], default: 0.5]
0.00/0.05 c heuristics/rens/minfixingrate = 0.3
0.00/0.05 c
0.00/0.05 c # number of nodes added to the contingent of the total nodes
0.00/0.05 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05 c heuristics/rens/nodesofs = 2000
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05 c heuristics/rootsoldiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.05 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/rounding/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/shiftandpropagate/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/shifting/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/simplerounding/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/subnlp/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/trivial/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/trysol/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c heuristics/undercover/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05 c heuristics/veclendiving/freq = -1
0.00/0.05 c
0.00/0.05 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.05 c
0.00/0.05 c # additional number of allowed LP iterations
0.00/0.05 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.05 c
0.00/0.05 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c heuristics/zirounding/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c separating/cmir/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c separating/flowcover/freq = -1
0.00/0.05 c
0.00/0.05 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c separating/rapidlearning/freq = 0
0.00/0.05 c
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c start solving
0.00/0.05 c
0.00/0.07 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.07 c 0.1s| 1 | 0 | 76 | - |3825k| 0 | 36 | 231 |2443 | 231 |2443 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.15 c 0.1s| 1 | 0 | 90 | - |4126k| 0 | 43 | 231 |2490 | 231 |2454 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 105 | - |4573k| 0 | 46 | 231 |2490 | 231 |2458 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.33 c 0.3s| 1 | 0 | 111 | - |4869k| 0 | 45 | 231 |2490 | 231 |2460 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.46 c 0.5s| 1 | 0 | 129 | - |5136k| 0 | 46 | 231 |2490 | 231 |2463 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.58 c 0.6s| 1 | 0 | 151 | - |5406k| 0 | 50 | 231 |2490 | 231 |2467 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.98 c 1.0s| 1 | 2 | 151 | - |5406k| 0 | 50 | 231 |2490 | 231 |2467 | 24 | 0 | 13 | 0.000000e+00 | -- | Inf
8.59/8.66 c * 8.7s| 82 | 0 | 5299 | 63.6 |5574k| 12 | - | 231 |2512 | 231 |2451 | 24 | 24 |1298 | 0.000000e+00 | 0.000000e+00 | 0.00%
8.59/8.66 c
8.59/8.66 c SCIP Status : problem is solved [optimal solution found]
8.59/8.66 c Solving Time (sec) : 8.66
8.59/8.66 c Solving Nodes : 82
8.59/8.66 c Primal Bound : +0.00000000000000e+00 (1 solutions)
8.59/8.66 c Dual Bound : +0.00000000000000e+00
8.59/8.66 c Gap : 0.00 %
8.59/8.66 s SATISFIABLE
8.59/8.66 v -x221 -x211 -x201 -x191 -x181 -x171 -x161 x151 -x141 -x131 -x231 -x210 -x200 -x190 -x180 -x170 -x160 -x150 x140 -x130 -x230 -x220
8.59/8.66 v -x199 x189 -x179 -x169 -x159 -x149 -x139 -x129 x229 -x219 -x209 -x188 -x178 -x168 -x158 -x148 -x138 -x128 -x228 -x218 -x208
8.59/8.66 v x198 -x177 -x167 -x157 -x147 -x137 -x127 -x227 x217 -x207 -x197 -x187 -x166 -x156 -x146 -x136 -x126 -x226 -x216 -x206 -x196
8.59/8.66 v -x186 -x176 x155 -x145 -x135 -x125 -x225 -x215 x205 -x195 -x185 -x175 -x165 -x144 -x134 -x124 -x224 -x214 -x204 -x194 -x184
8.59/8.66 v x174 -x164 -x154 -x133 -x123 -x223 -x213 -x203 -x193 -x183 -x173 -x163 -x153 -x143 x122 -x222 -x212 -x202 -x192 -x182 -x172 x162
8.59/8.66 v -x152 -x142 -x132 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 x112 -x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104
8.59/8.66 v -x103 -x102 -x101 x100 -x99 -x98 -x97 -x96 -x95 -x94 x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 x81 -x80
8.59/8.66 v -x79 -x78 -x77 -x76 x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54
8.59/8.66 v -x53 x52 -x51 -x50 -x49 -x48 -x47 -x46 -x45 x44 -x43 -x42 -x41 -x40 -x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 -x29
8.59/8.66 v -x28 -x27 -x26 x25 -x24 -x23 -x22 -x11 -x21 x10 -x20 -x9 -x19 -x8 -x18 -x7 x17 -x6 -x16 -x5 -x15 -x4 -x14 -x3 -x13 -x2 -x12
8.59/8.66 v -x1
8.59/8.66 c SCIP Status : problem is solved [optimal solution found]
8.59/8.66 c Total Time : 8.66
8.59/8.66 c solving : 8.66
8.59/8.66 c presolving : 0.03 (included in solving)
8.59/8.66 c reading : 0.02 (included in solving)
8.59/8.66 c Original Problem :
8.59/8.66 c Problem name : HOME/instance-3451263-1307639846.opb
8.59/8.66 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
8.59/8.66 c Constraints : 2707 initial, 2707 maximal
8.59/8.66 c Presolved Problem :
8.59/8.66 c Problem name : t_HOME/instance-3451263-1307639846.opb
8.59/8.66 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
8.59/8.66 c Constraints : 2443 initial, 2512 maximal
8.59/8.66 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
8.59/8.66 c trivial : 0.00 0 0 0 0 0 0 0 0 0
8.59/8.66 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
8.59/8.66 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
8.59/8.66 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
8.59/8.66 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
8.59/8.66 c implics : 0.00 0 0 0 0 0 0 0 0 0
8.59/8.66 c probing : 0.00 0 0 0 0 0 0 0 0 0
8.59/8.66 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
8.59/8.66 c setppc : 0.00 0 0 0 0 0 121 0 0 0
8.59/8.66 c linear : 0.01 0 0 0 0 0 143 0 0 0
8.59/8.66 c logicor : 0.01 0 0 0 0 0 0 0 0 0
8.59/8.66 c root node : - 0 - - 0 - - - - -
8.59/8.66 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
8.59/8.66 c integral : 0 0 0 196 0 3 0 16 411 0 0 96
8.59/8.66 c knapsack : 1 5 412 0 0 0 15 0 250 0 0 0
8.59/8.66 c setppc : 22 5 411 0 0 0 458 3 694 0 0 0
8.59/8.66 c linear : 0+ 5 48 0 0 0 0 0 0 0 0 0
8.59/8.66 c logicor : 2420+ 5 377 1 0 0 281 2 960 0 0 0
8.59/8.66 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
8.59/8.66 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
8.59/8.66 c integral : 7.45 0.00 0.00 7.45 0.00 0.00 0.00
8.59/8.66 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
8.59/8.66 c setppc : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
8.59/8.66 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
8.59/8.66 c logicor : 0.01 0.00 0.00 0.00 0.00 0.00 0.00
8.59/8.66 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
8.59/8.66 c Propagators : #Propagate #Resprop Cutoffs DomReds
8.59/8.66 c vbounds : 0 0 0 0
8.59/8.66 c rootredcost : 0 0 0 0
8.59/8.66 c pseudoobj : 0 0 0 0
8.59/8.66 c Propagator Timings : TotalTime Propagate Resprop
8.59/8.66 c vbounds : 0.00 0.00 0.00
8.59/8.66 c rootredcost : 0.00 0.00 0.00
8.59/8.66 c pseudoobj : 0.00 0.00 0.00
8.59/8.66 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
8.59/8.66 c propagation : 0.00 5 5 21 25.3 0 0.0 -
8.59/8.66 c infeasible LP : 0.00 12 7 41 39.1 1 12.0 0
8.59/8.66 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
8.59/8.66 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
8.59/8.66 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
8.59/8.66 c applied globally : - - - 22 20.1 - - -
8.59/8.66 c applied locally : - - - 2 33.0 - - -
8.59/8.66 c Separators : Time Calls Cutoffs DomReds Cuts Conss
8.59/8.66 c cut pool : 0.00 4 - - 122 - (maximal pool size: 503)
8.59/8.66 c redcost : 0.00 79 0 0 0 0
8.59/8.66 c impliedbounds : 0.00 5 0 0 0 0
8.59/8.66 c intobj : 0.00 0 0 0 0 0
8.59/8.66 c gomory : 0.27 5 0 0 1251 0
8.59/8.66 c cgmip : 0.00 0 0 0 0 0
8.59/8.66 c closecuts : 0.00 0 0 0 0 0
8.59/8.66 c strongcg : 0.19 5 0 0 2342 0
8.59/8.66 c cmir : 0.00 0 0 0 0 0
8.59/8.66 c flowcover : 0.00 0 0 0 0 0
8.59/8.66 c clique : 0.00 5 0 0 0 0
8.59/8.66 c zerohalf : 0.00 0 0 0 0 0
8.59/8.66 c mcf : 0.00 1 0 0 0 0
8.59/8.66 c oddcycle : 0.00 0 0 0 0 0
8.59/8.66 c rapidlearning : 0.04 1 0 0 0 47
8.59/8.66 c Pricers : Time Calls Vars
8.59/8.66 c problem variables: 0.00 0 0
8.59/8.66 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
8.59/8.66 c relpscost : 7.45 195 16 411 0 0 96
8.59/8.66 c pscost : 0.00 0 0 0 0 0 0
8.59/8.66 c inference : 0.00 0 0 0 0 0 0
8.59/8.66 c mostinf : 0.00 0 0 0 0 0 0
8.59/8.66 c leastinf : 0.00 0 0 0 0 0 0
8.59/8.66 c fullstrong : 0.00 0 0 0 0 0 0
8.59/8.66 c allfullstrong : 0.00 0 0 0 0 0 0
8.59/8.66 c random : 0.00 0 0 0 0 0 0
8.59/8.66 c Primal Heuristics : Time Calls Found
8.59/8.66 c LP solutions : 0.00 - 1
8.59/8.66 c pseudo solutions : 0.00 - 0
8.59/8.66 c trivial : 0.00 1 0
8.59/8.66 c shiftandpropagate: 0.00 0 0
8.59/8.66 c simplerounding : 0.00 0 0
8.59/8.66 c zirounding : 0.00 0 0
8.59/8.66 c rounding : 0.00 0 0
8.59/8.66 c shifting : 0.00 0 0
8.59/8.66 c intshifting : 0.00 0 0
8.59/8.66 c oneopt : 0.00 0 0
8.59/8.66 c twoopt : 0.00 0 0
8.59/8.66 c fixandinfer : 0.00 0 0
8.59/8.66 c feaspump : 0.00 0 0
8.59/8.66 c clique : 0.00 0 0
8.59/8.66 c coefdiving : 0.00 0 0
8.59/8.66 c pscostdiving : 0.00 0 0
8.59/8.66 c fracdiving : 0.00 0 0
8.59/8.66 c veclendiving : 0.00 0 0
8.59/8.66 c intdiving : 0.00 0 0
8.59/8.66 c actconsdiving : 0.00 0 0
8.59/8.66 c objpscostdiving : 0.00 0 0
8.59/8.66 c rootsoldiving : 0.00 0 0
8.59/8.66 c linesearchdiving : 0.00 0 0
8.59/8.66 c guideddiving : 0.00 0 0
8.59/8.66 c octane : 0.00 0 0
8.59/8.66 c rens : 0.00 0 0
8.59/8.66 c rins : 0.00 0 0
8.59/8.66 c localbranching : 0.00 0 0
8.59/8.66 c mutation : 0.00 0 0
8.59/8.66 c crossover : 0.00 0 0
8.59/8.66 c dins : 0.00 0 0
8.59/8.66 c vbounds : 0.00 0 0
8.59/8.66 c undercover : 0.00 0 0
8.59/8.66 c subnlp : 0.00 0 0
8.59/8.66 c trysol : 0.00 0 0
8.59/8.66 c LP : Time Calls Iterations Iter/call Iter/sec
8.59/8.66 c primal LP : 0.00 0 0 0.00 -
8.59/8.66 c dual LP : 0.60 213 5299 24.88 8796.80
8.59/8.66 c lex dual LP : 0.00 0 0 0.00 -
8.59/8.66 c barrier LP : 0.00 0 0 0.00 -
8.59/8.66 c diving/probing LP: 0.00 0 0 0.00 -
8.59/8.66 c strong branching : 7.43 1298 65737 50.64 8850.95
8.59/8.66 c (at root node) : - 13 4034 310.31 -
8.59/8.66 c conflict analysis: 0.00 0 0 0.00 -
8.59/8.66 c B&B Tree :
8.59/8.66 c number of runs : 1
8.59/8.66 c nodes : 82
8.59/8.66 c nodes (total) : 82
8.59/8.66 c nodes left : 0
8.59/8.66 c max depth : 12
8.59/8.66 c max depth (total): 12
8.59/8.66 c backtracks : 9 (11.0%)
8.59/8.66 c delayed cutoffs : 0
8.59/8.66 c repropagations : 5 (5 domain reductions, 0 cutoffs)
8.59/8.66 c avg switch length: 2.39
8.59/8.66 c switching time : 0.01
8.59/8.66 c Solution :
8.59/8.66 c Solutions found : 1 (1 improvements)
8.59/8.66 c First Solution : +0.00000000000000e+00 (in run 1, after 82 nodes, 8.66 seconds, depth 9, found by <relaxation>)
8.59/8.66 c Primal Bound : +0.00000000000000e+00 (in run 1, after 82 nodes, 8.66 seconds, depth 9, found by <relaxation>)
8.59/8.66 c Dual Bound : +0.00000000000000e+00
8.59/8.66 c Gap : 0.00 %
8.59/8.66 c Root Dual Bound : +0.00000000000000e+00
8.59/8.66 c Root Iterations : 151
8.59/8.67 c Time complete: 8.66.
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL
This is runsolver version 3.3.0 (svn: 977)
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-3451263-1307639846/watcher-3451263-1307639846 -o /tmp/evaluation-result-3451263-1307639846/solver-3451263-1307639846 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b.linux.x86_64.gnu.opt.spx -f HOME/instance-3451263-1307639846.opb -t 1800 -m 15500
running on 4 cores: 1,3,5,7
Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 1900 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB
Current StackSize limit: 10240 KiB
[startup+0 s]
/proc/loadavg: 2.00 2.00 2.19 3/177 1504
/proc/meminfo: memFree=32041364/32951124 swapFree=67056684/67111528
[pid=1504] ppid=1502 vsize=9460 CPUtime=0 cores=1,3,5,7
/proc/1504/stat : 1504 (scip-2.0.1.4b.l) R 1502 1504 32675 0 -1 4202496 1487 0 0 0 0 0 0 0 25 0 1 0 875585356 9687040 1440 33554432000 4194304 9163163 140733436150592 18446744073709551615 8013931 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/1504/statm: 2365 1447 345 1214 0 1147 0
[startup+0.013471 s]
/proc/loadavg: 2.00 2.00 2.19 3/177 1504
/proc/meminfo: memFree=32041364/32951124 swapFree=67056684/67111528
[pid=1504] ppid=1502 vsize=13648 CPUtime=0 cores=1,3,5,7
/proc/1504/stat : 1504 (scip-2.0.1.4b.l) R 1502 1504 32675 0 -1 4202496 2383 0 0 0 0 0 0 0 25 0 1 0 875585356 13975552 2336 33554432000 4194304 9163163 140733436150592 18446744073709551615 8041854 0 0 4096 0 0 0 0 17 1 0 0 0
/proc/1504/statm: 3412 2336 392 1214 0 2194 0
Current children cumulated CPU time (s) 0
Current children cumulated vsize (KiB) 13648
[startup+0.100507 s]
/proc/loadavg: 2.00 2.00 2.19 3/177 1504
/proc/meminfo: memFree=32041364/32951124 swapFree=67056684/67111528
[pid=1504] ppid=1502 vsize=27636 CPUtime=0.09 cores=1,3,5,7
/proc/1504/stat : 1504 (scip-2.0.1.4b.l) R 1502 1504 32675 0 -1 4202496 6210 0 0 0 9 0 0 0 18 0 1 0 875585356 28299264 5865 33554432000 4194304 9163163 140733436150592 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/1504/statm: 6909 5865 650 1214 0 5691 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 27636
[startup+0.300455 s]
/proc/loadavg: 2.00 2.00 2.19 3/177 1504
/proc/meminfo: memFree=32041364/32951124 swapFree=67056684/67111528
[pid=1504] ppid=1502 vsize=41768 CPUtime=0.29 cores=1,3,5,7
/proc/1504/stat : 1504 (scip-2.0.1.4b.l) R 1502 1504 32675 0 -1 4202496 10428 0 0 0 27 2 0 0 18 0 1 0 875585356 42770432 9375 33554432000 4194304 9163163 140733436150592 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/1504/statm: 10442 9375 698 1214 0 9224 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 41768
[startup+0.700396 s]
/proc/loadavg: 2.00 2.00 2.19 3/177 1504
/proc/meminfo: memFree=32041364/32951124 swapFree=67056684/67111528
[pid=1504] ppid=1502 vsize=42000 CPUtime=0.69 cores=1,3,5,7
/proc/1504/stat : 1504 (scip-2.0.1.4b.l) R 1502 1504 32675 0 -1 4202496 10500 0 0 0 66 3 0 0 18 0 1 0 875585356 43008000 9447 33554432000 4194304 9163163 140733436150592 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/1504/statm: 10500 9447 706 1214 0 9282 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 42000
[startup+1.50025 s]
/proc/loadavg: 2.00 2.00 2.19 3/178 1505
/proc/meminfo: memFree=32006588/32951124 swapFree=67056684/67111528
[pid=1504] ppid=1502 vsize=42000 CPUtime=1.49 cores=1,3,5,7
/proc/1504/stat : 1504 (scip-2.0.1.4b.l) R 1502 1504 32675 0 -1 4202496 10501 0 0 0 142 7 0 0 19 0 1 0 875585356 43008000 9448 33554432000 4194304 9163163 140733436150592 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/1504/statm: 10500 9448 707 1214 0 9282 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 42000
[startup+3.10096 s]
/proc/loadavg: 2.00 2.00 2.19 3/178 1505
/proc/meminfo: memFree=32005596/32951124 swapFree=67056684/67111528
[pid=1504] ppid=1502 vsize=42000 CPUtime=3.09 cores=1,3,5,7
/proc/1504/stat : 1504 (scip-2.0.1.4b.l) R 1502 1504 32675 0 -1 4202496 10507 0 0 0 296 13 0 0 25 0 1 0 875585356 43008000 9454 33554432000 4194304 9163163 140733436150592 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/1504/statm: 10500 9454 708 1214 0 9282 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 42000
[startup+6.30037 s]
/proc/loadavg: 2.00 2.00 2.19 3/178 1505
/proc/meminfo: memFree=32005444/32951124 swapFree=67056684/67111528
[pid=1504] ppid=1502 vsize=42000 CPUtime=6.29 cores=1,3,5,7
/proc/1504/stat : 1504 (scip-2.0.1.4b.l) R 1502 1504 32675 0 -1 4202496 10508 0 0 0 603 26 0 0 25 0 1 0 875585356 43008000 9454 33554432000 4194304 9163163 140733436150592 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/1504/statm: 10500 9454 707 1214 0 9282 0
Current children cumulated CPU time (s) 6.29
Current children cumulated vsize (KiB) 42000
Solver just ended. Dumping a history of the last processes samples
[startup+7.90108 s]
/proc/loadavg: 2.00 2.00 2.19 3/178 1505
/proc/meminfo: memFree=32005568/32951124 swapFree=67056684/67111528
[pid=1504] ppid=1502 vsize=42000 CPUtime=7.89 cores=1,3,5,7
/proc/1504/stat : 1504 (scip-2.0.1.4b.l) R 1502 1504 32675 0 -1 4202496 10508 0 0 0 757 32 0 0 25 0 1 0 875585356 43008000 9454 33554432000 4194304 9163163 140733436150592 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/1504/statm: 10500 9454 707 1214 0 9282 0
Current children cumulated CPU time (s) 7.89
Current children cumulated vsize (KiB) 42000
[startup+8.301 s]
/proc/loadavg: 2.00 2.00 2.19 3/178 1505
/proc/meminfo: memFree=32005568/32951124 swapFree=67056684/67111528
[pid=1504] ppid=1502 vsize=42000 CPUtime=8.29 cores=1,3,5,7
/proc/1504/stat : 1504 (scip-2.0.1.4b.l) R 1502 1504 32675 0 -1 4202496 10508 0 0 0 796 33 0 0 25 0 1 0 875585356 43008000 9454 33554432000 4194304 9163163 140733436150592 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/1504/statm: 10500 9454 707 1214 0 9282 0
Current children cumulated CPU time (s) 8.29
Current children cumulated vsize (KiB) 42000
[startup+8.50097 s]
/proc/loadavg: 2.00 2.00 2.19 3/178 1505
/proc/meminfo: memFree=32005568/32951124 swapFree=67056684/67111528
[pid=1504] ppid=1502 vsize=42000 CPUtime=8.49 cores=1,3,5,7
/proc/1504/stat : 1504 (scip-2.0.1.4b.l) R 1502 1504 32675 0 -1 4202496 10508 0 0 0 816 33 0 0 25 0 1 0 875585356 43008000 9454 33554432000 4194304 9163163 140733436150592 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/1504/statm: 10500 9454 707 1214 0 9282 0
Current children cumulated CPU time (s) 8.49
Current children cumulated vsize (KiB) 42000
[startup+8.60095 s]
/proc/loadavg: 2.00 2.00 2.19 3/178 1505
/proc/meminfo: memFree=32005568/32951124 swapFree=67056684/67111528
[pid=1504] ppid=1502 vsize=42000 CPUtime=8.59 cores=1,3,5,7
/proc/1504/stat : 1504 (scip-2.0.1.4b.l) R 1502 1504 32675 0 -1 4202496 10508 0 0 0 825 34 0 0 25 0 1 0 875585356 43008000 9454 33554432000 4194304 9163163 140733436150592 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 1 0 0 0
/proc/1504/statm: 10500 9454 707 1214 0 9282 0
Current children cumulated CPU time (s) 8.59
Current children cumulated vsize (KiB) 42000
Child status: 0
Real time (s): 8.67567
CPU time (s): 8.67468
CPU user time (s): 8.32773
CPU system time (s): 0.346947
CPU usage (%): 99.9886
Max. virtual memory (cumulated for all children) (KiB): 42000
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 8.32773
system time used= 0.346947
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 10515
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 5
involuntary context switches= 20
runsolver used 0.015997 second user time and 0.033994 second system time
The end