0.00/0.00 c SCIP version 2.0.1.4 [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-3452958-1307069318.opb>
0.01/0.02 c original problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2707 constraints
0.01/0.02 c problem read
0.01/0.02 c No objective function, only one solution is needed.
0.01/0.02 c presolving settings loaded
0.01/0.03 c presolving:
0.01/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.01/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.01/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.01/0.06 c presolving (4 rounds):
0.01/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.01/0.06 c 242 implications, 22 cliques
0.01/0.06 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2443 constraints
0.01/0.06 c 1 constraints of type <knapsack>
0.01/0.06 c 22 constraints of type <setppc>
0.01/0.06 c 2420 constraints of type <logicor>
0.01/0.06 c transformed objective value is always integral (scale: 1)
0.01/0.06 c Presolving Time: 0.04
0.01/0.06 c - non default parameters ----------------------------------------------------------------------
0.01/0.06 c # SCIP version 2.0.1.4
0.01/0.06 c
0.01/0.06 c # frequency for displaying node information lines
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.06 c display/freq = 10000
0.01/0.06 c
0.01/0.06 c # maximal time in seconds to run
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.06 c limits/time = 1800
0.01/0.06 c
0.01/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.06 c limits/memory = 13950
0.01/0.06 c
0.01/0.06 c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06 c limits/solutions = 1
0.01/0.06 c
0.01/0.06 c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.06 c separating/maxrounds = 1
0.01/0.06 c
0.01/0.06 c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06 c separating/maxroundsroot = 5
0.01/0.06 c
0.01/0.06 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.01/0.06 c # [type: int, range: [1,2], default: 1]
0.01/0.06 c timing/clocktype = 2
0.01/0.06 c
0.01/0.06 c # belongs reading time to solving time?
0.01/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06 c timing/reading = TRUE
0.01/0.06 c
0.01/0.06 c # should presolving try to simplify inequalities
0.01/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06 c constraints/linear/simplifyinequalities = TRUE
0.01/0.06 c
0.01/0.06 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.01/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06 c constraints/indicator/addCouplingCons = TRUE
0.01/0.06 c
0.01/0.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.06 c constraints/knapsack/disaggregation = FALSE
0.01/0.06 c
0.01/0.06 c # should presolving try to simplify knapsacks
0.01/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.06 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.06 c
0.01/0.06 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06 c presolving/probing/maxrounds = 0
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/coefdiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/coefdiving/maxlpiterquot = 0.075
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/coefdiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.06 c heuristics/crossover/freq = -1
0.01/0.06 c
0.01/0.06 c # number of nodes added to the contingent of the total nodes
0.01/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.06 c heuristics/crossover/nodesofs = 750
0.01/0.06 c
0.01/0.06 c # number of nodes without incumbent change that heuristic should wait
0.01/0.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.06 c heuristics/crossover/nwaitingnodes = 100
0.01/0.06 c
0.01/0.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.06 c # [type: real, range: [0,1], default: 0.1]
0.01/0.06 c heuristics/crossover/nodesquot = 0.15
0.01/0.06 c
0.01/0.06 c # minimum percentage of integer variables that have to be fixed
0.01/0.06 c # [type: real, range: [0,1], default: 0.666]
0.01/0.06 c heuristics/crossover/minfixingrate = 0.5
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.06 c heuristics/feaspump/freq = -1
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/feaspump/maxlpiterofs = 2000
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/fracdiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/fracdiving/maxlpiterquot = 0.075
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/fracdiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/guideddiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/guideddiving/maxlpiterquot = 0.075
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/guideddiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/intdiving/maxlpiterquot = 0.075
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/intshifting/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/linesearchdiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.06 c heuristics/objpscostdiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.06 c # [type: real, range: [0,1], default: 0.01]
0.01/0.06 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c heuristics/oneopt/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/pscostdiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/pscostdiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06 c heuristics/rens/freq = -1
0.01/0.06 c
0.01/0.06 c # minimum percentage of integer variables that have to be fixable
0.01/0.06 c # [type: real, range: [0,1], default: 0.5]
0.01/0.06 c heuristics/rens/minfixingrate = 0.3
0.01/0.06 c
0.01/0.06 c # number of nodes added to the contingent of the total nodes
0.01/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.06 c heuristics/rens/nodesofs = 2000
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.06 c heuristics/rootsoldiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.06 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c heuristics/rounding/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06 c heuristics/shiftandpropagate/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/shifting/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c heuristics/simplerounding/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c heuristics/subnlp/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06 c heuristics/trivial/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c heuristics/trysol/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06 c heuristics/undercover/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.06 c heuristics/veclendiving/freq = -1
0.01/0.06 c
0.01/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.06 c heuristics/veclendiving/maxlpiterquot = 0.075
0.01/0.06 c
0.01/0.06 c # additional number of allowed LP iterations
0.01/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.06 c heuristics/veclendiving/maxlpiterofs = 1500
0.01/0.06 c
0.01/0.06 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.06 c heuristics/zirounding/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06 c separating/cmir/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.06 c separating/flowcover/freq = -1
0.01/0.06 c
0.01/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.06 c separating/rapidlearning/freq = 0
0.01/0.06 c
0.01/0.06 c -----------------------------------------------------------------------------------------------
0.01/0.06 c start solving
0.01/0.06 c
0.01/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.01/0.07 c 0.1s| 1 | 0 | 76 | - |3626k| 0 | 36 | 231 |2443 | 231 |2443 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.09/0.16 c 0.2s| 1 | 0 | 90 | - |3931k| 0 | 43 | 231 |2488 | 231 |2454 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 105 | - |4371k| 0 | 46 | 231 |2488 | 231 |2458 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.34 c 0.3s| 1 | 0 | 111 | - |4666k| 0 | 45 | 231 |2488 | 231 |2460 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.46 c 0.5s| 1 | 0 | 129 | - |4937k| 0 | 46 | 231 |2488 | 231 |2463 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.59 c 0.6s| 1 | 0 | 151 | - |5207k| 0 | 50 | 231 |2488 | 231 |2467 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.76 c 0.8s| 1 | 2 | 151 | - |5207k| 0 | 50 | 231 |2488 | 231 |2467 | 24 | 0 | 11 | 0.000000e+00 | -- | Inf
11.89/12.00 c *12.0s| 601 | 0 | 16002 | 26.4 |5496k| 23 | - | 231 |2788 | 231 |2451 | 24 | 305 |1861 | 0.000000e+00 | 0.000000e+00 | 0.00%
11.89/12.00 c
11.89/12.00 c SCIP Status : problem is solved [optimal solution found]
11.89/12.00 c Solving Time (sec) : 12.01
11.89/12.01 c Solving Nodes : 601
11.89/12.01 c Primal Bound : +0.00000000000000e+00 (1 solutions)
11.89/12.01 c Dual Bound : +0.00000000000000e+00
11.89/12.01 c Gap : 0.00 %
11.89/12.01 s SATISFIABLE
11.89/12.01 v x221 -x211 -x201 -x191 -x181 -x171 -x161 -x151 -x141 -x131 -x231 -x210 -x200 x190 -x180 -x170 -x160 -x150 -x140 -x130 -x230 -x220
11.89/12.01 v -x199 -x189 -x179 -x169 -x159 -x149 x139 -x129 -x229 -x219 -x209 -x188 -x178 x168 -x158 -x148 -x138 -x128 -x228 -x218 -x208
11.89/12.01 v -x198 x177 -x167 -x157 -x147 -x137 -x127 -x227 -x217 -x207 -x197 -x187 -x166 -x156 x146 -x136 -x126 -x226 -x216 -x206 -x196
11.89/12.01 v -x186 -x176 -x155 -x145 -x135 x125 -x225 -x215 x205 -x195 -x185 -x175 -x165 -x144 -x134 -x124 -x224 -x214 -x204 x194 -x184 -x174
11.89/12.01 v -x164 -x154 -x133 -x123 x223 -x213 -x203 -x193 -x183 -x173 -x163 -x153 -x143 -x122 -x222 -x212 -x202 -x192 -x182 -x172 -x162
11.89/12.01 v x152 -x142 -x132 -x121 x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 x106 -x105 -x104
11.89/12.01 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
11.89/12.01 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
11.89/12.01 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
11.89/12.01 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
11.89/12.01 v -x1
11.89/12.01 c SCIP Status : problem is solved [optimal solution found]
11.89/12.01 c Total Time : 12.01
11.89/12.01 c solving : 12.01
11.89/12.01 c presolving : 0.04 (included in solving)
11.89/12.01 c reading : 0.02 (included in solving)
11.89/12.01 c Original Problem :
11.89/12.01 c Problem name : HOME/instance-3452958-1307069318.opb
11.89/12.01 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
11.89/12.01 c Constraints : 2707 initial, 2707 maximal
11.89/12.01 c Presolved Problem :
11.89/12.01 c Problem name : t_HOME/instance-3452958-1307069318.opb
11.89/12.01 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
11.89/12.01 c Constraints : 2443 initial, 2788 maximal
11.89/12.01 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
11.89/12.01 c trivial : 0.00 0 0 0 0 0 0 0 0 0
11.89/12.01 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
11.89/12.01 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
11.89/12.01 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
11.89/12.01 c implics : 0.00 0 0 0 0 0 0 0 0 0
11.89/12.01 c probing : 0.00 0 0 0 0 0 0 0 0 0
11.89/12.01 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
11.89/12.01 c setppc : 0.00 0 0 0 0 0 121 0 0 0
11.89/12.01 c linear : 0.01 0 0 0 0 0 143 0 0 0
11.89/12.01 c logicor : 0.01 0 0 0 0 0 0 0 0 0
11.89/12.01 c root node : - 0 - - 0 - - - - -
11.89/12.01 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
11.89/12.01 c integral : 0 0 0 635 0 3 0 32 649 0 0 636
11.89/12.01 c knapsack : 1 5 2207 1 0 0 107 4 787 0 0 0
11.89/12.01 c setppc : 22 5 2203 1 0 0 7341 12 3710 0 0 0
11.89/12.01 c linear : 0+ 5 2117 0 0 0 5 0 51 0 0 0
11.89/12.01 c logicor : 2420+ 5 1593 1 0 0 1464 7 4827 0 0 0
11.89/12.01 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
11.89/12.01 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
11.89/12.01 c integral : 9.35 0.00 0.00 9.35 0.00 0.00 0.00
11.89/12.01 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
11.89/12.01 c setppc : 0.01 0.00 0.01 0.00 0.00 0.00 0.00
11.89/12.01 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
11.89/12.01 c logicor : 0.02 0.00 0.02 0.00 0.00 0.00 0.00
11.89/12.01 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
11.89/12.01 c Propagators : #Propagate #Resprop Cutoffs DomReds
11.89/12.01 c vbounds : 0 0 0 0
11.89/12.01 c rootredcost : 0 0 0 0
11.89/12.01 c pseudoobj : 0 0 0 0
11.89/12.01 c Propagator Timings : TotalTime Propagate Resprop
11.89/12.01 c vbounds : 0.00 0.00 0.00
11.89/12.01 c rootredcost : 0.00 0.00 0.00
11.89/12.01 c pseudoobj : 0.00 0.00 0.00
11.89/12.01 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
11.89/12.01 c propagation : 0.00 23 22 137 21.4 0 0.0 -
11.89/12.01 c infeasible LP : 0.02 227 220 1386 31.4 3 11.7 0
11.89/12.01 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
11.89/12.01 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
11.89/12.01 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
11.89/12.01 c applied globally : - - - 302 14.7 - - -
11.89/12.01 c applied locally : - - - 3 35.3 - - -
11.89/12.01 c Separators : Time Calls Cutoffs DomReds Cuts Conss
11.89/12.01 c cut pool : 0.00 4 - - 122 - (maximal pool size: 502)
11.89/12.01 c redcost : 0.00 376 0 0 0 0
11.89/12.01 c impliedbounds : 0.00 5 0 0 0 0
11.89/12.01 c intobj : 0.00 0 0 0 0 0
11.89/12.01 c gomory : 0.27 5 0 0 1251 0
11.89/12.01 c cgmip : 0.00 0 0 0 0 0
11.89/12.01 c closecuts : 0.00 0 0 0 0 0
11.89/12.01 c strongcg : 0.20 5 0 0 2343 0
11.89/12.01 c cmir : 0.00 0 0 0 0 0
11.89/12.01 c flowcover : 0.00 0 0 0 0 0
11.89/12.01 c clique : 0.00 5 0 0 0 0
11.89/12.01 c zerohalf : 0.00 0 0 0 0 0
11.89/12.01 c mcf : 0.00 1 0 0 0 0
11.89/12.01 c oddcycle : 0.00 0 0 0 0 0
11.89/12.01 c rapidlearning : 0.04 1 0 0 0 45
11.89/12.01 c Pricers : Time Calls Vars
11.89/12.01 c problem variables: 0.00 0 0
11.89/12.01 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
11.89/12.01 c relpscost : 9.35 634 32 649 0 0 636
11.89/12.01 c pscost : 0.00 0 0 0 0 0 0
11.89/12.01 c inference : 0.00 0 0 0 0 0 0
11.89/12.01 c mostinf : 0.00 0 0 0 0 0 0
11.89/12.01 c leastinf : 0.00 0 0 0 0 0 0
11.89/12.01 c fullstrong : 0.00 0 0 0 0 0 0
11.89/12.01 c allfullstrong : 0.00 0 0 0 0 0 0
11.89/12.01 c random : 0.00 0 0 0 0 0 0
11.89/12.01 c Primal Heuristics : Time Calls Found
11.89/12.01 c LP solutions : 0.00 - 1
11.89/12.01 c pseudo solutions : 0.00 - 0
11.89/12.01 c trivial : 0.00 1 0
11.89/12.01 c shiftandpropagate: 0.00 0 0
11.89/12.01 c simplerounding : 0.00 0 0
11.89/12.01 c zirounding : 0.00 0 0
11.89/12.01 c rounding : 0.00 0 0
11.89/12.01 c shifting : 0.00 0 0
11.89/12.01 c intshifting : 0.00 0 0
11.89/12.01 c oneopt : 0.00 0 0
11.89/12.01 c twoopt : 0.00 0 0
11.89/12.01 c fixandinfer : 0.00 0 0
11.89/12.01 c feaspump : 0.00 0 0
11.89/12.01 c clique : 0.00 0 0
11.89/12.01 c coefdiving : 0.00 0 0
11.89/12.01 c pscostdiving : 0.00 0 0
11.89/12.01 c fracdiving : 0.00 0 0
11.89/12.01 c veclendiving : 0.00 0 0
11.89/12.01 c intdiving : 0.00 0 0
11.89/12.01 c actconsdiving : 0.00 0 0
11.89/12.01 c objpscostdiving : 0.00 0 0
11.89/12.01 c rootsoldiving : 0.00 0 0
11.89/12.01 c linesearchdiving : 0.00 0 0
11.89/12.01 c guideddiving : 0.00 0 0
11.89/12.01 c octane : 0.00 0 0
11.89/12.01 c rens : 0.00 0 0
11.89/12.01 c rins : 0.00 0 0
11.89/12.01 c localbranching : 0.00 0 0
11.89/12.01 c mutation : 0.00 0 0
11.89/12.01 c crossover : 0.00 0 0
11.89/12.01 c dins : 0.00 0 0
11.89/12.01 c vbounds : 0.00 0 0
11.89/12.01 c undercover : 0.00 0 0
11.89/12.01 c subnlp : 0.00 0 0
11.89/12.01 c trysol : 0.00 0 0
11.89/12.01 c LP : Time Calls Iterations Iter/call Iter/sec
11.89/12.01 c primal LP : 0.00 0 0 0.00 -
11.89/12.01 c dual LP : 1.87 864 16002 18.52 8541.22
11.89/12.01 c lex dual LP : 0.00 0 0 0.00 -
11.89/12.01 c barrier LP : 0.00 0 0 0.00 -
11.89/12.01 c diving/probing LP: 0.00 0 0 0.00 -
11.89/12.01 c strong branching : 9.31 1861 80301 43.15 8626.88
11.89/12.01 c (at root node) : - 11 1639 149.00 -
11.89/12.01 c conflict analysis: 0.00 0 0 0.00 -
11.89/12.01 c B&B Tree :
11.89/12.01 c number of runs : 1
11.89/12.01 c nodes : 601
11.89/12.01 c nodes (total) : 601
11.89/12.01 c nodes left : 0
11.89/12.01 c max depth : 23
11.89/12.01 c max depth (total): 23
11.89/12.01 c backtracks : 67 (11.1%)
11.89/12.01 c delayed cutoffs : 0
11.89/12.01 c repropagations : 415 (668 domain reductions, 0 cutoffs)
11.89/12.01 c avg switch length: 3.12
11.89/12.01 c switching time : 0.03
11.89/12.01 c Solution :
11.89/12.01 c Solutions found : 1 (1 improvements)
11.89/12.01 c First Solution : +0.00000000000000e+00 (in run 1, after 601 nodes, 12.00 seconds, depth 23, found by <relaxation>)
11.89/12.01 c Primal Bound : +0.00000000000000e+00 (in run 1, after 601 nodes, 12.00 seconds, depth 23, found by <relaxation>)
11.89/12.01 c Dual Bound : +0.00000000000000e+00
11.89/12.01 c Gap : 0.00 %
11.89/12.01 c Root Dual Bound : +0.00000000000000e+00
11.89/12.01 c Root Iterations : 151
11.89/12.01 c Time complete: 12.01.
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-3452958-1307069318/watcher-3452958-1307069318 -o /tmp/evaluation-result-3452958-1307069318/solver-3452958-1307069318 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3452958-1307069318.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.12 2.04 2.01 2/498 10455
/proc/meminfo: memFree=26725120/32950928 swapFree=34421304/67111528
[pid=10455] ppid=10453 vsize=10440 CPUtime=0 cores=1,3,5,7
/proc/10455/stat : 10455 (scip-2.0.1.4.li) R 10453 10455 8661 0 -1 4202496 1605 0 0 0 0 0 0 0 19 0 1 0 897162468 10690560 1559 33554432000 4194304 9128323 140736696552480 18446744073709551615 6886064 0 0 4096 0 0 0 0 17 5 0 0 0
/proc/10455/statm: 2610 1559 397 1205 0 1401 0
[startup+0.019533 s]
/proc/loadavg: 2.12 2.04 2.01 2/498 10455
/proc/meminfo: memFree=26725120/32950928 swapFree=34421304/67111528
[pid=10455] ppid=10453 vsize=11248 CPUtime=0.01 cores=1,3,5,7
/proc/10455/stat : 10455 (scip-2.0.1.4.li) R 10453 10455 8661 0 -1 4202496 1792 0 0 0 1 0 0 0 19 0 1 0 897162468 11517952 1746 33554432000 4194304 9128323 140736696552480 18446744073709551615 8011952 0 0 4096 0 0 0 0 17 5 0 0 0
/proc/10455/statm: 2812 1746 397 1205 0 1603 0
Current children cumulated CPU time (s) 0.01
Current children cumulated vsize (KiB) 11248
[startup+0.100588 s]
/proc/loadavg: 2.12 2.04 2.01 2/498 10455
/proc/meminfo: memFree=26725120/32950928 swapFree=34421304/67111528
[pid=10455] ppid=10453 vsize=26572 CPUtime=0.09 cores=1,3,5,7
/proc/10455/stat : 10455 (scip-2.0.1.4.li) R 10453 10455 8661 0 -1 4202496 5924 0 0 0 8 1 0 0 18 0 1 0 897162468 27209728 5580 33554432000 4194304 9128323 140736696552480 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/10455/statm: 6643 5580 651 1205 0 5434 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 26572
[startup+0.300555 s]
/proc/loadavg: 2.12 2.04 2.01 2/498 10455
/proc/meminfo: memFree=26725120/32950928 swapFree=34421304/67111528
[pid=10455] ppid=10453 vsize=40628 CPUtime=0.29 cores=1,3,5,7
/proc/10455/stat : 10455 (scip-2.0.1.4.li) R 10453 10455 8661 0 -1 4202496 9570 0 0 0 27 2 0 0 18 0 1 0 897162468 41603072 8871 33554432000 4194304 9128323 140736696552480 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/10455/statm: 10157 8871 706 1205 0 8948 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 40628
[startup+0.700479 s]
/proc/loadavg: 2.12 2.04 2.01 2/498 10455
/proc/meminfo: memFree=26725120/32950928 swapFree=34421304/67111528
[pid=10455] ppid=10453 vsize=40860 CPUtime=0.69 cores=1,3,5,7
/proc/10455/stat : 10455 (scip-2.0.1.4.li) R 10453 10455 8661 0 -1 4202496 9683 0 0 0 65 4 0 0 18 0 1 0 897162468 41840640 8984 33554432000 4194304 9128323 140736696552480 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/10455/statm: 10215 8984 714 1205 0 9006 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 40860
[startup+1.50033 s]
/proc/loadavg: 2.12 2.04 2.01 5/499 10456
/proc/meminfo: memFree=26691132/32950928 swapFree=34421304/67111528
[pid=10455] ppid=10453 vsize=40860 CPUtime=1.49 cores=1,3,5,7
/proc/10455/stat : 10455 (scip-2.0.1.4.li) R 10453 10455 8661 0 -1 4202496 9684 0 0 0 140 9 0 0 19 0 1 0 897162468 41840640 8985 33554432000 4194304 9128323 140736696552480 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/10455/statm: 10215 8985 715 1205 0 9006 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 40860
[startup+3.10103 s]
/proc/loadavg: 2.12 2.04 2.01 5/499 10456
/proc/meminfo: memFree=26690016/32950928 swapFree=34421304/67111528
[pid=10455] ppid=10453 vsize=40860 CPUtime=3.09 cores=1,3,5,7
/proc/10455/stat : 10455 (scip-2.0.1.4.li) R 10453 10455 8661 0 -1 4202496 9689 0 0 0 294 15 0 0 25 0 1 0 897162468 41840640 8990 33554432000 4194304 9128323 140736696552480 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/10455/statm: 10215 8990 715 1205 0 9006 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 40860
[startup+6.30044 s]
/proc/loadavg: 2.11 2.04 2.01 5/499 10456
/proc/meminfo: memFree=26689220/32950928 swapFree=34421304/67111528
[pid=10455] ppid=10453 vsize=40860 CPUtime=6.29 cores=1,3,5,7
/proc/10455/stat : 10455 (scip-2.0.1.4.li) R 10453 10455 8661 0 -1 4202496 9689 0 0 0 602 27 0 0 25 0 1 0 897162468 41840640 8990 33554432000 4194304 9128323 140736696552480 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/10455/statm: 10215 8990 715 1205 0 9006 0
Current children cumulated CPU time (s) 6.29
Current children cumulated vsize (KiB) 40860
Solver just ended. Dumping a history of the last processes samples
[startup+9.50085 s]
/proc/loadavg: 2.10 2.04 2.01 4/499 10456
/proc/meminfo: memFree=26688080/32950928 swapFree=34421304/67111528
[pid=10455] ppid=10453 vsize=40860 CPUtime=9.49 cores=1,3,5,7
/proc/10455/stat : 10455 (scip-2.0.1.4.li) R 10453 10455 8661 0 -1 4202496 9721 0 0 0 909 40 0 0 25 0 1 0 897162468 41840640 9022 33554432000 4194304 9128323 140736696552480 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/10455/statm: 10215 9022 715 1205 0 9006 0
Current children cumulated CPU time (s) 9.49
Current children cumulated vsize (KiB) 40860
[startup+11.1006 s]
/proc/loadavg: 2.10 2.04 2.01 5/499 10456
/proc/meminfo: memFree=26687740/32950928 swapFree=34421304/67111528
[pid=10455] ppid=10453 vsize=40860 CPUtime=11.1 cores=1,3,5,7
/proc/10455/stat : 10455 (scip-2.0.1.4.li) R 10453 10455 8661 0 -1 4202496 9724 0 0 0 1064 46 0 0 25 0 1 0 897162468 41840640 9025 33554432000 4194304 9128323 140736696552480 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/10455/statm: 10215 9025 715 1205 0 9006 0
Current children cumulated CPU time (s) 11.1
Current children cumulated vsize (KiB) 40860
[startup+11.5005 s]
/proc/loadavg: 2.10 2.04 2.01 5/499 10456
/proc/meminfo: memFree=26687740/32950928 swapFree=34421304/67111528
[pid=10455] ppid=10453 vsize=40860 CPUtime=11.49 cores=1,3,5,7
/proc/10455/stat : 10455 (scip-2.0.1.4.li) R 10453 10455 8661 0 -1 4202496 9724 0 0 0 1102 47 0 0 25 0 1 0 897162468 41840640 9025 33554432000 4194304 9128323 140736696552480 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/10455/statm: 10215 9025 715 1205 0 9006 0
Current children cumulated CPU time (s) 11.49
Current children cumulated vsize (KiB) 40860
[startup+11.9004 s]
/proc/loadavg: 2.10 2.04 2.01 5/499 10456
/proc/meminfo: memFree=26687740/32950928 swapFree=34421304/67111528
[pid=10455] ppid=10453 vsize=40860 CPUtime=11.89 cores=1,3,5,7
/proc/10455/stat : 10455 (scip-2.0.1.4.li) R 10453 10455 8661 0 -1 4202496 9724 0 0 0 1141 48 0 0 25 0 1 0 897162468 41840640 9025 33554432000 4194304 9128323 140736696552480 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/10455/statm: 10215 9025 715 1205 0 9006 0
Current children cumulated CPU time (s) 11.89
Current children cumulated vsize (KiB) 40860
[startup+12.0004 s]
/proc/loadavg: 2.10 2.04 2.01 5/499 10456
/proc/meminfo: memFree=26687616/32950928 swapFree=34421304/67111528
[pid=10455] ppid=10453 vsize=40860 CPUtime=12 cores=1,3,5,7
/proc/10455/stat : 10455 (scip-2.0.1.4.li) R 10453 10455 8661 0 -1 4202496 9724 0 0 0 1151 49 0 0 25 0 1 0 897162468 41840640 9025 33554432000 4194304 9128323 140736696552480 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/10455/statm: 10215 9025 715 1205 0 9006 0
Current children cumulated CPU time (s) 12
Current children cumulated vsize (KiB) 40860
Child status: 0
Real time (s): 12.0187
CPU time (s): 12.0192
CPU user time (s): 11.5252
CPU system time (s): 0.493924
CPU usage (%): 100.004
Max. virtual memory (cumulated for all children) (KiB): 40860
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 11.5252
system time used= 0.493924
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 9731
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= 6
involuntary context switches= 18
runsolver used 0.058991 second user time and 0.159975 second system time
The end