0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-3489213-1307753045.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.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.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 = 1797
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.06 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.06 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 | - |4140k| 0 | 43 | 231 |2491 | 231 |2454 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 105 | - |4586k| 0 | 46 | 231 |2491 | 231 |2458 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.32 c 0.3s| 1 | 0 | 111 | - |4882k| 0 | 45 | 231 |2491 | 231 |2460 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.44 c 0.4s| 1 | 0 | 129 | - |5148k| 0 | 46 | 231 |2491 | 231 |2463 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.57 c 0.6s| 1 | 0 | 151 | - |5418k| 0 | 50 | 231 |2491 | 231 |2467 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.79/0.88 c 0.9s| 1 | 2 | 151 | - |5419k| 0 | 50 | 231 |2491 | 231 |2467 | 24 | 0 | 12 | 0.000000e+00 | -- | Inf
12.29/12.34 c *12.3s| 765 | 0 | 18059 | 23.4 |5756k| 26 | - | 231 |2919 | 231 |2451 | 24 | 434 |1654 | 0.000000e+00 | 0.000000e+00 | 0.00%
12.29/12.34 c
12.29/12.34 c SCIP Status : problem is solved [optimal solution found]
12.29/12.34 c Solving Time (sec) : 12.34
12.29/12.34 c Solving Nodes : 765
12.29/12.34 c Primal Bound : +0.00000000000000e+00 (1 solutions)
12.29/12.34 c Dual Bound : +0.00000000000000e+00
12.29/12.34 c Gap : 0.00 %
12.29/12.34 s SATISFIABLE
12.29/12.34 v -x221 -x211 -x201 -x191 -x181 -x171 -x161 -x151 x141 -x131 -x231 -x210 -x200 -x190 -x180 -x170 -x160 x150 -x140 -x130 -x230 x220
12.29/12.34 v -x199 -x189 -x179 -x169 -x159 -x149 -x139 -x129 -x229 -x219 -x209 -x188 -x178 -x168 -x158 -x148 -x138 x128 -x228 -x218 x208
12.29/12.34 v -x198 -x177 -x167 -x157 -x147 -x137 -x127 -x227 -x217 -x207 -x197 x187 -x166 -x156 -x146 -x136 -x126 -x226 -x216 -x206 -x196
12.29/12.34 v -x186 -x176 x155 -x145 -x135 -x125 -x225 -x215 -x205 -x195 -x185 x175 -x165 -x144 -x134 -x124 x224 -x214 -x204 -x194 -x184 -x174
12.29/12.34 v -x164 -x154 -x133 -x123 -x223 -x213 -x203 x193 -x183 -x173 -x163 -x153 -x143 -x122 -x222 -x212 -x202 -x192 -x182 -x172 x162
12.29/12.34 v -x152 -x142 -x132 -x121 -x120 x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 x109 -x108 -x107 -x106 -x105 -x104
12.29/12.34 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
12.29/12.34 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
12.29/12.34 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
12.29/12.34 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
12.29/12.34 v -x1
12.29/12.34 c SCIP Status : problem is solved [optimal solution found]
12.29/12.34 c Total Time : 12.34
12.29/12.34 c solving : 12.34
12.29/12.34 c presolving : 0.03 (included in solving)
12.29/12.34 c reading : 0.02 (included in solving)
12.29/12.34 c Original Problem :
12.29/12.34 c Problem name : HOME/instance-3489213-1307753045.opb
12.29/12.34 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
12.29/12.34 c Constraints : 2707 initial, 2707 maximal
12.29/12.34 c Presolved Problem :
12.29/12.34 c Problem name : t_HOME/instance-3489213-1307753045.opb
12.29/12.34 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
12.29/12.34 c Constraints : 2443 initial, 2919 maximal
12.29/12.34 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
12.29/12.34 c trivial : 0.00 0 0 0 0 0 0 0 0 0
12.29/12.34 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
12.29/12.34 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
12.29/12.34 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
12.29/12.34 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
12.29/12.34 c implics : 0.00 0 0 0 0 0 0 0 0 0
12.29/12.34 c probing : 0.00 0 0 0 0 0 0 0 0 0
12.29/12.34 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
12.29/12.34 c setppc : 0.00 0 0 0 0 0 121 0 0 0
12.29/12.34 c linear : 0.01 0 0 0 0 0 143 0 0 0
12.29/12.34 c logicor : 0.01 0 0 0 0 0 0 0 0 0
12.29/12.34 c root node : - 0 - - 0 - - - - -
12.29/12.34 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
12.29/12.34 c integral : 0 0 0 697 0 3 0 28 639 0 0 792
12.29/12.34 c knapsack : 1 5 2859 1 0 0 222 11 1411 0 0 0
12.29/12.34 c setppc : 22 5 2852 1 0 0 10130 26 4317 0 0 0
12.29/12.34 c linear : 0+ 5 2447 0 0 0 0 0 35 0 0 0
12.29/12.34 c logicor : 2420+ 5 1800 1 0 0 2282 9 5353 0 0 0
12.29/12.34 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
12.29/12.34 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
12.29/12.34 c integral : 9.46 0.00 0.00 9.46 0.00 0.00 0.00
12.29/12.34 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
12.29/12.34 c setppc : 0.01 0.00 0.01 0.00 0.00 0.00 0.00
12.29/12.34 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
12.29/12.34 c logicor : 0.03 0.00 0.02 0.00 0.00 0.00 0.00
12.29/12.34 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
12.29/12.34 c Propagators : #Propagate #Resprop Cutoffs DomReds
12.29/12.34 c vbounds : 0 0 0 0
12.29/12.34 c rootredcost : 0 0 0 0
12.29/12.34 c pseudoobj : 0 0 0 0
12.29/12.34 c Propagator Timings : TotalTime Propagate Resprop
12.29/12.34 c vbounds : 0.00 0.00 0.00
12.29/12.34 c rootredcost : 0.00 0.00 0.00
12.29/12.34 c pseudoobj : 0.00 0.00 0.00
12.29/12.34 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
12.29/12.34 c propagation : 0.00 46 46 296 21.0 0 0.0 -
12.29/12.34 c infeasible LP : 0.02 300 279 1817 32.9 1 21.0 0
12.29/12.34 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
12.29/12.34 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
12.29/12.34 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
12.29/12.34 c applied globally : - - - 433 15.0 - - -
12.29/12.34 c applied locally : - - - 1 53.0 - - -
12.29/12.34 c Separators : Time Calls Cutoffs DomReds Cuts Conss
12.29/12.34 c cut pool : 0.00 4 - - 121 - (maximal pool size: 501)
12.29/12.34 c redcost : 0.00 435 0 0 0 0
12.29/12.34 c impliedbounds : 0.00 5 0 0 0 0
12.29/12.34 c intobj : 0.00 0 0 0 0 0
12.29/12.34 c gomory : 0.26 5 0 0 1251 0
12.29/12.34 c cgmip : 0.00 0 0 0 0 0
12.29/12.34 c closecuts : 0.00 0 0 0 0 0
12.29/12.34 c strongcg : 0.19 5 0 0 2342 0
12.29/12.34 c cmir : 0.00 0 0 0 0 0
12.29/12.34 c flowcover : 0.00 0 0 0 0 0
12.29/12.34 c clique : 0.00 5 0 0 0 0
12.29/12.34 c zerohalf : 0.00 0 0 0 0 0
12.29/12.34 c mcf : 0.00 1 0 0 0 0
12.29/12.34 c oddcycle : 0.00 0 0 0 0 0
12.29/12.34 c rapidlearning : 0.04 1 0 0 0 48
12.29/12.34 c Pricers : Time Calls Vars
12.29/12.34 c problem variables: 0.00 0 0
12.29/12.34 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
12.29/12.34 c relpscost : 9.46 696 28 639 0 0 792
12.29/12.34 c pscost : 0.00 0 0 0 0 0 0
12.29/12.34 c inference : 0.00 0 0 0 0 0 0
12.29/12.34 c mostinf : 0.00 0 0 0 0 0 0
12.29/12.34 c leastinf : 0.00 0 0 0 0 0 0
12.29/12.34 c fullstrong : 0.00 0 0 0 0 0 0
12.29/12.34 c allfullstrong : 0.00 0 0 0 0 0 0
12.29/12.34 c random : 0.00 0 0 0 0 0 0
12.29/12.34 c Primal Heuristics : Time Calls Found
12.29/12.34 c LP solutions : 0.00 - 1
12.29/12.34 c pseudo solutions : 0.00 - 0
12.29/12.34 c trivial : 0.00 1 0
12.29/12.34 c shiftandpropagate: 0.00 0 0
12.29/12.34 c simplerounding : 0.00 0 0
12.29/12.34 c zirounding : 0.00 0 0
12.29/12.34 c rounding : 0.00 0 0
12.29/12.34 c shifting : 0.00 0 0
12.29/12.34 c intshifting : 0.00 0 0
12.29/12.34 c oneopt : 0.00 0 0
12.29/12.34 c twoopt : 0.00 0 0
12.29/12.34 c fixandinfer : 0.00 0 0
12.29/12.34 c feaspump : 0.00 0 0
12.29/12.34 c clique : 0.00 0 0
12.29/12.34 c coefdiving : 0.00 0 0
12.29/12.34 c pscostdiving : 0.00 0 0
12.29/12.34 c fracdiving : 0.00 0 0
12.29/12.34 c veclendiving : 0.00 0 0
12.29/12.34 c intdiving : 0.00 0 0
12.29/12.34 c actconsdiving : 0.00 0 0
12.29/12.34 c objpscostdiving : 0.00 0 0
12.29/12.34 c rootsoldiving : 0.00 0 0
12.29/12.34 c linesearchdiving : 0.00 0 0
12.29/12.34 c guideddiving : 0.00 0 0
12.29/12.34 c octane : 0.00 0 0
12.29/12.34 c rens : 0.00 0 0
12.29/12.34 c rins : 0.00 0 0
12.29/12.34 c localbranching : 0.00 0 0
12.29/12.34 c mutation : 0.00 0 0
12.29/12.34 c crossover : 0.00 0 0
12.29/12.34 c dins : 0.00 0 0
12.29/12.34 c vbounds : 0.00 0 0
12.29/12.34 c undercover : 0.00 0 0
12.29/12.34 c subnlp : 0.00 0 0
12.29/12.34 c trysol : 0.00 0 0
12.29/12.34 c LP : Time Calls Iterations Iter/call Iter/sec
12.29/12.34 c primal LP : 0.00 0 0 0.00 -
12.29/12.34 c dual LP : 2.08 1001 18059 18.04 8691.44
12.29/12.34 c lex dual LP : 0.00 0 0 0.00 -
12.29/12.34 c barrier LP : 0.00 0 0 0.00 -
12.29/12.34 c diving/probing LP: 0.00 0 0 0.00 -
12.29/12.34 c strong branching : 9.42 1654 84916 51.34 9014.62
12.29/12.34 c (at root node) : - 12 3171 264.25 -
12.29/12.34 c conflict analysis: 0.00 0 0 0.00 -
12.29/12.34 c B&B Tree :
12.29/12.34 c number of runs : 1
12.29/12.34 c nodes : 765
12.29/12.34 c nodes (total) : 765
12.29/12.34 c nodes left : 0
12.29/12.34 c max depth : 26
12.29/12.34 c max depth (total): 26
12.29/12.34 c backtracks : 88 (11.5%)
12.29/12.34 c delayed cutoffs : 6
12.29/12.34 c repropagations : 749 (1154 domain reductions, 6 cutoffs)
12.29/12.34 c avg switch length: 3.62
12.29/12.34 c switching time : 0.04
12.29/12.34 c Solution :
12.29/12.34 c Solutions found : 1 (1 improvements)
12.29/12.34 c First Solution : +0.00000000000000e+00 (in run 1, after 765 nodes, 12.34 seconds, depth 21, found by <relaxation>)
12.29/12.34 c Primal Bound : +0.00000000000000e+00 (in run 1, after 765 nodes, 12.34 seconds, depth 21, found by <relaxation>)
12.29/12.34 c Dual Bound : +0.00000000000000e+00
12.29/12.34 c Gap : 0.00 %
12.29/12.34 c Root Dual Bound : +0.00000000000000e+00
12.29/12.34 c Root Iterations : 151
12.29/12.35 c Time complete: 12.35.
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL
This is runsolver version 3.3.1 (svn: 988)
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-3489213-1307753045/watcher-3489213-1307753045 -o /tmp/evaluation-result-3489213-1307753045/solver-3489213-1307753045 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3489213-1307753045.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 1.87 2/177 6668
/proc/meminfo: memFree=31931260/32951124 swapFree=67050780/67111528
[pid=6668] ppid=6666 vsize=12564 CPUtime=0 cores=1,3,5,7
/proc/6668/stat : 6668 (scip-2.0.1.4b_2) R 6666 6668 1779 0 -1 4202496 2135 0 0 0 0 0 0 0 25 0 1 0 886907241 12865536 2090 33554432000 4194304 9016284 140734211310656 18446744073709551615 6813403 0 0 4096 0 0 0 0 17 5 0 0 0
/proc/6668/statm: 3141 2093 357 1178 0 1959 0
[startup+0.104373 s]
/proc/loadavg: 2.00 2.00 1.87 2/177 6668
/proc/meminfo: memFree=31931260/32951124 swapFree=67050780/67111528
[pid=6668] ppid=6666 vsize=28008 CPUtime=0.09 cores=1,3,5,7
/proc/6668/stat : 6668 (scip-2.0.1.4b_2) R 6666 6668 1779 0 -1 4202496 6315 0 0 0 9 0 0 0 18 0 1 0 886907241 28680192 5973 33554432000 4194304 9016284 140734211310656 18446744073709551615 7925162 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/6668/statm: 7002 5973 634 1178 0 5820 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 28008
[startup+0.200357 s]
/proc/loadavg: 2.00 2.00 1.87 2/177 6668
/proc/meminfo: memFree=31931260/32951124 swapFree=67050780/67111528
[pid=6668] ppid=6666 vsize=41372 CPUtime=0.19 cores=1,3,5,7
/proc/6668/stat : 6668 (scip-2.0.1.4b_2) R 6666 6668 1779 0 -1 4202496 10096 0 0 0 18 1 0 0 18 0 1 0 886907241 42364928 9045 33554432000 4194304 9016284 140734211310656 18446744073709551615 6813403 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/6668/statm: 10343 9045 674 1178 0 9161 0
Current children cumulated CPU time (s) 0.19
Current children cumulated vsize (KiB) 41372
[startup+0.300338 s]
/proc/loadavg: 2.00 2.00 1.87 2/177 6668
/proc/meminfo: memFree=31931260/32951124 swapFree=67050780/67111528
[pid=6668] ppid=6666 vsize=41472 CPUtime=0.29 cores=1,3,5,7
/proc/6668/stat : 6668 (scip-2.0.1.4b_2) R 6666 6668 1779 0 -1 4202496 10128 0 0 0 28 1 0 0 18 0 1 0 886907241 42467328 9075 33554432000 4194304 9016284 140734211310656 18446744073709551615 7925162 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/6668/statm: 10368 9075 679 1178 0 9186 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 41472
[startup+0.700265 s]
/proc/loadavg: 2.00 2.00 1.87 2/177 6668
/proc/meminfo: memFree=31931260/32951124 swapFree=67050780/67111528
[pid=6668] ppid=6666 vsize=41704 CPUtime=0.69 cores=1,3,5,7
/proc/6668/stat : 6668 (scip-2.0.1.4b_2) R 6666 6668 1779 0 -1 4202496 10236 0 0 0 66 3 0 0 18 0 1 0 886907241 42704896 9183 33554432000 4194304 9016284 140734211310656 18446744073709551615 7925162 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/6668/statm: 10426 9183 687 1178 0 9244 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 41704
[startup+1.50013 s]
/proc/loadavg: 2.00 2.00 1.87 3/178 6669
/proc/meminfo: memFree=31885360/32951124 swapFree=67050780/67111528
[pid=6668] ppid=6666 vsize=41704 CPUtime=1.49 cores=1,3,5,7
/proc/6668/stat : 6668 (scip-2.0.1.4b_2) R 6666 6668 1779 0 -1 4202496 10238 0 0 0 142 7 0 0 19 0 1 0 886907241 42704896 9185 33554432000 4194304 9016284 140734211310656 18446744073709551615 7925162 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/6668/statm: 10426 9185 689 1178 0 9244 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 41704
[startup+3.10084 s]
/proc/loadavg: 2.00 2.00 1.87 3/178 6669
/proc/meminfo: memFree=31885112/32951124 swapFree=67050780/67111528
[pid=6668] ppid=6666 vsize=41704 CPUtime=3.09 cores=1,3,5,7
/proc/6668/stat : 6668 (scip-2.0.1.4b_2) R 6666 6668 1779 0 -1 4202496 10243 0 0 0 297 12 0 0 25 0 1 0 886907241 42704896 9185 33554432000 4194304 9016284 140734211310656 18446744073709551615 7925162 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/6668/statm: 10426 9185 684 1178 0 9244 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 41704
[startup+6.30027 s]
/proc/loadavg: 2.00 2.00 1.87 3/178 6669
/proc/meminfo: memFree=31885020/32951124 swapFree=67050780/67111528
[pid=6668] ppid=6666 vsize=41704 CPUtime=6.29 cores=1,3,5,7
/proc/6668/stat : 6668 (scip-2.0.1.4b_2) R 6666 6668 1779 0 -1 4202496 10243 0 0 0 606 23 0 0 25 0 1 0 886907241 42704896 9185 33554432000 4194304 9016284 140734211310656 18446744073709551615 7925162 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/6668/statm: 10426 9185 684 1178 0 9244 0
Current children cumulated CPU time (s) 6.29
Current children cumulated vsize (KiB) 41704
Solver just ended. Dumping a history of the last processes samples
[startup+6.40026 s]
/proc/loadavg: 2.00 2.00 1.87 3/178 6669
/proc/meminfo: memFree=31885020/32951124 swapFree=67050780/67111528
[pid=6668] ppid=6666 vsize=41704 CPUtime=6.39 cores=1,3,5,7
/proc/6668/stat : 6668 (scip-2.0.1.4b_2) R 6666 6668 1779 0 -1 4202496 10243 0 0 0 616 23 0 0 25 0 1 0 886907241 42704896 9185 33554432000 4194304 9016284 140734211310656 18446744073709551615 7925162 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/6668/statm: 10426 9185 684 1178 0 9244 0
Current children cumulated CPU time (s) 6.39
Current children cumulated vsize (KiB) 41704
[startup+9.60069 s]
/proc/loadavg: 2.00 2.00 1.87 3/178 6669
/proc/meminfo: memFree=31885196/32951124 swapFree=67050780/67111528
[pid=6668] ppid=6666 vsize=41704 CPUtime=9.59 cores=1,3,5,7
/proc/6668/stat : 6668 (scip-2.0.1.4b_2) R 6666 6668 1779 0 -1 4202496 10250 0 0 0 925 34 0 0 25 0 1 0 886907241 42704896 9192 33554432000 4194304 9016284 140734211310656 18446744073709551615 7925162 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/6668/statm: 10426 9192 686 1178 0 9244 0
Current children cumulated CPU time (s) 9.59
Current children cumulated vsize (KiB) 41704
[startup+11.2004 s]
/proc/loadavg: 2.00 2.00 1.87 3/178 6669
/proc/meminfo: memFree=31884708/32951124 swapFree=67050780/67111528
[pid=6668] ppid=6666 vsize=41704 CPUtime=11.19 cores=1,3,5,7
/proc/6668/stat : 6668 (scip-2.0.1.4b_2) R 6666 6668 1779 0 -1 4202496 10278 0 0 0 1080 39 0 0 25 0 1 0 886907241 42704896 9220 33554432000 4194304 9016284 140734211310656 18446744073709551615 7925162 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/6668/statm: 10426 9220 686 1178 0 9244 0
Current children cumulated CPU time (s) 11.19
Current children cumulated vsize (KiB) 41704
[startup+12.0003 s]
/proc/loadavg: 2.00 2.00 1.87 3/178 6669
/proc/meminfo: memFree=31884708/32951124 swapFree=67050780/67111528
[pid=6668] ppid=6666 vsize=41704 CPUtime=11.99 cores=1,3,5,7
/proc/6668/stat : 6668 (scip-2.0.1.4b_2) R 6666 6668 1779 0 -1 4202496 10285 0 0 0 1158 41 0 0 25 0 1 0 886907241 42704896 9227 33554432000 4194304 9016284 140734211310656 18446744073709551615 7925162 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/6668/statm: 10426 9227 686 1178 0 9244 0
Current children cumulated CPU time (s) 11.99
Current children cumulated vsize (KiB) 41704
[startup+12.2062 s]
/proc/loadavg: 2.00 2.00 1.87 3/178 6669
/proc/meminfo: memFree=31884708/32951124 swapFree=67050780/67111528
[pid=6668] ppid=6666 vsize=41704 CPUtime=12.19 cores=1,3,5,7
/proc/6668/stat : 6668 (scip-2.0.1.4b_2) R 6666 6668 1779 0 -1 4202496 10285 0 0 0 1178 41 0 0 25 0 1 0 886907241 42704896 9227 33554432000 4194304 9016284 140734211310656 18446744073709551615 7925162 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/6668/statm: 10426 9227 686 1178 0 9244 0
Current children cumulated CPU time (s) 12.19
Current children cumulated vsize (KiB) 41704
[startup+12.3002 s]
/proc/loadavg: 2.00 2.00 1.87 3/178 6669
/proc/meminfo: memFree=31884708/32951124 swapFree=67050780/67111528
[pid=6668] ppid=6666 vsize=41704 CPUtime=12.29 cores=1,3,5,7
/proc/6668/stat : 6668 (scip-2.0.1.4b_2) R 6666 6668 1779 0 -1 4202496 10285 0 0 0 1188 41 0 0 25 0 1 0 886907241 42704896 9227 33554432000 4194304 9016284 140734211310656 18446744073709551615 7925162 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/6668/statm: 10426 9227 686 1178 0 9244 0
Current children cumulated CPU time (s) 12.29
Current children cumulated vsize (KiB) 41704
Child status: 0
Real time (s): 12.355
CPU time (s): 12.3541
CPU user time (s): 11.9302
CPU system time (s): 0.423935
CPU usage (%): 99.9928
Max. virtual memory (cumulated for all children) (KiB): 41704
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 11.9302
system time used= 0.423935
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 10293
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= 151
runsolver used 0.017997 second user time and 0.045993 second system time
The end