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: 947bdb7-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-3691578-1338021639.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 | - |4259k| 0 | 36 | 231 |2443 | 231 |2443 | 0 | 0 | 0 | 0.000000e+00 | -- | Inf
0.18/0.21 c 0.2s| 1 | 0 | 93 | - |4693k| 0 | 39 | 231 |2711 | 231 |2451 | 8 | 0 | 0 | 0.000000e+00 | -- | Inf
0.18/0.25 c 0.2s| 1 | 0 | 110 | - |5002k| 0 | 46 | 231 |2711 | 231 |2456 | 13 | 0 | 0 | 0.000000e+00 | -- | Inf
0.29/0.39 c 0.4s| 1 | 0 | 128 | - |5330k| 0 | 50 | 231 |2711 | 231 |2457 | 14 | 0 | 0 | 0.000000e+00 | -- | Inf
0.49/0.55 c 0.5s| 1 | 0 | 140 | - |5797k| 0 | 49 | 231 |2711 | 231 |2458 | 15 | 0 | 0 | 0.000000e+00 | -- | Inf
0.69/0.70 c 0.7s| 1 | 0 | 158 | - |6142k| 0 | 50 | 231 |2711 | 231 |2459 | 16 | 0 | 0 | 0.000000e+00 | -- | Inf
0.88/0.94 c 0.9s| 1 | 2 | 158 | - |6143k| 0 | 50 | 231 |2711 | 231 |2459 | 16 | 0 | 13 | 0.000000e+00 | -- | Inf
8.89/8.96 c 9.0s| 100 | 13 | 4921 | 48.1 |6286k| 17 | - | 231 |2722 | 231 |2455 | 16 | 12 |1534 | 0.000000e+00 | -- | Inf
10.09/10.15 c 10.1s| 200 | 24 | 7017 | 34.5 |6342k| 19 | 34 | 231 |2772 | 231 |2455 | 16 | 62 |1738 | 0.000000e+00 | -- | Inf
10.58/10.65 c 10.6s| 300 | 26 | 8626 | 28.3 |6377k| 22 | - | 231 |2828 | 0 | 0 | 16 | 118 |1806 | 0.000000e+00 | -- | Inf
10.90/10.94 c 10.9s| 400 | 28 | 10300 | 25.4 |6409k| 22 | - | 231 |2898 | 231 |2455 | 16 | 188 |1827 | 0.000000e+00 | -- | Inf
11.18/11.23 c 11.2s| 500 | 32 | 12031 | 23.8 |6444k| 25 | 36 | 231 |2973 | 231 |2455 | 16 | 264 |1844 | 0.000000e+00 | -- | Inf
11.49/11.53 c 11.5s| 600 | 39 | 13702 | 22.6 |6486k| 26 | 20 | 231 |3037 | 231 |2455 | 16 | 328 |1864 | 0.000000e+00 | -- | Inf
11.78/11.83 c 11.8s| 700 | 42 | 15099 | 21.4 |6517k| 26 | 31 | 231 |3086 | 231 |2455 | 16 | 378 |1888 | 0.000000e+00 | -- | Inf
11.98/12.05 c 12.0s| 800 | 44 | 16517 | 20.5 |6545k| 26 | - | 231 |3140 | 231 |2455 | 16 | 433 |1895 | 0.000000e+00 | -- | Inf
12.18/12.27 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
12.18/12.27 c 12.3s| 900 | 44 | 17943 | 19.8 |6571k| 26 | 32 | 231 |3206 | 231 |2455 | 16 | 501 |1904 | 0.000000e+00 | -- | Inf
12.48/12.50 c 12.5s| 1000 | 42 | 19292 | 19.2 |6591k| 26 | 40 | 231 |3269 | 231 |2455 | 16 | 564 |1915 | 0.000000e+00 | -- | Inf
12.78/12.80 c 12.8s| 1100 | 38 | 21042 | 19.0 |6607k| 26 | - | 231 |3329 | 231 |2455 | 16 | 625 |1934 | 0.000000e+00 | -- | Inf
13.09/13.18 c 13.2s| 1200 | 48 | 23278 | 19.3 |6649k| 26 | 25 | 231 |3381 | 231 |2455 | 16 | 684 |1961 | 0.000000e+00 | -- | Inf
13.38/13.48 c 13.5s| 1300 | 50 | 25168 | 19.3 |6682k| 26 | 31 | 231 |3438 | 231 |2455 | 16 | 747 |1979 | 0.000000e+00 | -- | Inf
13.68/13.74 c 13.7s| 1400 | 50 | 26730 | 19.0 |6704k| 26 | 37 | 231 |3497 | 231 |2455 | 16 | 807 |1995 | 0.000000e+00 | -- | Inf
13.88/13.99 c 14.0s| 1500 | 54 | 28302 | 18.8 |6731k| 26 | - | 231 |3548 | 231 |2455 | 16 | 859 |2006 | 0.000000e+00 | -- | Inf
14.18/14.22 c 14.2s| 1600 | 54 | 30064 | 18.7 |6750k| 27 | 30 | 231 |3614 | 231 |2455 | 16 | 929 |2010 | 0.000000e+00 | -- | Inf
14.28/14.38 c 14.4s| 1700 | 55 | 31120 | 18.2 |6778k| 27 | 30 | 231 |3678 | 231 |2455 | 16 | 996 |2011 | 0.000000e+00 | -- | Inf
14.48/14.60 c 14.6s| 1800 | 59 | 32776 | 18.1 |6810k| 27 | 20 | 231 |3733 | 231 |2455 | 16 |1054 |2011 | 0.000000e+00 | -- | Inf
14.58/14.69 c *14.7s| 1845 | 0 | 33407 | 18.0 |6653k| 27 | - | 231 |3759 | 231 |2455 | 16 |1082 |2012 | 0.000000e+00 | 0.000000e+00 | 0.00%
14.58/14.69 c
14.58/14.69 c SCIP Status : problem is solved [optimal solution found]
14.58/14.69 c Solving Time (sec) : 14.69
14.58/14.69 c Solving Nodes : 1845
14.58/14.69 c Primal Bound : +0.00000000000000e+00 (1 solutions)
14.58/14.69 c Dual Bound : +0.00000000000000e+00
14.58/14.69 c Gap : 0.00 %
14.58/14.69 s SATISFIABLE
14.58/14.69 v -x221 -x211 -x201 -x191 x181 -x171 -x161 -x151 -x141 -x131 -x231 -x210 -x200 -x190 -x180 x170 -x160 -x150 -x140 -x130 -x230 -x220
14.58/14.69 v -x199 -x189 -x179 -x169 -x159 -x149 -x139 x129 -x229 -x219 -x209 -x188 -x178 -x168 x158 -x148 -x138 -x128 -x228 -x218 x208
14.58/14.69 v -x198 -x177 -x167 -x157 -x147 -x137 -x127 -x227 -x217 -x207 -x197 -x187 -x166 -x156 -x146 x136 -x126 -x226 -x216 -x206 -x196
14.58/14.69 v -x186 -x176 -x155 x145 -x135 -x125 -x225 -x215 -x205 -x195 x185 -x175 -x165 -x144 -x134 -x124 x224 -x214 -x204 -x194 -x184 -x174
14.58/14.69 v -x164 -x154 -x133 -x123 -x223 -x213 -x203 x193 -x183 -x173 -x163 -x153 -x143 -x122 -x222 x212 -x202 -x192 -x182 -x172 -x162
14.58/14.69 v -x152 -x142 -x132 x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 x105 -x104
14.58/14.69 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
14.58/14.69 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
14.58/14.69 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
14.58/14.69 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
14.58/14.69 v -x1
14.58/14.69 c SCIP Status : problem is solved [optimal solution found]
14.58/14.69 c Total Time : 14.69
14.58/14.69 c solving : 14.69
14.58/14.69 c presolving : 0.05 (included in solving)
14.58/14.69 c reading : 0.01 (included in solving)
14.58/14.69 c copying : 0.01 (1 #copies) (minimal 0.01, maximal 0.01, average 0.01)
14.58/14.69 c Original Problem :
14.58/14.69 c Problem name : HOME/instance-3691578-1338021639.opb
14.58/14.69 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
14.58/14.69 c Constraints : 2707 initial, 2707 maximal
14.58/14.69 c Objective sense : minimize
14.58/14.69 c Presolved Problem :
14.58/14.69 c Problem name : t_HOME/instance-3691578-1338021639.opb
14.58/14.69 c Variables : 231 (231 binary, 0 integer, 0 implicit integer, 0 continuous)
14.58/14.69 c Constraints : 2443 initial, 3759 maximal
14.58/14.69 c Presolvers : ExecTime SetupTime FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
14.58/14.69 c domcol : 0.00 0.00 0 0 0 0 0 0 0 0 0
14.58/14.69 c trivial : 0.00 0.00 0 0 0 0 0 0 0 0 0
14.58/14.69 c dualfix : 0.00 0.00 0 0 0 0 0 0 0 0 0
14.58/14.69 c boundshift : 0.00 0.00 0 0 0 0 0 0 0 0 0
14.58/14.69 c inttobinary : 0.00 0.00 0 0 0 0 0 0 0 0 0
14.58/14.69 c convertinttobin : 0.00 0.00 0 0 0 0 0 0 0 0 0
14.58/14.69 c gateextraction : 0.00 0.00 0 0 0 0 0 0 0 0 0
14.58/14.69 c implics : 0.00 0.00 0 0 0 0 0 0 0 0 0
14.58/14.69 c components : 0.00 0.00 0 0 0 0 0 0 0 0 0
14.58/14.69 c pseudoobj : 0.00 0.00 0 0 0 0 0 0 0 0 0
14.58/14.69 c probing : 0.00 0.00 0 0 0 0 0 0 0 0 0
14.58/14.69 c knapsack : 0.00 0.00 0 0 0 0 0 0 0 0 0
14.58/14.69 c setppc : 0.00 0.00 0 0 0 0 0 121 0 0 0
14.58/14.69 c linear : 0.02 0.00 0 0 0 0 0 143 0 0 0
14.58/14.69 c logicor : 0.02 0.00 0 0 0 0 0 0 0 0 0
14.58/14.69 c root node : - - 0 - - 0 - - - - -
14.58/14.69 c Constraints : Number MaxNumber #Separate #Propagate #EnfoLP #EnfoPS #Check #ResProp Cutoffs DomReds Cuts Conss Children
14.58/14.69 c integral : 0 0 0 0 1296 0 3 0 42 751 0 0 1916
14.58/14.69 c knapsack : 1 1 5 6595 1 0 0 475 15 2903 0 0 0
14.58/14.69 c setppc : 22 22 5 6584 1 0 0 22500 54 10286 0 0 0
14.58/14.69 c linear : 0+ 268 5 6525 0 0 0 58 0 978 2 0 0
14.58/14.69 c logicor : 2420+ 3468 5 3746 1 0 0 5079 16 11427 0 0 0
14.58/14.69 c countsols : 0 0 0 0 1 0 2 0 0 0 0 0 0
14.58/14.69 c Constraint Timings : TotalTime SetupTime Separate Propagate EnfoLP EnfoPS Check ResProp
14.58/14.69 c integral : 9.54 0.00 0.00 0.00 9.54 0.00 0.00 0.00
14.58/14.69 c knapsack : 0.01 0.00 0.00 0.01 0.00 0.00 0.00 0.00
14.58/14.69 c setppc : 0.03 0.00 0.00 0.03 0.00 0.00 0.00 0.01
14.58/14.69 c linear : 0.03 0.00 0.00 0.03 0.00 0.00 0.00 0.00
14.58/14.69 c logicor : 0.07 0.00 0.00 0.07 0.00 0.00 0.00 0.00
14.58/14.69 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00 0.00
14.58/14.69 c Propagators : #Propagate #ResProp Cutoffs DomReds
14.58/14.69 c rootredcost : 0 0 0 0
14.58/14.69 c pseudoobj : 0 0 0 0
14.58/14.69 c vbounds : 0 0 0 0
14.58/14.69 c redcost : 1301 0 0 0
14.58/14.69 c probing : 0 0 0 0
14.58/14.69 c Propagator Timings : TotalTime SetupTime Presolve Propagate ResProp
14.58/14.69 c rootredcost : 0.00 0.00 0.00 0.00 0.00
14.58/14.69 c pseudoobj : 0.00 0.00 0.00 0.00 0.00
14.58/14.69 c vbounds : 0.00 0.00 0.00 0.00 0.00
14.58/14.69 c redcost : 0.01 0.00 0.00 0.01 0.00
14.58/14.69 c probing : 0.00 0.00 0.00 0.00 0.00
14.58/14.69 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
14.58/14.69 c propagation : 0.00 85 85 531 19.4 0 0.0 -
14.58/14.69 c infeasible LP : 0.07 773 760 4814 29.0 1 12.0 0
14.58/14.69 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
14.58/14.69 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
14.58/14.69 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
14.58/14.69 c applied globally : - - - 1081 14.5 - - -
14.58/14.69 c applied locally : - - - 1 54.0 - - -
14.58/14.69 c Separators : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss
14.58/14.69 c cut pool : 0.00 4 - - 120 - (maximal pool size: 452)
14.58/14.69 c closecuts : 0.00 0.00 0 0 0 0 0
14.58/14.69 c impliedbounds : 0.00 0.00 5 0 0 0 0
14.58/14.69 c intobj : 0.00 0.00 0 0 0 0 0
14.58/14.69 c gomory : 0.27 0.00 5 0 0 101 0
14.58/14.69 c cgmip : 0.00 0.00 0 0 0 0 0
14.58/14.69 c strongcg : 0.23 0.00 5 0 0 2500 0
14.58/14.69 c cmir : 0.00 0.00 0 0 0 0 0
14.58/14.69 c flowcover : 0.00 0.00 0 0 0 0 0
14.58/14.69 c clique : 0.00 0.00 5 0 0 0 0
14.58/14.69 c zerohalf : 0.00 0.00 0 0 0 0 0
14.58/14.69 c mcf : 0.00 0.00 1 0 0 0 0
14.58/14.69 c oddcycle : 0.00 0.00 0 0 0 0 0
14.58/14.69 c rapidlearning : 0.11 0.00 1 0 0 0 268
14.58/14.69 c Pricers : ExecTime SetupTime Calls Vars
14.58/14.69 c problem variables: 0.00 - 0 0
14.58/14.69 c Branching Rules : ExecTime SetupTime Calls Cutoffs DomReds Cuts Conss Children
14.58/14.69 c relpscost : 9.54 0.00 1295 42 751 0 0 1916
14.58/14.69 c pscost : 0.00 0.00 0 0 0 0 0 0
14.58/14.69 c inference : 0.00 0.00 0 0 0 0 0 0
14.58/14.69 c mostinf : 0.00 0.00 0 0 0 0 0 0
14.58/14.69 c leastinf : 0.00 0.00 0 0 0 0 0 0
14.58/14.69 c fullstrong : 0.00 0.00 0 0 0 0 0 0
14.58/14.69 c allfullstrong : 0.00 0.00 0 0 0 0 0 0
14.58/14.69 c random : 0.00 0.00 0 0 0 0 0 0
14.58/14.69 c Primal Heuristics : ExecTime SetupTime Calls Found
14.58/14.69 c LP solutions : 0.00 - - 1
14.58/14.69 c pseudo solutions : 0.00 - - 0
14.58/14.69 c smallcard : 0.00 0.00 0 0
14.58/14.69 c trivial : 0.00 0.00 1 0
14.58/14.69 c shiftandpropagate: 0.00 0.00 0 0
14.58/14.69 c simplerounding : 0.00 0.00 0 0
14.58/14.69 c zirounding : 0.00 0.00 0 0
14.58/14.69 c rounding : 0.00 0.00 0 0
14.58/14.69 c shifting : 0.00 0.00 0 0
14.58/14.69 c intshifting : 0.00 0.00 0 0
14.58/14.69 c oneopt : 0.00 0.00 0 0
14.58/14.69 c twoopt : 0.00 0.00 0 0
14.58/14.69 c indtwoopt : 0.00 0.00 0 0
14.58/14.69 c indoneopt : 0.00 0.00 0 0
14.58/14.69 c fixandinfer : 0.00 0.00 0 0
14.58/14.69 c feaspump : 0.00 0.00 0 0
14.58/14.69 c clique : 0.00 0.00 0 0
14.58/14.69 c indrounding : 0.00 0.00 0 0
14.58/14.69 c indcoefdiving : 0.00 0.00 0 0
14.58/14.69 c coefdiving : 0.00 0.00 0 0
14.58/14.69 c pscostdiving : 0.00 0.00 0 0
14.58/14.69 c nlpdiving : 0.00 0.00 0 0
14.58/14.69 c fracdiving : 0.00 0.00 0 0
14.58/14.69 c veclendiving : 0.00 0.00 0 0
14.58/14.69 c intdiving : 0.00 0.00 0 0
14.58/14.69 c actconsdiving : 0.00 0.00 0 0
14.58/14.69 c objpscostdiving : 0.00 0.00 0 0
14.58/14.69 c rootsoldiving : 0.00 0.00 0 0
14.58/14.69 c linesearchdiving : 0.00 0.00 0 0
14.58/14.69 c guideddiving : 0.00 0.00 0 0
14.58/14.69 c octane : 0.00 0.00 0 0
14.58/14.69 c rens : 0.00 0.00 0 0
14.58/14.69 c rins : 0.00 0.00 0 0
14.58/14.69 c localbranching : 0.00 0.00 0 0
14.58/14.69 c mutation : 0.00 0.00 0 0
14.58/14.69 c crossover : 0.00 0.00 0 0
14.58/14.69 c dins : 0.00 0.00 0 0
14.58/14.69 c vbounds : 0.00 0.00 0 0
14.58/14.69 c undercover : 0.00 0.00 0 0
14.58/14.69 c subnlp : 0.00 0.00 0 0
14.58/14.69 c trysol : 0.00 0.00 0 0
14.58/14.69 c LP : Time Calls Iterations Iter/call Iter/sec Time-0-It Calls-0-It
14.58/14.69 c primal LP : 0.00 1 0 0.00 - 0.00 1
14.58/14.69 c dual LP : 3.81 2074 33407 16.13 8778.48 0.00 3
14.58/14.69 c lex dual LP : 0.00 0 0 0.00 -
14.58/14.69 c barrier LP : 0.00 0 0 0.00 - 0.00 0
14.58/14.69 c diving/probing LP: 0.00 0 0 0.00 -
14.58/14.69 c strong branching : 9.48 2012 81278 40.40 8570.36
14.58/14.69 c (at root node) : - 13 2375 182.69 -
14.58/14.69 c conflict analysis: 0.00 0 0 0.00 -
14.58/14.69 c B&B Tree :
14.58/14.69 c number of runs : 1
14.58/14.69 c nodes : 1845
14.58/14.69 c nodes (total) : 1845
14.58/14.69 c nodes left : 0
14.58/14.69 c max depth : 27
14.58/14.69 c max depth (total): 27
14.58/14.69 c backtracks : 197 (10.7%)
14.58/14.69 c delayed cutoffs : 14
14.58/14.69 c repropagations : 2118 (2169 domain reductions, 14 cutoffs)
14.58/14.69 c avg switch length: 3.99
14.58/14.69 c switching time : 0.12
14.58/14.69 c Solution :
14.58/14.69 c Solutions found : 1 (1 improvements)
14.58/14.69 c First Solution : +0.00000000000000e+00 (in run 1, after 1845 nodes, 14.69 seconds, depth 19, found by <relaxation>)
14.58/14.69 c Primal Bound : +0.00000000000000e+00 (in run 1, after 1845 nodes, 14.69 seconds, depth 19, found by <relaxation>)
14.58/14.69 c Dual Bound : +0.00000000000000e+00
14.58/14.69 c Gap : 0.00 %
14.58/14.69 c Root Dual Bound : +0.00000000000000e+00
14.58/14.69 c Root Iterations : 158
14.68/14.70 c Time complete: 14.68.
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-3691578-1338021639/watcher-3691578-1338021639 -o /tmp/evaluation-result-3691578-1338021639/solver-3691578-1338021639 -C 1800 -W 1900 -M 15500 HOME/scip-2.1.1.4expfix.linux.x86_64.gnu.opt.spx -f HOME/instance-3691578-1338021639.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.00 2.00 2.00 3/175 2811
/proc/meminfo: memFree=29505056/32873852 swapFree=7616/7616
[pid=2811] ppid=2809 vsize=12032 CPUtime=0 cores=1,3,5,7
/proc/2811/stat : 2811 (scip-2.1.1.4exp) R 2809 2811 403 0 -1 4202496 1714 0 0 0 0 0 0 0 20 0 1 0 268289412 12320768 1669 33554432000 4194304 10219143 140735706380080 140735706244920 8891101 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/2811/statm: 3008 1680 398 1471 0 1528 0
[startup+0.0139371 s]
/proc/loadavg: 2.00 2.00 2.00 3/175 2811
/proc/meminfo: memFree=29505056/32873852 swapFree=7616/7616
[pid=2811] ppid=2809 vsize=14652 CPUtime=0 cores=1,3,5,7
/proc/2811/stat : 2811 (scip-2.1.1.4exp) R 2809 2811 403 0 -1 4202496 2399 0 0 0 0 0 0 0 20 0 1 0 268289412 15003648 2354 33554432000 4194304 10219143 140735706380080 140735706244920 7157197 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/2811/statm: 3663 2354 419 1471 0 2183 0
Current children cumulated CPU time (s) 0
Current children cumulated vsize (KiB) 14652
[startup+0.100257 s]
/proc/loadavg: 2.00 2.00 2.00 3/175 2811
/proc/meminfo: memFree=29505056/32873852 swapFree=7616/7616
[pid=2811] ppid=2809 vsize=30612 CPUtime=0.09 cores=1,3,5,7
/proc/2811/stat : 2811 (scip-2.1.1.4exp) R 2809 2811 403 0 -1 4202496 6799 0 0 0 8 1 0 0 20 0 1 0 268289412 31346688 6452 33554432000 4194304 10219143 140735706380080 140735706244920 9026266 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/2811/statm: 7653 6452 761 1471 0 6173 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 30612
[startup+0.300293 s]
/proc/loadavg: 2.00 2.00 2.00 3/175 2811
/proc/meminfo: memFree=29505056/32873852 swapFree=7616/7616
[pid=2811] ppid=2809 vsize=48396 CPUtime=0.29 cores=1,3,5,7
/proc/2811/stat : 2811 (scip-2.1.1.4exp) R 2809 2811 403 0 -1 4202496 11686 0 0 0 26 3 0 0 20 0 1 0 268289412 49557504 10631 33554432000 4194304 10219143 140735706380080 140735706244920 9008087 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/2811/statm: 12099 10631 814 1471 0 10619 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 48396
[startup+0.700248 s]
/proc/loadavg: 2.00 2.00 2.00 3/175 2811
/proc/meminfo: memFree=29505056/32873852 swapFree=7616/7616
[pid=2811] ppid=2809 vsize=48536 CPUtime=0.69 cores=1,3,5,7
/proc/2811/stat : 2811 (scip-2.1.1.4exp) R 2809 2811 403 0 -1 4202496 11796 0 0 0 66 3 0 0 20 0 1 0 268289412 49700864 10741 33554432000 4194304 10219143 140735706380080 140735706375032 9026266 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/2811/statm: 12134 10741 814 1471 0 10654 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 48536
[startup+1.50022 s]
/proc/loadavg: 2.00 2.00 2.00 3/176 2812
/proc/meminfo: memFree=29465516/32873852 swapFree=7616/7616
[pid=2811] ppid=2809 vsize=48628 CPUtime=1.49 cores=1,3,5,7
/proc/2811/stat : 2811 (scip-2.1.1.4exp) R 2809 2811 403 0 -1 4202496 11819 0 0 0 145 4 0 0 20 0 1 0 268289412 49795072 10764 33554432000 4194304 10219143 140735706380080 140735706375032 9026266 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/2811/statm: 12157 10764 820 1471 0 10677 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 48628
[startup+3.10023 s]
/proc/loadavg: 2.00 2.00 2.00 3/176 2812
/proc/meminfo: memFree=29464000/32873852 swapFree=7616/7616
[pid=2811] ppid=2809 vsize=48628 CPUtime=3.09 cores=1,3,5,7
/proc/2811/stat : 2811 (scip-2.1.1.4exp) R 2809 2811 403 0 -1 4202496 11824 0 0 0 303 6 0 0 20 0 1 0 268289412 49795072 10917 33554432000 4194304 10219143 140735706380080 140735706373576 9026266 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/2811/statm: 12157 10917 823 1471 0 10677 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 48628
[startup+6.30023 s]
/proc/loadavg: 2.08 2.02 2.01 3/176 2812
/proc/meminfo: memFree=29464372/32873852 swapFree=7616/7616
[pid=2811] ppid=2809 vsize=48628 CPUtime=6.29 cores=1,3,5,7
/proc/2811/stat : 2811 (scip-2.1.1.4exp) R 2809 2811 403 0 -1 4202496 11824 0 0 0 620 9 0 0 20 0 1 0 268289412 49795072 10917 33554432000 4194304 10219143 140735706380080 140735706376920 9026266 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/2811/statm: 12157 10917 823 1471 0 10677 0
Current children cumulated CPU time (s) 6.29
Current children cumulated vsize (KiB) 48628
[startup+12.7002 s]
/proc/loadavg: 2.07 2.02 2.00 3/176 2812
/proc/meminfo: memFree=29463876/32873852 swapFree=7616/7616
[pid=2811] ppid=2809 vsize=48628 CPUtime=12.67 cores=1,3,5,7
/proc/2811/stat : 2811 (scip-2.1.1.4exp) R 2809 2811 403 0 -1 4202496 11832 0 0 0 1250 17 0 0 20 0 1 0 268289412 49795072 10919 33554432000 4194304 10219143 140735706380080 140735706373336 9026266 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/2811/statm: 12157 10919 824 1471 0 10677 0
Current children cumulated CPU time (s) 12.67
Current children cumulated vsize (KiB) 48628
Solver just ended. Dumping a history of the last processes samples
[startup+13.5002 s]
/proc/loadavg: 2.07 2.02 2.00 3/176 2812
/proc/meminfo: memFree=29464248/32873852 swapFree=7616/7616
[pid=2811] ppid=2809 vsize=48628 CPUtime=13.48 cores=1,3,5,7
/proc/2811/stat : 2811 (scip-2.1.1.4exp) R 2809 2811 403 0 -1 4202496 11832 0 0 0 1330 18 0 0 20 0 1 0 268289412 49795072 10919 33554432000 4194304 10219143 140735706380080 140735706373336 9026266 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/2811/statm: 12157 10919 824 1471 0 10677 0
Current children cumulated CPU time (s) 13.48
Current children cumulated vsize (KiB) 48628
[startup+14.3067 s]
/proc/loadavg: 2.07 2.02 2.00 3/176 2812
/proc/meminfo: memFree=29464248/32873852 swapFree=7616/7616
[pid=2811] ppid=2809 vsize=48628 CPUtime=14.28 cores=1,3,5,7
/proc/2811/stat : 2811 (scip-2.1.1.4exp) R 2809 2811 403 0 -1 4202496 11832 0 0 0 1410 18 0 0 20 0 1 0 268289412 49795072 10919 33554432000 4194304 10219143 140735706380080 140735706373336 9026266 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/2811/statm: 12157 10919 824 1471 0 10677 0
Current children cumulated CPU time (s) 14.28
Current children cumulated vsize (KiB) 48628
[startup+14.7002 s]
/proc/loadavg: 2.07 2.02 2.00 3/176 2812
/proc/meminfo: memFree=29464248/32873852 swapFree=7616/7616
[pid=2811] ppid=2809 vsize=47600 CPUtime=14.68 cores=1,3,5,7
/proc/2811/stat : 2811 (scip-2.1.1.4exp) R 2809 2811 403 0 -1 4202496 11836 0 0 0 1449 19 0 0 20 0 1 0 268289412 48742400 10666 33554432000 4194304 10219143 140735706380080 140735706373432 9036791 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/2811/statm: 11900 10666 828 1471 0 10420 0
Current children cumulated CPU time (s) 14.68
Current children cumulated vsize (KiB) 47600
Child status: 0
Real time (s): 14.706
CPU time (s): 14.6938
CPU user time (s): 14.4948
CPU system time (s): 0.198969
CPU usage (%): 99.9165
Max. virtual memory (cumulated for all children) (KiB): 50560
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 14.4948
system time used= 0.198969
maximum resident set size= 45056
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 11838
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= 12
involuntary context switches= 17
runsolver used 0.024996 second user time and 0.06199 second system time
The end