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-3453298-1307093954.opb>
0.00/0.00 c original problem has 100 variables (100 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 100
0.00/0.00 c feasible solution found by trivial heuristic, objective value 1.000000e+02
0.00/0.00 c presolving:
0.00/0.00 c (round 1) 0 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 50 upgd conss, 0 impls, 0 clqs
0.00/0.01 c presolving (2 rounds):
0.00/0.01 c 0 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01 c 0 implications, 0 cliques
0.00/0.01 c presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 50 constraints
0.00/0.01 c 50 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.00
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.01 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.01 c t 0.0s| 1 | 0 | 190 | - | 509k| 0 | 39 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 2.893899e+00 | 1.000000e+02 |3355.55%
0.00/0.01 o 39
0.00/0.01 c r 0.0s| 1 | 0 | 190 | - | 512k| 0 | 39 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 2.893899e+00 | 3.900000e+01 |1247.66%
0.00/0.01 o 38
0.00/0.01 c R 0.0s| 1 | 0 | 190 | - | 514k| 0 | 39 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 2.893899e+00 | 3.800000e+01 |1213.11%
0.00/0.01 o 37
0.00/0.01 c s 0.0s| 1 | 0 | 190 | - | 517k| 0 | 39 | 100 | 50 | 100 | 50 | 0 | 0 | 0 | 2.893899e+00 | 3.700000e+01 |1178.55%
0.00/0.02 c 0.0s| 1 | 0 | 238 | - | 610k| 0 | 37 | 100 | 50 | 100 | 51 | 1 | 0 | 0 | 2.928411e+00 | 3.700000e+01 |1163.48%
0.00/0.02 o 7
0.00/0.02 c b 0.0s| 1 | 0 | 238 | - | 613k| 0 | 37 | 100 | 50 | 100 | 51 | 1 | 0 | 0 | 2.928411e+00 | 7.000000e+00 | 139.04%
0.00/0.02 c 0.0s| 1 | 0 | 267 | - | 693k| 0 | 34 | 100 | 50 | 100 | 52 | 2 | 0 | 0 | 2.954940e+00 | 7.000000e+00 | 136.89%
0.00/0.03 c 0.0s| 1 | 0 | 282 | - | 748k| 0 | 34 | 100 | 50 | 100 | 53 | 3 | 0 | 0 | 2.959985e+00 | 7.000000e+00 | 136.49%
0.00/0.03 c 0.0s| 1 | 0 | 309 | - | 761k| 0 | 32 | 100 | 50 | 100 | 54 | 4 | 0 | 0 | 2.970470e+00 | 7.000000e+00 | 135.65%
0.00/0.04 c 0.0s| 1 | 0 | 334 | - | 768k| 0 | 32 | 100 | 50 | 100 | 55 | 5 | 0 | 0 | 2.976270e+00 | 7.000000e+00 | 135.19%
0.09/0.10 o 4
0.09/0.10 c E 0.1s| 1 | 0 | 334 | - | 773k| 0 | 32 | 100 | 50 | 100 | 55 | 5 | 0 | 0 | 2.976270e+00 | 4.000000e+00 | 34.40%
0.09/0.11 c 0.1s| 1 | 0 | 334 | - | 773k| 0 | 32 | 100 | 50 | 100 | 55 | 5 | 0 | 0 | 2.976270e+00 | 4.000000e+00 | 34.40%
0.09/0.11 c 0.1s| 1 | 0 | 334 | - | 773k| 0 | 32 | 100 | 50 | 100 | 55 | 5 | 0 | 0 | 2.976270e+00 | 4.000000e+00 | 34.40%
0.09/0.12 c 0.1s| 1 | 0 | 334 | - | 773k| 0 | - | 100 | 50 | 100 | 55 | 5 | 0 | 5 | 2.976270e+00 | 4.000000e+00 | 34.40%
0.09/0.12 c (run 1, node 1) restarting after 57 global fixings of integer variables
0.09/0.12 c
0.09/0.12 c (restart) converted 5 cuts from the global cut pool into linear constraints
0.09/0.12 c
0.09/0.12 c presolving:
0.09/0.12 c (round 1) 57 del vars, 0 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 5 upgd conss, 0 impls, 0 clqs
0.09/0.12 c presolving (2 rounds):
0.09/0.12 c 57 deleted vars, 0 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.09/0.12 c 0 implications, 0 cliques
0.09/0.12 c presolved problem has 43 variables (43 bin, 0 int, 0 impl, 0 cont) and 55 constraints
0.09/0.12 c 5 constraints of type <knapsack>
0.09/0.12 c 50 constraints of type <logicor>
0.09/0.12 c transformed objective value is always integral (scale: 1)
0.09/0.12 c Presolving Time: 0.00
0.09/0.12 c
0.09/0.12 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.12 c 0.1s| 1 | 0 | 413 | - | 544k| 0 | - | 43 | 55 | 43 | 55 | 0 | 0 | 5 | 4.000000e+00 | 4.000000e+00 | 0.00%
0.09/0.12 c 0.1s| 1 | 0 | 413 | - | 544k| 0 | - | 43 | 55 | 43 | 55 | 0 | 0 | 5 | 4.000000e+00 | 4.000000e+00 | 0.00%
0.09/0.12 c
0.09/0.12 c SCIP Status : problem is solved [optimal solution found]
0.09/0.12 c Solving Time (sec) : 0.12
0.09/0.12 c Solving Nodes : 1 (total of 2 nodes in 2 runs)
0.09/0.12 c Primal Bound : +4.00000000000000e+00 (13 solutions)
0.09/0.12 c Dual Bound : +4.00000000000000e+00
0.09/0.12 c Gap : 0.00 %
0.09/0.12 s OPTIMUM FOUND
0.09/0.12 v -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 -x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 -x81 -x80 -x79 -x78 -x77 -x76 -x75
0.09/0.12 v -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 x63 -x62 -x61 -x60 -x59 -x58 -x57 -x56 -x55 -x54 -x53 -x52 -x51 -x50
0.09/0.12 v -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
0.09/0.12 v -x24 -x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 -x4 -x3 -x2 -x1
0.09/0.12 c SCIP Status : problem is solved [optimal solution found]
0.09/0.12 c Total Time : 0.12
0.09/0.12 c solving : 0.12
0.09/0.12 c presolving : 0.00 (included in solving)
0.09/0.12 c reading : 0.00 (included in solving)
0.09/0.12 c Original Problem :
0.09/0.12 c Problem name : HOME/instance-3453298-1307093954.opb
0.09/0.12 c Variables : 100 (100 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.12 c Constraints : 50 initial, 50 maximal
0.09/0.12 c Presolved Problem :
0.09/0.12 c Problem name : t_HOME/instance-3453298-1307093954.opb
0.09/0.12 c Variables : 43 (43 binary, 0 integer, 0 implicit integer, 0 continuous)
0.09/0.12 c Constraints : 55 initial, 55 maximal
0.09/0.12 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.09/0.12 c trivial : 0.00 57 0 0 0 0 0 0 0 0
0.09/0.12 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.12 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.12 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.12 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.12 c probing : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.12 c knapsack : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.12 c linear : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.12 c logicor : 0.00 0 0 0 0 0 0 0 0 0
0.09/0.12 c root node : - 57 - - 57 - - - - -
0.09/0.12 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.09/0.12 c integral : 0 0 0 1 0 18 0 0 5 0 0 0
0.09/0.12 c knapsack : 5 0 1 0 0 0 0 0 0 0 0 0
0.09/0.12 c logicor : 50 7 57 0 0 13 0 0 0 0 0 0
0.09/0.12 c countsols : 0 0 0 0 0 16 0 0 0 0 0 0
0.09/0.12 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.09/0.12 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.12 c knapsack : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.12 c logicor : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.12 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.09/0.12 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.09/0.12 c vbounds : 0 0 0 0
0.09/0.12 c rootredcost : 0 0 0 0
0.09/0.12 c pseudoobj : 10 0 0 0
0.09/0.12 c Propagator Timings : TotalTime Propagate Resprop
0.09/0.12 c vbounds : 0.00 0.00 0.00
0.09/0.12 c rootredcost : 0.00 0.00 0.00
0.09/0.12 c pseudoobj : 0.00 0.00 0.00
0.09/0.12 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.09/0.12 c propagation : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.12 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.12 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.12 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.09/0.12 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.09/0.12 c applied globally : - - - 0 0.0 - - -
0.09/0.12 c applied locally : - - - 0 0.0 - - -
0.09/0.12 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.09/0.12 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
0.09/0.12 c redcost : 0.00 7 0 52 0 0
0.09/0.12 c impliedbounds : 0.00 7 0 0 0 0
0.09/0.12 c intobj : 0.00 0 0 0 0 0
0.09/0.12 c gomory : 0.01 7 0 0 0 0
0.09/0.12 c cgmip : 0.00 0 0 0 0 0
0.09/0.12 c closecuts : 0.00 0 0 0 0 0
0.09/0.12 c strongcg : 0.01 7 0 0 74 0
0.09/0.12 c cmir : 0.01 7 0 0 0 0
0.09/0.12 c flowcover : 0.01 7 0 0 0 0
0.09/0.12 c clique : 0.00 1 0 0 0 0
0.09/0.12 c zerohalf : 0.00 0 0 0 0 0
0.09/0.12 c mcf : 0.00 1 0 0 0 0
0.09/0.12 c oddcycle : 0.00 0 0 0 0 0
0.09/0.12 c rapidlearning : 0.00 0 0 0 0 0
0.09/0.12 c Pricers : Time Calls Vars
0.09/0.12 c problem variables: 0.00 0 0
0.09/0.12 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.09/0.12 c relpscost : 0.00 1 0 5 0 0 0
0.09/0.12 c pscost : 0.00 0 0 0 0 0 0
0.09/0.12 c inference : 0.00 0 0 0 0 0 0
0.09/0.12 c mostinf : 0.00 0 0 0 0 0 0
0.09/0.12 c leastinf : 0.00 0 0 0 0 0 0
0.09/0.12 c fullstrong : 0.00 0 0 0 0 0 0
0.09/0.12 c allfullstrong : 0.00 0 0 0 0 0 0
0.09/0.12 c random : 0.00 0 0 0 0 0 0
0.09/0.12 c Primal Heuristics : Time Calls Found
0.09/0.12 c LP solutions : 0.00 - 0
0.09/0.12 c pseudo solutions : 0.00 - 0
0.09/0.12 c oneopt : 0.00 3 1
0.09/0.12 c trivial : 0.00 2 1
0.09/0.12 c shiftandpropagate: 0.00 0 0
0.09/0.12 c simplerounding : 0.00 6 6
0.09/0.12 c zirounding : 0.00 1 1
0.09/0.12 c rounding : 0.00 6 1
0.09/0.12 c shifting : 0.00 6 2
0.09/0.12 c intshifting : 0.00 0 0
0.09/0.12 c twoopt : 0.00 0 0
0.09/0.12 c fixandinfer : 0.00 0 0
0.09/0.12 c feaspump : 0.00 0 0
0.09/0.12 c clique : 0.00 0 0
0.09/0.12 c coefdiving : 0.00 0 0
0.09/0.12 c pscostdiving : 0.00 0 0
0.09/0.12 c fracdiving : 0.00 0 0
0.09/0.12 c veclendiving : 0.00 0 0
0.09/0.12 c intdiving : 0.00 0 0
0.09/0.12 c actconsdiving : 0.00 0 0
0.09/0.12 c objpscostdiving : 0.00 0 0
0.09/0.12 c rootsoldiving : 0.00 0 0
0.09/0.12 c linesearchdiving : 0.00 0 0
0.09/0.12 c guideddiving : 0.00 0 0
0.09/0.12 c octane : 0.00 0 0
0.09/0.12 c rens : 0.06 1 1
0.09/0.12 c rins : 0.00 0 0
0.09/0.12 c localbranching : 0.00 0 0
0.09/0.12 c mutation : 0.00 0 0
0.09/0.12 c crossover : 0.00 0 0
0.09/0.12 c dins : 0.00 0 0
0.09/0.12 c vbounds : 0.00 0 0
0.09/0.12 c undercover : 0.00 0 0
0.09/0.12 c subnlp : 0.00 0 0
0.09/0.12 c trysol : 0.00 0 0
0.09/0.12 c LP : Time Calls Iterations Iter/call Iter/sec
0.09/0.12 c primal LP : 0.00 0 0 0.00 -
0.09/0.12 c dual LP : 0.01 7 413 59.00 39299.65
0.09/0.12 c lex dual LP : 0.00 0 0 0.00 -
0.09/0.12 c barrier LP : 0.00 0 0 0.00 -
0.09/0.12 c diving/probing LP: 0.00 0 0 0.00 -
0.09/0.12 c strong branching : 0.00 5 122 24.40 -
0.09/0.12 c (at root node) : - 5 122 24.40 -
0.09/0.12 c conflict analysis: 0.00 0 0 0.00 -
0.09/0.12 c B&B Tree :
0.09/0.12 c number of runs : 2
0.09/0.12 c nodes : 1
0.09/0.12 c nodes (total) : 2
0.09/0.12 c nodes left : 0
0.09/0.12 c max depth : 0
0.09/0.12 c max depth (total): 0
0.09/0.12 c backtracks : 0 (0.0%)
0.09/0.12 c delayed cutoffs : 0
0.09/0.12 c repropagations : 0 (0 domain reductions, 0 cutoffs)
0.09/0.12 c avg switch length: 2.00
0.09/0.12 c switching time : 0.00
0.09/0.12 c Solution :
0.09/0.12 c Solutions found : 13 (6 improvements)
0.09/0.12 c First Solution : +1.00000000000000e+02 (in run 1, after 0 nodes, 0.00 seconds, depth 0, found by <trivial>)
0.09/0.12 c Primal Bound : +4.00000000000000e+00 (in run 1, after 1 nodes, 0.10 seconds, depth 0, found by <rens>)
0.09/0.12 c Dual Bound : +4.00000000000000e+00
0.09/0.12 c Gap : 0.00 %
0.09/0.12 c Root Dual Bound : +4.00000000000000e+00
0.09/0.12 c Root Iterations : 413
0.09/0.12 c Time complete: 0.12.
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-3453298-1307093954/watcher-3453298-1307093954 -o /tmp/evaluation-result-3453298-1307093954/solver-3453298-1307093954 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3453298-1307093954.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.09 2.06 2.01 2/464 5917
/proc/meminfo: memFree=30058572/32950928 swapFree=45617076/67111528
[pid=5917] ppid=5915 vsize=13920 CPUtime=0 cores=1,3,5,7
/proc/5917/stat : 5917 (scip-2.0.1.4.li) R 5915 5917 5789 0 -1 4202496 2292 0 0 0 0 0 0 0 25 0 1 0 820995159 14254080 2246 33554432000 4194304 9128323 140734927593728 18446744073709551615 8009021 0 0 4096 16384 0 0 0 17 3 0 0 0
/proc/5917/statm: 3480 2259 439 1205 0 2271 0
[startup+0.069493 s]
/proc/loadavg: 2.09 2.06 2.01 2/464 5917
/proc/meminfo: memFree=30058572/32950928 swapFree=45617076/67111528
[pid=5917] ppid=5915 vsize=28536 CPUtime=0.06 cores=1,3,5,7
/proc/5917/stat : 5917 (scip-2.0.1.4.li) R 5915 5917 5789 0 -1 4202496 5974 0 0 0 5 1 0 0 25 0 1 0 820995159 29220864 5667 33554432000 4194304 9128323 140734927593728 18446744073709551615 7340992 0 0 4096 16384 0 0 0 17 3 0 0 0
/proc/5917/statm: 7134 5671 684 1205 0 5925 0
Current children cumulated CPU time (s) 0.06
Current children cumulated vsize (KiB) 28536
[startup+0.100485 s]
/proc/loadavg: 2.09 2.06 2.01 2/464 5917
/proc/meminfo: memFree=30058572/32950928 swapFree=45617076/67111528
[pid=5917] ppid=5915 vsize=28536 CPUtime=0.09 cores=1,3,5,7
/proc/5917/stat : 5917 (scip-2.0.1.4.li) R 5915 5917 5789 0 -1 4202496 6012 0 0 0 8 1 0 0 25 0 1 0 820995159 29220864 5705 33554432000 4194304 9128323 140734927593728 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 3 0 0 0
/proc/5917/statm: 7134 5705 685 1205 0 5925 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 28536
Solver just ended. Dumping a history of the last processes samples
Child status: 0
Real time (s): 0.129266
CPU time (s): 0.128979
CPU user time (s): 0.105983
CPU system time (s): 0.022996
CPU usage (%): 99.778
Max. virtual memory (cumulated for all children) (KiB): 28536
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.105983
system time used= 0.022996
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 6043
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= 4
involuntary context switches= 1
runsolver used 0.003999 second user time and 0.012998 second system time
The end