0.00/0.02 c SCIP version 1.1.0.7
0.00/0.02 c LP-Solver SoPlex 1.4.1
0.00/0.02 c user parameter file <scip.set> not found - using default parameters
0.00/0.02 c read problem <HOME/instance-3729877-1338680448.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 No objective function, only one solution is needed.
0.00/0.02 c start presolving problem
0.00/0.02 c presolving:
0.00/0.04 c (round 1) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.00/0.05 c (round 2) 0 del vars, 143 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.00/0.05 c presolving (3 rounds):
0.00/0.05 c 0 deleted vars, 143 deleted 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 2564 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 2541 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 SATUNSAT-LIN
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 = c -1
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 = c -1
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 = c 1500
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 = c 0.075
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 = c -1
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 = c -1
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 = c -1
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 = c -1
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 = c 1500
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 = c 0.015
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 = c -1
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 = c 2000
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 = c 0.3
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 = c -1
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 = c 1500
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 = c 0.075
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 = c -1
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 = c -1
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 = c 1500
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 = c 0.015
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 = c -1
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 = c 1500
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 = c 0.075
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 = c -1
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 = c -1
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 = c 0.075
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 = c 1500
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 = c 0.075
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 = c -1
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 = c 1500
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 = c 0.075
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 = c -1
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 = c 2000
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 = c -1
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 = c 0.5
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 = c 0.15
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 = c 100
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 = c 750
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 = c -1
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 = c 1500
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 = c 0.075
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 = c -1
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 = c 0
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 = c TRUE
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 = c FALSE
0.00/0.05 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c constraints/knapsack/maxnumcardlift = c 0
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 = c TRUE
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 = c 5
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 = c 1
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 = c 1
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 = c 13950
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 = c 1791
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 = c 10000
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c start solving problem
0.00/0.05 c
0.00/0.06 c time | node | left |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.00/0.06 c 0.0s| 1 | 0 | 77 |3513k| 0 | 34 | 231 |2564 |2564 | 231 |2564 | 0 | 0 | 0 | 1.100000e+01 | -- | Inf
0.09/0.11 c 0.1s| 1 | 0 | 103 |3670k| 0 | 39 | 231 |2564 |2564 | 231 |2570 | 6 | 0 | 0 | 1.100000e+01 | -- | Inf
0.19/0.22 c 0.2s| 1 | 0 | 126 |3881k| 0 | 39 | 231 |2564 |2564 | 231 |2573 | 9 | 0 | 0 | 1.100000e+01 | -- | Inf
0.29/0.35 c 0.3s| 1 | 0 | 141 |3950k| 0 | 41 | 231 |2564 |2564 | 231 |2577 | 13 | 0 | 0 | 1.100000e+01 | -- | Inf
0.49/0.50 c 0.5s| 1 | 0 | 164 |4019k| 0 | 43 | 231 |2564 |2564 | 231 |2578 | 14 | 0 | 0 | 1.100000e+01 | -- | Inf
0.59/0.65 c 0.6s| 1 | 0 | 178 |4036k| 0 | 45 | 231 |2564 |2564 | 231 |2579 | 15 | 0 | 0 | 1.100000e+01 | -- | Inf
1.69/1.72 c 1.7s| 1 | 2 | 178 |4037k| 0 | 45 | 231 |2564 |2564 | 231 |2579 | 15 | 0 | 33 | 1.100000e+01 | -- | Inf
3.69/3.73 c * 3.7s| 11 | 4 | 801 |4165k| 7 | - | 231 |2565 | 594 | 231 |2574 | 15 | 2 | 259 | 1.100000e+01 | 2.200000e+01 | 100.00%
3.69/3.73 c
3.69/3.73 c SCIP Status : solving was interrupted [solution limit reached]
3.69/3.73 c Solving Time (sec) : 3.67
3.69/3.73 c Solving Nodes : 11
3.69/3.73 c Primal Bound : +2.20000000000000e+01 (1 solutions)
3.69/3.73 c Dual Bound : +1.10000000000000e+01
3.69/3.73 c Gap : 100.00 %
3.69/3.73 c NODE 11
3.69/3.73 c DUAL BOUND 11
3.69/3.73 c PRIMAL BOUND 22
3.69/3.73 c GAP 1
3.69/3.73 s SATISFIABLE
3.69/3.73 v -x221 -x211 -x201 x191 -x181 -x171 -x161 -x151 -x141 -x131 -x231 -x210 -x200 -x190 -x180 x170 -x160 -x150 -x140 -x130 -x230 -x220
3.69/3.73 v -x199 -x189 -x179 -x169 -x159 -x149 -x139 x129 -x229 -x219 -x209 -x188 -x178 -x168 x158 -x148 -x138 -x128 -x228 -x218 -x208
3.69/3.73 v -x198 x177 -x167 -x157 -x147 -x137 -x127 -x227 -x217 x207 -x197 -x187 -x166 -x156 -x146 -x136 -x126 -x226 -x216 -x206 -x196
3.69/3.73 v -x186 -x176 -x155 -x145 x135 -x125 -x225 x215 -x205 -x195 -x185 -x175 -x165 -x144 -x134 -x124 -x224 -x214 -x204 x194 -x184 -x174
3.69/3.73 v -x164 -x154 -x133 -x123 x223 -x213 -x203 -x193 -x183 -x173 -x163 -x153 -x143 -x122 -x222 -x212 -x202 -x192 -x182 -x172 -x162
3.69/3.73 v -x152 x142 -x132 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 x111 -x110 -x109 -x108 -x107 -x106 -x105 -x104
3.69/3.73 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
3.69/3.73 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
3.69/3.73 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
3.69/3.73 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
3.69/3.73 v -x1
3.69/3.73 c SCIP Status : solving was interrupted [solution limit reached]
3.69/3.73 c Solving Time : 3.67
3.69/3.73 c Original Problem :
3.69/3.73 c Problem name : HOME/instance-3729877-1338680448.opb
3.69/3.73 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
3.69/3.73 c Constraints : 2707 initial, 2707 maximal
3.69/3.73 c Presolved Problem :
3.69/3.73 c Problem name : t_HOME/instance-3729877-1338680448.opb
3.69/3.73 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
3.69/3.73 c Constraints : 2564 initial, 2565 maximal
3.69/3.73 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
3.69/3.73 c trivial : 0.00 0 0 0 0 0 0 0 0
3.69/3.73 c dualfix : 0.00 0 0 0 0 0 0 0 0
3.69/3.73 c boundshift : 0.00 0 0 0 0 0 0 0 0
3.69/3.73 c inttobinary : 0.00 0 0 0 0 0 0 0 0
3.69/3.73 c implics : 0.00 0 0 0 0 0 0 0 0
3.69/3.73 c probing : 0.00 0 0 0 0 0 0 0 0
3.69/3.73 c knapsack : 0.00 0 0 0 0 0 0 0 0
3.69/3.73 c setppc : 0.00 0 0 0 0 0 0 0 0
3.69/3.73 c linear : 0.02 0 0 0 0 0 143 0 0
3.69/3.73 c logicor : 0.00 0 0 0 0 0 0 0 0
3.69/3.73 c root node : - 0 - - 0 - - - -
3.69/3.73 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
3.69/3.73 c integral : 0 0 0 21 0 0 47 0 0 14
3.69/3.73 c knapsack : 1 5 46 1 0 0 15 0 0 0
3.69/3.73 c setppc : 22 5 45 0 0 0 132 0 0 0
3.69/3.73 c logicor : 2541+ 5 41 1 0 0 138 0 0 0
3.69/3.73 c countsols : 0 0 0 1 0 0 0 0 0 0
3.69/3.73 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
3.69/3.73 c integral : 2.95 0.00 0.00 2.95 0.00
3.69/3.73 c knapsack : 0.00 0.00 0.00 0.00 0.00
3.69/3.73 c setppc : 0.00 0.00 0.00 0.00 0.00
3.69/3.73 c logicor : 0.00 0.00 0.00 0.00 0.00
3.69/3.73 c countsols : 0.00 0.00 0.00 0.00 0.00
3.69/3.73 c Propagators : Time Calls Cutoffs DomReds
3.69/3.73 c rootredcost : 0.00 0 0 0
3.69/3.73 c pseudoobj : 0.00 47 0 0
3.69/3.73 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
3.69/3.73 c propagation : 0.00 0 0 0 0.0 0 0.0 -
3.69/3.73 c infeasible LP : 0.00 3 2 6 31.0 0 0.0 0
3.69/3.73 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
3.69/3.73 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
3.69/3.73 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
3.69/3.73 c applied globally : - - - 1 9.0 - - -
3.69/3.73 c applied locally : - - - 1 52.0 - - -
3.69/3.73 c Separators : Time Calls Cutoffs DomReds Cuts Conss
3.69/3.73 c cut pool : 0.00 4 - - 4 - (maximal pool size: 189)
3.69/3.73 c redcost : 0.00 15 0 0 0 0
3.69/3.73 c impliedbounds : 0.00 5 0 0 0 0
3.69/3.73 c intobj : 0.00 0 0 0 0 0
3.69/3.73 c gomory : 0.33 5 0 0 732 0
3.69/3.73 c strongcg : 0.22 5 0 0 1233 0
3.69/3.73 c cmir : 0.00 0 0 0 0 0
3.69/3.73 c flowcover : 0.00 0 0 0 0 0
3.69/3.73 c clique : 0.00 5 0 0 0 0
3.69/3.73 c zerohalf : 0.00 0 0 0 0 0
3.69/3.73 c mcf : 0.00 1 0 0 0 0
3.69/3.73 c Pricers : Time Calls Vars
3.69/3.73 c problem variables: 0.00 0 0
3.69/3.73 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
3.69/3.73 c relpscost : 2.95 20 0 47 0 0 14
3.69/3.73 c pscost : 0.00 0 0 0 0 0 0
3.69/3.73 c inference : 0.00 0 0 0 0 0 0
3.69/3.73 c mostinf : 0.00 0 0 0 0 0 0
3.69/3.73 c leastinf : 0.00 0 0 0 0 0 0
3.69/3.73 c fullstrong : 0.00 0 0 0 0 0 0
3.69/3.73 c allfullstrong : 0.00 0 0 0 0 0 0
3.69/3.73 c random : 0.00 0 0 0 0 0 0
3.69/3.73 c Primal Heuristics : Time Calls Found
3.69/3.73 c LP solutions : 0.00 - 1
3.69/3.73 c pseudo solutions : 0.00 - 0
3.69/3.73 c simplerounding : 0.00 0 0
3.69/3.73 c rounding : 0.00 0 0
3.69/3.73 c shifting : 0.00 0 0
3.69/3.73 c intshifting : 0.00 0 0
3.69/3.73 c oneopt : 0.00 0 0
3.69/3.73 c fixandinfer : 0.00 0 0
3.69/3.73 c feaspump : 0.00 0 0
3.69/3.73 c coefdiving : 0.00 0 0
3.69/3.73 c pscostdiving : 0.00 0 0
3.69/3.73 c fracdiving : 0.00 0 0
3.69/3.73 c veclendiving : 0.00 0 0
3.69/3.73 c intdiving : 0.00 0 0
3.69/3.73 c actconsdiving : 0.00 0 0
3.69/3.73 c objpscostdiving : 0.00 0 0
3.69/3.73 c rootsoldiving : 0.00 0 0
3.69/3.73 c linesearchdiving : 0.00 0 0
3.69/3.73 c guideddiving : 0.00 0 0
3.69/3.73 c octane : 0.00 0 0
3.69/3.73 c rens : 0.00 0 0
3.69/3.73 c rins : 0.00 0 0
3.69/3.73 c localbranching : 0.00 0 0
3.69/3.73 c mutation : 0.00 0 0
3.69/3.73 c crossover : 0.00 0 0
3.69/3.73 c dins : 0.00 0 0
3.69/3.73 c LP : Time Calls Iterations Iter/call Iter/sec
3.69/3.73 c primal LP : 0.00 0 0 0.00 -
3.69/3.73 c dual LP : 0.13 29 801 27.62 6161.54
3.69/3.73 c barrier LP : 0.00 0 0 0.00 -
3.69/3.73 c diving/probing LP: 0.00 0 0 0.00 -
3.69/3.73 c strong branching : 2.95 259 16717 64.54 5666.78
3.69/3.73 c (at root node) : - 33 6148 186.30 -
3.69/3.73 c conflict analysis: 0.00 0 0 0.00 -
3.69/3.73 c B&B Tree :
3.69/3.73 c number of runs : 1
3.69/3.73 c nodes : 11
3.69/3.73 c nodes (total) : 11
3.69/3.73 c nodes left : 4
3.69/3.73 c max depth : 7
3.69/3.73 c max depth (total): 7
3.69/3.73 c backtracks : 0 (0.0%)
3.69/3.73 c delayed cutoffs : 0
3.69/3.73 c repropagations : 0 (0 domain reductions, 0 cutoffs)
3.69/3.73 c avg switch length: 1.27
3.69/3.73 c switching time : 0.00
3.69/3.73 c Solution :
3.69/3.73 c Solutions found : 1 (1 improvements)
3.69/3.73 c Primal Bound : +2.20000000000000e+01 (in run 1, after 11 nodes, 3.67 seconds, depth 7, found by <relaxation>)
3.69/3.73 c Dual Bound : +1.10000000000000e+01
3.69/3.73 c Gap : 100.00 %
3.69/3.73 c Root Dual Bound : +1.10000000000000e+01
3.69/3.74 c Time complete: 3.73.
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL
This is runsolver version 3.3.1 (svn: 989)
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-3729877-1338680448/watcher-3729877-1338680448 -o /tmp/evaluation-result-3729877-1338680448/solver-3729877-1338680448 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 15500 -f HOME/instance-3729877-1338680448.opb
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.01 2.00 3/177 525
/proc/meminfo: memFree=27264936/32873844 swapFree=6608/6608
[pid=525] ppid=523 vsize=7152 CPUtime=0 cores=1,3,5,7
/proc/525/stat : 525 (pbscip.linux.x8) R 523 525 301 0 -1 4202496 1153 0 0 0 0 0 0 0 20 0 1 0 334169671 7323648 1106 33554432000 4194304 7823515 140737400338176 140735276748232 4402248 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/525/statm: 1788 1116 335 887 0 898 0
[startup+0.0738681 s]
/proc/loadavg: 2.00 2.01 2.00 3/177 525
/proc/meminfo: memFree=27264936/32873844 swapFree=6608/6608
[pid=525] ppid=523 vsize=20816 CPUtime=0.06 cores=1,3,5,7
/proc/525/stat : 525 (pbscip.linux.x8) R 523 525 301 0 -1 4202496 4870 0 0 0 6 0 0 0 20 0 1 0 334169671 21315584 4426 33554432000 4194304 7823515 140737400338176 140737400204280 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/525/statm: 5204 4426 534 887 0 4314 0
Current children cumulated CPU time (s) 0.06
Current children cumulated vsize (KiB) 20816
[startup+0.100328 s]
/proc/loadavg: 2.00 2.01 2.00 3/177 525
/proc/meminfo: memFree=27264936/32873844 swapFree=6608/6608
[pid=525] ppid=523 vsize=22308 CPUtime=0.09 cores=1,3,5,7
/proc/525/stat : 525 (pbscip.linux.x8) R 523 525 301 0 -1 4202496 5226 0 0 0 8 1 0 0 20 0 1 0 334169671 22843392 4782 33554432000 4194304 7823515 140737400338176 140737400204280 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/525/statm: 5577 4782 535 887 0 4687 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 22308
[startup+0.300225 s]
/proc/loadavg: 2.00 2.01 2.00 3/177 525
/proc/meminfo: memFree=27264936/32873844 swapFree=6608/6608
[pid=525] ppid=523 vsize=24868 CPUtime=0.29 cores=1,3,5,7
/proc/525/stat : 525 (pbscip.linux.x8) R 523 525 301 0 -1 4202496 5854 0 0 0 28 1 0 0 20 0 1 0 334169671 25464832 5409 33554432000 4194304 7823515 140737400338176 140737400204280 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/525/statm: 6217 5409 547 887 0 5327 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 24868
[startup+0.700225 s]
/proc/loadavg: 2.00 2.01 2.00 3/177 525
/proc/meminfo: memFree=27264936/32873844 swapFree=6608/6608
[pid=525] ppid=523 vsize=25408 CPUtime=0.69 cores=1,3,5,7
/proc/525/stat : 525 (pbscip.linux.x8) R 523 525 301 0 -1 4202496 6019 0 0 0 67 2 0 0 20 0 1 0 334169671 26017792 5574 33554432000 4194304 7823515 140737400338176 140737400204280 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/525/statm: 6352 5574 551 887 0 5462 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 25408
[startup+1.50022 s]
/proc/loadavg: 2.00 2.01 2.00 3/178 526
/proc/meminfo: memFree=27244956/32873844 swapFree=6608/6608
[pid=525] ppid=523 vsize=25760 CPUtime=1.49 cores=1,3,5,7
/proc/525/stat : 525 (pbscip.linux.x8) R 523 525 301 0 -1 4202496 6105 0 0 0 147 2 0 0 20 0 1 0 334169671 26378240 5660 33554432000 4194304 7823515 140737400338176 140737400332872 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/525/statm: 6440 5660 551 887 0 5550 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 25760
[startup+3.10023 s]
/proc/loadavg: 2.00 2.01 2.00 3/178 526
/proc/meminfo: memFree=27244336/32873844 swapFree=6608/6608
[pid=525] ppid=523 vsize=25760 CPUtime=3.09 cores=1,3,5,7
/proc/525/stat : 525 (pbscip.linux.x8) R 523 525 301 0 -1 4202496 6119 0 0 0 305 4 0 0 20 0 1 0 334169671 26378240 5674 33554432000 4194304 7823515 140737400338176 140737400332872 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/525/statm: 6440 5674 560 887 0 5550 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 25760
Solver just ended. Dumping a history of the last processes samples
[startup+3.50023 s]
/proc/loadavg: 2.00 2.01 2.00 3/178 526
/proc/meminfo: memFree=27244328/32873844 swapFree=6608/6608
[pid=525] ppid=523 vsize=25760 CPUtime=3.49 cores=1,3,5,7
/proc/525/stat : 525 (pbscip.linux.x8) R 523 525 301 0 -1 4202496 6119 0 0 0 345 4 0 0 20 0 1 0 334169671 26378240 5674 33554432000 4194304 7823515 140737400338176 140737400332872 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/525/statm: 6440 5674 560 887 0 5550 0
Current children cumulated CPU time (s) 3.49
Current children cumulated vsize (KiB) 25760
[startup+3.70023 s]
/proc/loadavg: 2.00 2.01 2.00 3/178 526
/proc/meminfo: memFree=27244328/32873844 swapFree=6608/6608
[pid=525] ppid=523 vsize=25760 CPUtime=3.69 cores=1,3,5,7
/proc/525/stat : 525 (pbscip.linux.x8) R 523 525 301 0 -1 4202496 6120 0 0 0 365 4 0 0 20 0 1 0 334169671 26378240 5675 33554432000 4194304 7823515 140737400338176 140737400332872 6099692 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/525/statm: 6440 5675 561 887 0 5550 0
Current children cumulated CPU time (s) 3.69
Current children cumulated vsize (KiB) 25760
Child status: 0
Real time (s): 3.74326
CPU time (s): 3.74243
CPU user time (s): 3.69244
CPU system time (s): 0.049992
CPU usage (%): 99.9778
Max. virtual memory (cumulated for all children) (KiB): 25760
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 3.69244
system time used= 0.049992
maximum resident set size= 22724
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 6130
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= 3
involuntary context switches= 5
runsolver used 0.025996 second user time and 0.030995 second system time
The end