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-3452340-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) 738 del vars, 50 del conss, 0 add conss, 738 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2952 impls, 0 clqs
0.00/0.04 c (round 2) 738 del vars, 50 del conss, 0 add conss, 738 chg bounds, 0 chg sides, 0 chg coeffs, 738 upgd conss, 4428 impls, 0 clqs
0.00/0.05 c presolving (3 rounds):
0.00/0.05 c 738 deleted vars, 50 deleted constraints, 0 added constraints, 738 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.05 c 4428 implications, 0 cliques
0.00/0.05 c presolved problem has 50 variables (50 bin, 0 int, 0 impl, 0 cont) and 738 constraints
0.00/0.05 c 738 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 | 51 | - |1735k| 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.1s| 1 | 0 | 51 | - |1736k| 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.1s| 1 | 0 | 51 | - |1736k| 0 | 50 | 50 | 738 | 50 | 738 | 0 | 0 | 0 |-2.500000e+01 |-2.000000e+00 | 92.00%
0.00/0.06 c 0.1s| 1 | 0 | 103 | - |1743k| 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.1s| 1 | 0 | 103 | - |1745k| 0 | 33 | 50 | 738 | 50 | 743 | 5 | 0 | 0 |-1.650000e+01 |-4.000000e+00 | 75.76%
0.00/0.08 c 0.1s| 1 | 0 | 176 | - |1751k| 0 | 26 | 50 | 738 | 50 | 748 | 10 | 0 | 0 |-1.300000e+01 |-4.000000e+00 | 69.23%
0.00/0.09 c 0.1s| 1 | 0 | 211 | - |1759k| 0 | 24 | 50 | 738 | 50 | 758 | 20 | 0 | 0 |-1.200000e+01 |-4.000000e+00 | 66.67%
0.09/0.11 c 0.1s| 1 | 0 | 285 | - |1772k| 0 | 27 | 50 | 738 | 50 | 765 | 27 | 0 | 0 |-1.050000e+01 |-4.000000e+00 | 61.90%
0.09/0.13 c 0.1s| 1 | 0 | 344 | - |1783k| 0 | 23 | 50 | 738 | 50 | 771 | 33 | 0 | 0 |-9.750000e+00 |-4.000000e+00 | 58.97%
0.09/0.15 c 0.1s| 1 | 0 | 360 | - |1794k| 0 | 24 | 50 | 738 | 50 | 777 | 39 | 0 | 0 |-9.000000e+00 |-4.000000e+00 | 55.56%
0.09/0.17 c 0.2s| 1 | 0 | 407 | - |1818k| 0 | 34 | 50 | 738 | 50 | 783 | 45 | 0 | 0 |-8.851485e+00 |-4.000000e+00 | 54.81%
0.18/0.21 c 0.2s| 1 | 0 | 478 | - |2108k| 0 | 36 | 50 | 738 | 50 | 791 | 53 | 0 | 0 |-8.368047e+00 |-4.000000e+00 | 52.20%
0.18/0.25 c 0.3s| 1 | 0 | 537 | - |2422k| 0 | 36 | 50 | 738 | 50 | 797 | 59 | 0 | 0 |-8.093220e+00 |-4.000000e+00 | 50.58%
0.29/0.30 c 0.3s| 1 | 0 | 568 | - |3043k| 0 | 31 | 50 | 738 | 50 | 804 | 66 | 0 | 0 |-8.025837e+00 |-4.000000e+00 | 50.16%
0.29/0.34 c 0.3s| 1 | 0 | 608 | - |3228k| 0 | 39 | 50 | 738 | 50 | 115 | 73 | 0 | 0 |-7.778846e+00 |-4.000000e+00 | 48.58%
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 | 624 | - |3532k| 0 | 44 | 50 | 738 | 50 | 123 | 81 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.29/0.36 c 0.4s| 1 | 0 | 640 | - |3726k| 0 | 46 | 50 | 738 | 50 | 132 | 90 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.29/0.37 c 0.4s| 1 | 0 | 656 | - |3936k| 0 | 46 | 50 | 738 | 50 | 139 | 97 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.29/0.37 c 0.4s| 1 | 0 | 690 | - |4165k| 0 | 46 | 50 | 738 | 50 | 146 | 104 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.29/0.38 c 0.4s| 1 | 0 | 716 | - |4401k| 0 | 48 | 50 | 738 | 50 | 154 | 112 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.29/0.39 c 0.4s| 1 | 0 | 742 | - |4612k| 0 | 49 | 50 | 738 | 50 | 117 | 117 | 0 | 0 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.49/0.57 c 0.6s| 1 | 2 | 742 | - |4613k| 0 | 49 | 50 | 738 | 50 | 117 | 117 | 0 | 42 |-7.000000e+00 |-4.000000e+00 | 42.86%
0.49/0.58 o -5
0.49/0.58 c * 0.6s| 30 | 1 | 742 | 0.0 |4618k| 10 | - | 50 | 738 | 0 | 0 | 117 | 0 | 42 |-7.000000e+00 |-5.000000e+00 | 28.57%
0.49/0.58 o -6
0.49/0.58 c * 0.6s| 61 | 3 | 742 | 0.0 |4575k| 12 | - | 50 | 676 | 0 | 0 | 117 | 15 | 42 |-7.000000e+00 |-6.000000e+00 | 14.29%
0.59/0.61 c
0.59/0.61 c SCIP Status : problem is solved [optimal solution found]
0.59/0.61 c Solving Time (sec) : 0.61
0.59/0.61 c Solving Nodes : 616
0.59/0.61 c Primal Bound : -6.00000000000000e+00 (8 solutions)
0.59/0.61 c Dual Bound : -6.00000000000000e+00
0.59/0.61 c Gap : 0.00 %
0.59/0.61 s OPTIMUM FOUND
0.59/0.61 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.59/0.61 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.59/0.61 c SCIP Status : problem is solved [optimal solution found]
0.59/0.61 c Total Time : 0.61
0.59/0.61 c solving : 0.61
0.59/0.61 c presolving : 0.04 (included in solving)
0.59/0.61 c reading : 0.00 (included in solving)
0.59/0.61 c Original Problem :
0.59/0.61 c Problem name : HOME/instance-3452340-1307108198.opb
0.59/0.61 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
0.59/0.61 c Constraints : 50 initial, 50 maximal
0.59/0.61 c Presolved Problem :
0.59/0.61 c Problem name : t_HOME/instance-3452340-1307108198.opb
0.59/0.61 c Variables : 50 (50 binary, 0 integer, 0 implicit integer, 0 continuous)
0.59/0.61 c Constraints : 738 initial, 753 maximal
0.59/0.61 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
0.59/0.61 c trivial : 0.00 0 0 0 0 0 0 0 0 0
0.59/0.61 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
0.59/0.61 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
0.59/0.61 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
0.59/0.61 c implics : 0.00 0 0 0 0 0 0 0 0 0
0.59/0.61 c probing : 0.01 0 0 0 0 0 0 0 0 0
0.59/0.61 c and : 0.02 0 0 0 0 0 0 0 0 0
0.59/0.61 c linear : 0.00 738 0 0 738 0 50 0 0 0
0.59/0.61 c logicor : 0.01 0 0 0 0 0 0 0 0 0
0.59/0.61 c root node : - 50 - - 50 - - - - -
0.59/0.61 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
0.59/0.61 c integral : 0 0 0 1 0 10 0 0 0 0 0 2
0.59/0.61 c logicor : 738+ 17 867 0 2 6 11147 124 2684 0 0 0
0.59/0.61 c countsols : 0 0 0 0 2 8 0 0 0 0 0 0
0.59/0.61 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
0.59/0.61 c integral : 0.17 0.00 0.00 0.17 0.00 0.00 0.00
0.59/0.61 c logicor : 0.01 0.00 0.01 0.00 0.00 0.00 0.00
0.59/0.61 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
0.59/0.61 c Propagators : #Propagate #Resprop Cutoffs DomReds
0.59/0.61 c vbounds : 0 0 0 0
0.59/0.61 c rootredcost : 2 0 0 0
0.59/0.61 c pseudoobj : 3170 244 220 634
0.59/0.61 c Propagator Timings : TotalTime Propagate Resprop
0.59/0.61 c vbounds : 0.00 0.00 0.00
0.59/0.61 c rootredcost : 0.00 0.00 0.00
0.59/0.61 c pseudoobj : 0.01 0.01 0.00
0.59/0.61 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
0.59/0.61 c propagation : 0.00 344 330 330 2.2 0 0.0 -
0.59/0.61 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
0.59/0.61 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
0.59/0.61 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
0.59/0.61 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
0.59/0.61 c applied globally : - - - 330 2.2 - - -
0.59/0.61 c applied locally : - - - 0 0.0 - - -
0.59/0.61 c Separators : Time Calls Cutoffs DomReds Cuts Conss
0.59/0.61 c cut pool : 0.00 16 - - 362 - (maximal pool size: 1724)
0.59/0.61 c redcost : 0.00 17 0 0 0 0
0.59/0.61 c impliedbounds : 0.00 17 0 0 0 0
0.59/0.61 c intobj : 0.00 0 0 0 0 0
0.59/0.61 c gomory : 0.14 17 0 0 3879 0
0.59/0.61 c cgmip : 0.00 0 0 0 0 0
0.59/0.61 c closecuts : 0.00 0 0 0 0 0
0.59/0.61 c strongcg : 0.12 17 0 0 5115 0
0.59/0.61 c cmir : 0.01 10 0 0 0 0
0.59/0.61 c flowcover : 0.02 10 0 0 0 0
0.59/0.61 c clique : 0.01 17 0 0 147 0
0.59/0.61 c zerohalf : 0.00 0 0 0 0 0
0.59/0.61 c mcf : 0.00 1 0 0 0 0
0.59/0.61 c oddcycle : 0.00 0 0 0 0 0
0.59/0.61 c rapidlearning : 0.00 0 0 0 0 0
0.59/0.61 c Pricers : Time Calls Vars
0.59/0.61 c problem variables: 0.00 0 0
0.59/0.61 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
0.59/0.61 c relpscost : 0.17 1 0 0 0 0 2
0.59/0.61 c pscost : 0.00 0 0 0 0 0 0
0.59/0.61 c inference : 0.00 347 0 0 0 0 694
0.59/0.61 c mostinf : 0.00 0 0 0 0 0 0
0.59/0.61 c leastinf : 0.00 0 0 0 0 0 0
0.59/0.61 c fullstrong : 0.00 0 0 0 0 0 0
0.59/0.61 c allfullstrong : 0.00 0 0 0 0 0 0
0.59/0.61 c random : 0.00 0 0 0 0 0 0
0.59/0.61 c Primal Heuristics : Time Calls Found
0.59/0.61 c LP solutions : 0.00 - 0
0.59/0.61 c pseudo solutions : 0.00 - 2
0.59/0.61 c crossover : 0.00 0 0
0.59/0.61 c oneopt : 0.00 2 1
0.59/0.61 c trivial : 0.00 2 1
0.59/0.61 c shiftandpropagate: 0.00 0 0
0.59/0.61 c simplerounding : 0.00 18 0
0.59/0.61 c zirounding : 0.00 1 1
0.59/0.61 c rounding : 0.00 18 1
0.59/0.61 c shifting : 0.00 18 2
0.59/0.61 c intshifting : 0.00 0 0
0.59/0.61 c twoopt : 0.00 0 0
0.59/0.61 c fixandinfer : 0.00 0 0
0.59/0.61 c feaspump : 0.00 0 0
0.59/0.61 c clique : 0.00 0 0
0.59/0.61 c coefdiving : 0.00 0 0
0.59/0.61 c pscostdiving : 0.00 0 0
0.59/0.61 c fracdiving : 0.00 0 0
0.59/0.61 c veclendiving : 0.00 0 0
0.59/0.61 c intdiving : 0.00 0 0
0.59/0.61 c actconsdiving : 0.00 0 0
0.59/0.61 c objpscostdiving : 0.00 0 0
0.59/0.61 c rootsoldiving : 0.00 0 0
0.59/0.61 c linesearchdiving : 0.00 0 0
0.59/0.61 c guideddiving : 0.00 0 0
0.59/0.61 c octane : 0.00 0 0
0.59/0.61 c rens : 0.01 0 0
0.59/0.61 c rins : 0.00 0 0
0.59/0.61 c localbranching : 0.00 0 0
0.59/0.61 c mutation : 0.00 0 0
0.59/0.61 c dins : 0.00 0 0
0.59/0.61 c vbounds : 0.00 0 0
0.59/0.61 c undercover : 0.00 0 0
0.59/0.61 c subnlp : 0.00 0 0
0.59/0.61 c trysol : 0.00 0 0
0.59/0.61 c LP : Time Calls Iterations Iter/call Iter/sec
0.59/0.61 c primal LP : 0.00 0 0 0.00 -
0.59/0.61 c dual LP : 0.03 18 742 41.22 22751.66
0.59/0.61 c lex dual LP : 0.00 0 0 0.00 -
0.59/0.61 c barrier LP : 0.00 0 0 0.00 -
0.59/0.61 c diving/probing LP: 0.00 0 0 0.00 -
0.59/0.61 c strong branching : 0.17 42 5099 121.40 29368.23
0.59/0.61 c (at root node) : - 42 5099 121.40 -
0.59/0.61 c conflict analysis: 0.00 0 0 0.00 -
0.59/0.61 c B&B Tree :
0.59/0.61 c number of runs : 1
0.59/0.61 c nodes : 616
0.59/0.61 c nodes (total) : 616
0.59/0.61 c nodes left : 0
0.59/0.61 c max depth : 43
0.59/0.61 c max depth (total): 43
0.59/0.61 c backtracks : 82 (13.3%)
0.59/0.61 c delayed cutoffs : 78
0.59/0.61 c repropagations : 1863 (740 domain reductions, 78 cutoffs)
0.59/0.61 c avg switch length: 6.98
0.59/0.61 c switching time : 0.01
0.59/0.61 c Solution :
0.59/0.61 c Solutions found : 8 (6 improvements)
0.59/0.61 c First Solution : +0.00000000000000e+00 (in run 1, after 0 nodes, 0.01 seconds, depth 0, found by <trivial>)
0.59/0.61 c Primal Bound : -6.00000000000000e+00 (in run 1, after 61 nodes, 0.58 seconds, depth 6, found by <relaxation>)
0.59/0.61 c Dual Bound : -6.00000000000000e+00
0.59/0.61 c Gap : 0.00 %
0.59/0.61 c Root Dual Bound : -6.99999999999999e+00
0.59/0.61 c Root Iterations : 742
0.59/0.62 c Time complete: 0.6.
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-3452340-1307108198/watcher-3452340-1307108198 -o /tmp/evaluation-result-3452340-1307108198/solver-3452340-1307108198 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4.linux.x86_64.gnu.opt.spx -f HOME/instance-3452340-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 32293
/proc/meminfo: memFree=16658984/32951124 swapFree=67111204/67111528
[pid=32293] ppid=32290 vsize=17024 CPUtime=0.01 cores=0,2,4,6
/proc/32293/stat : 32293 (scip-2.0.1.4.li) R 32290 32293 30576 0 -1 4202496 3273 0 0 0 1 0 0 0 25 0 1 0 803235973 17432576 2968 33554432000 4194304 9128323 140734192167392 18446744073709551615 4708563 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/32293/statm: 4256 2968 498 1205 0 3047 0
[startup+0.107182 s]
/proc/loadavg: 2.00 2.01 2.00 3/511 32293
/proc/meminfo: memFree=16658984/32951124 swapFree=67111204/67111528
[pid=32293] ppid=32290 vsize=20544 CPUtime=0.09 cores=0,2,4,6
/proc/32293/stat : 32293 (scip-2.0.1.4.li) R 32290 32293 30576 0 -1 4202496 4363 0 0 0 9 0 0 0 25 0 1 0 803235973 21037056 4055 33554432000 4194304 9128323 140734192167392 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/32293/statm: 5136 4055 666 1205 0 3927 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 20544
[startup+0.201165 s]
/proc/loadavg: 2.00 2.01 2.00 3/511 32293
/proc/meminfo: memFree=16658984/32951124 swapFree=67111204/67111528
[pid=32293] ppid=32290 vsize=22500 CPUtime=0.18 cores=0,2,4,6
/proc/32293/stat : 32293 (scip-2.0.1.4.li) R 32290 32293 30576 0 -1 4202496 4825 0 0 0 18 0 0 0 25 0 1 0 803235973 23040000 4517 33554432000 4194304 9128323 140734192167392 18446744073709551615 8054618 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/32293/statm: 5625 4517 668 1205 0 4416 0
Current children cumulated CPU time (s) 0.18
Current children cumulated vsize (KiB) 22500
[startup+0.301191 s]
/proc/loadavg: 2.00 2.01 2.00 3/511 32293
/proc/meminfo: memFree=16658984/32951124 swapFree=67111204/67111528
[pid=32293] ppid=32290 vsize=29512 CPUtime=0.29 cores=0,2,4,6
/proc/32293/stat : 32293 (scip-2.0.1.4.li) R 32290 32293 30576 0 -1 4202496 6611 0 0 0 28 1 0 0 25 0 1 0 803235973 30220288 6297 33554432000 4194304 9128323 140734192167392 18446744073709551615 6298648 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/32293/statm: 7378 6297 688 1205 0 6169 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 29512
Solver just ended. Dumping a history of the last processes samples
[startup+0.401128 s]
/proc/loadavg: 2.00 2.01 2.00 3/511 32293
/proc/meminfo: memFree=16658984/32951124 swapFree=67111204/67111528
[pid=32293] ppid=32290 vsize=30536 CPUtime=0.38 cores=0,2,4,6
/proc/32293/stat : 32293 (scip-2.0.1.4.li) R 32290 32293 30576 0 -1 4202496 6849 0 0 0 37 1 0 0 25 0 1 0 803235973 31268864 6520 33554432000 4194304 9128323 140734192167392 18446744073709551615 4338848 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/32293/statm: 7634 6547 676 1205 0 6425 0
Current children cumulated CPU time (s) 0.38
Current children cumulated vsize (KiB) 30536
[startup+0.601094 s]
/proc/loadavg: 2.00 2.01 2.00 3/511 32293
/proc/meminfo: memFree=16658984/32951124 swapFree=67111204/67111528
[pid=32293] ppid=32290 vsize=29512 CPUtime=0.59 cores=0,2,4,6
/proc/32293/stat : 32293 (scip-2.0.1.4.li) R 32290 32293 30576 0 -1 4202496 7454 0 0 0 57 2 0 0 25 0 1 0 803235973 30220288 6374 33554432000 4194304 9128323 140734192167392 18446744073709551615 4241440 0 0 4096 16384 0 0 0 17 0 0 0 0
/proc/32293/statm: 7378 6374 704 1205 0 6169 0
Current children cumulated CPU time (s) 0.59
Current children cumulated vsize (KiB) 29512
Child status: 0
Real time (s): 0.620559
CPU time (s): 0.618905
CPU user time (s): 0.58991
CPU system time (s): 0.028995
CPU usage (%): 99.7335
Max. virtual memory (cumulated for all children) (KiB): 30536
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.58991
system time used= 0.028995
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 7463
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= 2
runsolver used 0.005999 second user time and 0.013997 second system time
The end