0.00/0.00 c SCIP version 2.0.1.4 [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-3485771-1307751401.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
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
0.01/0.02 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 = 1797
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 | - |3941k| 0 | 43 | 231 |2491 | 231 |2454 | 11 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.25 c 0.2s| 1 | 0 | 105 | - |4387k| 0 | 46 | 231 |2491 | 231 |2458 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.36 c 0.4s| 1 | 0 | 111 | - |4683k| 0 | 45 | 231 |2491 | 231 |2460 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.50 c 0.5s| 1 | 0 | 129 | - |4950k| 0 | 46 | 231 |2491 | 231 |2463 | 20 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.64 c 0.6s| 1 | 0 | 151 | - |5219k| 0 | 50 | 231 |2491 | 231 |2467 | 24 | 0 | 0 | 0.000000e+00 | -- | Inf
0.89/0.99 c 1.0s| 1 | 2 | 151 | - |5220k| 0 | 50 | 231 |2491 | 231 |2467 | 24 | 0 | 12 | 0.000000e+00 | -- | Inf
13.89/13.99 c *14.0s| 765 | 0 | 18059 | 23.4 |5558k| 26 | - | 231 |2919 | 231 |2451 | 24 | 434 |1654 | 0.000000e+00 | 0.000000e+00 | 0.00%
13.89/13.99 c
13.89/13.99 c SCIP Status : problem is solved [optimal solution found]
13.89/13.99 c Solving Time (sec) : 13.99
13.89/13.99 c Solving Nodes : 765
13.89/13.99 c Primal Bound : +0.00000000000000e+00 (1 solutions)
13.89/13.99 c Dual Bound : +0.00000000000000e+00
13.89/13.99 c Gap : 0.00 %
13.89/13.99 s SATISFIABLE
13.89/13.99 v -x221 -x211 -x201 -x191 -x181 -x171 -x161 -x151 x141 -x131 -x231 -x210 -x200 -x190 -x180 -x170 -x160 x150 -x140 -x130 -x230 x220
13.89/13.99 v -x199 -x189 -x179 -x169 -x159 -x149 -x139 -x129 -x229 -x219 -x209 -x188 -x178 -x168 -x158 -x148 -x138 x128 -x228 -x218 x208
13.89/13.99 v -x198 -x177 -x167 -x157 -x147 -x137 -x127 -x227 -x217 -x207 -x197 x187 -x166 -x156 -x146 -x136 -x126 -x226 -x216 -x206 -x196
13.89/13.99 v -x186 -x176 x155 -x145 -x135 -x125 -x225 -x215 -x205 -x195 -x185 x175 -x165 -x144 -x134 -x124 x224 -x214 -x204 -x194 -x184 -x174
13.89/13.99 v -x164 -x154 -x133 -x123 -x223 -x213 -x203 x193 -x183 -x173 -x163 -x153 -x143 -x122 -x222 -x212 -x202 -x192 -x182 -x172 x162
13.89/13.99 v -x152 -x142 -x132 -x121 -x120 x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 x109 -x108 -x107 -x106 -x105 -x104
13.89/13.99 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
13.89/13.99 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
13.89/13.99 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
13.89/13.99 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
13.89/13.99 v -x1
13.89/13.99 c SCIP Status : problem is solved [optimal solution found]
13.89/13.99 c Total Time : 13.99
13.89/13.99 c solving : 13.99
13.89/13.99 c presolving : 0.04 (included in solving)
13.89/13.99 c reading : 0.02 (included in solving)
13.89/13.99 c Original Problem :
13.89/13.99 c Problem name : HOME/instance-3485771-1307751401.opb
13.89/13.99 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
13.89/13.99 c Constraints : 2707 initial, 2707 maximal
13.89/13.99 c Presolved Problem :
13.89/13.99 c Problem name : t_HOME/instance-3485771-1307751401.opb
13.89/13.99 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
13.89/13.99 c Constraints : 2443 initial, 2919 maximal
13.89/13.99 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
13.89/13.99 c trivial : 0.00 0 0 0 0 0 0 0 0 0
13.89/13.99 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
13.89/13.99 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
13.89/13.99 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
13.89/13.99 c implics : 0.00 0 0 0 0 0 0 0 0 0
13.89/13.99 c probing : 0.00 0 0 0 0 0 0 0 0 0
13.89/13.99 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
13.89/13.99 c setppc : 0.00 0 0 0 0 0 121 0 0 0
13.89/13.99 c linear : 0.01 0 0 0 0 0 143 0 0 0
13.89/13.99 c logicor : 0.01 0 0 0 0 0 0 0 0 0
13.89/13.99 c root node : - 0 - - 0 - - - - -
13.89/13.99 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
13.89/13.99 c integral : 0 0 0 697 0 3 0 28 639 0 0 792
13.89/13.99 c knapsack : 1 5 2859 1 0 0 222 11 1411 0 0 0
13.89/13.99 c setppc : 22 5 2852 1 0 0 10130 26 4317 0 0 0
13.89/13.99 c linear : 0+ 5 2447 0 0 0 0 0 35 0 0 0
13.89/13.99 c logicor : 2420+ 5 1800 1 0 0 2282 9 5353 0 0 0
13.89/13.99 c countsols : 0 0 0 1 0 2 0 0 0 0 0 0
13.89/13.99 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
13.89/13.99 c integral : 10.73 0.00 0.00 10.73 0.00 0.00 0.00
13.89/13.99 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
13.89/13.99 c setppc : 0.01 0.00 0.01 0.00 0.00 0.00 0.00
13.89/13.99 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
13.89/13.99 c logicor : 0.03 0.00 0.03 0.00 0.00 0.00 0.00
13.89/13.99 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
13.89/13.99 c Propagators : #Propagate #Resprop Cutoffs DomReds
13.89/13.99 c vbounds : 0 0 0 0
13.89/13.99 c rootredcost : 0 0 0 0
13.89/13.99 c pseudoobj : 0 0 0 0
13.89/13.99 c Propagator Timings : TotalTime Propagate Resprop
13.89/13.99 c vbounds : 0.00 0.00 0.00
13.89/13.99 c rootredcost : 0.00 0.00 0.00
13.89/13.99 c pseudoobj : 0.00 0.00 0.00
13.89/13.99 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
13.89/13.99 c propagation : 0.00 46 46 296 21.0 0 0.0 -
13.89/13.99 c infeasible LP : 0.03 300 279 1817 32.9 1 21.0 0
13.89/13.99 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
13.89/13.99 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
13.89/13.99 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
13.89/13.99 c applied globally : - - - 433 15.0 - - -
13.89/13.99 c applied locally : - - - 1 53.0 - - -
13.89/13.99 c Separators : Time Calls Cutoffs DomReds Cuts Conss
13.89/13.99 c cut pool : 0.00 4 - - 121 - (maximal pool size: 501)
13.89/13.99 c redcost : 0.00 435 0 0 0 0
13.89/13.99 c impliedbounds : 0.00 5 0 0 0 0
13.89/13.99 c intobj : 0.00 0 0 0 0 0
13.89/13.99 c gomory : 0.30 5 0 0 1251 0
13.89/13.99 c cgmip : 0.00 0 0 0 0 0
13.89/13.99 c closecuts : 0.00 0 0 0 0 0
13.89/13.99 c strongcg : 0.21 5 0 0 2342 0
13.89/13.99 c cmir : 0.00 0 0 0 0 0
13.89/13.99 c flowcover : 0.00 0 0 0 0 0
13.89/13.99 c clique : 0.00 5 0 0 0 0
13.89/13.99 c zerohalf : 0.00 0 0 0 0 0
13.89/13.99 c mcf : 0.00 1 0 0 0 0
13.89/13.99 c oddcycle : 0.00 0 0 0 0 0
13.89/13.99 c rapidlearning : 0.04 1 0 0 0 48
13.89/13.99 c Pricers : Time Calls Vars
13.89/13.99 c problem variables: 0.00 0 0
13.89/13.99 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
13.89/13.99 c relpscost : 10.73 696 28 639 0 0 792
13.89/13.99 c pscost : 0.00 0 0 0 0 0 0
13.89/13.99 c inference : 0.00 0 0 0 0 0 0
13.89/13.99 c mostinf : 0.00 0 0 0 0 0 0
13.89/13.99 c leastinf : 0.00 0 0 0 0 0 0
13.89/13.99 c fullstrong : 0.00 0 0 0 0 0 0
13.89/13.99 c allfullstrong : 0.00 0 0 0 0 0 0
13.89/13.99 c random : 0.00 0 0 0 0 0 0
13.89/13.99 c Primal Heuristics : Time Calls Found
13.89/13.99 c LP solutions : 0.00 - 1
13.89/13.99 c pseudo solutions : 0.00 - 0
13.89/13.99 c trivial : 0.00 1 0
13.89/13.99 c shiftandpropagate: 0.00 0 0
13.89/13.99 c simplerounding : 0.00 0 0
13.89/13.99 c zirounding : 0.00 0 0
13.89/13.99 c rounding : 0.00 0 0
13.89/13.99 c shifting : 0.00 0 0
13.89/13.99 c intshifting : 0.00 0 0
13.89/13.99 c oneopt : 0.00 0 0
13.89/13.99 c twoopt : 0.00 0 0
13.89/13.99 c fixandinfer : 0.00 0 0
13.89/13.99 c feaspump : 0.00 0 0
13.89/13.99 c clique : 0.00 0 0
13.89/13.99 c coefdiving : 0.00 0 0
13.89/13.99 c pscostdiving : 0.00 0 0
13.89/13.99 c fracdiving : 0.00 0 0
13.89/13.99 c veclendiving : 0.00 0 0
13.89/13.99 c intdiving : 0.00 0 0
13.89/13.99 c actconsdiving : 0.00 0 0
13.89/13.99 c objpscostdiving : 0.00 0 0
13.89/13.99 c rootsoldiving : 0.00 0 0
13.89/13.99 c linesearchdiving : 0.00 0 0
13.89/13.99 c guideddiving : 0.00 0 0
13.89/13.99 c octane : 0.00 0 0
13.89/13.99 c rens : 0.00 0 0
13.89/13.99 c rins : 0.00 0 0
13.89/13.99 c localbranching : 0.00 0 0
13.89/13.99 c mutation : 0.00 0 0
13.89/13.99 c crossover : 0.00 0 0
13.89/13.99 c dins : 0.00 0 0
13.89/13.99 c vbounds : 0.00 0 0
13.89/13.99 c undercover : 0.00 0 0
13.89/13.99 c subnlp : 0.00 0 0
13.89/13.99 c trysol : 0.00 0 0
13.89/13.99 c LP : Time Calls Iterations Iter/call Iter/sec
13.89/13.99 c primal LP : 0.00 0 0 0.00 -
13.89/13.99 c dual LP : 2.36 1001 18059 18.04 7658.18
13.89/13.99 c lex dual LP : 0.00 0 0 0.00 -
13.89/13.99 c barrier LP : 0.00 0 0 0.00 -
13.89/13.99 c diving/probing LP: 0.00 0 0 0.00 -
13.89/13.99 c strong branching : 10.68 1654 84916 51.34 7950.57
13.89/13.99 c (at root node) : - 12 3171 264.25 -
13.89/13.99 c conflict analysis: 0.00 0 0 0.00 -
13.89/13.99 c B&B Tree :
13.89/13.99 c number of runs : 1
13.89/13.99 c nodes : 765
13.89/13.99 c nodes (total) : 765
13.89/13.99 c nodes left : 0
13.89/13.99 c max depth : 26
13.89/13.99 c max depth (total): 26
13.89/13.99 c backtracks : 88 (11.5%)
13.89/13.99 c delayed cutoffs : 6
13.89/13.99 c repropagations : 749 (1154 domain reductions, 6 cutoffs)
13.89/13.99 c avg switch length: 3.62
13.89/13.99 c switching time : 0.04
13.89/13.99 c Solution :
13.89/13.99 c Solutions found : 1 (1 improvements)
13.89/13.99 c First Solution : +0.00000000000000e+00 (in run 1, after 765 nodes, 13.99 seconds, depth 21, found by <relaxation>)
13.89/13.99 c Primal Bound : +0.00000000000000e+00 (in run 1, after 765 nodes, 13.99 seconds, depth 21, found by <relaxation>)
13.89/13.99 c Dual Bound : +0.00000000000000e+00
13.89/13.99 c Gap : 0.00 %
13.89/13.99 c Root Dual Bound : +0.00000000000000e+00
13.89/13.99 c Root Iterations : 151
13.89/14.00 c Time complete: 13.99.
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-3485771-1307751401/watcher-3485771-1307751401 -o /tmp/evaluation-result-3485771-1307751401/solver-3485771-1307751401 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3485771-1307751401.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.00 1.95 1.43 2/177 3222
/proc/meminfo: memFree=31536836/32950928 swapFree=67056212/67111528
[pid=3222] ppid=3220 vsize=9836 CPUtime=0 cores=0,2,4,6
/proc/3222/stat : 3222 (scip-2.0.1.4_2.) R 3220 3222 2370 0 -1 4202496 1472 0 0 0 0 0 0 0 25 0 1 0 965370798 10072064 1426 33554432000 4194304 8979876 140735631279856 18446744073709551615 7790414 0 0 4096 0 0 0 0 17 2 0 0 0
/proc/3222/statm: 2459 1426 363 1169 0 1286 0
[startup+0.0218059 s]
/proc/loadavg: 2.00 1.95 1.43 2/177 3222
/proc/meminfo: memFree=31536836/32950928 swapFree=67056212/67111528
[pid=3222] ppid=3220 vsize=14288 CPUtime=0.01 cores=0,2,4,6
/proc/3222/stat : 3222 (scip-2.0.1.4_2.) R 3220 3222 2370 0 -1 4202496 2543 0 0 0 1 0 0 0 25 0 1 0 965370798 14630912 2497 33554432000 4194304 8979876 140735631279856 18446744073709551615 6782507 0 0 4096 2 0 0 0 17 0 0 0 0
/proc/3222/statm: 3572 2498 414 1169 0 2399 0
Current children cumulated CPU time (s) 0.01
Current children cumulated vsize (KiB) 14288
[startup+0.100779 s]
/proc/loadavg: 2.00 1.95 1.43 2/177 3222
/proc/meminfo: memFree=31536836/32950928 swapFree=67056212/67111528
[pid=3222] ppid=3220 vsize=25580 CPUtime=0.09 cores=0,2,4,6
/proc/3222/stat : 3222 (scip-2.0.1.4_2.) R 3220 3222 2370 0 -1 4202496 5727 0 0 0 9 0 0 0 18 0 1 0 965370798 26193920 5384 33554432000 4194304 8979876 140735631279856 18446744073709551615 7890762 0 0 4096 2 0 0 0 17 0 0 0 0
/proc/3222/statm: 6395 5384 644 1169 0 5222 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 25580
[startup+0.30074 s]
/proc/loadavg: 2.00 1.95 1.43 2/177 3222
/proc/meminfo: memFree=31536836/32950928 swapFree=67056212/67111528
[pid=3222] ppid=3220 vsize=40504 CPUtime=0.29 cores=0,2,4,6
/proc/3222/stat : 3222 (scip-2.0.1.4_2.) R 3220 3222 2370 0 -1 4202496 9540 0 0 0 28 1 0 0 18 0 1 0 965370798 41476096 8842 33554432000 4194304 8979876 140735631279856 18446744073709551615 7890762 0 0 4096 2 0 0 0 17 0 0 0 0
/proc/3222/statm: 10126 8842 690 1169 0 8953 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 40504
[startup+0.700666 s]
/proc/loadavg: 2.00 1.95 1.43 2/177 3222
/proc/meminfo: memFree=31536836/32950928 swapFree=67056212/67111528
[pid=3222] ppid=3220 vsize=40736 CPUtime=0.69 cores=0,2,4,6
/proc/3222/stat : 3222 (scip-2.0.1.4_2.) R 3220 3222 2370 0 -1 4202496 9671 0 0 0 67 2 0 0 18 0 1 0 965370798 41713664 8973 33554432000 4194304 8979876 140735631279856 18446744073709551615 6956464 0 0 4096 2 0 0 0 17 0 0 0 0
/proc/3222/statm: 10184 8973 693 1169 0 9011 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 40736
[startup+1.50052 s]
/proc/loadavg: 2.00 1.95 1.43 3/178 3223
/proc/meminfo: memFree=31503744/32950928 swapFree=67056212/67111528
[pid=3222] ppid=3220 vsize=40736 CPUtime=1.49 cores=0,2,4,6
/proc/3222/stat : 3222 (scip-2.0.1.4_2.) R 3220 3222 2370 0 -1 4202496 9671 0 0 0 147 2 0 0 20 0 1 0 965370798 41713664 8973 33554432000 4194304 8979876 140735631279856 18446744073709551615 7164668 0 0 4096 2 0 0 0 17 0 0 0 0
/proc/3222/statm: 10184 8973 693 1169 0 9011 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 40736
[startup+3.10021 s]
/proc/loadavg: 2.00 1.95 1.43 3/178 3223
/proc/meminfo: memFree=31503496/32950928 swapFree=67056212/67111528
[pid=3222] ppid=3220 vsize=40736 CPUtime=3.09 cores=0,2,4,6
/proc/3222/stat : 3222 (scip-2.0.1.4_2.) R 3220 3222 2370 0 -1 4202496 9671 0 0 0 306 3 0 0 25 0 1 0 965370798 41713664 8973 33554432000 4194304 8979876 140735631279856 18446744073709551615 7890762 0 0 4096 2 0 0 0 17 0 0 0 0
/proc/3222/statm: 10184 8973 693 1169 0 9011 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 40736
[startup+6.3006 s]
/proc/loadavg: 2.00 1.95 1.44 3/178 3223
/proc/meminfo: memFree=31502508/32950928 swapFree=67056212/67111528
[pid=3222] ppid=3220 vsize=40736 CPUtime=6.29 cores=0,2,4,6
/proc/3222/stat : 3222 (scip-2.0.1.4_2.) R 3220 3222 2370 0 -1 4202496 9671 0 0 0 622 7 0 0 25 0 1 0 965370798 41713664 8973 33554432000 4194304 8979876 140735631279856 18446744073709551615 7890762 0 0 4096 2 0 0 0 17 0 0 0 0
/proc/3222/statm: 10184 8973 693 1169 0 9011 0
Current children cumulated CPU time (s) 6.29
Current children cumulated vsize (KiB) 40736
[startup+12.7004 s]
/proc/loadavg: 2.00 1.95 1.44 3/178 3223
/proc/meminfo: memFree=31502152/32950928 swapFree=67056212/67111528
[pid=3222] ppid=3220 vsize=40736 CPUtime=12.7 cores=0,2,4,6
/proc/3222/stat : 3222 (scip-2.0.1.4_2.) R 3220 3222 2370 0 -1 4202496 9690 0 0 0 1257 13 0 0 25 0 1 0 965370798 41713664 8992 33554432000 4194304 8979876 140735631279856 18446744073709551615 7890762 0 0 4096 2 0 0 0 17 0 0 0 0
/proc/3222/statm: 10184 8992 696 1169 0 9011 0
Current children cumulated CPU time (s) 12.7
Current children cumulated vsize (KiB) 40736
Solver just ended. Dumping a history of the last processes samples
[startup+13.5002 s]
/proc/loadavg: 2.00 1.96 1.44 3/178 3223
/proc/meminfo: memFree=31502152/32950928 swapFree=67056212/67111528
[pid=3222] ppid=3220 vsize=40736 CPUtime=13.49 cores=0,2,4,6
/proc/3222/stat : 3222 (scip-2.0.1.4_2.) R 3220 3222 2370 0 -1 4202496 9690 0 0 0 1336 13 0 0 25 0 1 0 965370798 41713664 8992 33554432000 4194304 8979876 140735631279856 18446744073709551615 7890762 0 0 4096 2 0 0 0 17 0 0 0 0
/proc/3222/statm: 10184 8992 696 1169 0 9011 0
Current children cumulated CPU time (s) 13.49
Current children cumulated vsize (KiB) 40736
[startup+13.9012 s]
/proc/loadavg: 2.00 1.96 1.44 3/178 3223
/proc/meminfo: memFree=31502152/32950928 swapFree=67056212/67111528
[pid=3222] ppid=3220 vsize=40736 CPUtime=13.89 cores=0,2,4,6
/proc/3222/stat : 3222 (scip-2.0.1.4_2.) R 3220 3222 2370 0 -1 4202496 9690 0 0 0 1375 14 0 0 25 0 1 0 965370798 41713664 8992 33554432000 4194304 8979876 140735631279856 18446744073709551615 7890762 0 0 4096 2 0 0 0 17 0 0 0 0
/proc/3222/statm: 10184 8992 696 1169 0 9011 0
Current children cumulated CPU time (s) 13.89
Current children cumulated vsize (KiB) 40736
[startup+14.0011 s]
/proc/loadavg: 2.00 1.96 1.44 3/178 3223
/proc/meminfo: memFree=31502152/32950928 swapFree=67056212/67111528
[pid=3222] ppid=3220 vsize=7472 CPUtime=13.99 cores=0,2,4,6
/proc/3222/stat : 3222 (scip-2.0.1.4_2.) R 3220 3222 2370 0 -1 4202496 9698 0 0 0 1385 14 0 0 25 0 1 0 965370798 7651328 1225 33554432000 4194304 8979876 140735631279856 18446744073709551615 7478512 0 0 4096 0 0 0 0 17 0 0 0 0
/proc/3222/statm: 0 0 0 0 0 0 0
Current children cumulated CPU time (s) 13.99
Current children cumulated vsize (KiB) 7472
Child status: 0
Real time (s): 14.0014
CPU time (s): 14.0019
CPU user time (s): 13.8579
CPU system time (s): 0.143978
CPU usage (%): 100.003
Max. virtual memory (cumulated for all children) (KiB): 40736
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 13.8579
system time used= 0.143978
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 9698
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 5
involuntary context switches= 31
runsolver used 0.023996 second user time and 0.044993 second system time
The end