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-3728998-1338678626.opb>
0.00/0.01 c original problem has 220 variables (220 bin, 0 int, 0 impl, 0 cont) and 470 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.00/0.01 c presolving:
0.00/0.01 c (round 1) 3 del vars, 1 del conss, 1 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 256 impls, 0 clqs
0.00/0.01 c (round 2) 13 del vars, 17 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 256 impls, 0 clqs
0.00/0.01 c (round 3) 13 del vars, 27 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 256 impls, 0 clqs
0.00/0.02 c (round 4) 13 del vars, 27 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 443 upgd conss, 256 impls, 0 clqs
0.01/0.02 c (round 5) 19 del vars, 27 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 443 upgd conss, 4704 impls, 6 clqs
0.01/0.03 c (round 6) 19 del vars, 33 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 443 upgd conss, 4704 impls, 6 clqs
0.01/0.03 c (round 7) 19 del vars, 35 del conss, 11 chg bounds, 0 chg sides, 0 chg coeffs, 443 upgd conss, 4704 impls, 6 clqs
0.01/0.03 c presolving (8 rounds):
0.01/0.03 c 19 deleted vars, 35 deleted constraints, 11 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.01/0.03 c 4704 implications, 6 cliques
0.01/0.03 c presolved problem has 201 variables (201 bin, 0 int, 0 impl, 0 cont) and 435 constraints
0.01/0.03 c 129 constraints of type <knapsack>
0.01/0.03 c 95 constraints of type <setppc>
0.01/0.03 c 211 constraints of type <logicor>
0.01/0.03 c transformed objective value is always integral (scale: 1)
0.01/0.03 c Presolving Time: 0.02
0.01/0.03 c - non default parameters ----------------------------------------------------------------------
0.01/0.03 c # SCIP version 1.2.1.3
0.01/0.03 c
0.01/0.03 c # frequency for displaying node information lines
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 100]
0.01/0.03 c display/freq = 10000
0.01/0.03 c
0.01/0.03 c # maximal time in seconds to run
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/time = 1790
0.01/0.03 c
0.01/0.03 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.01/0.03 c limits/memory = 13950
0.01/0.03 c
0.01/0.03 c # solving stops, if the given number of solutions were found (-1: no limit)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c limits/solutions = 1
0.01/0.03 c
0.01/0.03 c # maximal number of separation rounds per node (-1: unlimited)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 5]
0.01/0.03 c separating/maxrounds = 1
0.01/0.03 c
0.01/0.03 c # maximal number of separation rounds in the root node (-1: unlimited)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c separating/maxroundsroot = 5
0.01/0.03 c
0.01/0.03 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.01/0.03 c # [type: int, range: [1,2], default: 1]
0.01/0.03 c timing/clocktype = 2
0.01/0.03 c
0.01/0.03 c # should presolving try to simplify inequalities
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/linear/simplifyinequalities = TRUE
0.01/0.03 c
0.01/0.03 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/indicator/addCouplingCons = TRUE
0.01/0.03 c
0.01/0.03 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.01/0.03 c constraints/knapsack/disaggregation = FALSE
0.01/0.03 c
0.01/0.03 c # should presolving try to simplify knapsacks
0.01/0.03 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.01/0.03 c constraints/knapsack/simplifyinequalities = TRUE
0.01/0.03 c
0.01/0.03 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c presolving/probing/maxrounds = 0
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/coefdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/coefdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/coefdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 30]
0.01/0.03 c heuristics/crossover/freq = -1
0.01/0.03 c
0.01/0.03 c # number of nodes added to the contingent of the total nodes
0.01/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.03 c heuristics/crossover/nodesofs = 750
0.01/0.03 c
0.01/0.03 c # number of nodes without incumbent change that heuristic should wait
0.01/0.03 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.01/0.03 c heuristics/crossover/nwaitingnodes = 100
0.01/0.03 c
0.01/0.03 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.01/0.03 c # [type: real, range: [0,1], default: 0.1]
0.01/0.03 c heuristics/crossover/nodesquot = 0.15
0.01/0.03 c
0.01/0.03 c # minimum percentage of integer variables that have to be fixed
0.01/0.03 c # [type: real, range: [0,1], default: 0.666]
0.01/0.03 c heuristics/crossover/minfixingrate = 0.5
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03 c heuristics/feaspump/freq = -1
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/feaspump/maxlpiterofs = 2000
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/fracdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/fracdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/fracdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/guideddiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/guideddiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/guideddiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/intdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/intshifting/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/linesearchdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <nlp> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/nlp/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03 c heuristics/objpscostdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to total iteration number
0.01/0.03 c # [type: real, range: [0,1], default: 0.01]
0.01/0.03 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/oneopt/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/pscostdiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/pscostdiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c heuristics/rens/freq = -1
0.01/0.03 c
0.01/0.03 c # minimum percentage of integer variables that have to be fixable
0.01/0.03 c # [type: real, range: [0,1], default: 0.5]
0.01/0.03 c heuristics/rens/minfixingrate = 0.3
0.01/0.03 c
0.01/0.03 c # number of nodes added to the contingent of the total nodes
0.01/0.03 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.01/0.03 c heuristics/rens/nodesofs = 2000
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 20]
0.01/0.03 c heuristics/rootsoldiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.01/0.03 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/rounding/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/shifting/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/simplerounding/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c heuristics/trivial/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/trysol/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 10]
0.01/0.03 c heuristics/veclendiving/freq = -1
0.01/0.03 c
0.01/0.03 c # maximal fraction of diving LP iterations compared to node LP iterations
0.01/0.03 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.01/0.03 c heuristics/veclendiving/maxlpiterquot = 0.075
0.01/0.03 c
0.01/0.03 c # additional number of allowed LP iterations
0.01/0.03 c # [type: int, range: [0,2147483647], default: 1000]
0.01/0.03 c heuristics/veclendiving/maxlpiterofs = 1500
0.01/0.03 c
0.01/0.03 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 1]
0.01/0.03 c heuristics/zirounding/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c separating/cmir/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: 0]
0.01/0.03 c separating/flowcover/freq = -1
0.01/0.03 c
0.01/0.03 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.01/0.03 c # [type: int, range: [-1,2147483647], default: -1]
0.01/0.03 c separating/rapidlearning/freq = 0
0.01/0.03 c
0.01/0.03 c -----------------------------------------------------------------------------------------------
0.01/0.03 c start solving
0.01/0.03 c
0.01/0.04 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.04 c 0.0s| 1 | 0 | 269 | - |1437k| 0 | 116 | 201 | 435 | 201 | 435 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.20 c 0.2s| 1 | 0 | 605 | - |2682k| 0 | 159 | 201 | 498 | 201 | 673 | 238 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.30 c 0.3s| 1 | 0 | 877 | - |4012k| 0 | 172 | 201 | 498 | 201 | 749 | 314 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.42 c 0.4s| 1 | 0 | 1180 | - |5707k| 0 | 176 | 201 | 498 | 201 | 787 | 352 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.52 c 0.5s| 1 | 0 | 1431 | - |7171k| 0 | 177 | 201 | 498 | 201 | 809 | 374 | 0 | 0 | 0.000000e+00 | -- | Inf
0.58/0.66 c 0.6s| 1 | 0 | 1846 | - |8941k| 0 | 189 | 201 | 498 | 201 | 828 | 393 | 0 | 0 | 0.000000e+00 | -- | Inf
1.59/1.63 c 1.6s| 1 | 2 | 1846 | - |8941k| 0 | 189 | 201 | 498 | 201 | 828 | 393 | 0 | 10 | 0.000000e+00 | -- | Inf
9.39/9.47 c * 9.5s| 1960 | 0 | 46588 | 22.8 |9459k| 23 | - | 201 |1551 | 201 | 585 | 393 |1120 |1258 | 0.000000e+00 | 0.000000e+00 | 0.00%
9.39/9.47 c
9.39/9.47 c SCIP Status : problem is solved [optimal solution found]
9.39/9.47 c Solving Time (sec) : 9.46
9.39/9.47 c Solving Nodes : 1960
9.39/9.47 c Primal Bound : +0.00000000000000e+00 (1 solutions)
9.39/9.47 c Dual Bound : +0.00000000000000e+00
9.39/9.47 c Gap : 0.00 %
9.39/9.47 s SATISFIABLE
9.39/9.47 v x219 -x220 x217 -x218 x215 -x216 x213 -x214 x211 -x212 x209 -x210 x207 -x208 -x205 -x206 -x203 -x204 x201 -x202 x199 -x200 -x197
9.39/9.47 v x198 x195 -x196 -x193 x194 x191 -x192 x189 -x190 x187 -x188 -x185 x186 -x183 x184 -x181 x182 -x179 -x180 -x177 -x178 -x175
9.39/9.47 v -x176 -x173 x174 -x171 -x172 -x169 x170 -x167 x168 -x165 x166 -x163 x164 -x161 x162 x159 -x160 x157 -x158 x155 -x156 -x153 x154
9.39/9.47 v -x151 x152 -x149 x150 -x147 x148 -x145 x146 -x143 x144 -x141 x142 x139 -x140 x137 -x138 -x135 x136 -x133 x134 x131 -x132 x129
9.39/9.47 v -x130 -x128 -x126 -x124 -x122 -x120 -x118 -x116 -x114 -x112 -x110 -x108 -x106 -x104 -x102 -x100 -x98 x96 x94 -x92 -x90 -x88
9.39/9.47 v -x86 -x84 -x82 x80 -x78 x76 -x74 -x72 -x70 -x68 -x66 -x64 -x62 -x60 -x58 -x56 -x54 -x52 -x50 -x48 -x46 -x44 -x42 -x40 -x38
9.39/9.47 v -x36 -x34 -x32 x30 x28 -x26 -x24 -x22 -x20 -x18 x16 x14 x12 -x10 -x8 -x6 -x4 -x2 -x127 -x125 -x123 -x121 x119 -x117 x115 -x113
9.39/9.47 v -x111 -x109 -x107 x105 -x103 x101 -x99 -x97 -x95 -x93 -x91 -x89 -x87 -x85 -x83 -x81 -x79 -x77 -x75 -x73 -x71 -x69 -x67 -x65
9.39/9.47 v -x63 -x61 -x59 -x57 -x55 -x53 x51 x49 -x47 -x45 -x43 -x41 -x39 x37 x35 x33 -x31 -x29 -x27 -x25 -x23 -x21 -x19 -x17 -x15 -x13
9.39/9.47 v -x11 -x9 -x7 -x5 -x3 -x1
9.39/9.47 c SCIP Status : problem is solved [optimal solution found]
9.39/9.47 c Solving Time : 9.46
9.39/9.47 c Original Problem :
9.39/9.47 c Problem name : HOME/instance-3728998-1338678626.opb
9.39/9.47 c Variables : 220 (220 binary, 0 integer, 0 implicit integer, 0 continuous)
9.39/9.47 c Constraints : 470 initial, 470 maximal
9.39/9.47 c Presolved Problem :
9.39/9.47 c Problem name : t_HOME/instance-3728998-1338678626.opb
9.39/9.47 c Variables : 201 (201 binary, 0 integer, 0 implicit integer, 0 continuous)
9.39/9.47 c Constraints : 435 initial, 1551 maximal
9.39/9.47 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
9.39/9.47 c trivial : 0.00 0 0 0 0 0 0 0 0
9.39/9.47 c dualfix : 0.00 0 0 0 0 0 0 0 0
9.39/9.47 c boundshift : 0.00 0 0 0 0 0 0 0 0
9.39/9.47 c inttobinary : 0.00 0 0 0 0 0 0 0 0
9.39/9.47 c implics : 0.00 0 8 0 0 0 0 0 0
9.39/9.47 c probing : 0.00 0 0 0 0 0 0 0 0
9.39/9.47 c knapsack : 0.00 0 0 0 0 0 0 0 0
9.39/9.47 c setppc : 0.00 0 0 0 0 0 8 0 0
9.39/9.47 c linear : 0.01 11 0 0 11 0 27 0 0
9.39/9.47 c logicor : 0.00 0 0 0 0 0 0 0 0
9.39/9.47 c root node : - 0 - - 0 - - - -
9.39/9.47 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
9.39/9.47 c integral : 0 0 0 1176 0 13 165 0 0 2174
9.39/9.47 c knapsack : 129 5 8453 1 0 599 19788 445 0 0
9.39/9.47 c setppc : 95 5 7789 0 0 42 6383 0 0 0
9.39/9.47 c linear : 0+ 5 4595 0 0 0 23 1 0 0
9.39/9.47 c logicor : 211+ 5 6226 1 0 197 8125 0 0 0
9.39/9.47 c countsols : 0 0 0 1 0 0 0 0 0 0
9.39/9.47 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
9.39/9.47 c integral : 5.61 0.00 0.00 5.61 0.00
9.39/9.47 c knapsack : 0.10 0.00 0.09 0.00 0.00
9.39/9.47 c setppc : 0.01 0.00 0.01 0.00 0.00
9.39/9.47 c linear : 0.00 0.00 0.00 0.00 0.00
9.39/9.47 c logicor : 0.04 0.00 0.04 0.00 0.00
9.39/9.47 c countsols : 0.00 0.00 0.00 0.00 0.00
9.39/9.47 c Propagators : Time Calls Cutoffs DomReds
9.39/9.47 c vbounds : 0.00 1 0 0
9.39/9.47 c rootredcost : 0.00 0 0 0
9.39/9.47 c pseudoobj : 0.00 0 0 0
9.39/9.47 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
9.39/9.47 c propagation : 0.05 838 745 4951 44.1 16 27.7 -
9.39/9.47 c infeasible LP : 0.01 201 3 22 43.1 0 0.0 0
9.39/9.47 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
9.39/9.47 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
9.39/9.47 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
9.39/9.47 c applied globally : - - - 1108 14.1 - - -
9.39/9.47 c applied locally : - - - 12 50.3 - - -
9.39/9.47 c Separators : Time Calls Cutoffs DomReds Cuts Conss
9.39/9.47 c cut pool : 0.00 4 - - 35 - (maximal pool size: 2312)
9.39/9.47 c redcost : 0.00 1127 0 0 0 0
9.39/9.47 c impliedbounds : 0.00 5 0 0 600 0
9.39/9.47 c intobj : 0.00 0 0 0 0 0
9.39/9.47 c cgmip : 0.00 0 0 0 0 0
9.39/9.47 c gomory : 0.14 5 0 0 62 0
9.39/9.47 c strongcg : 0.15 5 0 0 2353 0
9.39/9.47 c cmir : 0.00 0 0 0 0 0
9.39/9.47 c flowcover : 0.00 0 0 0 0 0
9.39/9.47 c clique : 0.00 5 0 0 14 0
9.39/9.47 c zerohalf : 0.00 0 0 0 0 0
9.39/9.47 c mcf : 0.00 1 0 0 0 0
9.39/9.47 c rapidlearning : 0.08 1 0 0 0 63
9.39/9.47 c Pricers : Time Calls Vars
9.39/9.47 c problem variables: 0.00 0 0
9.39/9.47 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
9.39/9.47 c relpscost : 5.61 1175 13 165 0 0 2174
9.39/9.47 c pscost : 0.00 0 0 0 0 0 0
9.39/9.47 c inference : 0.00 0 0 0 0 0 0
9.39/9.47 c mostinf : 0.00 0 0 0 0 0 0
9.39/9.47 c leastinf : 0.00 0 0 0 0 0 0
9.39/9.47 c fullstrong : 0.00 0 0 0 0 0 0
9.39/9.47 c allfullstrong : 0.00 0 0 0 0 0 0
9.39/9.47 c random : 0.00 0 0 0 0 0 0
9.39/9.47 c Primal Heuristics : Time Calls Found
9.39/9.47 c LP solutions : 0.00 - 1
9.39/9.47 c pseudo solutions : 0.00 - 0
9.39/9.47 c trivial : 0.00 1 0
9.39/9.47 c simplerounding : 0.00 0 0
9.39/9.47 c zirounding : 0.00 0 0
9.39/9.47 c rounding : 0.00 0 0
9.39/9.47 c shifting : 0.00 0 0
9.39/9.47 c intshifting : 0.00 0 0
9.39/9.47 c oneopt : 0.00 0 0
9.39/9.47 c twoopt : 0.00 0 0
9.39/9.47 c fixandinfer : 0.00 0 0
9.39/9.47 c feaspump : 0.00 0 0
9.39/9.47 c coefdiving : 0.00 0 0
9.39/9.47 c pscostdiving : 0.00 0 0
9.39/9.47 c fracdiving : 0.00 0 0
9.39/9.47 c veclendiving : 0.00 0 0
9.39/9.47 c intdiving : 0.00 0 0
9.39/9.47 c actconsdiving : 0.00 0 0
9.39/9.47 c objpscostdiving : 0.00 0 0
9.39/9.47 c rootsoldiving : 0.00 0 0
9.39/9.47 c linesearchdiving : 0.00 0 0
9.39/9.47 c guideddiving : 0.00 0 0
9.39/9.47 c octane : 0.00 0 0
9.39/9.47 c rens : 0.00 0 0
9.39/9.47 c rins : 0.00 0 0
9.39/9.47 c localbranching : 0.00 0 0
9.39/9.47 c mutation : 0.00 0 0
9.39/9.47 c crossover : 0.00 0 0
9.39/9.47 c dins : 0.00 0 0
9.39/9.47 c undercover : 0.00 0 0
9.39/9.47 c nlp : 0.00 0 0
9.39/9.47 c trysol : 0.00 0 0
9.39/9.47 c LP : Time Calls Iterations Iter/call Iter/sec
9.39/9.47 c primal LP : 0.00 0 0 0.00 -
9.39/9.47 c dual LP : 3.06 1382 46588 33.71 15214.98
9.39/9.47 c lex dual LP : 0.00 0 0 0.00 -
9.39/9.47 c barrier LP : 0.00 0 0 0.00 -
9.39/9.47 c diving/probing LP: 0.00 0 0 0.00 -
9.39/9.47 c strong branching : 5.59 1258 71396 56.75 12761.22
9.39/9.47 c (at root node) : - 10 6964 696.40 -
9.39/9.47 c conflict analysis: 0.00 0 0 0.00 -
9.39/9.47 c B&B Tree :
9.39/9.47 c number of runs : 1
9.39/9.47 c nodes : 1960
9.39/9.47 c nodes (total) : 1960
9.39/9.47 c nodes left : 0
9.39/9.47 c max depth : 23
9.39/9.47 c max depth (total): 23
9.39/9.47 c backtracks : 429 (21.9%)
9.39/9.47 c delayed cutoffs : 191
9.39/9.47 c repropagations : 1135 (7382 domain reductions, 180 cutoffs)
9.39/9.47 c avg switch length: 3.25
9.39/9.47 c switching time : 0.07
9.39/9.47 c Solution :
9.39/9.47 c Solutions found : 1 (1 improvements)
9.39/9.47 c First Solution : +0.00000000000000e+00 (in run 1, after 1960 nodes, 9.46 seconds, depth 21, found by <relaxation>)
9.39/9.47 c Primal Bound : +0.00000000000000e+00 (in run 1, after 1960 nodes, 9.46 seconds, depth 21, found by <relaxation>)
9.39/9.47 c Dual Bound : +0.00000000000000e+00
9.39/9.47 c Gap : 0.00 %
9.39/9.47 c Root Dual Bound : +0.00000000000000e+00
9.39/9.47 c Root Iterations : 1846
9.39/9.48 c Time complete: 9.47.
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-3728998-1338678626/watcher-3728998-1338678626 -o /tmp/evaluation-result-3728998-1338678626/solver-3728998-1338678626 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-3728998-1338678626.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: 0.00 0.00 0.41 3/173 4084
/proc/meminfo: memFree=25574436/32873648 swapFree=6852/6852
[pid=4084] ppid=4082 vsize=8944 CPUtime=0 cores=0,2,4,6
/proc/4084/stat : 4084 (pbscip.linux.x8) D 4082 4084 4046 0 -1 4202496 1263 0 0 0 0 0 0 0 20 0 1 0 333989873 9158656 1223 33554432000 4194304 8395647 140737109784416 140737109716248 7382157 0 0 4096 0 18446744071581355444 0 0 17 0 0 0 0 0 0
/proc/4084/statm: 2236 1223 374 1026 0 1206 0
[startup+0.0268471 s]
/proc/loadavg: 0.00 0.00 0.41 3/173 4084
/proc/meminfo: memFree=25574436/32873648 swapFree=6852/6852
[pid=4084] ppid=4082 vsize=15068 CPUtime=0.01 cores=0,2,4,6
/proc/4084/stat : 4084 (pbscip.linux.x8) R 4082 4084 4046 0 -1 4202496 3126 0 0 0 1 0 0 0 20 0 1 0 333989873 15429632 2732 33554432000 4194304 8395647 140737109784416 140737109716248 6080787 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/4084/statm: 3767 2732 496 1026 0 2737 0
Current children cumulated CPU time (s) 0.01
Current children cumulated vsize (KiB) 15068
[startup+0.100238 s]
/proc/loadavg: 0.00 0.00 0.41 3/173 4084
/proc/meminfo: memFree=25574436/32873648 swapFree=6852/6852
[pid=4084] ppid=4082 vsize=28644 CPUtime=0.09 cores=0,2,4,6
/proc/4084/stat : 4084 (pbscip.linux.x8) R 4082 4084 4046 0 -1 4202496 6319 0 0 0 8 1 0 0 20 0 1 0 333989873 29331456 5925 33554432000 4194304 8395647 140737109784416 140737109779656 7428202 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/4084/statm: 7161 5925 620 1026 0 6131 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 28644
[startup+0.300215 s]
/proc/loadavg: 0.00 0.00 0.41 3/173 4084
/proc/meminfo: memFree=25574436/32873648 swapFree=6852/6852
[pid=4084] ppid=4082 vsize=29040 CPUtime=0.29 cores=0,2,4,6
/proc/4084/stat : 4084 (pbscip.linux.x8) R 4082 4084 4046 0 -1 4202496 6481 0 0 0 28 1 0 0 20 0 1 0 333989873 29736960 6087 33554432000 4194304 8395647 140737109784416 140737109779656 7428202 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/4084/statm: 7260 6087 629 1026 0 6230 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 29040
[startup+0.700295 s]
/proc/loadavg: 0.00 0.00 0.41 3/173 4084
/proc/meminfo: memFree=25574436/32873648 swapFree=6852/6852
[pid=4084] ppid=4082 vsize=29040 CPUtime=0.68 cores=0,2,4,6
/proc/4084/stat : 4084 (pbscip.linux.x8) R 4082 4084 4046 0 -1 4202496 6819 0 0 0 67 1 0 0 20 0 1 0 333989873 29736960 6425 33554432000 4194304 8395647 140737109784416 140737109779704 7428202 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/4084/statm: 7260 6425 629 1026 0 6230 0
Current children cumulated CPU time (s) 0.68
Current children cumulated vsize (KiB) 29040
[startup+1.50022 s]
/proc/loadavg: 0.00 0.00 0.41 3/178 4094
/proc/meminfo: memFree=25511060/32873648 swapFree=6852/6852
[pid=4084] ppid=4082 vsize=29040 CPUtime=1.49 cores=0,2,4,6
/proc/4084/stat : 4084 (pbscip.linux.x8) R 4082 4084 4046 0 -1 4202496 6819 0 0 0 147 2 0 0 20 0 1 0 333989873 29736960 6425 33554432000 4194304 8395647 140737109784416 140737109779288 7428202 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/4084/statm: 7260 6425 629 1026 0 6230 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 29040
[startup+3.10023 s]
/proc/loadavg: 0.00 0.00 0.41 3/178 4094
/proc/meminfo: memFree=25508456/32873648 swapFree=6852/6852
[pid=4084] ppid=4082 vsize=29040 CPUtime=3.09 cores=0,2,4,6
/proc/4084/stat : 4084 (pbscip.linux.x8) R 4082 4084 4046 0 -1 4202496 6821 0 0 0 305 4 0 0 20 0 1 0 333989873 29736960 6427 33554432000 4194304 8395647 140737109784416 140737109779288 7428202 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/4084/statm: 7260 6427 631 1026 0 6230 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 29040
[startup+6.30022 s]
/proc/loadavg: 0.24 0.05 0.43 3/178 4094
/proc/meminfo: memFree=25507720/32873648 swapFree=6852/6852
[pid=4084] ppid=4082 vsize=29040 CPUtime=6.28 cores=0,2,4,6
/proc/4084/stat : 4084 (pbscip.linux.x8) R 4082 4084 4046 0 -1 4202496 6821 0 0 0 620 8 0 0 20 0 1 0 333989873 29736960 6427 33554432000 4194304 8395647 140737109784416 140737109779624 7428202 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/4084/statm: 7260 6427 631 1026 0 6230 0
Current children cumulated CPU time (s) 6.28
Current children cumulated vsize (KiB) 29040
Solver just ended. Dumping a history of the last processes samples
[startup+7.90022 s]
/proc/loadavg: 0.24 0.05 0.43 3/178 4094
/proc/meminfo: memFree=25507976/32873648 swapFree=6852/6852
[pid=4084] ppid=4082 vsize=29040 CPUtime=7.89 cores=0,2,4,6
/proc/4084/stat : 4084 (pbscip.linux.x8) R 4082 4084 4046 0 -1 4202496 6821 0 0 0 778 11 0 0 20 0 1 0 333989873 29736960 6427 33554432000 4194304 8395647 140737109784416 140737109779288 7428202 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/4084/statm: 7260 6427 631 1026 0 6230 0
Current children cumulated CPU time (s) 7.89
Current children cumulated vsize (KiB) 29040
[startup+8.70022 s]
/proc/loadavg: 0.24 0.05 0.43 3/178 4094
/proc/meminfo: memFree=25507976/32873648 swapFree=6852/6852
[pid=4084] ppid=4082 vsize=29040 CPUtime=8.7 cores=0,2,4,6
/proc/4084/stat : 4084 (pbscip.linux.x8) R 4082 4084 4046 0 -1 4202496 6821 0 0 0 857 13 0 0 20 0 1 0 333989873 29736960 6427 33554432000 4194304 8395647 140737109784416 140737109779672 7428202 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/4084/statm: 7260 6427 631 1026 0 6230 0
Current children cumulated CPU time (s) 8.7
Current children cumulated vsize (KiB) 29040
[startup+9.10023 s]
/proc/loadavg: 0.24 0.05 0.43 3/178 4094
/proc/meminfo: memFree=25507976/32873648 swapFree=6852/6852
[pid=4084] ppid=4082 vsize=29040 CPUtime=9.09 cores=0,2,4,6
/proc/4084/stat : 4084 (pbscip.linux.x8) R 4082 4084 4046 0 -1 4202496 6821 0 0 0 895 14 0 0 20 0 1 0 333989873 29736960 6427 33554432000 4194304 8395647 140737109784416 140737109779976 7428202 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/4084/statm: 7260 6427 631 1026 0 6230 0
Current children cumulated CPU time (s) 9.09
Current children cumulated vsize (KiB) 29040
[startup+9.30023 s]
/proc/loadavg: 0.24 0.05 0.43 3/178 4094
/proc/meminfo: memFree=25507976/32873648 swapFree=6852/6852
[pid=4084] ppid=4082 vsize=29040 CPUtime=9.29 cores=0,2,4,6
/proc/4084/stat : 4084 (pbscip.linux.x8) R 4082 4084 4046 0 -1 4202496 6821 0 0 0 915 14 0 0 20 0 1 0 333989873 29736960 6427 33554432000 4194304 8395647 140737109784416 140737109779976 7428202 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/4084/statm: 7260 6427 631 1026 0 6230 0
Current children cumulated CPU time (s) 9.29
Current children cumulated vsize (KiB) 29040
[startup+9.40023 s]
/proc/loadavg: 0.24 0.05 0.43 3/178 4094
/proc/meminfo: memFree=25507976/32873648 swapFree=6852/6852
[pid=4084] ppid=4082 vsize=29040 CPUtime=9.39 cores=0,2,4,6
/proc/4084/stat : 4084 (pbscip.linux.x8) R 4082 4084 4046 0 -1 4202496 6821 0 0 0 925 14 0 0 20 0 1 0 333989873 29736960 6427 33554432000 4194304 8395647 140737109784416 140737109779976 7428202 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/4084/statm: 7260 6427 631 1026 0 6230 0
Current children cumulated CPU time (s) 9.39
Current children cumulated vsize (KiB) 29040
Child status: 0
Real time (s): 9.48512
CPU time (s): 9.48056
CPU user time (s): 9.33558
CPU system time (s): 0.144977
CPU usage (%): 99.9519
Max. virtual memory (cumulated for all children) (KiB): 29040
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 9.33558
system time used= 0.144977
maximum resident set size= 25720
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 6827
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= 4
involuntary context switches= 14
runsolver used 0.014997 second user time and 0.043993 second system time
The end