0.00/0.00 c SCIP version 1.2.1.3 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.4.2]
0.00/0.00 c Copyright (c) 2002-2010 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-3729856-1338679982.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 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 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 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 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 1.2.1.3
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 = 1789.98
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 # 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 <nlp> (-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/nlp/freq = -1
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 <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 <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 <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.05/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.05/0.06 c 0.0s| 1 | 0 | 76 | - |3488k| 0 | 36 | 231 |2443 | 231 |2443 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.21 c 0.2s| 1 | 0 | 94 | - |3937k| 0 | 45 | 231 |2630 | 231 |2455 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 107 | - |4311k| 0 | 50 | 231 |2630 | 231 |2460 | 17 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.42 c 0.4s| 1 | 0 | 127 | - |4692k| 0 | 48 | 231 |2630 | 231 |2464 | 21 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.54 c 0.5s| 1 | 0 | 148 | - |5183k| 0 | 49 | 231 |2630 | 231 |2465 | 22 | 0 | 0 | 0.000000e+00 | -- | Inf
0.59/0.69 c 0.7s| 1 | 0 | 157 | - |5528k| 0 | 50 | 231 |2630 | 231 |2466 | 23 | 0 | 0 | 0.000000e+00 | -- | Inf
0.79/0.86 c 0.8s| 1 | 2 | 157 | - |5529k| 0 | 50 | 231 |2630 | 231 |2466 | 23 | 0 | 10 | 0.000000e+00 | -- | Inf
11.99/12.04 c *12.0s| 95 | 0 | 5081 | 52.4 |5689k| 16 | - | 231 |2648 | 231 |2452 | 23 | 18 |1329 | 0.000000e+00 | 0.000000e+00 | 0.00%
11.99/12.04 c
11.99/12.04 c SCIP Status : problem is solved [optimal solution found]
11.99/12.04 c Solving Time (sec) : 12.02
11.99/12.04 c Solving Nodes : 95
11.99/12.04 c Primal Bound : +0.00000000000000e+00 (1 solutions)
11.99/12.04 c Dual Bound : +0.00000000000000e+00
11.99/12.04 c Gap : 0.00 %
11.99/12.04 s SATISFIABLE
11.99/12.04 v -x221 -x211 -x201 -x191 -x181 -x171 -x161 -x151 x141 -x131 x231 -x210 -x200 -x190 -x180 -x170 -x160 -x150 -x140 -x130 -x230 -x220
11.99/12.04 v -x199 -x189 -x179 -x169 x159 -x149 -x139 -x129 -x229 -x219 -x209 -x188 -x178 -x168 -x158 x148 -x138 -x128 -x228 x218 -x208
11.99/12.04 v -x198 -x177 -x167 -x157 -x147 -x137 -x127 -x227 -x217 -x207 -x197 x187 -x166 -x156 -x146 -x136 -x126 -x226 -x216 -x206 x196
11.99/12.04 v -x186 -x176 -x155 -x145 -x135 -x125 -x225 -x215 -x205 -x195 -x185 -x175 -x165 -x144 -x134 x124 -x224 -x214 -x204 -x194 -x184
11.99/12.04 v x174 -x164 -x154 -x133 -x123 -x223 -x213 x203 -x193 -x183 -x173 -x163 -x153 -x143 -x122 -x222 -x212 -x202 -x192 -x182 -x172 x162
11.99/12.04 v -x152 -x142 -x132 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 x112 -x111 -x110 -x109 x108 -x107 -x106 -x105 -x104
11.99/12.04 v -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80
11.99/12.04 v -x79 x78 -x77 -x76 -x75 -x74 -x73 -x72 x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54
11.99/12.04 v -x53 -x52 -x51 -x50 -x49 -x48 x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 x39 -x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 -x30 x29
11.99/12.04 v -x28 -x27 -x26 -x25 -x24 -x23 -x22 x11 x21 -x10 -x20 -x9 -x19 -x8 -x18 -x7 -x17 -x6 -x16 -x5 -x15 -x4 -x14 -x3 -x13 -x2 -x12
11.99/12.04 v -x1
11.99/12.04 c SCIP Status : problem is solved [optimal solution found]
11.99/12.04 c Solving Time : 12.02
11.99/12.04 c Original Problem :
11.99/12.04 c Problem name : HOME/instance-3729856-1338679982.opb
11.99/12.04 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
11.99/12.04 c Constraints : 2707 initial, 2707 maximal
11.99/12.04 c Presolved Problem :
11.99/12.04 c Problem name : t_HOME/instance-3729856-1338679982.opb
11.99/12.04 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
11.99/12.04 c Constraints : 2443 initial, 2648 maximal
11.99/12.04 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
11.99/12.04 c trivial : 0.00 0 0 0 0 0 0 0 0
11.99/12.04 c dualfix : 0.00 0 0 0 0 0 0 0 0
11.99/12.04 c boundshift : 0.00 0 0 0 0 0 0 0 0
11.99/12.04 c inttobinary : 0.00 0 0 0 0 0 0 0 0
11.99/12.04 c implics : 0.00 0 0 0 0 0 0 0 0
11.99/12.04 c probing : 0.00 0 0 0 0 0 0 0 0
11.99/12.04 c knapsack : 0.00 0 0 0 0 0 0 0 0
11.99/12.04 c setppc : 0.00 0 0 0 0 0 121 0 0
11.99/12.04 c linear : 0.01 0 0 0 0 0 143 0 0
11.99/12.04 c logicor : 0.01 0 0 0 0 0 0 0 0
11.99/12.04 c root node : - 0 - - 0 - - - -
11.99/12.04 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
11.99/12.04 c integral : 0 0 0 210 0 18 370 0 0 120
11.99/12.04 c knapsack : 1 5 395 1 0 0 158 0 0 0
11.99/12.04 c setppc : 22 5 395 1 0 4 697 0 0 0
11.99/12.04 c linear : 0+ 5 389 0 0 0 5 3 0 0
11.99/12.04 c logicor : 2420+ 5 347 1 0 1 763 0 0 0
11.99/12.04 c countsols : 0 0 0 1 0 0 0 0 0 0
11.99/12.04 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
11.99/12.04 c integral : 10.53 0.00 0.00 10.53 0.00
11.99/12.04 c knapsack : 0.00 0.00 0.00 0.00 0.00
11.99/12.04 c setppc : 0.00 0.00 0.00 0.00 0.00
11.99/12.04 c linear : 0.00 0.00 0.00 0.00 0.00
11.99/12.04 c logicor : 0.01 0.00 0.00 0.00 0.00
11.99/12.04 c countsols : 0.00 0.00 0.00 0.00 0.00
11.99/12.04 c Propagators : Time Calls Cutoffs DomReds
11.99/12.04 c vbounds : 0.00 1 0 0
11.99/12.04 c rootredcost : 0.00 0 0 0
11.99/12.04 c pseudoobj : 0.00 0 0 0
11.99/12.04 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
11.99/12.04 c propagation : 0.00 5 5 29 24.9 0 0.0 -
11.99/12.04 c infeasible LP : 0.00 12 8 43 36.8 0 0.0 0
11.99/12.04 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
11.99/12.04 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
11.99/12.04 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
11.99/12.04 c applied globally : - - - 18 18.1 - - -
11.99/12.04 c applied locally : - - - 0 0.0 - - -
11.99/12.04 c Separators : Time Calls Cutoffs DomReds Cuts Conss
11.99/12.04 c cut pool : 0.00 4 - - 81 - (maximal pool size: 587)
11.99/12.04 c redcost : 0.00 91 0 0 0 0
11.99/12.04 c impliedbounds : 0.00 5 0 0 0 0
11.99/12.04 c intobj : 0.00 0 0 0 0 0
11.99/12.04 c cgmip : 0.00 0 0 0 0 0
11.99/12.04 c gomory : 0.31 5 0 0 1227 0
11.99/12.04 c strongcg : 0.19 5 0 0 2394 0
11.99/12.04 c cmir : 0.00 0 0 0 0 0
11.99/12.04 c flowcover : 0.00 0 0 0 0 0
11.99/12.04 c clique : 0.00 5 0 0 0 0
11.99/12.04 c zerohalf : 0.00 0 0 0 0 0
11.99/12.04 c mcf : 0.00 1 0 0 0 0
11.99/12.04 c rapidlearning : 0.10 1 0 0 0 187
11.99/12.04 c Pricers : Time Calls Vars
11.99/12.04 c problem variables: 0.00 0 0
11.99/12.04 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
11.99/12.04 c relpscost : 10.53 209 18 370 0 0 120
11.99/12.04 c pscost : 0.00 0 0 0 0 0 0
11.99/12.04 c inference : 0.00 0 0 0 0 0 0
11.99/12.04 c mostinf : 0.00 0 0 0 0 0 0
11.99/12.04 c leastinf : 0.00 0 0 0 0 0 0
11.99/12.04 c fullstrong : 0.00 0 0 0 0 0 0
11.99/12.04 c allfullstrong : 0.00 0 0 0 0 0 0
11.99/12.04 c random : 0.00 0 0 0 0 0 0
11.99/12.04 c Primal Heuristics : Time Calls Found
11.99/12.04 c LP solutions : 0.00 - 1
11.99/12.04 c pseudo solutions : 0.00 - 0
11.99/12.04 c trivial : 0.00 1 0
11.99/12.04 c simplerounding : 0.00 0 0
11.99/12.04 c zirounding : 0.00 0 0
11.99/12.04 c rounding : 0.00 0 0
11.99/12.04 c shifting : 0.00 0 0
11.99/12.04 c intshifting : 0.00 0 0
11.99/12.04 c oneopt : 0.00 0 0
11.99/12.04 c twoopt : 0.00 0 0
11.99/12.04 c fixandinfer : 0.00 0 0
11.99/12.04 c feaspump : 0.00 0 0
11.99/12.04 c coefdiving : 0.00 0 0
11.99/12.04 c pscostdiving : 0.00 0 0
11.99/12.04 c fracdiving : 0.00 0 0
11.99/12.04 c veclendiving : 0.00 0 0
11.99/12.04 c intdiving : 0.00 0 0
11.99/12.04 c actconsdiving : 0.00 0 0
11.99/12.04 c objpscostdiving : 0.00 0 0
11.99/12.04 c rootsoldiving : 0.00 0 0
11.99/12.04 c linesearchdiving : 0.00 0 0
11.99/12.04 c guideddiving : 0.00 0 0
11.99/12.04 c octane : 0.00 0 0
11.99/12.04 c rens : 0.00 0 0
11.99/12.04 c rins : 0.00 0 0
11.99/12.04 c localbranching : 0.00 0 0
11.99/12.04 c mutation : 0.00 0 0
11.99/12.04 c crossover : 0.00 0 0
11.99/12.04 c dins : 0.00 0 0
11.99/12.04 c undercover : 0.00 0 0
11.99/12.04 c nlp : 0.00 0 0
11.99/12.04 c trysol : 0.00 0 0
11.99/12.04 c LP : Time Calls Iterations Iter/call Iter/sec
11.99/12.04 c primal LP : 0.00 0 0 0.00 -
11.99/12.04 c dual LP : 0.78 227 5081 22.38 6506.79
11.99/12.04 c lex dual LP : 0.00 0 0 0.00 -
11.99/12.04 c barrier LP : 0.00 0 0 0.00 -
11.99/12.04 c diving/probing LP: 0.00 0 0 0.00 -
11.99/12.04 c strong branching : 10.53 1329 70710 53.21 6716.99
11.99/12.04 c (at root node) : - 10 1149 114.90 -
11.99/12.04 c conflict analysis: 0.00 0 0 0.00 -
11.99/12.04 c B&B Tree :
11.99/12.04 c number of runs : 1
11.99/12.04 c nodes : 95
11.99/12.04 c nodes (total) : 95
11.99/12.04 c nodes left : 0
11.99/12.04 c max depth : 16
11.99/12.04 c max depth (total): 16
11.99/12.04 c backtracks : 7 (7.4%)
11.99/12.04 c delayed cutoffs : 1
11.99/12.04 c repropagations : 5 (44 domain reductions, 1 cutoffs)
11.99/12.04 c avg switch length: 2.29
11.99/12.04 c switching time : 0.01
11.99/12.04 c Solution :
11.99/12.04 c Solutions found : 1 (1 improvements)
11.99/12.04 c First Solution : +0.00000000000000e+00 (in run 1, after 95 nodes, 12.02 seconds, depth 9, found by <relaxation>)
11.99/12.04 c Primal Bound : +0.00000000000000e+00 (in run 1, after 95 nodes, 12.02 seconds, depth 9, found by <relaxation>)
11.99/12.04 c Dual Bound : +0.00000000000000e+00
11.99/12.04 c Gap : 0.00 %
11.99/12.04 c Root Dual Bound : +0.00000000000000e+00
11.99/12.04 c Root Iterations : 157
11.99/12.05 c Time complete: 12.04.
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-3729856-1338679982/watcher-3729856-1338679982 -o /tmp/evaluation-result-3729856-1338679982/solver-3729856-1338679982 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-3729856-1338679982.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.02 1.98 1.65 3/176 21760
/proc/meminfo: memFree=28461280/32873648 swapFree=7388/7388
[pid=21760] ppid=21758 vsize=9972 CPUtime=0 cores=1,3,5,7
/proc/21760/stat : 21760 (pbscip.linux.x8) R 21758 21760 21664 0 -1 4202496 1764 0 0 0 0 0 0 0 20 0 1 0 334122718 10211328 1711 33554432000 4194304 8395647 140733570180880 140735216122872 7382157 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/21760/statm: 2507 1721 375 1026 0 1477 0
[startup+0.0606899 s]
/proc/loadavg: 2.02 1.98 1.65 3/176 21760
/proc/meminfo: memFree=28461280/32873648 swapFree=7388/7388
[pid=21760] ppid=21758 vsize=21220 CPUtime=0.05 cores=1,3,5,7
/proc/21760/stat : 21760 (pbscip.linux.x8) R 21758 21760 21664 0 -1 4202496 4698 0 0 0 5 0 0 0 20 0 1 0 334122718 21729280 4291 33554432000 4194304 8395647 140733570180880 140735216122872 6679443 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21760/statm: 5305 4300 535 1026 0 4275 0
Current children cumulated CPU time (s) 0.05
Current children cumulated vsize (KiB) 21220
[startup+0.100266 s]
/proc/loadavg: 2.02 1.98 1.65 3/176 21760
/proc/meminfo: memFree=28461280/32873648 swapFree=7388/7388
[pid=21760] ppid=21758 vsize=23800 CPUtime=0.09 cores=1,3,5,7
/proc/21760/stat : 21760 (pbscip.linux.x8) R 21758 21760 21664 0 -1 4202496 5516 0 0 0 9 0 0 0 20 0 1 0 334122718 24371200 5068 33554432000 4194304 8395647 140733570180880 140735216122872 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21760/statm: 5950 5068 584 1026 0 4920 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 23800
[startup+0.300267 s]
/proc/loadavg: 2.02 1.98 1.65 3/176 21760
/proc/meminfo: memFree=28461280/32873648 swapFree=7388/7388
[pid=21760] ppid=21758 vsize=37592 CPUtime=0.29 cores=1,3,5,7
/proc/21760/stat : 21760 (pbscip.linux.x8) R 21758 21760 21664 0 -1 4202496 8769 0 0 0 28 1 0 0 20 0 1 0 334122718 38494208 8290 33554432000 4194304 8395647 140733570180880 140735216122872 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21760/statm: 9398 8290 616 1026 0 8368 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 37592
[startup+0.700251 s]
/proc/loadavg: 2.02 1.98 1.65 3/176 21760
/proc/meminfo: memFree=28461280/32873648 swapFree=7388/7388
[pid=21760] ppid=21758 vsize=37592 CPUtime=0.69 cores=1,3,5,7
/proc/21760/stat : 21760 (pbscip.linux.x8) R 21758 21760 21664 0 -1 4202496 8855 0 0 0 68 1 0 0 20 0 1 0 334122718 38494208 8376 33554432000 4194304 8395647 140733570180880 140733570176168 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21760/statm: 9398 8376 621 1026 0 8368 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 37592
[startup+1.50029 s]
/proc/loadavg: 2.02 1.98 1.65 3/177 21761
/proc/meminfo: memFree=28431024/32873648 swapFree=7388/7388
[pid=21760] ppid=21758 vsize=37592 CPUtime=1.49 cores=1,3,5,7
/proc/21760/stat : 21760 (pbscip.linux.x8) R 21758 21760 21664 0 -1 4202496 8858 0 0 0 147 2 0 0 20 0 1 0 334122718 38494208 8379 33554432000 4194304 8395647 140733570180880 140733570176168 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21760/statm: 9398 8379 624 1026 0 8368 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 37592
[startup+3.10022 s]
/proc/loadavg: 2.02 1.98 1.65 3/177 21761
/proc/meminfo: memFree=28430264/32873648 swapFree=7388/7388
[pid=21760] ppid=21758 vsize=37592 CPUtime=3.09 cores=1,3,5,7
/proc/21760/stat : 21760 (pbscip.linux.x8) R 21758 21760 21664 0 -1 4202496 8859 0 0 0 306 3 0 0 20 0 1 0 334122718 38494208 8380 33554432000 4194304 8395647 140733570180880 140733570175752 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21760/statm: 9398 8380 625 1026 0 8368 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 37592
[startup+6.30027 s]
/proc/loadavg: 2.02 1.98 1.65 3/177 21761
/proc/meminfo: memFree=28430404/32873648 swapFree=7388/7388
[pid=21760] ppid=21758 vsize=37592 CPUtime=6.29 cores=1,3,5,7
/proc/21760/stat : 21760 (pbscip.linux.x8) R 21758 21760 21664 0 -1 4202496 8860 0 0 0 623 6 0 0 20 0 1 0 334122718 38494208 8381 33554432000 4194304 8395647 140733570180880 140733570175672 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21760/statm: 9398 8381 626 1026 0 8368 0
Current children cumulated CPU time (s) 6.29
Current children cumulated vsize (KiB) 37592
Solver just ended. Dumping a history of the last processes samples
[startup+9.50031 s]
/proc/loadavg: 2.01 1.98 1.65 3/177 21761
/proc/meminfo: memFree=28430476/32873648 swapFree=7388/7388
[pid=21760] ppid=21758 vsize=37592 CPUtime=9.49 cores=1,3,5,7
/proc/21760/stat : 21760 (pbscip.linux.x8) R 21758 21760 21664 0 -1 4202496 8861 0 0 0 942 7 0 0 20 0 1 0 334122718 38494208 8382 33554432000 4194304 8395647 140733570180880 140733570175432 6390530 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21760/statm: 9398 8382 627 1026 0 8368 0
Current children cumulated CPU time (s) 9.49
Current children cumulated vsize (KiB) 37592
[startup+11.1003 s]
/proc/loadavg: 2.01 1.98 1.65 3/177 21761
/proc/meminfo: memFree=28430120/32873648 swapFree=7388/7388
[pid=21760] ppid=21758 vsize=37592 CPUtime=11.08 cores=1,3,5,7
/proc/21760/stat : 21760 (pbscip.linux.x8) R 21758 21760 21664 0 -1 4202496 8861 0 0 0 1100 8 0 0 20 0 1 0 334122718 38494208 8382 33554432000 4194304 8395647 140733570180880 140733570175752 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21760/statm: 9398 8382 627 1026 0 8368 0
Current children cumulated CPU time (s) 11.08
Current children cumulated vsize (KiB) 37592
[startup+11.5003 s]
/proc/loadavg: 2.01 1.98 1.65 3/177 21761
/proc/meminfo: memFree=28430120/32873648 swapFree=7388/7388
[pid=21760] ppid=21758 vsize=37592 CPUtime=11.49 cores=1,3,5,7
/proc/21760/stat : 21760 (pbscip.linux.x8) R 21758 21760 21664 0 -1 4202496 8861 0 0 0 1140 9 0 0 20 0 1 0 334122718 38494208 8382 33554432000 4194304 8395647 140733570180880 140733570175752 6697065 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21760/statm: 9398 8382 627 1026 0 8368 0
Current children cumulated CPU time (s) 11.49
Current children cumulated vsize (KiB) 37592
[startup+11.9002 s]
/proc/loadavg: 2.01 1.98 1.65 3/177 21761
/proc/meminfo: memFree=28430120/32873648 swapFree=7388/7388
[pid=21760] ppid=21758 vsize=37592 CPUtime=11.89 cores=1,3,5,7
/proc/21760/stat : 21760 (pbscip.linux.x8) R 21758 21760 21664 0 -1 4202496 8861 0 0 0 1180 9 0 0 20 0 1 0 334122718 38494208 8382 33554432000 4194304 8395647 140733570180880 140733570176344 7428202 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21760/statm: 9398 8382 627 1026 0 8368 0
Current children cumulated CPU time (s) 11.89
Current children cumulated vsize (KiB) 37592
[startup+12.0003 s]
/proc/loadavg: 2.01 1.98 1.65 3/177 21761
/proc/meminfo: memFree=28430252/32873648 swapFree=7388/7388
[pid=21760] ppid=21758 vsize=37592 CPUtime=11.99 cores=1,3,5,7
/proc/21760/stat : 21760 (pbscip.linux.x8) R 21758 21760 21664 0 -1 4202496 8861 0 0 0 1190 9 0 0 20 0 1 0 334122718 38494208 8382 33554432000 4194304 8395647 140733570180880 140733570176344 6472181 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21760/statm: 9398 8382 627 1026 0 8368 0
Current children cumulated CPU time (s) 11.99
Current children cumulated vsize (KiB) 37592
Child status: 0
Real time (s): 12.0523
CPU time (s): 12.0492
CPU user time (s): 11.9502
CPU system time (s): 0.098984
CPU usage (%): 99.9738
Max. virtual memory (cumulated for all children) (KiB): 37592
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 11.9502
system time used= 0.098984
maximum resident set size= 33540
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 8867
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= 13
runsolver used 0.019996 second user time and 0.06499 second system time
The end