0.00/0.01 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.01 c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.01 c
0.00/0.01 c user parameter file <scip.set> not found - using default parameters
0.00/0.01 c reading problem <HOME/instance-3452339-1307108198.opb>
0.00/0.01 c original problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 50 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) 740 del vars, 50 del conss, 0 add conss, 740 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2960 impls, 0 clqs
0.00/0.04 c (round 2) 740 del vars, 50 del conss, 0 add conss, 740 chg bounds, 0 chg sides, 0 chg coeffs, 740 upgd conss, 4440 impls, 0 clqs
0.00/0.05 c presolving (3 rounds):
0.00/0.05 c 740 deleted vars, 50 deleted constraints, 0 added constraints, 740 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.05 c 4440 implications, 0 cliques
0.00/0.05 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 740 constraints
0.00/0.05 c 740 constraints of type <logicor>
0.00/0.05 c transformed objective value is always integral (scale: 1)
0.00/0.05 c Presolving Time: 0.04
0.00/0.05 c - non default parameters ----------------------------------------------------------------------
0.00/0.05 c # SCIP version 2.0.1.4
0.00/0.05 c
0.00/0.05 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05 c conflict/interconss = 0
0.00/0.05 c
0.00/0.05 c # should binary conflicts be preferred?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c conflict/preferbinary = TRUE
0.00/0.05 c
0.00/0.05 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05 c constraints/agelimit = 1
0.00/0.05 c
0.00/0.05 c # should enforcement of pseudo solution be disabled?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/disableenfops = TRUE
0.00/0.05 c
0.00/0.05 c # frequency for displaying node information lines
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05 c display/freq = 10000
0.00/0.05 c
0.00/0.05 c # maximal time in seconds to run
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/time = 1800
0.00/0.05 c
0.00/0.05 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05 c limits/memory = 13950
0.00/0.05 c
0.00/0.05 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.05 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05 c lp/solvefreq = 0
0.00/0.05 c
0.00/0.05 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.05 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.05 c lp/pricing = a
0.00/0.05 c
0.00/0.05 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.05 c # [type: int, range: [1,2], default: 1]
0.00/0.05 c timing/clocktype = 2
0.00/0.05 c
0.00/0.05 c # belongs reading time to solving time?
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c timing/reading = TRUE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify inequalities
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/linear/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/indicator/addCouplingCons = TRUE
0.00/0.05 c
0.00/0.05 c # should presolving try to simplify knapsacks
0.00/0.05 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.05 c
0.00/0.05 c # priority of node selection rule <dfs> in standard mode
0.00/0.05 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.05 c nodeselection/dfs/stdpriority = 1000000
0.00/0.05 c
0.00/0.05 c -----------------------------------------------------------------------------------------------
0.00/0.05 c start solving
0.00/0.05 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.1s| 1 | 0 | 50 | - |1740k| 0 | 50 | 50 | 740 | 50 | 740 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.00/0.05 o -1
0.00/0.05 c R 0.1s| 1 | 0 | 50 | - |1741k| 0 | 50 | 50 | 740 | 50 | 740 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.00/0.05 o -2
0.00/0.05 c s 0.1s| 1 | 0 | 50 | - |1741k| 0 | 50 | 50 | 740 | 50 | 740 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.00/0.06 c 0.1s| 1 | 0 | 84 | - |1747k| 0 | 41 | 50 | 740 | 50 | 744 | 4 | 0 | 0 |-2.050000e+01 |-2.000000e+00 | 90.24%
0.00/0.06 o -4
0.00/0.06 c b 0.1s| 1 | 0 | 84 | - |1749k| 0 | 41 | 50 | 740 | 50 | 744 | 4 | 0 | 0 |-2.050000e+01 |-4.000000e+00 | 80.49%
0.05/0.07 c 0.1s| 1 | 0 | 159 | - |1756k| 0 | 32 | 50 | 740 | 50 | 751 | 11 | 0 | 0 |-1.600000e+01 |-4.000000e+00 | 75.00%
0.05/0.09 c 0.1s| 1 | 0 | 229 | - |1762k| 0 | 25 | 50 | 740 | 50 | 761 | 21 | 0 | 0 |-1.250000e+01 |-4.000000e+00 | 68.00%
0.09/0.11 c 0.1s| 1 | 0 | 328 | - |1773k| 0 | 29 | 50 | 740 | 50 | 767 | 27 | 0 | 0 |-1.056250e+01 |-4.000000e+00 | 62.13%
0.09/0.14 c 0.1s| 1 | 0 | 394 | - |1829k| 0 | 26 | 50 | 740 | 50 | 775 | 35 | 0 | 0 |-9.416667e+00 |-4.000000e+00 | 57.52%
0.09/0.16 c 0.2s| 1 | 0 | 448 | - |1853k| 0 | 26 | 50 | 740 | 50 | 785 | 45 | 0 | 0 |-8.750000e+00 |-4.000000e+00 | 54.29%
0.09/0.19 c 0.2s| 1 | 0 | 480 | - |1876k| 0 | 28 | 50 | 740 | 50 | 790 | 50 | 0 | 0 |-8.482143e+00 |-4.000000e+00 | 52.84%
0.19/0.23 c 0.2s| 1 | 0 | 550 | - |2048k| 0 | 34 | 50 | 740 | 50 | 800 | 60 | 0 | 0 |-8.070485e+00 |-4.000000e+00 | 50.44%
0.19/0.27 c 0.3s| 1 | 0 | 592 | - |2383k| 0 | 33 | 50 | 740 | 50 | 807 | 67 | 0 | 0 |-7.804878e+00 |-4.000000e+00 | 48.75%
0.29/0.30 c 0.3s| 1 | 0 | 624 | - |2699k| 0 | 35 | 50 | 740 | 50 | 815 | 75 | 0 | 0 |-7.679245e+00 |-4.000000e+00 | 47.91%
0.29/0.34 c 0.3s| 1 | 0 | 647 | - |3077k| 0 | 36 | 50 | 740 | 50 | 148 | 82 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.29/0.35 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.35 c 0.3s| 1 | 0 | 665 | - |3327k| 0 | 41 | 50 | 740 | 50 | 154 | 88 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.29/0.36 c 0.4s| 1 | 0 | 685 | - |3431k| 0 | 42 | 50 | 740 | 50 | 162 | 96 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.29/0.37 c 0.4s| 1 | 0 | 704 | - |3534k| 0 | 44 | 50 | 740 | 50 | 169 | 103 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.29/0.37 c 0.4s| 1 | 0 | 715 | - |3653k| 0 | 45 | 50 | 740 | 50 | 175 | 109 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.29/0.38 c 0.4s| 1 | 0 | 740 | - |3743k| 0 | 45 | 50 | 740 | 50 | 181 | 115 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.49/0.55 c 0.6s| 1 | 2 | 740 | - |3744k| 0 | 45 | 50 | 740 | 50 | 181 | 115 | 0 | 32 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.49/0.55 o -5
0.49/0.55 c * 0.6s| 14 | 1 | 740 | 0.0 |3748k| 5 | - | 50 | 740 | 0 | 0 | 115 | 0 | 32 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.49/0.56 o -6
0.49/0.56 c * 0.6s| 155 | 2 | 740 | 0.0 |3667k| 19 | - | 50 | 633 | 0 | 0 | 115 | 79 | 32 |-7.000000e+00 |-6.000000e+00 | 14.29%
0.49/0.59 c
0.49/0.59 c SCIP Status : problem is solved [optimal solution found]
0.49/0.59 c Solving Time (sec) : 0.59
0.49/0.59 c Solving Nodes : 564
0.49/0.59 c Primal Bound : -6.00000000000000e+00 (9 solutions)
0.49/0.59 c Dual Bound : -6.00000000000000e+00
0.49/0.59 c Gap : 0.00 %
0.49/0.59 s OPTIMUM FOUND
0.49/0.59 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.49/0.59 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.49/0.59 c SCIP Status : problem is solved [optimal solution found]
0.49/0.59 c Total Time : 0.59
0.49/0.59 c solving : 0.59
0.49/0.59 c presolving : 0.04 (included in solving)
0.49/0.59 c reading : 0.00 (included in solving)
0.49/0.59 c Original Problem :
0.49/0.59 c Problem name : HOME/instance-3452339-1307108198.opb
0.49/0.59 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.59 c Constraints : 50 initial, 50 maximal
0.49/0.59 c Presolved Problem :
0.49/0.59 c Problem name : t_HOME/instance-3452339-1307108198.opb
0.49/0.59 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.59 c Constraints : 740 initial, 759 maximal
0.49/0.59 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.49/0.59 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.59 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.59 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.59 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.59 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.59 c probing : 0.01 0 0 0 0 0 0 0 0 0
0.49/0.59 c and : 0.02 0 0 0 0 0 0 0 0 0
0.49/0.59 c linear : 0.00 740 0 0 740 0 50 0 0 0
0.49/0.59 c logicor : 0.01 0 0 0 0 0 0 0 0 0
0.49/0.59 c root node : - 50 - - 50 - - - - -
0.49/0.59 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.49/0.59 c integral : 0 0 0 1 0 11 0 0 0 0 0 2
0.49/0.59 c logicor : 740+ 16 814 0 2 7 9816 119 2372 0 0 0
0.49/0.59 c countsols : 0 0 0 0 2 9 0 0 0 0 0 0
0.49/0.59 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.49/0.59 c integral : 0.16 0.00 0.00 0.16 0.00 0.00 0.00
0.49/0.59 c logicor : 0.01 0.00 0.01 0.00 0.00 0.00 0.00
0.49/0.59 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.59 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.49/0.59 c vbounds : 0 0 0 0
0.49/0.59 c rootredcost : 2 0 0 3
0.49/0.59 c pseudoobj : 2818 231 200 582
0.49/0.59 c Propagator Timings : TotalTime Propagate Resprop
0.49/0.59 c vbounds : 0.00 0.00 0.00
0.49/0.59 c rootredcost : 0.00 0.00 0.00
0.49/0.59 c pseudoobj : 0.01 0.01 0.00
0.49/0.59 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.59 c propagation : 0.00 319 313 313 2.1 0 0.0 -
0.49/0.59 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.59 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.59 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.59 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.59 c applied globally : - - - 313 2.1 - - -
0.49/0.59 c applied locally : - - - 0 0.0 - - -
0.49/0.59 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.49/0.59 c cut pool : 0.00 15 - - 171 - (maximal pool size: 1208)
0.49/0.59 c redcost : 0.00 16 0 0 0 0
0.49/0.59 c impliedbounds : 0.00 16 0 0 0 0
0.49/0.59 c intobj : 0.00 0 0 0 0 0
0.49/0.59 c gomory : 0.13 16 0 0 4602 0
0.49/0.59 c cgmip : 0.00 0 0 0 0 0
0.49/0.59 c closecuts : 0.00 0 0 0 0 0
0.49/0.59 c strongcg : 0.12 16 0 0 4942 0
0.49/0.59 c cmir : 0.01 10 0 0 0 0
0.49/0.59 c flowcover : 0.02 10 0 0 0 0
0.49/0.59 c clique : 0.01 16 0 0 141 0
0.49/0.59 c zerohalf : 0.00 0 0 0 0 0
0.49/0.59 c mcf : 0.00 1 0 0 0 0
0.49/0.59 c oddcycle : 0.00 0 0 0 0 0
0.49/0.59 c rapidlearning : 0.00 0 0 0 0 0
0.49/0.59 c Pricers : Time Calls Vars
0.49/0.59 c problem variables: 0.00 0 0
0.49/0.59 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.49/0.59 c relpscost : 0.16 1 0 0 0 0 2
0.49/0.59 c pscost : 0.00 0 0 0 0 0 0
0.49/0.59 c inference : 0.00 322 0 0 0 0 644
0.49/0.59 c mostinf : 0.00 0 0 0 0 0 0
0.49/0.59 c leastinf : 0.00 0 0 0 0 0 0
0.49/0.59 c fullstrong : 0.00 0 0 0 0 0 0
0.49/0.59 c allfullstrong : 0.00 0 0 0 0 0 0
0.49/0.59 c random : 0.00 0 0 0 0 0 0
0.49/0.59 c Primal Heuristics : Time Calls Found
0.49/0.59 c LP solutions : 0.00 - 0
0.49/0.59 c pseudo solutions : 0.00 - 2
0.49/0.59 c crossover : 0.00 0 0
0.49/0.59 c oneopt : 0.00 2 1
0.49/0.59 c trivial : 0.00 2 1
0.49/0.59 c shiftandpropagate: 0.00 0 0
0.49/0.59 c simplerounding : 0.00 17 0
0.49/0.59 c zirounding : 0.00 1 1
0.49/0.59 c rounding : 0.00 17 1
0.49/0.59 c shifting : 0.00 17 3
0.49/0.59 c intshifting : 0.00 0 0
0.49/0.59 c twoopt : 0.00 0 0
0.49/0.59 c fixandinfer : 0.00 0 0
0.49/0.59 c feaspump : 0.00 0 0
0.49/0.59 c clique : 0.00 0 0
0.49/0.59 c coefdiving : 0.00 0 0
0.49/0.59 c pscostdiving : 0.00 0 0
0.49/0.59 c fracdiving : 0.00 0 0
0.49/0.59 c veclendiving : 0.00 0 0
0.49/0.59 c intdiving : 0.00 0 0
0.49/0.59 c actconsdiving : 0.00 0 0
0.49/0.59 c objpscostdiving : 0.00 0 0
0.49/0.59 c rootsoldiving : 0.00 0 0
0.49/0.59 c linesearchdiving : 0.00 0 0
0.49/0.59 c guideddiving : 0.00 0 0
0.49/0.59 c octane : 0.00 0 0
0.49/0.59 c rens : 0.01 0 0
0.49/0.59 c rins : 0.00 0 0
0.49/0.59 c localbranching : 0.00 0 0
0.49/0.59 c mutation : 0.00 0 0
0.49/0.59 c dins : 0.00 0 0
0.49/0.59 c vbounds : 0.00 0 0
0.49/0.59 c undercover : 0.00 0 0
0.49/0.59 c subnlp : 0.00 0 0
0.49/0.59 c trysol : 0.00 0 0
0.49/0.59 c LP : Time Calls Iterations Iter/call Iter/sec
0.49/0.59 c primal LP : 0.00 0 0 0.00 -
0.49/0.59 c dual LP : 0.03 17 740 43.53 21179.77
0.49/0.59 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.59 c barrier LP : 0.00 0 0 0.00 -
0.49/0.59 c diving/probing LP: 0.00 0 0 0.00 -
0.49/0.59 c strong branching : 0.16 32 4547 142.09 27674.65
0.49/0.59 c (at root node) : - 32 4547 142.09 -
0.49/0.59 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.59 c B&B Tree :
0.49/0.59 c number of runs : 1
0.49/0.59 c nodes : 564
0.49/0.59 c nodes (total) : 564
0.49/0.59 c nodes left : 0
0.49/0.59 c max depth : 40
0.49/0.59 c max depth (total): 40
0.49/0.59 c backtracks : 82 (14.5%)
0.49/0.59 c delayed cutoffs : 80
0.49/0.59 c repropagations : 1605 (719 domain reductions, 80 cutoffs)
0.49/0.59 c avg switch length: 6.60
0.49/0.59 c switching time : 0.01
0.49/0.59 c Solution :
0.49/0.59 c Solutions found : 9 (6 improvements)
0.49/0.59 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.49/0.59 c Primal Bound : -6.00000000000000e+00 (in run 1, after 155 nodes, 0.56 seconds, depth 17, found by <relaxation>)
0.49/0.59 c Dual Bound : -6.00000000000000e+00
0.49/0.59 c Gap : 0.00 %
0.49/0.59 c Root Dual Bound : -6.99999999999999e+00
0.49/0.59 c Root Iterations : 740
0.49/0.59 c Time complete: 0.58.
runsolver Copyright (C) 2010-2011 Olivier ROUSSEL
This is runsolver version 3.3.0 (svn: 977)
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-3452339-1307108198/watcher-3452339-1307108198 -o /tmp/evaluation-result-3452339-1307108198/solver-3452339-1307108198 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3452339-1307108198.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.01 2.00 3/511 32259
/proc/meminfo: memFree=16659356/32951124 swapFree=67111204/67111528
[pid=32259] ppid=32257 vsize=17016 CPUtime=0.01 cores=0,2,4,6
/proc/32259/stat : 32259 (scip-2.0.1.4.li) R 32257 32259 30576 0 -1 4202496 3270 0 0 0 1 0 0 0 25 0 1 0 803235899 17424384 2965 33554432000 4194304 9128323 140733750953568 18446744073709551615 18446744073699066094 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/32259/statm: 4254 2965 498 1205 0 3045 0
[startup+0.064764 s]
/proc/loadavg: 2.00 2.01 2.00 3/511 32259
/proc/meminfo: memFree=16659356/32951124 swapFree=67111204/67111528
[pid=32259] ppid=32257 vsize=20020 CPUtime=0.05 cores=0,2,4,6
/proc/32259/stat : 32259 (scip-2.0.1.4.li) R 32257 32259 30576 0 -1 4202496 4135 0 0 0 5 0 0 0 25 0 1 0 803235899 20500480 3827 33554432000 4194304 9128323 140733750953568 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/32259/statm: 5005 3827 664 1205 0 3796 0
Current children cumulated CPU time (s) 0.05
Current children cumulated vsize (KiB) 20020
[startup+0.100772 s]
/proc/loadavg: 2.00 2.01 2.00 3/511 32259
/proc/meminfo: memFree=16659356/32951124 swapFree=67111204/67111528
[pid=32259] ppid=32257 vsize=20172 CPUtime=0.09 cores=0,2,4,6
/proc/32259/stat : 32259 (scip-2.0.1.4.li) R 32257 32259 30576 0 -1 4202496 4215 0 0 0 9 0 0 0 25 0 1 0 803235899 20656128 3907 33554432000 4194304 9128323 140733750953568 18446744073709551615 6637220 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/32259/statm: 5043 3907 666 1205 0 3834 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 20172
[startup+0.300735 s]
/proc/loadavg: 2.00 2.01 2.00 3/511 32259
/proc/meminfo: memFree=16659356/32951124 swapFree=67111204/67111528
[pid=32259] ppid=32257 vsize=25532 CPUtime=0.29 cores=0,2,4,6
/proc/32259/stat : 32259 (scip-2.0.1.4.li) R 32257 32259 30576 0 -1 4202496 5537 0 0 0 29 0 0 0 25 0 1 0 803235899 26144768 5229 33554432000 4194304 9128323 140733750953568 18446744073709551615 6707204 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/32259/statm: 6383 5229 668 1205 0 5174 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 25532
Solver just ended. Dumping a history of the last processes samples
[startup+0.500737 s]
/proc/loadavg: 2.00 2.01 2.00 3/511 32259
/proc/meminfo: memFree=16659356/32951124 swapFree=67111204/67111528
[pid=32259] ppid=32257 vsize=26008 CPUtime=0.49 cores=0,2,4,6
/proc/32259/stat : 32259 (scip-2.0.1.4.li) R 32257 32259 30576 0 -1 4202496 6592 0 0 0 48 1 0 0 25 0 1 0 803235899 26632192 5492 33554432000 4194304 9128323 140733750953568 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/32259/statm: 6502 5492 691 1205 0 5293 0
Current children cumulated CPU time (s) 0.49
Current children cumulated vsize (KiB) 26008
Child status: 0
Real time (s): 0.59529
CPU time (s): 0.593908
CPU user time (s): 0.573912
CPU system time (s): 0.019996
CPU usage (%): 99.7678
Max. virtual memory (cumulated for all children) (KiB): 26008
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.573912
system time used= 0.019996
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 6614
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= 5
involuntary context switches= 2
runsolver used 0.001999 second user time and 0.017997 second system time
The end