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-3737217-1338710221.opb>
0.00/0.01 c original problem has 788 variables (788 bin, 0 int, 0 impl, 0 cont) and 788 constraints
0.00/0.01 c problem read
0.00/0.01 c presolving settings loaded
0.00/0.01 o 0
0.00/0.01 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.00/0.01 c presolving:
0.00/0.03 c (round 1) 738 del vars, 50 del conss, 738 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2952 impls, 0 clqs
0.00/0.04 c presolving (2 rounds):
0.00/0.04 c 738 deleted vars, 50 deleted constraints, 738 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.04 c 4428 implications, 0 cliques
0.00/0.04 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 738 constraints
0.00/0.04 c 738 constraints of type <logicor>
0.00/0.04 c transformed objective value is always integral (scale: 1)
0.00/0.04 c Presolving Time: 0.03
0.00/0.04 c - non default parameters ----------------------------------------------------------------------
0.00/0.04 c # SCIP version 1.2.1.3
0.00/0.04 c
0.00/0.04 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04 c conflict/interconss = 0
0.00/0.04 c
0.00/0.04 c # should binary conflicts be preferred?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c conflict/preferbinary = TRUE
0.00/0.04 c
0.00/0.04 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04 c constraints/agelimit = 1
0.00/0.04 c
0.00/0.04 c # should enforcement of pseudo solution be disabled?
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/disableenfops = TRUE
0.00/0.04 c
0.00/0.04 c # frequency for displaying node information lines
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04 c display/freq = 10000
0.00/0.04 c
0.00/0.04 c # maximal time in seconds to run
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/time = 1790
0.00/0.04 c
0.00/0.04 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04 c limits/memory = 13950
0.00/0.04 c
0.00/0.04 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.04 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04 c lp/solvefreq = 0
0.00/0.04 c
0.00/0.04 c # LP pricing strategy ('l'pi default, 'a'uto, 'f'ull pricing, 'p'artial, 's'teepest edge pricing, 'q'uickstart steepest edge pricing, 'd'evex pricing)
0.00/0.04 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.04 c lp/pricing = a
0.00/0.04 c
0.00/0.04 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.04 c # [type: int, range: [1,2], default: 1]
0.00/0.04 c timing/clocktype = 2
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify inequalities
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/linear/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/indicator/addCouplingCons = TRUE
0.00/0.04 c
0.00/0.04 c # should presolving try to simplify knapsacks
0.00/0.04 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.04 c
0.00/0.04 c # priority of node selection rule <dfs> in standard mode
0.00/0.04 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.04 c nodeselection/dfs/stdpriority = 1000000
0.00/0.04 c
0.00/0.04 c -----------------------------------------------------------------------------------------------
0.00/0.04 c start solving
0.00/0.04 c
0.00/0.05 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.05 c t 0.0s| 1 | 0 | 51 | - |2192k| 0 | 50 | 50 | 738 | 50 | 738 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.00/0.05 o -1
0.00/0.05 c R 0.0s| 1 | 0 | 51 | - |2193k| 0 | 50 | 50 | 738 | 50 | 738 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.00/0.05 o -2
0.00/0.05 c s 0.0s| 1 | 0 | 51 | - |2193k| 0 | 50 | 50 | 738 | 50 | 738 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.00/0.06 c 0.0s| 1 | 0 | 108 | - |2199k| 0 | 33 | 50 | 738 | 50 | 743 | 5 | 0 | 0 |-1.650000e+01 |-2.000000e+00 | 87.88%
0.00/0.06 o -4
0.00/0.06 c b 0.0s| 1 | 0 | 108 | - |2201k| 0 | 33 | 50 | 738 | 50 | 743 | 5 | 0 | 0 |-1.650000e+01 |-4.000000e+00 | 75.76%
0.00/0.07 c 0.1s| 1 | 0 | 169 | - |2205k| 0 | 25 | 50 | 738 | 50 | 749 | 11 | 0 | 0 |-1.250000e+01 |-4.000000e+00 | 68.00%
0.00/0.09 c 0.1s| 1 | 0 | 209 | - |2211k| 0 | 23 | 50 | 738 | 50 | 754 | 16 | 0 | 0 |-1.150000e+01 |-4.000000e+00 | 65.22%
0.09/0.10 c 0.1s| 1 | 0 | 254 | - |2216k| 0 | 34 | 50 | 738 | 50 | 759 | 21 | 0 | 0 |-1.056250e+01 |-4.000000e+00 | 62.13%
0.09/0.13 c 0.1s| 1 | 0 | 311 | - |2292k| 0 | 30 | 50 | 738 | 50 | 766 | 28 | 0 | 0 |-9.714286e+00 |-4.000000e+00 | 58.82%
0.09/0.16 c 0.2s| 1 | 0 | 386 | - |2340k| 0 | 23 | 50 | 738 | 50 | 773 | 35 | 0 | 0 |-8.750000e+00 |-4.000000e+00 | 54.29%
0.09/0.18 c 0.2s| 1 | 0 | 404 | - |2423k| 0 | 30 | 50 | 738 | 50 | 781 | 43 | 0 | 0 |-8.541667e+00 |-4.000000e+00 | 53.17%
0.18/0.21 c 0.2s| 1 | 0 | 443 | - |2548k| 0 | 22 | 50 | 738 | 50 | 788 | 50 | 0 | 0 |-8.333333e+00 |-4.000000e+00 | 52.00%
0.18/0.24 c 0.2s| 1 | 0 | 477 | - |2584k| 0 | 31 | 50 | 738 | 50 | 793 | 55 | 0 | 0 |-8.129577e+00 |-4.000000e+00 | 50.80%
0.18/0.28 c 0.3s| 1 | 0 | 518 | - |3006k| 0 | 30 | 50 | 738 | 50 | 799 | 61 | 0 | 0 |-7.941176e+00 |-4.000000e+00 | 49.63%
0.29/0.31 c 0.3s| 1 | 0 | 558 | - |3246k| 0 | 34 | 50 | 738 | 50 | 117 | 69 | 0 | 0 |-7.662626e+00 |-4.000000e+00 | 47.80%
0.29/0.32 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.29/0.32 c 0.3s| 1 | 0 | 586 | - |3536k| 0 | 36 | 50 | 738 | 50 | 124 | 76 | 0 | 0 |-7.450753e+00 |-4.000000e+00 | 46.31%
0.29/0.33 c 0.3s| 1 | 0 | 639 | - |3616k| 0 | 33 | 50 | 738 | 50 | 136 | 88 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.29/0.33 c 0.3s| 1 | 0 | 695 | - |3639k| 0 | 36 | 50 | 738 | 50 | 143 | 95 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.29/0.34 c 0.3s| 1 | 0 | 720 | - |3771k| 0 | 40 | 50 | 738 | 50 | 151 | 103 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.29/0.35 c 0.3s| 1 | 0 | 739 | - |3884k| 0 | 43 | 50 | 738 | 50 | 159 | 111 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.29/0.36 c 0.4s| 1 | 0 | 772 | - |4005k| 0 | 45 | 50 | 738 | 50 | 120 | 121 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.29/0.36 c 0.4s| 1 | 0 | 819 | - |4074k| 0 | 45 | 50 | 738 | 50 | 128 | 129 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.38/0.47 c 0.5s| 1 | 2 | 819 | - |4075k| 0 | 45 | 50 | 738 | 50 | 128 | 129 | 0 | 20 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.38/0.47 o -5
0.38/0.47 c * 0.5s| 8 | 3 | 819 | 0.0 |4080k| 5 | - | 50 | 738 | 0 | 0 | 129 | 0 | 20 |-6.998700e+00 |-5.000000e+00 | 28.56%
0.38/0.47 o -6
0.38/0.47 c * 0.5s| 27 | 0 | 819 | 0.0 |4081k| 8 | - | 50 | 739 | 0 | 0 | 129 | 1 | 20 |-6.000000e+00 |-6.000000e+00 | 0.00%
0.38/0.47 c
0.38/0.47 c SCIP Status : problem is solved [optimal solution found]
0.38/0.47 c Solving Time (sec) : 0.47
0.38/0.47 c Solving Nodes : 27
0.38/0.47 c Primal Bound : -6.00000000000000e+00 (10 solutions)
0.38/0.47 c Dual Bound : -6.00000000000000e+00
0.38/0.47 c Gap : 0.00 %
0.38/0.47 s OPTIMUM FOUND
0.38/0.47 v x50 -x49 -x48 -x47 -x46 -x45 x44 -x43 -x42 x41 -x40 -x39 -x38 -x37 -x36 x35 -x34 -x33 -x32 -x31 -x30 -x29 -x28 -x27 -x26 -x25 -x24
0.38/0.47 v -x23 -x22 -x21 x20 -x19 -x18 -x17 -x16 -x15 x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
0.38/0.47 c SCIP Status : problem is solved [optimal solution found]
0.38/0.47 c Solving Time : 0.47
0.38/0.47 c Original Problem :
0.38/0.47 c Problem name : HOME/instance-3737217-1338710221.opb
0.38/0.47 c Variables : 788 (788 binary, 0 integer, 0 implicit integer, 0 continuous)
0.38/0.47 c Constraints : 788 initial, 788 maximal
0.38/0.47 c Presolved Problem :
0.38/0.47 c Problem name : t_HOME/instance-3737217-1338710221.opb
0.38/0.47 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
0.38/0.47 c Constraints : 738 initial, 739 maximal
0.38/0.47 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
0.38/0.47 c trivial : 0.00 0 0 0 0 0 0 0 0
0.38/0.47 c dualfix : 0.00 0 0 0 0 0 0 0 0
0.38/0.47 c boundshift : 0.00 0 0 0 0 0 0 0 0
0.38/0.47 c inttobinary : 0.00 0 0 0 0 0 0 0 0
0.38/0.47 c implics : 0.00 0 0 0 0 0 0 0 0
0.38/0.47 c probing : 0.01 0 0 0 0 0 0 0 0
0.38/0.47 c linear : 0.00 738 0 0 738 0 50 0 0
0.38/0.47 c logicor : 0.00 0 0 0 0 0 0 0 0
0.38/0.47 c root node : - 0 - - 0 - - - -
0.38/0.47 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
0.38/0.47 c integral : 0 0 0 1 0 0 0 0 0 2
0.38/0.47 c logicor : 738+ 18 127 0 2 2 105 8 0 0
0.38/0.47 c countsols : 0 0 0 0 2 0 0 0 0 0
0.38/0.47 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
0.38/0.47 c integral : 0.10 0.00 0.00 0.10 0.00
0.38/0.47 c logicor : 0.00 0.00 0.00 0.00 0.00
0.38/0.47 c countsols : 0.00 0.00 0.00 0.00 0.00
0.38/0.47 c Propagators : Time Calls Cutoffs DomReds
0.38/0.47 c vbounds : 0.00 2 0 0
0.38/0.47 c rootredcost : 0.00 1 0 0
0.38/0.47 c pseudoobj : 0.00 60 8 13
0.38/0.47 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.38/0.47 c propagation : 0.00 10 1 1 7.0 0 0.0 -
0.38/0.47 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.38/0.47 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.38/0.47 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.38/0.47 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.38/0.47 c applied globally : - - - 1 7.0 - - -
0.38/0.47 c applied locally : - - - 0 0.0 - - -
0.38/0.47 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.38/0.47 c cut pool : 0.00 17 - - 131 - (maximal pool size: 1240)
0.38/0.47 c redcost : 0.00 18 0 0 0 0
0.38/0.47 c impliedbounds : 0.00 18 0 0 16 0
0.38/0.47 c intobj : 0.00 0 0 0 0 0
0.38/0.47 c cgmip : 0.00 0 0 0 0 0
0.38/0.47 c gomory : 0.12 18 0 0 4817 0
0.38/0.47 c strongcg : 0.11 18 0 0 5134 0
0.38/0.47 c cmir : 0.01 10 0 0 0 0
0.38/0.47 c flowcover : 0.02 10 0 0 0 0
0.38/0.47 c clique : 0.01 18 0 0 152 0
0.38/0.47 c zerohalf : 0.00 0 0 0 0 0
0.38/0.47 c mcf : 0.00 1 0 0 0 0
0.38/0.47 c rapidlearning : 0.00 0 0 0 0 0
0.38/0.47 c Pricers : Time Calls Vars
0.38/0.47 c problem variables: 0.00 0 0
0.38/0.47 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.38/0.47 c relpscost : 0.10 1 0 0 0 0 2
0.38/0.47 c pscost : 0.00 0 0 0 0 0 0
0.38/0.47 c inference : 0.00 14 0 0 0 0 28
0.38/0.47 c mostinf : 0.00 0 0 0 0 0 0
0.38/0.47 c leastinf : 0.00 0 0 0 0 0 0
0.38/0.47 c fullstrong : 0.00 0 0 0 0 0 0
0.38/0.47 c allfullstrong : 0.00 0 0 0 0 0 0
0.38/0.47 c random : 0.00 0 0 0 0 0 0
0.38/0.47 c Primal Heuristics : Time Calls Found
0.38/0.47 c LP solutions : 0.00 - 0
0.38/0.47 c pseudo solutions : 0.00 - 2
0.38/0.47 c crossover : 0.00 0 0
0.38/0.47 c oneopt : 0.00 2 1
0.38/0.47 c trivial : 0.00 2 2
0.38/0.47 c simplerounding : 0.00 19 0
0.38/0.47 c zirounding : 0.00 1 1
0.38/0.47 c rounding : 0.00 19 1
0.38/0.47 c shifting : 0.00 19 3
0.38/0.47 c intshifting : 0.00 0 0
0.38/0.47 c twoopt : 0.00 0 0
0.38/0.47 c fixandinfer : 0.00 0 0
0.38/0.47 c feaspump : 0.00 0 0
0.38/0.47 c coefdiving : 0.00 0 0
0.38/0.47 c pscostdiving : 0.00 0 0
0.38/0.47 c fracdiving : 0.00 0 0
0.38/0.47 c veclendiving : 0.00 0 0
0.38/0.47 c intdiving : 0.00 0 0
0.38/0.47 c actconsdiving : 0.00 0 0
0.38/0.47 c objpscostdiving : 0.00 0 0
0.38/0.47 c rootsoldiving : 0.00 0 0
0.38/0.47 c linesearchdiving : 0.00 0 0
0.38/0.47 c guideddiving : 0.00 0 0
0.38/0.47 c octane : 0.00 0 0
0.38/0.47 c rens : 0.00 0 0
0.38/0.47 c rins : 0.00 0 0
0.38/0.47 c localbranching : 0.00 0 0
0.38/0.47 c mutation : 0.00 0 0
0.38/0.47 c dins : 0.00 0 0
0.38/0.47 c undercover : 0.00 0 0
0.38/0.47 c nlp : 0.00 0 0
0.38/0.47 c trysol : 0.00 0 0
0.38/0.47 c LP : Time Calls Iterations Iter/call Iter/sec
0.38/0.47 c primal LP : 0.00 0 0 0.00 -
0.38/0.47 c dual LP : 0.04 19 819 43.11 19308.30
0.38/0.47 c lex dual LP : 0.00 0 0 0.00 -
0.38/0.47 c barrier LP : 0.00 0 0 0.00 -
0.38/0.47 c diving/probing LP: 0.00 0 0 0.00 -
0.38/0.47 c strong branching : 0.10 20 2609 130.45 25480.01
0.38/0.47 c (at root node) : - 20 2609 130.45 -
0.38/0.47 c conflict analysis: 0.00 0 0 0.00 -
0.38/0.47 c B&B Tree :
0.38/0.47 c number of runs : 1
0.38/0.47 c nodes : 27
0.38/0.47 c nodes (total) : 27
0.38/0.47 c nodes left : 0
0.38/0.47 c max depth : 8
0.38/0.47 c max depth (total): 8
0.38/0.47 c backtracks : 3 (11.1%)
0.38/0.47 c delayed cutoffs : 0
0.38/0.47 c repropagations : 2 (4 domain reductions, 0 cutoffs)
0.38/0.47 c avg switch length: 2.07
0.38/0.47 c switching time : 0.00
0.38/0.47 c Solution :
0.38/0.47 c Solutions found : 10 (6 improvements)
0.38/0.47 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.38/0.47 c Primal Bound : -6.00000000000000e+00 (in run 1, after 27 nodes, 0.47 seconds, depth 8, found by <relaxation>)
0.38/0.47 c Dual Bound : -6.00000000000000e+00
0.38/0.47 c Gap : 0.00 %
0.38/0.47 c Root Dual Bound : -7.00000000000000e+00
0.38/0.47 c Root Iterations : 819
0.38/0.48 c Time complete: 0.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-3737217-1338710221/watcher-3737217-1338710221 -o /tmp/evaluation-result-3737217-1338710221/solver-3737217-1338710221 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt.spx -f HOME/instance-3737217-1338710221.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: 2.00 2.00 2.00 2/176 16140
/proc/meminfo: memFree=27915248/32873648 swapFree=6864/6864
[pid=16140] ppid=16138 vsize=8944 CPUtime=0 cores=0,2,4,6
/proc/16140/stat : 16140 (pbscip.linux.x8) R 16138 16140 11712 0 -1 4202496 1504 0 0 0 0 0 0 0 20 0 1 0 337148911 9158656 1451 33554432000 4194304 8395647 140735084877264 140734091286888 7382157 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/16140/statm: 2236 1462 374 1026 0 1206 0
[startup+0.00875304 s]
/proc/loadavg: 2.00 2.00 2.00 2/176 16140
/proc/meminfo: memFree=27915248/32873648 swapFree=6864/6864
[pid=16140] ppid=16138 vsize=10668 CPUtime=0 cores=0,2,4,6
/proc/16140/stat : 16140 (pbscip.linux.x8) R 16138 16140 11712 0 -1 4202496 1921 0 0 0 0 0 0 0 20 0 1 0 337148911 10924032 1867 33554432000 4194304 8395647 140735084877264 140734091286888 5755201 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/16140/statm: 2667 1867 393 1026 0 1637 0
Current children cumulated CPU time (s) 0
Current children cumulated vsize (KiB) 10668
[startup+0.100209 s]
/proc/loadavg: 2.00 2.00 2.00 2/176 16140
/proc/meminfo: memFree=27915248/32873648 swapFree=6864/6864
[pid=16140] ppid=16138 vsize=18360 CPUtime=0.09 cores=0,2,4,6
/proc/16140/stat : 16140 (pbscip.linux.x8) R 16138 16140 11712 0 -1 4202496 4095 0 0 0 9 0 0 0 20 0 1 0 337148911 18800640 3687 33554432000 4194304 8395647 140735084877264 140734091286888 6197326 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/16140/statm: 4590 3687 592 1026 0 3560 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 18360
[startup+0.300181 s]
/proc/loadavg: 2.00 2.00 2.00 2/176 16140
/proc/meminfo: memFree=27915248/32873648 swapFree=6864/6864
[pid=16140] ppid=16138 vsize=24264 CPUtime=0.29 cores=0,2,4,6
/proc/16140/stat : 16140 (pbscip.linux.x8) R 16138 16140 11712 0 -1 4202496 5581 0 0 0 28 1 0 0 20 0 1 0 337148911 24846336 5173 33554432000 4194304 8395647 140735084877264 140735084872504 7428202 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/16140/statm: 6066 5173 594 1026 0 5036 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 24264
Solver just ended. Dumping a history of the last processes samples
[startup+0.400233 s]
/proc/loadavg: 2.00 2.00 2.00 2/176 16140
/proc/meminfo: memFree=27915248/32873648 swapFree=6864/6864
[pid=16140] ppid=16138 vsize=24264 CPUtime=0.38 cores=0,2,4,6
/proc/16140/stat : 16140 (pbscip.linux.x8) R 16138 16140 11712 0 -1 4202496 6393 0 0 0 37 1 0 0 20 0 1 0 337148911 24846336 5216 33554432000 4194304 8395647 140735084877264 140735084872504 7428202 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/16140/statm: 6066 5216 601 1026 0 5036 0
Current children cumulated CPU time (s) 0.38
Current children cumulated vsize (KiB) 24264
Child status: 0
Real time (s): 0.483223
CPU time (s): 0.481926
CPU user time (s): 0.45793
CPU system time (s): 0.023996
CPU usage (%): 99.7316
Max. virtual memory (cumulated for all children) (KiB): 24264
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.45793
system time used= 0.023996
maximum resident set size= 23936
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 6410
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= 2
runsolver used 0 second user time and 0.005999 second system time
The end