0.00/0.00 c SCIP version 2.1.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.6.0.3] [GitHash: a3bf3a4-dirty]
0.00/0.00 c Copyright (c) 2002-2012 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-3690432-1338016936.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 in 0.01
0.00/0.01 c No objective function, only one solution is needed.
0.00/0.01 c presolving settings loaded
0.00/0.02 c presolving:
0.00/0.04 c (round 1) 0 del vars, 143 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2542 upgd conss, 242 impls, 22 clqs
0.00/0.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.00/0.05 c (round 3) 0 del vars, 264 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 2564 upgd conss, 242 impls, 22 clqs
0.00/0.06 c presolving (4 rounds):
0.00/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.00/0.06 c 242 implications, 22 cliques
0.00/0.06 c presolved problem has 231 variables (231 bin, 0 int, 0 impl, 0 cont) and 2443 constraints
0.00/0.06 c 1 constraints of type <knapsack>
0.00/0.06 c 22 constraints of type <setppc>
0.00/0.06 c 2420 constraints of type <logicor>
0.00/0.06 c transformed objective value is always integral (scale: 1)
0.00/0.06 c Presolving Time: 0.05
0.00/0.06 c - non default parameters ----------------------------------------------------------------------
0.00/0.06 c # SCIP version 2.1.1.4
0.00/0.06 c
0.00/0.06 c # maximal time in seconds to run
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/time = 1797
0.00/0.06 c
0.00/0.06 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.06 c limits/memory = 13950
0.00/0.06 c
0.00/0.06 c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c limits/solutions = 1
0.00/0.06 c
0.00/0.06 c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.06 c separating/maxrounds = 1
0.00/0.06 c
0.00/0.06 c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/maxroundsroot = 5
0.00/0.06 c
0.00/0.06 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.06 c # [type: int, range: [1,2], default: 1]
0.00/0.06 c timing/clocktype = 2
0.00/0.06 c
0.00/0.06 c # belongs reading time to solving time?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.06 c timing/reading = TRUE
0.00/0.06 c
0.00/0.06 c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.06 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.06 c constraints/knapsack/disaggregation = FALSE
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/coefdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.06 c heuristics/crossover/freq = -1
0.00/0.06 c
0.00/0.06 c # number of nodes added to the contingent of the total nodes
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06 c heuristics/crossover/nodesofs = 750
0.00/0.06 c
0.00/0.06 c # number of nodes without incumbent change that heuristic should wait
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.06 c heuristics/crossover/nwaitingnodes = 100
0.00/0.06 c
0.00/0.06 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.06 c # [type: real, range: [0,1], default: 0.1]
0.00/0.06 c heuristics/crossover/nodesquot = 0.15
0.00/0.06 c
0.00/0.06 c # minimum percentage of integer variables that have to be fixed
0.00/0.06 c # [type: real, range: [0,1], default: 0.666]
0.00/0.06 c heuristics/crossover/minfixingrate = 0.5
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/feaspump/freq = -1
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/fracdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/guideddiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/intshifting/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/linesearchdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/objpscostdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.06 c # [type: real, range: [0,1], default: 0.01]
0.00/0.06 c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/oneopt/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/pscostdiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/rens/freq = -1
0.00/0.06 c
0.00/0.06 c # minimum percentage of integer variables that have to be fixable
0.00/0.06 c # [type: real, range: [0,1], default: 0.5]
0.00/0.06 c heuristics/rens/minfixingrate = 0.3
0.00/0.06 c
0.00/0.06 c # number of nodes added to the contingent of the total nodes
0.00/0.06 c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.06 c heuristics/rens/nodesofs = 2000
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.06 c heuristics/rootsoldiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.06 c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/rounding/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/shiftandpropagate/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/shifting/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/simplerounding/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/subnlp/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/trivial/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/trysol/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c heuristics/undercover/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.06 c heuristics/veclendiving/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.06 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.06 c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.06 c
0.00/0.06 c # additional number of allowed LP iterations
0.00/0.06 c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.06 c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/zirounding/freq = -1
0.00/0.06 c
0.00/0.06 c # maximal number of presolving rounds the propagator participates in (-1: no limit)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c propagating/probing/maxprerounds = 0
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c separating/cmir/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.06 c separating/flowcover/freq = -1
0.00/0.06 c
0.00/0.06 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.06 c separating/rapidlearning/freq = 0
0.00/0.06 c
0.00/0.06 c # frequency for calling primal heuristic <indoneopt> (-1: never, 0: only at depth freqofs)
0.00/0.06 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.06 c heuristics/indoneopt/freq = -1
0.00/0.06 c
0.00/0.06 c -----------------------------------------------------------------------------------------------
0.00/0.06 c start solving
0.00/0.06 c
0.00/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.00/0.07 c 0.1s| 1 | 0 | 76 | - |3909k| 0 | 36 | 231 |2443 | 231 |2443 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.20 c 0.2s| 1 | 0 | 90 | - |4326k| 0 | 39 | 231 |2700 | 231 |2450 | 7 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.23 c 0.2s| 1 | 0 | 105 | - |4656k| 0 | 45 | 231 |2700 | 231 |2455 | 12 | 0 | 0 | 0.000000e+00 | -- | Inf
0.19/0.27 c 0.3s| 1 | 0 | 120 | - |5097k| 0 | 46 | 231 |2700 | 231 |2456 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.31 c 0.3s| 1 | 0 | 139 | - |5541k| 0 | 47 | 231 |2700 | 231 |2458 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
0.39/0.47 c 0.5s| 1 | 0 | 147 | - |5881k| 0 | 51 | 231 |2700 | 231 |2461 | 18 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.71 c 0.7s| 1 | 2 | 147 | - |5881k| 0 | 51 | 231 |2700 | 231 |2461 | 18 | 0 | 11 | 0.000000e+00 | -- | Inf
7.69/7.78 c 7.8s| 100 | 19 | 3870 | 37.6 |6042k| 15 | 39 | 231 |2730 | 231 |2454 | 18 | 30 |1556 | 0.000000e+00 | -- | Inf
9.08/9.12 c 9.1s| 200 | 30 | 5994 | 29.4 |6101k| 20 | 30 | 231 |2779 | 231 |2454 | 18 | 80 |1843 | 0.000000e+00 | -- | Inf
9.49/9.59 c 9.6s| 300 | 36 | 7616 | 25.0 |6136k| 22 | 39 | 231 |2831 | 231 |2454 | 18 | 132 |1918 | 0.000000e+00 | -- | Inf
9.89/9.92 c 9.9s| 400 | 35 | 9094 | 22.4 |6163k| 22 | - | 231 |2894 | 231 |2454 | 18 | 196 |1951 | 0.000000e+00 | -- | Inf
9.89/9.96 c *10.0s| 421 | 0 | 9292 | 21.8 |6083k| 22 | - | 231 |2906 | 231 |2454 | 18 | 209 |1955 | 0.000000e+00 | 0.000000e+00 | 0.00%
9.89/9.96 c
9.89/9.96 c SCIP Status : problem is solved [optimal solution found]
9.89/9.96 c Solving Time (sec) : 9.96
9.89/9.96 c Solving Nodes : 421
9.89/9.96 c Primal Bound : +0.00000000000000e+00 (1 solutions)
9.89/9.96 c Dual Bound : +0.00000000000000e+00
9.89/9.96 c Gap : 0.00 %
9.89/9.96 s SATISFIABLE
9.89/9.96 v x221 -x211 -x201 -x191 -x181 -x171 -x161 -x151 -x141 -x131 -x231 -x210 -x200 -x190 -x180 -x170 -x160 -x150 -x140 x130 -x230 -x220
9.89/9.96 v -x199 -x189 x179 -x169 -x159 -x149 -x139 -x129 -x229 -x219 -x209 -x188 -x178 -x168 -x158 x148 -x138 -x128 -x228 -x218 -x208
9.89/9.96 v -x198 -x177 -x167 -x157 -x147 x137 -x127 -x227 -x217 -x207 -x197 -x187 x166 -x156 -x146 -x136 -x126 -x226 -x216 -x206 x196
9.89/9.96 v -x186 -x176 -x155 -x145 -x135 -x125 -x225 -x215 -x205 -x195 x185 -x175 -x165 -x144 -x134 -x124 x224 -x214 -x204 -x194 -x184 -x174
9.89/9.96 v -x164 -x154 -x133 -x123 -x223 -x213 x203 -x193 -x183 -x173 -x163 -x153 -x143 -x122 -x222 -x212 -x202 -x192 -x182 -x172 -x162
9.89/9.96 v x152 -x142 -x132 -x121 -x120 x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 x105 -x104
9.89/9.96 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
9.89/9.96 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
9.89/9.96 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
9.89/9.96 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
9.89/9.96 v -x1
9.89/9.96 c SCIP Status : problem is solved [optimal solution found]
9.89/9.96 c Total Time : 9.96
9.89/9.96 c solving : 9.96
9.89/9.96 c presolving : 0.05 (included in solving)
9.89/9.96 c reading : 0.01 (included in solving)
9.89/9.96 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
9.89/9.96 c Original Problem :
9.89/9.96 c Problem name : HOME/instance-3690432-1338016936.opb
9.89/9.96 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
9.89/9.96 c Constraints : 2707 initial, 2707 maximal
9.89/9.96 c Objective sense : minimize
9.89/9.96 c Presolved Problem :
9.89/9.96 c Problem name : t_HOME/instance-3690432-1338016936.opb
9.89/9.96 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
9.89/9.96 c Constraints : 2443 initial, 2906 maximal
9.89/9.96 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
9.89/9.96 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.89/9.96 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.89/9.96 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.89/9.96 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.89/9.96 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.89/9.96 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.89/9.96 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.89/9.96 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.89/9.96 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.89/9.96 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.89/9.96 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.89/9.96 c knapsack : 0.00 0.00 0 0 0 0 0 0 0 0 0
9.89/9.96 c setppc : 0.00 0.00 0 0 0 0 0 121 0 0 0
9.89/9.96 c linear : 0.02 0.00 0 0 0 0 0 143 0 0 0
9.89/9.96 c logicor : 0.02 0.00 0 0 0 0 0 0 0 0 0
9.89/9.96 c root node : - - 0 - - 0 - - - - -
9.89/9.96 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
9.89/9.96 c integral : 0 0 0 0 498 0 3 0 22 660 0 0 460
9.89/9.96 c knapsack : 1 1 5 1602 0 0 0 60 6 465 0 0 0
9.89/9.96 c setppc : 22 22 5 1596 0 0 0 5331 8 2631 0 0 0
9.89/9.96 c linear : 0+ 257 5 1587 0 0 0 3 0 171 1 0 0
9.89/9.96 c logicor : 2420+ 2626 5 1132 1 0 0 1206 4 3306 0 0 0
9.89/9.96 c countsols : 0 0 0 0 1 0 2 0 0 0 0 0 0
9.89/9.96 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
9.89/9.96 c integral : 8.18 0.00 0.00 0.00 8.18 0.00 0.00 0.00
9.89/9.96 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
9.89/9.96 c setppc : 0.01 0.00 0.00 0.01 0.00 0.00 0.00 0.00
9.89/9.96 c linear : 0.01 0.00 0.00 0.01 0.00 0.00 0.00 0.00
9.89/9.96 c logicor : 0.02 0.00 0.00 0.02 0.00 0.00 0.00 0.00
9.89/9.96 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
9.89/9.96 c Propagators : #Propagate #ResProp Cutoffs DomReds
9.89/9.96 c rootredcost : 0 0 0 0
9.89/9.96 c pseudoobj : 0 0 0 0
9.89/9.96 c vbounds : 0 0 0 0
9.89/9.96 c redcost : 503 0 0 0
9.89/9.96 c probing : 0 0 0 0
9.89/9.96 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
9.89/9.96 c rootredcost : 0.00 0.00 0.00 0.00 0.00
9.89/9.96 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
9.89/9.96 c vbounds : 0.00 0.00 0.00 0.00 0.00
9.89/9.96 c redcost : 0.00 0.00 0.00 0.00 0.00
9.89/9.96 c probing : 0.00 0.00 0.00 0.00 0.00
9.89/9.96 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
9.89/9.96 c propagation : 0.00 18 18 113 21.5 0 0.0 -
9.89/9.96 c infeasible LP : 0.01 152 138 948 32.0 3 12.0 0
9.89/9.96 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
9.89/9.96 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
9.89/9.96 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
9.89/9.96 c applied globally : - - - 207 14.4 - - -
9.89/9.96 c applied locally : - - - 2 50.0 - - -
9.89/9.96 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
9.89/9.96 c cut pool : 0.00 4 - - 305 - (maximal pool size: 516)
9.89/9.96 c closecuts : 0.00 0.00 0 0 0 0 0
9.89/9.96 c impliedbounds : 0.00 0.00 5 0 0 0 0
9.89/9.96 c intobj : 0.00 0.00 0 0 0 0 0
9.89/9.96 c gomory : 0.10 0.00 5 0 0 200 0
9.89/9.96 c cgmip : 0.00 0.00 0 0 0 0 0
9.89/9.96 c strongcg : 0.18 0.00 5 0 0 2500 0
9.89/9.96 c cmir : 0.00 0.00 0 0 0 0 0
9.89/9.96 c flowcover : 0.00 0.00 0 0 0 0 0
9.89/9.96 c clique : 0.00 0.00 5 0 0 0 0
9.89/9.96 c zerohalf : 0.00 0.00 0 0 0 0 0
9.89/9.96 c mcf : 0.00 0.00 1 0 0 0 0
9.89/9.96 c oddcycle : 0.00 0.00 0 0 0 0 0
9.89/9.96 c rapidlearning : 0.10 0.00 1 0 0 0 257
9.89/9.96 c Pricers : ExecTime SetupTime Calls Vars
9.89/9.96 c problem variables: 0.00 - 0 0
9.89/9.96 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
9.89/9.96 c relpscost : 8.18 0.00 497 22 660 0 0 460
9.89/9.96 c pscost : 0.00 0.00 0 0 0 0 0 0
9.89/9.96 c inference : 0.00 0.00 0 0 0 0 0 0
9.89/9.96 c mostinf : 0.00 0.00 0 0 0 0 0 0
9.89/9.96 c leastinf : 0.00 0.00 0 0 0 0 0 0
9.89/9.96 c fullstrong : 0.00 0.00 0 0 0 0 0 0
9.89/9.96 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
9.89/9.96 c random : 0.00 0.00 0 0 0 0 0 0
9.89/9.96 c Primal Heuristics : ExecTime SetupTime Calls Found
9.89/9.96 c LP solutions : 0.00 - - 1
9.89/9.96 c pseudo solutions : 0.00 - - 0
9.89/9.96 c smallcard : 0.00 0.00 0 0
9.89/9.96 c trivial : 0.00 0.00 1 0
9.89/9.96 c shiftandpropagate: 0.00 0.00 0 0
9.89/9.96 c simplerounding : 0.00 0.00 0 0
9.89/9.96 c zirounding : 0.00 0.00 0 0
9.89/9.96 c rounding : 0.00 0.00 0 0
9.89/9.96 c shifting : 0.00 0.00 0 0
9.89/9.96 c intshifting : 0.00 0.00 0 0
9.89/9.96 c oneopt : 0.00 0.00 0 0
9.89/9.96 c twoopt : 0.00 0.00 0 0
9.89/9.96 c indtwoopt : 0.00 0.00 0 0
9.89/9.96 c indoneopt : 0.00 0.00 0 0
9.89/9.96 c fixandinfer : 0.00 0.00 0 0
9.89/9.96 c feaspump : 0.00 0.00 0 0
9.89/9.96 c clique : 0.00 0.00 0 0
9.89/9.96 c indrounding : 0.00 0.00 0 0
9.89/9.96 c indcoefdiving : 0.00 0.00 0 0
9.89/9.96 c coefdiving : 0.00 0.00 0 0
9.89/9.96 c pscostdiving : 0.00 0.00 0 0
9.89/9.96 c nlpdiving : 0.00 0.00 0 0
9.89/9.96 c fracdiving : 0.00 0.00 0 0
9.89/9.96 c veclendiving : 0.00 0.00 0 0
9.89/9.96 c intdiving : 0.00 0.00 0 0
9.89/9.96 c actconsdiving : 0.00 0.00 0 0
9.89/9.96 c objpscostdiving : 0.00 0.00 0 0
9.89/9.96 c rootsoldiving : 0.00 0.00 0 0
9.89/9.96 c linesearchdiving : 0.00 0.00 0 0
9.89/9.96 c guideddiving : 0.00 0.00 0 0
9.89/9.96 c octane : 0.00 0.00 0 0
9.89/9.96 c rens : 0.00 0.00 0 0
9.89/9.96 c rins : 0.00 0.00 0 0
9.89/9.96 c localbranching : 0.00 0.00 0 0
9.89/9.96 c mutation : 0.00 0.00 0 0
9.89/9.96 c crossover : 0.00 0.00 0 0
9.89/9.96 c dins : 0.00 0.00 0 0
9.89/9.96 c vbounds : 0.00 0.00 0 0
9.89/9.96 c undercover : 0.00 0.00 0 0
9.89/9.96 c subnlp : 0.00 0.00 0 0
9.89/9.96 c trysol : 0.00 0.00 0 0
9.89/9.96 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
9.89/9.96 c primal LP : 0.00 1 0 0.00 - 0.00 1
9.89/9.96 c dual LP : 1.14 655 9292 14.21 8173.30 0.00 1
9.89/9.96 c lex dual LP : 0.00 0 0 0.00 -
9.89/9.96 c barrier LP : 0.00 0 0 0.00 - 0.00 0
9.89/9.96 c diving/probing LP: 0.00 0 0 0.00 -
9.89/9.96 c strong branching : 8.14 1955 69434 35.52 8532.97
9.89/9.96 c (at root node) : - 11 2484 225.82 -
9.89/9.96 c conflict analysis: 0.00 0 0 0.00 -
9.89/9.96 c B&B Tree :
9.89/9.96 c number of runs : 1
9.89/9.96 c nodes : 421
9.89/9.96 c nodes (total) : 421
9.89/9.96 c nodes left : 0
9.89/9.96 c max depth : 22
9.89/9.96 c max depth (total): 22
9.89/9.96 c backtracks : 33 (7.8%)
9.89/9.96 c delayed cutoffs : 2
9.89/9.96 c repropagations : 283 (384 domain reductions, 2 cutoffs)
9.89/9.96 c avg switch length: 3.27
9.89/9.96 c switching time : 0.03
9.89/9.96 c Solution :
9.89/9.96 c Solutions found : 1 (1 improvements)
9.89/9.96 c First Solution : +0.00000000000000e+00 (in run 1, after 421 nodes, 9.96 seconds, depth 19, found by <relaxation>)
9.89/9.96 c Primal Bound : +0.00000000000000e+00 (in run 1, after 421 nodes, 9.96 seconds, depth 19, found by <relaxation>)
9.89/9.96 c Dual Bound : +0.00000000000000e+00
9.89/9.96 c Gap : 0.00 %
9.89/9.96 c Root Dual Bound : +0.00000000000000e+00
9.89/9.96 c Root Iterations : 147
9.89/9.97 c Time complete: 9.96.
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-3690432-1338016936/watcher-3690432-1338016936 -o /tmp/evaluation-result-3690432-1338016936/solver-3690432-1338016936 -C 1800 -W 1900 -M 15500 HOME/scip-2.1.1.4fix.linux.x86_64.gnu.opt.spx -f HOME/instance-3690432-1338016936.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.00 1/171 9628
/proc/meminfo: memFree=28980456/32873648 swapFree=7104/7104
[pid=9628] ppid=9626 vsize=10288 CPUtime=0 cores=0,2,4,6
/proc/9628/stat : 9628 (scip-2.1.1.4fix) R 9626 9628 9598 0 -1 4202496 1324 0 0 0 0 0 0 0 20 0 1 0 267819098 10534912 1279 33554432000 4194304 10173063 140734174806384 140734780777112 7141799 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/9628/statm: 2572 1279 413 1460 0 1103 0
[startup+0.083199 s]
/proc/loadavg: 0.00 0.00 0.00 1/171 9628
/proc/meminfo: memFree=28980456/32873648 swapFree=7104/7104
[pid=9628] ppid=9626 vsize=29500 CPUtime=0.07 cores=0,2,4,6
/proc/9628/stat : 9628 (scip-2.1.1.4fix) R 9626 9628 9598 0 -1 4202496 6506 0 0 0 6 1 0 0 20 0 1 0 267819098 30208000 6164 33554432000 4194304 10173063 140734174806384 140734780777112 8982074 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/9628/statm: 7375 6164 770 1460 0 5906 0
Current children cumulated CPU time (s) 0.07
Current children cumulated vsize (KiB) 29500
[startup+0.100215 s]
/proc/loadavg: 0.00 0.00 0.00 1/171 9628
/proc/meminfo: memFree=28980456/32873648 swapFree=7104/7104
[pid=9628] ppid=9626 vsize=29500 CPUtime=0.09 cores=0,2,4,6
/proc/9628/stat : 9628 (scip-2.1.1.4fix) R 9626 9628 9598 0 -1 4202496 6536 0 0 0 8 1 0 0 20 0 1 0 267819098 30208000 6194 33554432000 4194304 10173063 140734174806384 140734780777112 8963895 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/9628/statm: 7375 6194 771 1460 0 5906 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 29500
[startup+0.300167 s]
/proc/loadavg: 0.00 0.00 0.00 1/171 9628
/proc/meminfo: memFree=28980456/32873648 swapFree=7104/7104
[pid=9628] ppid=9626 vsize=47124 CPUtime=0.29 cores=0,2,4,6
/proc/9628/stat : 9628 (scip-2.1.1.4fix) R 9626 9628 9598 0 -1 4202496 10680 0 0 0 26 3 0 0 20 0 1 0 267819098 48254976 10336 33554432000 4194304 10173063 140734174806384 140734780777112 8982074 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/9628/statm: 11781 10336 827 1460 0 10312 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 47124
[startup+0.700097 s]
/proc/loadavg: 0.00 0.00 0.00 1/171 9628
/proc/meminfo: memFree=28980456/32873648 swapFree=7104/7104
[pid=9628] ppid=9626 vsize=47292 CPUtime=0.69 cores=0,2,4,6
/proc/9628/stat : 9628 (scip-2.1.1.4fix) R 9626 9628 9598 0 -1 4202496 10798 0 0 0 66 3 0 0 20 0 1 0 267819098 48427008 10454 33554432000 4194304 10173063 140734174806384 140734174799832 8982074 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/9628/statm: 11823 10454 830 1460 0 10354 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 47292
[startup+1.5001 s]
/proc/loadavg: 0.00 0.00 0.00 2/172 9629
/proc/meminfo: memFree=28941224/32873648 swapFree=7104/7104
[pid=9628] ppid=9626 vsize=47292 CPUtime=1.49 cores=0,2,4,6
/proc/9628/stat : 9628 (scip-2.1.1.4fix) R 9626 9628 9598 0 -1 4202496 10803 0 0 0 145 4 0 0 20 0 1 0 267819098 48427008 10459 33554432000 4194304 10173063 140734174806384 140734174799640 8033088 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/9628/statm: 11823 10459 835 1460 0 10354 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 47292
[startup+3.10011 s]
/proc/loadavg: 0.00 0.00 0.00 3/177 9643
/proc/meminfo: memFree=28845936/32873648 swapFree=7104/7104
[pid=9628] ppid=9626 vsize=47292 CPUtime=3.09 cores=0,2,4,6
/proc/9628/stat : 9628 (scip-2.1.1.4fix) R 9626 9628 9598 0 -1 4202496 10803 0 0 0 304 5 0 0 20 0 1 0 267819098 48427008 10459 33554432000 4194304 10173063 140734174806384 140734174799928 8982074 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/9628/statm: 11823 10459 835 1460 0 10354 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 47292
[startup+6.30023 s]
/proc/loadavg: 0.16 0.04 0.01 3/177 9643
/proc/meminfo: memFree=28775228/32873648 swapFree=7104/7104
[pid=9628] ppid=9626 vsize=47292 CPUtime=6.29 cores=0,2,4,6
/proc/9628/stat : 9628 (scip-2.1.1.4fix) R 9626 9628 9598 0 -1 4202496 10803 0 0 0 620 9 0 0 20 0 1 0 267819098 48427008 10459 33554432000 4194304 10173063 140734174806384 140734174800024 8982074 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/9628/statm: 11823 10459 835 1460 0 10354 0
Current children cumulated CPU time (s) 6.29
Current children cumulated vsize (KiB) 47292
Solver just ended. Dumping a history of the last processes samples
[startup+7.90024 s]
/proc/loadavg: 0.16 0.04 0.01 3/177 9643
/proc/meminfo: memFree=28775452/32873648 swapFree=7104/7104
[pid=9628] ppid=9626 vsize=47292 CPUtime=7.88 cores=0,2,4,6
/proc/9628/stat : 9628 (scip-2.1.1.4fix) R 9626 9628 9598 0 -1 4202496 10803 0 0 0 778 10 0 0 20 0 1 0 267819098 48427008 10459 33554432000 4194304 10173063 140734174806384 140734174802184 8982074 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/9628/statm: 11823 10459 835 1460 0 10354 0
Current children cumulated CPU time (s) 7.88
Current children cumulated vsize (KiB) 47292
[startup+8.70024 s]
/proc/loadavg: 0.16 0.04 0.01 3/177 9643
/proc/meminfo: memFree=28775332/32873648 swapFree=7104/7104
[pid=9628] ppid=9626 vsize=47292 CPUtime=8.69 cores=0,2,4,6
/proc/9628/stat : 9628 (scip-2.1.1.4fix) R 9626 9628 9598 0 -1 4202496 10803 0 0 0 858 11 0 0 20 0 1 0 267819098 48427008 10459 33554432000 4194304 10173063 140734174806384 140734174802184 8982074 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/9628/statm: 11823 10459 835 1460 0 10354 0
Current children cumulated CPU time (s) 8.69
Current children cumulated vsize (KiB) 47292
[startup+9.50019 s]
/proc/loadavg: 0.16 0.04 0.01 3/177 9643
/proc/meminfo: memFree=28775332/32873648 swapFree=7104/7104
[pid=9628] ppid=9626 vsize=47292 CPUtime=9.49 cores=0,2,4,6
/proc/9628/stat : 9628 (scip-2.1.1.4fix) R 9626 9628 9598 0 -1 4202496 10803 0 0 0 936 13 0 0 20 0 1 0 267819098 48427008 10459 33554432000 4194304 10173063 140734174806384 140734174802184 8982074 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/9628/statm: 11823 10459 835 1460 0 10354 0
Current children cumulated CPU time (s) 9.49
Current children cumulated vsize (KiB) 47292
[startup+9.90636 s]
/proc/loadavg: 0.31 0.07 0.02 3/177 9643
/proc/meminfo: memFree=28775464/32873648 swapFree=7104/7104
[pid=9628] ppid=9626 vsize=47292 CPUtime=9.89 cores=0,2,4,6
/proc/9628/stat : 9628 (scip-2.1.1.4fix) R 9626 9628 9598 0 -1 4202496 10804 0 0 0 976 13 0 0 20 0 1 0 267819098 48427008 10460 33554432000 4194304 10173063 140734174806384 140734174799640 8982074 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/9628/statm: 11823 10460 836 1460 0 10354 0
Current children cumulated CPU time (s) 9.89
Current children cumulated vsize (KiB) 47292
Child status: 0
Real time (s): 9.97526
CPU time (s): 9.97048
CPU user time (s): 9.8325
CPU system time (s): 0.137979
CPU usage (%): 99.9521
Max. virtual memory (cumulated for all children) (KiB): 47292
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 9.8325
system time used= 0.137979
maximum resident set size= 41856
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 10810
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= 26
runsolver used 0.022996 second user time and 0.058991 second system time
The end