0.00/0.00 c SCIP version 2.0.1.4 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.4]
0.00/0.00 c Copyright (c) 2002-2011 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-3452311-1307106466.opb>
0.00/0.00 c original problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.00 c problem read
0.00/0.00 c presolving settings loaded
0.00/0.00 o 0
0.00/0.00 c feasible solution found by trivial heuristic, objective value 0.000000e+00
0.00/0.00 c presolving:
0.00/0.01 c (round 1) 305 del vars, 50 del conss, 0 add conss, 305 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1220 impls, 0 clqs
0.00/0.01 c (round 2) 305 del vars, 50 del conss, 0 add conss, 305 chg bounds, 0 chg sides, 0 chg coeffs, 305 upgd conss, 1830 impls, 0 clqs
0.00/0.01 c presolving (3 rounds):
0.00/0.01 c 305 deleted vars, 50 deleted constraints, 0 added constraints, 305 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 1830 implications, 0 cliques
0.00/0.01 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 305 constraints
0.00/0.01 c 305 constraints of type <logicor>
0.00/0.01 c transformed objective value is always integral (scale: 1)
0.00/0.01 c Presolving Time: 0.01
0.00/0.01 c - non default parameters ----------------------------------------------------------------------
0.00/0.01 c # SCIP version 2.0.1.4
0.00/0.01 c
0.00/0.01 c # maximal number of intermediate conflict constraints generated in conflict graph (-1: use every intermediate constraint)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01 c conflict/interconss = 0
0.00/0.01 c
0.00/0.01 c # should binary conflicts be preferred?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c conflict/preferbinary = TRUE
0.00/0.01 c
0.00/0.01 c # maximum age an unnecessary constraint can reach before it is deleted (0: dynamic, -1: keep all constraints)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01 c constraints/agelimit = 1
0.00/0.01 c
0.00/0.01 c # should enforcement of pseudo solution be disabled?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/disableenfops = TRUE
0.00/0.01 c
0.00/0.01 c # frequency for displaying node information lines
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01 c display/freq = 10000
0.00/0.01 c
0.00/0.01 c # maximal time in seconds to run
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/time = 1800
0.00/0.01 c
0.00/0.01 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01 c limits/memory = 13950
0.00/0.01 c
0.00/0.01 c # frequency for solving LP at the nodes (-1: never; 0: only root LP)
0.00/0.01 c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01 c lp/solvefreq = 0
0.00/0.01 c
0.00/0.01 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.01 c # [type: char, range: {lafpsqd}, default: l]
0.00/0.01 c lp/pricing = a
0.00/0.01 c
0.00/0.01 c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.01 c # [type: int, range: [1,2], default: 1]
0.00/0.01 c timing/clocktype = 2
0.00/0.01 c
0.00/0.01 c # belongs reading time to solving time?
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c timing/reading = TRUE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify inequalities
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/linear/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/indicator/addCouplingCons = TRUE
0.00/0.01 c
0.00/0.01 c # should presolving try to simplify knapsacks
0.00/0.01 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01 c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.01 c
0.00/0.01 c # priority of node selection rule <dfs> in standard mode
0.00/0.01 c # [type: int, range: [-536870912,536870911], default: 0]
0.00/0.01 c nodeselection/dfs/stdpriority = 1000000
0.00/0.01 c
0.00/0.01 c -----------------------------------------------------------------------------------------------
0.00/0.01 c start solving
0.00/0.01 c
0.00/0.02 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.02 c t 0.0s| 1 | 0 | 53 | - | 884k| 0 | 50 | 50 | 305 | 50 | 305 | 0 | 0 | 0 |-2.500000e+01 | 0.000000e+00 | 100.00%
0.00/0.02 o -1
0.00/0.02 c R 0.0s| 1 | 0 | 53 | - | 885k| 0 | 50 | 50 | 305 | 50 | 305 | 0 | 0 | 0 |-2.500000e+01 |-1.000000e+00 | 96.00%
0.00/0.02 o -2
0.00/0.02 c s 0.0s| 1 | 0 | 53 | - | 886k| 0 | 50 | 50 | 305 | 50 | 305 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.00/0.02 c 0.0s| 1 | 0 | 125 | - | 891k| 0 | 43 | 50 | 305 | 50 | 312 | 7 | 0 | 0 |-2.150000e+01 |-2.000000e+00 | 90.70%
0.00/0.02 o -8
0.00/0.02 c b 0.0s| 1 | 0 | 125 | - | 893k| 0 | 43 | 50 | 305 | 50 | 312 | 7 | 0 | 0 |-2.150000e+01 |-8.000000e+00 | 62.79%
0.00/0.03 c 0.0s| 1 | 0 | 169 | - | 896k| 0 | 38 | 50 | 305 | 50 | 319 | 14 | 0 | 0 |-1.900000e+01 |-8.000000e+00 | 57.89%
0.00/0.03 c 0.0s| 1 | 0 | 212 | - | 903k| 0 | 47 | 50 | 305 | 50 | 326 | 21 | 0 | 0 |-1.766667e+01 |-8.000000e+00 | 54.72%
0.00/0.04 c 0.0s| 1 | 0 | 264 | - | 912k| 0 | 37 | 50 | 305 | 50 | 332 | 27 | 0 | 0 |-1.675000e+01 |-8.000000e+00 | 52.24%
0.00/0.05 c 0.1s| 1 | 0 | 320 | - | 932k| 0 | 35 | 50 | 305 | 50 | 339 | 34 | 0 | 0 |-1.600000e+01 |-8.000000e+00 | 50.00%
0.00/0.06 c 0.1s| 1 | 0 | 389 | - | 954k| 0 | 44 | 50 | 305 | 50 | 346 | 41 | 0 | 0 |-1.577049e+01 |-8.000000e+00 | 49.27%
0.07/0.08 c 0.1s| 1 | 0 | 443 | - |1117k| 0 | 40 | 50 | 305 | 50 | 352 | 47 | 0 | 0 |-1.550000e+01 |-8.000000e+00 | 48.39%
0.07/0.09 c 0.1s| 1 | 0 | 472 | - |1208k| 0 | 46 | 50 | 305 | 50 | 359 | 54 | 0 | 0 |-1.500000e+01 |-8.000000e+00 | 46.67%
0.09/0.12 c 0.1s| 1 | 0 | 512 | - |1707k| 0 | 45 | 50 | 305 | 50 | 367 | 62 | 0 | 0 |-1.491304e+01 |-8.000000e+00 | 46.36%
0.09/0.14 c 0.1s| 1 | 0 | 527 | - |1865k| 0 | 44 | 50 | 305 | 50 | 374 | 69 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.09/0.16 c 0.2s| 1 | 0 | 545 | - |2220k| 0 | 48 | 50 | 305 | 50 | 137 | 79 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.09/0.16 c time | node | left |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr| dualbound | primalbound | gap
0.09/0.16 c 0.2s| 1 | 0 | 561 | - |2286k| 0 | 48 | 50 | 305 | 50 | 145 | 87 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.09/0.17 c 0.2s| 1 | 0 | 584 | - |2379k| 0 | 47 | 50 | 305 | 50 | 153 | 95 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.09/0.18 c 0.2s| 1 | 0 | 610 | - |2484k| 0 | 46 | 50 | 305 | 50 | 162 | 104 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.09/0.18 c 0.2s| 1 | 0 | 626 | - |2517k| 0 | 48 | 50 | 305 | 50 | 165 | 107 | 0 | 0 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.19/0.23 c 0.2s| 1 | 2 | 626 | - |2518k| 0 | 48 | 50 | 305 | 50 | 165 | 107 | 0 | 20 |-1.400000e+01 |-8.000000e+00 | 42.86%
0.19/0.23 o -10
0.19/0.23 c * 0.2s| 11 | 10 | 626 | 0.0 |2524k| 10 | - | 50 | 305 | 0 | 0 | 107 | 0 | 20 |-1.387113e+01 |-1.000000e+01 | 27.91%
0.19/0.23 o -11
0.19/0.23 c * 0.2s| 22 | 7 | 626 | 0.0 |2524k| 10 | - | 50 | 305 | 0 | 0 | 107 | 1 | 20 |-1.387113e+01 |-1.100000e+01 | 20.70%
0.19/0.23 o -12
0.19/0.23 c * 0.2s| 23 | 5 | 626 | 0.0 |2524k| 10 | - | 50 | 305 | 0 | 0 | 107 | 1 | 20 |-1.387113e+01 |-1.200000e+01 | 13.49%
0.49/0.53 c
0.49/0.53 c SCIP Status : problem is solved [optimal solution found]
0.49/0.53 c Solving Time (sec) : 0.53
0.49/0.53 c Solving Nodes : 7923
0.49/0.53 c Primal Bound : -1.20000000000000e+01 (7 solutions)
0.49/0.53 c Dual Bound : -1.20000000000000e+01
0.49/0.53 c Gap : 0.00 %
0.49/0.53 s OPTIMUM FOUND
0.49/0.53 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.53 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.53 c SCIP Status : problem is solved [optimal solution found]
0.49/0.53 c Total Time : 0.53
0.49/0.53 c solving : 0.53
0.49/0.53 c presolving : 0.01 (included in solving)
0.49/0.53 c reading : 0.00 (included in solving)
0.49/0.53 c Original Problem :
0.49/0.53 c Problem name : HOME/instance-3452311-1307106466.opb
0.49/0.53 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.53 c Constraints : 50 initial, 50 maximal
0.49/0.53 c Presolved Problem :
0.49/0.53 c Problem name : t_HOME/instance-3452311-1307106466.opb
0.49/0.53 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.53 c Constraints : 305 initial, 487 maximal
0.49/0.53 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.49/0.53 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.53 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.53 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.53 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.53 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.53 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.53 c and : 0.01 0 0 0 0 0 0 0 0 0
0.49/0.53 c linear : 0.00 305 0 0 305 0 50 0 0 0
0.49/0.53 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.49/0.53 c root node : - 50 - - 50 - - - - -
0.49/0.53 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.49/0.53 c integral : 0 0 0 1 0 9 0 0 0 0 0 2
0.49/0.53 c logicor : 305+ 15 10976 0 3 5 136563 2326 20755 0 0 0
0.49/0.53 c countsols : 0 0 0 0 3 6 0 0 0 0 0 0
0.49/0.53 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.49/0.53 c integral : 0.04 0.00 0.00 0.04 0.00 0.00 0.00
0.49/0.53 c logicor : 0.09 0.00 0.07 0.00 0.00 0.00 0.02
0.49/0.53 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.49/0.53 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.49/0.53 c vbounds : 0 0 0 0
0.49/0.53 c rootredcost : 3 0 0 0
0.49/0.53 c pseudoobj : 26883 4485 2187 22070
0.49/0.53 c Propagator Timings : TotalTime Propagate Resprop
0.49/0.53 c vbounds : 0.00 0.00 0.00
0.49/0.53 c rootredcost : 0.00 0.00 0.00
0.49/0.53 c pseudoobj : 0.09 0.08 0.01
0.49/0.53 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.49/0.53 c propagation : 0.06 4513 3639 3639 3.6 0 0.0 -
0.49/0.53 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.53 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.53 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.49/0.53 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.49/0.53 c applied globally : - - - 3639 3.6 - - -
0.49/0.53 c applied locally : - - - 0 0.0 - - -
0.49/0.53 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.49/0.53 c cut pool : 0.00 14 - - 141 - (maximal pool size: 1088)
0.49/0.53 c redcost : 0.00 15 0 0 0 0
0.49/0.53 c impliedbounds : 0.00 15 0 0 0 0
0.49/0.53 c intobj : 0.00 0 0 0 0 0
0.49/0.53 c gomory : 0.06 15 0 0 2850 0
0.49/0.53 c cgmip : 0.00 0 0 0 0 0
0.49/0.53 c closecuts : 0.00 0 0 0 0 0
0.49/0.53 c strongcg : 0.05 15 0 0 3054 0
0.49/0.53 c cmir : 0.01 10 0 0 0 0
0.49/0.53 c flowcover : 0.01 10 0 0 0 0
0.49/0.53 c clique : 0.00 15 0 0 111 0
0.49/0.53 c zerohalf : 0.00 0 0 0 0 0
0.49/0.53 c mcf : 0.00 1 0 0 0 0
0.49/0.53 c oddcycle : 0.00 0 0 0 0 0
0.49/0.53 c rapidlearning : 0.00 0 0 0 0 0
0.49/0.53 c Pricers : Time Calls Vars
0.49/0.53 c problem variables: 0.00 0 0
0.49/0.53 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.49/0.53 c relpscost : 0.04 1 0 0 0 0 2
0.49/0.53 c pscost : 0.00 0 0 0 0 0 0
0.49/0.53 c inference : 0.01 4578 0 0 0 0 9156
0.49/0.53 c mostinf : 0.00 0 0 0 0 0 0
0.49/0.53 c leastinf : 0.00 0 0 0 0 0 0
0.49/0.53 c fullstrong : 0.00 0 0 0 0 0 0
0.49/0.53 c allfullstrong : 0.00 0 0 0 0 0 0
0.49/0.53 c random : 0.00 0 0 0 0 0 0
0.49/0.53 c Primal Heuristics : Time Calls Found
0.49/0.53 c LP solutions : 0.00 - 0
0.49/0.53 c pseudo solutions : 0.00 - 3
0.49/0.53 c crossover : 0.00 0 0
0.49/0.53 c oneopt : 0.00 2 1
0.49/0.53 c trivial : 0.00 2 1
0.49/0.53 c shiftandpropagate: 0.00 0 0
0.49/0.53 c simplerounding : 0.00 16 0
0.49/0.53 c zirounding : 0.00 1 0
0.49/0.53 c rounding : 0.00 16 1
0.49/0.53 c shifting : 0.00 16 1
0.49/0.53 c intshifting : 0.00 0 0
0.49/0.53 c twoopt : 0.00 0 0
0.49/0.53 c fixandinfer : 0.00 0 0
0.49/0.53 c feaspump : 0.00 0 0
0.49/0.53 c clique : 0.00 0 0
0.49/0.53 c coefdiving : 0.00 0 0
0.49/0.53 c pscostdiving : 0.00 0 0
0.49/0.53 c fracdiving : 0.00 0 0
0.49/0.53 c veclendiving : 0.00 0 0
0.49/0.53 c intdiving : 0.00 0 0
0.49/0.53 c actconsdiving : 0.00 0 0
0.49/0.53 c objpscostdiving : 0.00 0 0
0.49/0.53 c rootsoldiving : 0.00 0 0
0.49/0.53 c linesearchdiving : 0.00 0 0
0.49/0.53 c guideddiving : 0.00 0 0
0.49/0.53 c octane : 0.00 0 0
0.49/0.53 c rens : 0.00 0 0
0.49/0.53 c rins : 0.00 0 0
0.49/0.53 c localbranching : 0.00 0 0
0.49/0.53 c mutation : 0.00 0 0
0.49/0.53 c dins : 0.00 0 0
0.49/0.53 c vbounds : 0.00 0 0
0.49/0.53 c undercover : 0.00 0 0
0.49/0.53 c subnlp : 0.00 0 0
0.49/0.53 c trysol : 0.00 0 0
0.49/0.53 c LP : Time Calls Iterations Iter/call Iter/sec
0.49/0.53 c primal LP : 0.00 0 0 0.00 -
0.49/0.53 c dual LP : 0.02 16 626 39.12 35746.92
0.49/0.53 c lex dual LP : 0.00 0 0 0.00 -
0.49/0.53 c barrier LP : 0.00 0 0 0.00 -
0.49/0.53 c diving/probing LP: 0.00 0 0 0.00 -
0.49/0.53 c strong branching : 0.04 20 1405 70.25 37255.06
0.49/0.53 c (at root node) : - 20 1405 70.25 -
0.49/0.53 c conflict analysis: 0.00 0 0 0.00 -
0.49/0.53 c B&B Tree :
0.49/0.53 c number of runs : 1
0.49/0.53 c nodes : 7923
0.49/0.53 c nodes (total) : 7923
0.49/0.53 c nodes left : 0
0.49/0.53 c max depth : 37
0.49/0.53 c max depth (total): 37
0.49/0.53 c backtracks : 1532 (19.3%)
0.49/0.53 c delayed cutoffs : 1235
0.49/0.53 c repropagations : 10851 (14921 domain reductions, 1172 cutoffs)
0.49/0.53 c avg switch length: 3.82
0.49/0.53 c switching time : 0.05
0.49/0.53 c Solution :
0.49/0.53 c Solutions found : 7 (7 improvements)
0.49/0.53 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.49/0.53 c Primal Bound : -1.20000000000000e+01 (in run 1, after 23 nodes, 0.23 seconds, depth 8, found by <relaxation>)
0.49/0.53 c Dual Bound : -1.20000000000000e+01
0.49/0.53 c Gap : 0.00 %
0.49/0.53 c Root Dual Bound : -1.40000000000000e+01
0.49/0.53 c Root Iterations : 626
0.49/0.53 c Time complete: 0.53.
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-3452311-1307106466/watcher-3452311-1307106466 -o /tmp/evaluation-result-3452311-1307106466/solver-3452311-1307106466 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3452311-1307106466.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: 1.92 2.00 1.99 2/373 10565
/proc/meminfo: memFree=22832980/32951124 swapFree=37148216/67111528
[pid=10565] ppid=10563 vsize=15884 CPUtime=0 cores=0,2,4,6
/proc/10565/stat : 10565 (scip-2.0.1.4.li) R 10563 10565 9067 0 -1 4202496 2979 0 0 0 0 0 0 0 18 0 1 0 822247061 16265216 2676 33554432000 4194304 9128323 140734268689440 18446744073709551615 18446744073699065897 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/10565/statm: 3971 2676 498 1205 0 2762 0
[startup+0.078542 s]
/proc/loadavg: 1.92 2.00 1.99 2/373 10565
/proc/meminfo: memFree=22832980/32951124 swapFree=37148216/67111528
[pid=10565] ppid=10563 vsize=19420 CPUtime=0.07 cores=0,2,4,6
/proc/10565/stat : 10565 (scip-2.0.1.4.li) R 10563 10565 9067 0 -1 4202496 4040 0 0 0 7 0 0 0 18 0 1 0 822247061 19886080 3732 33554432000 4194304 9128323 140734268689440 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/10565/statm: 4855 3732 667 1205 0 3646 0
Current children cumulated CPU time (s) 0.07
Current children cumulated vsize (KiB) 19420
[startup+0.100539 s]
/proc/loadavg: 1.92 2.00 1.99 2/373 10565
/proc/meminfo: memFree=22832980/32951124 swapFree=37148216/67111528
[pid=10565] ppid=10563 vsize=19968 CPUtime=0.09 cores=0,2,4,6
/proc/10565/stat : 10565 (scip-2.0.1.4.li) R 10563 10565 9067 0 -1 4202496 4123 0 0 0 9 0 0 0 18 0 1 0 822247061 20447232 3815 33554432000 4194304 9128323 140734268689440 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/10565/statm: 4992 3815 667 1205 0 3783 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 19968
[startup+0.300507 s]
/proc/loadavg: 1.92 2.00 1.99 2/373 10565
/proc/meminfo: memFree=22832980/32951124 swapFree=37148216/67111528
[pid=10565] ppid=10563 vsize=25456 CPUtime=0.29 cores=0,2,4,6
/proc/10565/stat : 10565 (scip-2.0.1.4.li) R 10563 10565 9067 0 -1 4202496 6163 0 0 0 29 0 0 0 18 0 1 0 822247061 26066944 5276 33554432000 4194304 9128323 140734268689440 18446744073709551615 4246584 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/10565/statm: 6364 5276 703 1205 0 5155 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 25456
Solver just ended. Dumping a history of the last processes samples
[startup+0.50047 s]
/proc/loadavg: 1.92 2.00 1.99 2/373 10565
/proc/meminfo: memFree=22832980/32951124 swapFree=37148216/67111528
[pid=10565] ppid=10563 vsize=25456 CPUtime=0.49 cores=0,2,4,6
/proc/10565/stat : 10565 (scip-2.0.1.4.li) R 10563 10565 9067 0 -1 4202496 6163 0 0 0 49 0 0 0 18 0 1 0 822247061 26066944 5276 33554432000 4194304 9128323 140734268689440 18446744073709551615 4742608 0 0 4096 16384 0 0 0 17 4 0 0 0
/proc/10565/statm: 6364 5276 703 1205 0 5155 0
Current children cumulated CPU time (s) 0.49
Current children cumulated vsize (KiB) 25456
Child status: 0
Real time (s): 0.539817
CPU time (s): 0.539917
CPU user time (s): 0.530919
CPU system time (s): 0.008998
CPU usage (%): 100.019
Max. virtual memory (cumulated for all children) (KiB): 25456
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.530919
system time used= 0.008998
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 6172
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= 1
runsolver used 0.005999 second user time and 0.008998 second system time
The end