0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: 947bdb7-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3691591-1338022234.opb>
0.00/0.01 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.00/0.01 c problem read in 0.01
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
0.00/0.01 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.04 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.06 c presolving (4 rounds):
0.00/0.06 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.06 c 242 implications, 22 cliques
0.00/0.06 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2443 constraints
0.00/0.06 c 1 constraints of type <knapsack>
0.00/0.06 c 22 constraints of type <setppc>
0.00/0.06 c 2420 constraints of type <logicor>
0.00/0.06 c transformed objective value is always integral (scale: 1)
0.00/0.06 c Presolving Time: 0.04
0.00/0.06 c - non default parameters ----------------------------------------------------------------------
0.00/0.06 c # SCIP version 2.1.1.4
0.00/0.06 c
0.00/0.06 c # maximal time in seconds to run
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/time = 1797
0.00/0.06 c
0.00/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/memory = 13950
0.00/0.06 c
0.00/0.06 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c limits/solutions = 1
0.00/0.06 c
0.00/0.06 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.06 c separating/maxrounds = 1
0.00/0.06 c
0.00/0.06 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/maxroundsroot = 5
0.00/0.06 c
0.00/0.06 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.06 c # [type: int, range: [1,2], default: 1]
0.00/0.06 c timing/clocktype = 2
0.00/0.06 c
0.00/0.06 c # belongs reading time to solving time?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c timing/reading = TRUE
0.00/0.06 c
0.00/0.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.06 c constraints/knapsack/disaggregation = FALSE
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/coefdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.06 c heuristics/crossover/freq = -1
0.00/0.06 c
0.00/0.06 c # number of nodes added to the contingent of the total nodes
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06 c heuristics/crossover/nodesofs = 750
0.00/0.06 c
0.00/0.06 c # number of nodes without incumbent change that heuristic should wait
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.06 c heuristics/crossover/nwaitingnodes = 100
0.00/0.06 c
0.00/0.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.06 c # [type: real, range: [0,1], default: 0.1]
0.00/0.06 c heuristics/crossover/nodesquot = 0.15
0.00/0.06 c
0.00/0.06 c # minimum percentage of integer variables that have to be fixed
0.00/0.06 c # [type: real, range: [0,1], default: 0.666]
0.00/0.06 c heuristics/crossover/minfixingrate = 0.5
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/feaspump/freq = -1
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/fracdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/guideddiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/intshifting/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/linesearchdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/objpscostdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.06 c # [type: real, range: [0,1], default: 0.01]
0.00/0.06 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/oneopt/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/pscostdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/rens/freq = -1
0.00/0.06 c
0.00/0.06 c # minimum percentage of integer variables that have to be fixable
0.00/0.06 c # [type: real, range: [0,1], default: 0.5]
0.00/0.06 c heuristics/rens/minfixingrate = 0.3
0.00/0.06 c
0.00/0.06 c # number of nodes added to the contingent of the total nodes
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06 c heuristics/rens/nodesofs = 2000
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/rootsoldiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.06 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/rounding/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/shiftandpropagate/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/shifting/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/simplerounding/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/subnlp/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/trivial/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/trysol/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/undercover/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/veclendiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/zirounding/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c propagating/probing/maxprerounds = 0
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c separating/cmir/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c separating/flowcover/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/rapidlearning/freq = 0
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/indoneopt/freq = -1
0.00/0.06 c
0.00/0.06 c -----------------------------------------------------------------------------------------------
0.00/0.06 c start solving
0.00/0.06 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 | - |4259k| 0 | 36 | 231 |2443 | 231 |2443 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.08/0.19 c 0.2s| 1 | 0 | 90 | - |4675k| 0 | 39 | 231 |2694 | 231 |2450 | 7 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 105 | - |5004k| 0 | 45 | 231 |2694 | 231 |2454 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.3s| 1 | 0 | 120 | - |5446k| 0 | 46 | 231 |2694 | 231 |2455 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 139 | - |5890k| 0 | 47 | 231 |2694 | 231 |2457 | 14 | 0 | 0 | 0.000000e+00 | -- | Inf
0.38/0.47 c 0.5s| 1 | 0 | 146 | - |6231k| 0 | 51 | 231 |2694 | 231 |2460 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.72 c 0.7s| 1 | 2 | 146 | - |6231k| 0 | 51 | 231 |2694 | 231 |2460 | 17 | 0 | 11 | 0.000000e+00 | -- | Inf
8.08/8.12 c 8.1s| 100 | 15 | 4367 | 42.6 |6391k| 15 | 49 | 231 |2720 | 231 |2453 | 17 | 26 |1519 | 0.000000e+00 | -- | Inf
9.18/9.24 c 9.2s| 200 | 24 | 6403 | 31.4 |6439k| 24 | 45 | 231 |2773 | 231 |2453 | 17 | 82 |1744 | 0.000000e+00 | -- | Inf
9.79/9.82 c 9.8s| 300 | 28 | 8145 | 26.8 |6471k| 24 | 26 | 231 |2827 | 231 |2453 | 17 | 140 |1839 | 0.000000e+00 | -- | Inf
9.98/10.08 c *10.1s| 360 | 0 | 9177 | 25.2 |6415k| 24 | - | 231 |2855 | 231 |2453 | 17 | 168 |1874 | 0.000000e+00 | 0.000000e+00 | 0.00%
9.98/10.08 c
9.98/10.08 c SCIP Status : problem is solved [optimal solution found]
9.98/10.08 c Solving Time (sec) : 10.08
9.98/10.08 c Solving Nodes : 360
9.98/10.08 c Primal Bound : +0.00000000000000e+00 (1 solutions)
9.98/10.08 c Dual Bound : +0.00000000000000e+00
9.98/10.08 c Gap : 0.00 %
9.98/10.08 s SATISFIABLE
9.98/10.08 v -x221 -x211 x201 -x191 -x181 -x171 -x161 -x151 -x141 -x131 -x231 -x210 -x200 -x190 -x180 -x170 -x160 -x150 x140 -x130 -x230 -x220
9.98/10.08 v -x199 -x189 -x179 -x169 -x159 -x149 -x139 x129 -x229 -x219 -x209 -x188 -x178 x168 -x158 -x148 -x138 -x128 -x228 -x218 -x208
9.98/10.08 v -x198 -x177 -x167 -x157 x147 -x137 -x127 -x227 x217 -x207 -x197 -x187 -x166 -x156 -x146 -x136 -x126 -x226 -x216 -x206 -x196
9.98/10.08 v -x186 x176 -x155 -x145 -x135 -x125 -x225 -x215 x205 -x195 -x185 -x175 -x165 -x144 -x134 -x124 x224 -x214 -x204 -x194 -x184 -x174
9.98/10.08 v -x164 -x154 -x133 -x123 -x223 -x213 -x203 -x193 -x183 -x173 -x163 x153 -x143 -x122 -x222 -x212 -x202 -x192 x182 -x172 -x162
9.98/10.08 v -x152 -x142 -x132 x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 x107 -x106 -x105 -x104
9.98/10.08 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
9.98/10.08 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
9.98/10.08 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
9.98/10.08 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
9.98/10.08 v -x1
9.98/10.08 c SCIP Status : problem is solved [optimal solution found]
9.98/10.08 c Total Time : 10.08
9.98/10.08 c solving : 10.08
9.98/10.08 c presolving : 0.04 (included in solving)
9.98/10.08 c reading : 0.01 (included in solving)
9.98/10.08 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
9.98/10.08 c Original Problem :
9.98/10.08 c Problem name : HOME/instance-3691591-1338022234.opb
9.98/10.08 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
9.98/10.08 c Constraints : 2707 initial, 2707 maximal
9.98/10.08 c Objective sense : minimize
9.98/10.08 c Presolved Problem :
9.98/10.08 c Problem name : t_HOME/instance-3691591-1338022234.opb
9.98/10.08 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
9.98/10.08 c Constraints : 2443 initial, 2855 maximal
9.98/10.08 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
9.98/10.08 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.98/10.08 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.98/10.08 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.98/10.08 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.98/10.08 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.98/10.08 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.98/10.08 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.98/10.08 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.98/10.08 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.98/10.08 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.98/10.08 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.98/10.08 c knapsack : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.98/10.08 c setppc : 0.00 0.00 0 0 0 0 0 121 0 0 0
9.98/10.08 c linear : 0.02 0.00 0 0 0 0 0 143 0 0 0
9.98/10.08 c logicor : 0.02 0.00 0 0 0 0 0 0 0 0 0
9.98/10.08 c root node : - - 0 - - 0 - - - - -
9.98/10.08 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
9.98/10.08 c integral : 0 0 0 0 513 0 3 0 24 657 0 0 390
9.98/10.08 c knapsack : 1 1 5 1500 1 0 0 188 5 1015 0 0 0
9.98/10.08 c setppc : 22 22 5 1497 1 0 0 4524 13 2574 0 0 0
9.98/10.08 c linear : 0+ 251 5 1479 0 0 0 10 0 164 0 0 0
9.98/10.08 c logicor : 2420+ 2581 5 1102 1 0 0 1622 13 3117 0 0 0
9.98/10.08 c countsols : 0 0 0 0 1 0 2 0 0 0 0 0 0
9.98/10.08 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
9.98/10.08 c integral : 8.36 0.00 0.00 0.00 8.36 0.00 0.00 0.00
9.98/10.08 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
9.98/10.08 c setppc : 0.01 0.00 0.00 0.01 0.00 0.00 0.00 0.00
9.98/10.08 c linear : 0.01 0.00 0.00 0.01 0.00 0.00 0.00 0.00
9.98/10.08 c logicor : 0.02 0.00 0.00 0.02 0.00 0.00 0.00 0.00
9.98/10.08 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
9.98/10.08 c Propagators : #Propagate #ResProp Cutoffs DomReds
9.98/10.08 c rootredcost : 0 0 0 0
9.98/10.08 c pseudoobj : 0 0 0 0
9.98/10.08 c vbounds : 0 0 0 0
9.98/10.08 c redcost : 518 0 0 0
9.98/10.08 c probing : 0 0 0 0
9.98/10.08 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
9.98/10.08 c rootredcost : 0.00 0.00 0.00 0.00 0.00
9.98/10.08 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
9.98/10.08 c vbounds : 0.00 0.00 0.00 0.00 0.00
9.98/10.08 c redcost : 0.00 0.00 0.00 0.00 0.00
9.98/10.08 c probing : 0.00 0.00 0.00 0.00 0.00
9.98/10.08 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
9.98/10.08 c propagation : 0.00 31 28 161 26.5 1 12.0 -
9.98/10.08 c infeasible LP : 0.01 111 94 591 35.4 0 0.0 0
9.98/10.08 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
9.98/10.08 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
9.98/10.08 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
9.98/10.08 c applied globally : - - - 161 15.7 - - -
9.98/10.08 c applied locally : - - - 7 42.7 - - -
9.98/10.08 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
9.98/10.08 c cut pool : 0.00 4 - - 306 - (maximal pool size: 516)
9.98/10.08 c closecuts : 0.00 0.00 0 0 0 0 0
9.98/10.08 c impliedbounds : 0.00 0.00 5 0 0 0 0
9.98/10.08 c intobj : 0.00 0.00 0 0 0 0 0
9.98/10.08 c gomory : 0.10 0.00 5 0 0 200 0
9.98/10.08 c cgmip : 0.00 0.00 0 0 0 0 0
9.98/10.08 c strongcg : 0.19 0.00 5 0 0 2500 0
9.98/10.08 c cmir : 0.00 0.00 0 0 0 0 0
9.98/10.08 c flowcover : 0.00 0.00 0 0 0 0 0
9.98/10.08 c clique : 0.00 0.00 5 0 0 0 0
9.98/10.08 c zerohalf : 0.00 0.00 0 0 0 0 0
9.98/10.08 c mcf : 0.00 0.00 1 0 0 0 0
9.98/10.08 c oddcycle : 0.00 0.00 0 0 0 0 0
9.98/10.08 c rapidlearning : 0.09 0.00 1 0 0 0 251
9.98/10.08 c Pricers : ExecTime SetupTime Calls Vars
9.98/10.08 c problem variables: 0.00 - 0 0
9.98/10.08 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
9.98/10.08 c relpscost : 8.36 0.00 512 24 657 0 0 390
9.98/10.08 c pscost : 0.00 0.00 0 0 0 0 0 0
9.98/10.08 c inference : 0.00 0.00 0 0 0 0 0 0
9.98/10.08 c mostinf : 0.00 0.00 0 0 0 0 0 0
9.98/10.08 c leastinf : 0.00 0.00 0 0 0 0 0 0
9.98/10.08 c fullstrong : 0.00 0.00 0 0 0 0 0 0
9.98/10.08 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
9.98/10.08 c random : 0.00 0.00 0 0 0 0 0 0
9.98/10.08 c Primal Heuristics : ExecTime SetupTime Calls Found
9.98/10.08 c LP solutions : 0.00 - - 1
9.98/10.08 c pseudo solutions : 0.00 - - 0
9.98/10.08 c smallcard : 0.00 0.00 0 0
9.98/10.08 c trivial : 0.00 0.00 1 0
9.98/10.08 c shiftandpropagate: 0.00 0.00 0 0
9.98/10.08 c simplerounding : 0.00 0.00 0 0
9.98/10.08 c zirounding : 0.00 0.00 0 0
9.98/10.08 c rounding : 0.00 0.00 0 0
9.98/10.08 c shifting : 0.00 0.00 0 0
9.98/10.08 c intshifting : 0.00 0.00 0 0
9.98/10.08 c oneopt : 0.00 0.00 0 0
9.98/10.08 c twoopt : 0.00 0.00 0 0
9.98/10.08 c indtwoopt : 0.00 0.00 0 0
9.98/10.08 c indoneopt : 0.00 0.00 0 0
9.98/10.08 c fixandinfer : 0.00 0.00 0 0
9.98/10.08 c feaspump : 0.00 0.00 0 0
9.98/10.08 c clique : 0.00 0.00 0 0
9.98/10.08 c indrounding : 0.00 0.00 0 0
9.98/10.08 c indcoefdiving : 0.00 0.00 0 0
9.98/10.08 c coefdiving : 0.00 0.00 0 0
9.98/10.08 c pscostdiving : 0.00 0.00 0 0
9.98/10.08 c nlpdiving : 0.00 0.00 0 0
9.98/10.08 c fracdiving : 0.00 0.00 0 0
9.98/10.08 c veclendiving : 0.00 0.00 0 0
9.98/10.08 c intdiving : 0.00 0.00 0 0
9.98/10.08 c actconsdiving : 0.00 0.00 0 0
9.98/10.08 c objpscostdiving : 0.00 0.00 0 0
9.98/10.08 c rootsoldiving : 0.00 0.00 0 0
9.98/10.08 c linesearchdiving : 0.00 0.00 0 0
9.98/10.08 c guideddiving : 0.00 0.00 0 0
9.98/10.08 c octane : 0.00 0.00 0 0
9.98/10.08 c rens : 0.00 0.00 0 0
9.98/10.08 c rins : 0.00 0.00 0 0
9.98/10.08 c localbranching : 0.00 0.00 0 0
9.98/10.08 c mutation : 0.00 0.00 0 0
9.98/10.08 c crossover : 0.00 0.00 0 0
9.98/10.08 c dins : 0.00 0.00 0 0
9.98/10.08 c vbounds : 0.00 0.00 0 0
9.98/10.08 c undercover : 0.00 0.00 0 0
9.98/10.08 c subnlp : 0.00 0.00 0 0
9.98/10.08 c trysol : 0.00 0.00 0 0
9.98/10.08 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
9.98/10.08 c primal LP : 0.00 1 0 0.00 - 0.00 1
9.98/10.08 c dual LP : 1.10 629 9177 14.59 8348.40 0.00 0
9.98/10.08 c lex dual LP : 0.00 0 0 0.00 -
9.98/10.08 c barrier LP : 0.00 0 0 0.00 - 0.00 0
9.98/10.08 c diving/probing LP: 0.00 0 0 0.00 -
9.98/10.08 c strong branching : 8.31 1874 73277 39.10 8816.34
9.98/10.08 c (at root node) : - 11 2633 239.36 -
9.98/10.08 c conflict analysis: 0.00 0 0 0.00 -
9.98/10.08 c B&B Tree :
9.98/10.08 c number of runs : 1
9.98/10.08 c nodes : 360
9.98/10.08 c nodes (total) : 360
9.98/10.08 c nodes left : 0
9.98/10.08 c max depth : 24
9.98/10.08 c max depth (total): 24
9.98/10.08 c backtracks : 33 (9.2%)
9.98/10.08 c delayed cutoffs : 2
9.98/10.08 c repropagations : 224 (270 domain reductions, 2 cutoffs)
9.98/10.08 c avg switch length: 3.22
9.98/10.08 c switching time : 0.03
9.98/10.08 c Solution :
9.98/10.08 c Solutions found : 1 (1 improvements)
9.98/10.08 c First Solution : +0.00000000000000e+00 (in run 1, after 360 nodes, 10.08 seconds, depth 10, found by <relaxation>)
9.98/10.08 c Primal Bound : +0.00000000000000e+00 (in run 1, after 360 nodes, 10.08 seconds, depth 10, found by <relaxation>)
9.98/10.08 c Dual Bound : +0.00000000000000e+00
9.98/10.08 c Gap : 0.00 %
9.98/10.08 c Root Dual Bound : +0.00000000000000e+00
9.98/10.08 c Root Iterations : 146
9.98/10.09 c Time complete: 10.08.
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL
This is runsolver version 3.3.1 (svn: 989)
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-3691591-1338022234/watcher-3691591-1338022234 -o /tmp/evaluation-result-3691591-1338022234/solver-3691591-1338022234 -C 1800 -W 1900 -M 15500 HOME/scip-2.1.1.4expfix.linux.x86_64.gnu.opt.spx -f HOME/instance-3691591-1338022234.opb -t 1800 -m 15500
running on 4 cores: 0,2,4,6
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.02 2.02 1.97 3/175 14889
/proc/meminfo: memFree=28280372/32873852 swapFree=6848/6848
[pid=14889] ppid=14887 vsize=11000 CPUtime=0 cores=0,2,4,6
/proc/14889/stat : 14889 (scip-2.1.1.4exp) R 14887 14889 14323 0 -1 4202496 1579 0 0 0 0 0 0 0 20 0 1 0 268349345 11264000 1533 33554432000 4194304 10219143 140737464222960 140735364836760 8891101 0 0 4096 0 0 0 0 17 4 0 0 0 0 0
/proc/14889/statm: 2750 1545 398 1471 0 1270 0
[startup+0.098433 s]
/proc/loadavg: 2.02 2.02 1.97 3/175 14889
/proc/meminfo: memFree=28280372/32873852 swapFree=6848/6848
[pid=14889] ppid=14887 vsize=32156 CPUtime=0.08 cores=0,2,4,6
/proc/14889/stat : 14889 (scip-2.1.1.4exp) R 14887 14889 14323 0 -1 4202496 6883 0 0 0 7 1 0 0 20 0 1 0 268349345 32927744 6535 33554432000 4194304 10219143 140737464222960 140735364836760 8891101 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/14889/statm: 8039 6558 773 1471 0 6559 0
Current children cumulated CPU time (s) 0.08
Current children cumulated vsize (KiB) 32156
[startup+0.100219 s]
/proc/loadavg: 2.02 2.02 1.97 3/175 14889
/proc/meminfo: memFree=28280372/32873852 swapFree=6848/6848
[pid=14889] ppid=14887 vsize=33832 CPUtime=0.08 cores=0,2,4,6
/proc/14889/stat : 14889 (scip-2.1.1.4exp) R 14887 14889 14323 0 -1 4202496 7604 0 0 0 7 1 0 0 20 0 1 0 268349345 34643968 7256 33554432000 4194304 10219143 140737464222960 140735364836760 8844210 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/14889/statm: 8458 7260 773 1471 0 6978 0
Current children cumulated CPU time (s) 0.08
Current children cumulated vsize (KiB) 33832
[startup+0.300256 s]
/proc/loadavg: 2.02 2.02 1.97 3/175 14889
/proc/meminfo: memFree=28280372/32873852 swapFree=6848/6848
[pid=14889] ppid=14887 vsize=48308 CPUtime=0.29 cores=0,2,4,6
/proc/14889/stat : 14889 (scip-2.1.1.4exp) R 14887 14889 14323 0 -1 4202496 11672 0 0 0 26 3 0 0 20 0 1 0 268349345 49467392 10616 33554432000 4194304 10219143 140737464222960 140737464217848 9026266 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/14889/statm: 12077 10616 814 1471 0 10597 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 48308
[startup+0.700221 s]
/proc/loadavg: 2.02 2.02 1.97 3/175 14889
/proc/meminfo: memFree=28280372/32873852 swapFree=6848/6848
[pid=14889] ppid=14887 vsize=48476 CPUtime=0.69 cores=0,2,4,6
/proc/14889/stat : 14889 (scip-2.1.1.4exp) R 14887 14889 14323 0 -1 4202496 11790 0 0 0 65 4 0 0 20 0 1 0 268349345 49639424 10734 33554432000 4194304 10219143 140737464222960 140737464217848 9026266 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/14889/statm: 12119 10734 817 1471 0 10639 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 48476
[startup+1.50022 s]
/proc/loadavg: 2.02 2.02 1.97 3/176 14890
/proc/meminfo: memFree=28240956/32873852 swapFree=6848/6848
[pid=14889] ppid=14887 vsize=48476 CPUtime=1.49 cores=0,2,4,6
/proc/14889/stat : 14889 (scip-2.1.1.4exp) R 14887 14889 14323 0 -1 4202496 11792 0 0 0 144 5 0 0 20 0 1 0 268349345 49639424 10736 33554432000 4194304 10219143 140737464222960 140737464216088 9008087 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/14889/statm: 12119 10736 819 1471 0 10639 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 48476
[startup+3.10022 s]
/proc/loadavg: 2.02 2.02 1.97 3/176 14890
/proc/meminfo: memFree=28240584/32873852 swapFree=6848/6848
[pid=14889] ppid=14887 vsize=48476 CPUtime=3.09 cores=0,2,4,6
/proc/14889/stat : 14889 (scip-2.1.1.4exp) R 14887 14889 14323 0 -1 4202496 11795 0 0 0 303 6 0 0 20 0 1 0 268349345 49639424 10739 33554432000 4194304 10219143 140737464222960 140737464216328 9026266 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/14889/statm: 12119 10739 822 1471 0 10639 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 48476
[startup+6.30022 s]
/proc/loadavg: 2.02 2.02 1.97 3/176 14890
/proc/meminfo: memFree=28240708/32873852 swapFree=6848/6848
[pid=14889] ppid=14887 vsize=48476 CPUtime=6.28 cores=0,2,4,6
/proc/14889/stat : 14889 (scip-2.1.1.4exp) R 14887 14889 14323 0 -1 4202496 11802 0 0 0 618 10 0 0 20 0 1 0 268349345 49639424 10807 33554432000 4194304 10219143 140737464222960 140737464216136 9026266 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/14889/statm: 12119 10807 823 1471 0 10639 0
Current children cumulated CPU time (s) 6.28
Current children cumulated vsize (KiB) 48476
Solver just ended. Dumping a history of the last processes samples
[startup+7.90023 s]
/proc/loadavg: 2.02 2.02 1.97 3/176 14890
/proc/meminfo: memFree=28240320/32873852 swapFree=6848/6848
[pid=14889] ppid=14887 vsize=48476 CPUtime=7.89 cores=0,2,4,6
/proc/14889/stat : 14889 (scip-2.1.1.4exp) R 14887 14889 14323 0 -1 4202496 11802 0 0 0 777 12 0 0 20 0 1 0 268349345 49639424 10807 33554432000 4194304 10219143 140737464222960 140737464216408 9026266 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/14889/statm: 12119 10807 823 1471 0 10639 0
Current children cumulated CPU time (s) 7.89
Current children cumulated vsize (KiB) 48476
[startup+8.70022 s]
/proc/loadavg: 2.02 2.02 1.97 3/176 14890
/proc/meminfo: memFree=28240452/32873852 swapFree=6848/6848
[pid=14889] ppid=14887 vsize=48476 CPUtime=8.69 cores=0,2,4,6
/proc/14889/stat : 14889 (scip-2.1.1.4exp) R 14887 14889 14323 0 -1 4202496 11802 0 0 0 856 13 0 0 20 0 1 0 268349345 49639424 10807 33554432000 4194304 10219143 140737464222960 140737464215944 9026266 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/14889/statm: 12119 10807 823 1471 0 10639 0
Current children cumulated CPU time (s) 8.69
Current children cumulated vsize (KiB) 48476
[startup+9.50023 s]
/proc/loadavg: 2.02 2.02 1.97 3/176 14890
/proc/meminfo: memFree=28240452/32873852 swapFree=6848/6848
[pid=14889] ppid=14887 vsize=48476 CPUtime=9.49 cores=0,2,4,6
/proc/14889/stat : 14889 (scip-2.1.1.4exp) R 14887 14889 14323 0 -1 4202496 11803 0 0 0 935 14 0 0 20 0 1 0 268349345 49639424 10808 33554432000 4194304 10219143 140737464222960 140737464216408 9026266 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/14889/statm: 12119 10808 824 1471 0 10639 0
Current children cumulated CPU time (s) 9.49
Current children cumulated vsize (KiB) 48476
[startup+9.90614 s]
/proc/loadavg: 2.02 2.02 1.97 3/176 14890
/proc/meminfo: memFree=28240452/32873852 swapFree=6848/6848
[pid=14889] ppid=14887 vsize=48476 CPUtime=9.89 cores=0,2,4,6
/proc/14889/stat : 14889 (scip-2.1.1.4exp) R 14887 14889 14323 0 -1 4202496 11803 0 0 0 975 14 0 0 20 0 1 0 268349345 49639424 10808 33554432000 4194304 10219143 140737464222960 140737464216408 9026266 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/14889/statm: 12119 10808 824 1471 0 10639 0
Current children cumulated CPU time (s) 9.89
Current children cumulated vsize (KiB) 48476
[startup+10.0002 s]
/proc/loadavg: 2.02 2.02 1.97 3/176 14890
/proc/meminfo: memFree=28240452/32873852 swapFree=6848/6848
[pid=14889] ppid=14887 vsize=48476 CPUtime=9.98 cores=0,2,4,6
/proc/14889/stat : 14889 (scip-2.1.1.4exp) R 14887 14889 14323 0 -1 4202496 11803 0 0 0 984 14 0 0 20 0 1 0 268349345 49639424 10808 33554432000 4194304 10219143 140737464222960 140737464216408 9026266 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0
/proc/14889/statm: 12119 10808 824 1471 0 10639 0
Current children cumulated CPU time (s) 9.98
Current children cumulated vsize (KiB) 48476
Child status: 0
Real time (s): 10.0999
CPU time (s): 10.0905
CPU user time (s): 9.93949
CPU system time (s): 0.150977
CPU usage (%): 99.9067
Max. virtual memory (cumulated for all children) (KiB): 48476
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 9.93949
system time used= 0.150977
maximum resident set size= 44924
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 11809
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= 9
involuntary context switches= 12
runsolver used 0.016997 second user time and 0.039993 second system time
The end