0.48/0.57 c SCIP version 1.1.0.7
0.48/0.57 c LP-Solver SoPlex 1.4.1
0.48/0.57 c user parameter file <scip.set> not found - using default parameters
0.48/0.57 c read problem <HOME/instance-3739743-1338757168.opb>
0.48/0.57 c original problem has 26136 variables (26136 bin, 0 int, 0 impl, 0 cont) and 90585 constraints
0.68/0.72 c No objective function, only one solution is needed.
0.68/0.72 c start presolving problem
0.68/0.72 c presolving:
2.18/2.21 c presolving (1 rounds):
2.18/2.21 c 3335 deleted vars, 11366 deleted constraints, 3335 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.18/2.21 c 4038656 implications, 0 cliques
2.18/2.22 c presolving detected infeasibility
2.18/2.22 c Presolving Time: 1.43
2.18/2.22 c SATUNSAT-LIN
2.18/2.22 c -----------------------------------------------------------------------------------------------
2.18/2.22 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: 0]
2.18/2.22 c separating/flowcover/freq = c -1
2.18/2.22 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: 0]
2.18/2.22 c separating/cmir/freq = c -1
2.18/2.22 c # additional number of allowed LP iterations
2.18/2.22 c # [type: int, range: [0,2147483647], default: 1000]
2.18/2.22 c heuristics/veclendiving/maxlpiterofs = c 1500
2.18/2.22 c # maximal fraction of diving LP iterations compared to node LP iterations
2.18/2.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.18/2.22 c heuristics/veclendiving/maxlpiterquot = c 0.075
2.18/2.22 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: 10]
2.18/2.22 c heuristics/veclendiving/freq = c -1
2.18/2.22 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: 1]
2.18/2.22 c heuristics/simplerounding/freq = c -1
2.18/2.22 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: 10]
2.18/2.22 c heuristics/shifting/freq = c -1
2.18/2.22 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: 1]
2.18/2.22 c heuristics/rounding/freq = c -1
2.18/2.22 c # additional number of allowed LP iterations
2.18/2.22 c # [type: int, range: [0,2147483647], default: 1000]
2.18/2.22 c heuristics/rootsoldiving/maxlpiterofs = c 1500
2.18/2.22 c # maximal fraction of diving LP iterations compared to node LP iterations
2.18/2.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.18/2.22 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
2.18/2.22 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: 20]
2.18/2.22 c heuristics/rootsoldiving/freq = c -1
2.18/2.22 c # number of nodes added to the contingent of the total nodes
2.18/2.22 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.18/2.22 c heuristics/rens/nodesofs = c 2000
2.18/2.22 c # minimum percentage of integer variables that have to be fixable
2.18/2.22 c # [type: real, range: [0,1], default: 0.5]
2.18/2.22 c heuristics/rens/minfixingrate = c 0.3
2.18/2.22 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: 0]
2.18/2.22 c heuristics/rens/freq = c -1
2.18/2.22 c # additional number of allowed LP iterations
2.18/2.22 c # [type: int, range: [0,2147483647], default: 1000]
2.18/2.22 c heuristics/pscostdiving/maxlpiterofs = c 1500
2.18/2.22 c # maximal fraction of diving LP iterations compared to node LP iterations
2.18/2.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.18/2.22 c heuristics/pscostdiving/maxlpiterquot = c 0.075
2.18/2.22 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: 10]
2.18/2.22 c heuristics/pscostdiving/freq = c -1
2.18/2.22 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: 1]
2.18/2.22 c heuristics/oneopt/freq = c -1
2.18/2.22 c # additional number of allowed LP iterations
2.18/2.22 c # [type: int, range: [0,2147483647], default: 1000]
2.18/2.22 c heuristics/objpscostdiving/maxlpiterofs = c 1500
2.18/2.22 c # maximal fraction of diving LP iterations compared to total iteration number
2.18/2.22 c # [type: real, range: [0,1], default: 0.01]
2.18/2.22 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
2.18/2.22 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: 20]
2.18/2.22 c heuristics/objpscostdiving/freq = c -1
2.18/2.22 c # additional number of allowed LP iterations
2.18/2.22 c # [type: int, range: [0,2147483647], default: 1000]
2.18/2.22 c heuristics/linesearchdiving/maxlpiterofs = c 1500
2.18/2.22 c # maximal fraction of diving LP iterations compared to node LP iterations
2.18/2.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.18/2.22 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
2.18/2.22 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: 10]
2.18/2.22 c heuristics/linesearchdiving/freq = c -1
2.18/2.22 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: 10]
2.18/2.22 c heuristics/intshifting/freq = c -1
2.18/2.22 c # maximal fraction of diving LP iterations compared to node LP iterations
2.18/2.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.18/2.22 c heuristics/intdiving/maxlpiterquot = c 0.075
2.18/2.22 c # additional number of allowed LP iterations
2.18/2.22 c # [type: int, range: [0,2147483647], default: 1000]
2.18/2.22 c heuristics/guideddiving/maxlpiterofs = c 1500
2.18/2.22 c # maximal fraction of diving LP iterations compared to node LP iterations
2.18/2.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.18/2.22 c heuristics/guideddiving/maxlpiterquot = c 0.075
2.18/2.22 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: 10]
2.18/2.22 c heuristics/guideddiving/freq = c -1
2.18/2.22 c # additional number of allowed LP iterations
2.18/2.22 c # [type: int, range: [0,2147483647], default: 1000]
2.18/2.22 c heuristics/fracdiving/maxlpiterofs = c 1500
2.18/2.22 c # maximal fraction of diving LP iterations compared to node LP iterations
2.18/2.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.18/2.22 c heuristics/fracdiving/maxlpiterquot = c 0.075
2.18/2.22 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: 10]
2.18/2.22 c heuristics/fracdiving/freq = c -1
2.18/2.22 c # additional number of allowed LP iterations
2.18/2.22 c # [type: int, range: [0,2147483647], default: 1000]
2.18/2.22 c heuristics/feaspump/maxlpiterofs = c 2000
2.18/2.22 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: 20]
2.18/2.22 c heuristics/feaspump/freq = c -1
2.18/2.22 c # minimum percentage of integer variables that have to be fixed
2.18/2.22 c # [type: real, range: [0,1], default: 0.666]
2.18/2.22 c heuristics/crossover/minfixingrate = c 0.5
2.18/2.22 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.18/2.22 c # [type: real, range: [0,1], default: 0.1]
2.18/2.22 c heuristics/crossover/nodesquot = c 0.15
2.18/2.22 c # number of nodes without incumbent change that heuristic should wait
2.18/2.22 c # [type: longint, range: [0,9223372036854775807], default: 200]
2.18/2.22 c heuristics/crossover/nwaitingnodes = c 100
2.18/2.22 c # number of nodes added to the contingent of the total nodes
2.18/2.22 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.18/2.22 c heuristics/crossover/nodesofs = c 750
2.18/2.22 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: 30]
2.18/2.22 c heuristics/crossover/freq = c -1
2.18/2.22 c # additional number of allowed LP iterations
2.18/2.22 c # [type: int, range: [0,2147483647], default: 1000]
2.18/2.22 c heuristics/coefdiving/maxlpiterofs = c 1500
2.18/2.22 c # maximal fraction of diving LP iterations compared to node LP iterations
2.18/2.22 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.18/2.22 c heuristics/coefdiving/maxlpiterquot = c 0.075
2.18/2.22 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: 10]
2.18/2.22 c heuristics/coefdiving/freq = c -1
2.18/2.22 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: -1]
2.18/2.22 c presolving/probing/maxrounds = c 0
2.18/2.22 c # should presolving try to simplify knapsacks
2.18/2.22 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.18/2.22 c constraints/knapsack/simplifyinequalities = c TRUE
2.18/2.22 c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.18/2.22 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.18/2.22 c constraints/knapsack/disaggregation = c FALSE
2.18/2.22 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: -1]
2.18/2.22 c constraints/knapsack/maxnumcardlift = c 0
2.18/2.22 c # should presolving try to simplify inequalities
2.18/2.22 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.18/2.22 c constraints/linear/simplifyinequalities = c TRUE
2.18/2.22 c # maximal number of separation rounds in the root node (-1: unlimited)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: -1]
2.18/2.22 c separating/maxroundsroot = c 5
2.18/2.22 c # maximal number of separation rounds per node (-1: unlimited)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: 5]
2.18/2.22 c separating/maxrounds = c 1
2.18/2.22 c # solving stops, if the given number of solutions were found (-1: no limit)
2.18/2.22 c # [type: int, range: [-1,2147483647], default: -1]
2.18/2.22 c limits/solutions = c 1
2.18/2.22 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.18/2.22 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.18/2.22 c limits/memory = c 13950
2.18/2.22 c # maximal time in seconds to run
2.18/2.22 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.18/2.22 c limits/time = c 1791
2.18/2.22 c # frequency for displaying node information lines
2.18/2.22 c # [type: int, range: [-1,2147483647], default: 100]
2.18/2.22 c display/freq = c 10000
2.18/2.22 c -----------------------------------------------------------------------------------------------
2.18/2.22 c start solving problem
2.18/2.22 c
2.18/2.22 c SCIP Status : problem is solved [infeasible]
2.18/2.22 c Solving Time (sec) : 1.52
2.18/2.22 c Solving Nodes : 0
2.18/2.22 c Primal Bound : +1.00000000000000e+20 (0 solutions)
2.18/2.22 c Dual Bound : -1.00000000000000e+20
2.18/2.22 c Gap : infinite
2.18/2.22 c NODE 0
2.18/2.22 c DUAL BOUND -1e+20
2.18/2.22 c PRIMAL BOUND 1e+20
2.18/2.22 c GAP 1e+20
2.18/2.22 s UNSATISFIABLE
2.18/2.22 c SCIP Status : problem is solved [infeasible]
2.18/2.22 c Solving Time : 1.52
2.18/2.22 c Original Problem :
2.18/2.22 c Problem name : HOME/instance-3739743-1338757168.opb
2.18/2.22 c Variables : 26136 (26136 binary, 0 integer, 0 implicit integer, 0 continuous)
2.18/2.22 c Constraints : 90585 initial, 90585 maximal
2.18/2.22 c Presolved Problem :
2.18/2.22 c Problem name : t_HOME/instance-3739743-1338757168.opb
2.18/2.22 c Variables : 22801 (22801 binary, 0 integer, 0 implicit integer, 0 continuous)
2.18/2.22 c Constraints : 79219 initial, 79219 maximal
2.18/2.22 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.18/2.22 c trivial : 0.00 0 0 0 0 0 0 0 0
2.18/2.22 c dualfix : 0.01 0 0 0 0 0 0 0 0
2.18/2.22 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.18/2.22 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.18/2.22 c implics : 0.00 0 0 0 0 0 0 0 0
2.18/2.22 c probing : 0.00 0 0 0 0 0 0 0 0
2.18/2.22 c linear : 1.37 3335 0 0 3335 0 11366 0 0
2.18/2.22 c root node : - 0 - - 0 - - - -
2.18/2.22 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.18/2.22 c integral : 0 0 0 0 0 0 0 0 0 0
2.18/2.22 c linear : 79219 0 0 0 0 0 0 0 0 0
2.18/2.22 c countsols : 0 0 0 0 0 0 0 0 0 0
2.18/2.22 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.18/2.22 c integral : 0.00 0.00 0.00 0.00 0.00
2.18/2.22 c linear : 0.00 0.00 0.00 0.00 0.00
2.18/2.22 c countsols : 0.00 0.00 0.00 0.00 0.00
2.18/2.22 c Propagators : Time Calls Cutoffs DomReds
2.18/2.22 c pseudoobj : 0.00 0 0 0
2.18/2.22 c rootredcost : 0.00 0 0 0
2.18/2.22 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.18/2.22 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.18/2.22 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.18/2.22 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.18/2.22 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.18/2.22 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.18/2.22 c applied globally : - - - 0 0.0 - - -
2.18/2.22 c applied locally : - - - 0 0.0 - - -
2.18/2.22 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.18/2.22 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
2.18/2.22 c redcost : 0.00 0 0 0 0 0
2.18/2.22 c impliedbounds : 0.00 0 0 0 0 0
2.18/2.22 c intobj : 0.00 0 0 0 0 0
2.18/2.22 c gomory : 0.00 0 0 0 0 0
2.18/2.22 c strongcg : 0.00 0 0 0 0 0
2.18/2.22 c cmir : 0.00 0 0 0 0 0
2.18/2.22 c flowcover : 0.00 0 0 0 0 0
2.18/2.22 c clique : 0.00 0 0 0 0 0
2.18/2.22 c zerohalf : 0.00 0 0 0 0 0
2.18/2.22 c mcf : 0.00 0 0 0 0 0
2.18/2.22 c Pricers : Time Calls Vars
2.18/2.22 c problem variables: 0.00 0 0
2.18/2.22 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.18/2.22 c pscost : 0.00 0 0 0 0 0 0
2.18/2.22 c inference : 0.00 0 0 0 0 0 0
2.18/2.22 c mostinf : 0.00 0 0 0 0 0 0
2.18/2.22 c leastinf : 0.00 0 0 0 0 0 0
2.18/2.22 c fullstrong : 0.00 0 0 0 0 0 0
2.18/2.22 c allfullstrong : 0.00 0 0 0 0 0 0
2.18/2.22 c random : 0.00 0 0 0 0 0 0
2.18/2.22 c relpscost : 0.00 0 0 0 0 0 0
2.18/2.22 c Primal Heuristics : Time Calls Found
2.18/2.22 c LP solutions : 0.00 - 0
2.18/2.22 c pseudo solutions : 0.00 - 0
2.18/2.22 c simplerounding : 0.00 0 0
2.18/2.22 c rounding : 0.00 0 0
2.18/2.22 c shifting : 0.00 0 0
2.18/2.22 c intshifting : 0.00 0 0
2.18/2.22 c oneopt : 0.00 0 0
2.18/2.22 c fixandinfer : 0.00 0 0
2.18/2.22 c feaspump : 0.00 0 0
2.18/2.22 c coefdiving : 0.00 0 0
2.18/2.22 c pscostdiving : 0.00 0 0
2.18/2.22 c fracdiving : 0.00 0 0
2.18/2.22 c veclendiving : 0.00 0 0
2.18/2.22 c intdiving : 0.00 0 0
2.18/2.22 c actconsdiving : 0.00 0 0
2.18/2.22 c objpscostdiving : 0.00 0 0
2.18/2.22 c rootsoldiving : 0.00 0 0
2.18/2.22 c linesearchdiving : 0.00 0 0
2.18/2.22 c guideddiving : 0.00 0 0
2.18/2.22 c octane : 0.00 0 0
2.18/2.22 c rens : 0.00 0 0
2.18/2.22 c rins : 0.00 0 0
2.18/2.22 c localbranching : 0.00 0 0
2.18/2.22 c mutation : 0.00 0 0
2.18/2.22 c crossover : 0.00 0 0
2.18/2.22 c dins : 0.00 0 0
2.18/2.22 c LP : Time Calls Iterations Iter/call Iter/sec
2.18/2.22 c primal LP : 0.00 0 0 0.00 -
2.18/2.22 c dual LP : 0.00 0 0 0.00 -
2.18/2.22 c barrier LP : 0.00 0 0 0.00 -
2.18/2.22 c diving/probing LP: 0.00 0 0 0.00 -
2.18/2.22 c strong branching : 0.00 0 0 0.00 -
2.18/2.22 c (at root node) : - 0 0 0.00 -
2.18/2.22 c conflict analysis: 0.00 0 0 0.00 -
2.18/2.22 c B&B Tree :
2.18/2.22 c number of runs : 1
2.18/2.22 c nodes : 0
2.18/2.22 c nodes (total) : 0
2.18/2.22 c nodes left : 1
2.18/2.22 c max depth : -1
2.18/2.22 c max depth (total): -1
2.18/2.22 c backtracks : 0 (0.0%)
2.18/2.22 c delayed cutoffs : 0
2.18/2.22 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.18/2.22 c avg switch length: 0.00
2.18/2.22 c switching time : 0.00
2.18/2.22 c Solution :
2.18/2.22 c Solutions found : 0 (0 improvements)
2.18/2.22 c Primal Bound : infeasible
2.18/2.22 c Dual Bound : -
2.18/2.22 c Gap : infinite
2.18/2.22 c Root Dual Bound : -
2.29/2.36 c Time complete: 2.34.
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-3739743-1338757168/watcher-3739743-1338757168 -o /tmp/evaluation-result-3739743-1338757168/solver-3739743-1338757168 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 15500 -f HOME/instance-3739743-1338757168.opb
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 3/176 28328
/proc/meminfo: memFree=27591840/32873844 swapFree=7108/7108
[pid=28328] ppid=28326 vsize=11812 CPUtime=0 cores=0,2,4,6
/proc/28328/stat : 28328 (runsolver) D 28326 28328 26990 0 -1 4202560 41 0 0 0 0 0 0 0 20 0 1 0 341841368 12095488 51 33554432000 4194304 5436572 140736859333776 140736859330072 4883175 0 0 4096 24578 18446744071579943789 0 0 17 0 0 0 0 0 0
/proc/28328/statm: 2953 51 31 304 0 2645 0
[startup+0.068775 s]
/proc/loadavg: 2.00 2.00 2.00 3/176 28328
/proc/meminfo: memFree=27591840/32873844 swapFree=7108/7108
[pid=28328] ppid=28326 vsize=19844 CPUtime=0.05 cores=0,2,4,6
/proc/28328/stat : 28328 (pbscip.linux.x8) R 28326 28328 26990 0 -1 4202496 4294 0 0 0 5 0 0 0 20 0 1 0 341841368 20320256 4247 33554432000 4194304 7823515 140734047804704 140734047669320 6957168 0 0 4096 0 0 0 0 17 2 0 0 0 0 0
/proc/28328/statm: 4961 4247 351 887 0 4071 0
Current children cumulated CPU time (s) 0.05
Current children cumulated vsize (KiB) 19844
[startup+0.100311 s]
/proc/loadavg: 2.00 2.00 2.00 3/176 28328
/proc/meminfo: memFree=27591840/32873844 swapFree=7108/7108
[pid=28328] ppid=28326 vsize=24420 CPUtime=0.08 cores=0,2,4,6
/proc/28328/stat : 28328 (pbscip.linux.x8) R 28326 28328 26990 0 -1 4202496 5436 0 0 0 8 0 0 0 20 0 1 0 341841368 25006080 5389 33554432000 4194304 7823515 140734047804704 140734047669320 6957168 0 0 4096 0 0 0 0 17 2 0 0 0 0 0
/proc/28328/statm: 6105 5389 351 887 0 5215 0
Current children cumulated CPU time (s) 0.08
Current children cumulated vsize (KiB) 24420
[startup+0.30026 s]
/proc/loadavg: 2.00 2.00 2.00 3/176 28328
/proc/meminfo: memFree=27591840/32873844 swapFree=7108/7108
[pid=28328] ppid=28326 vsize=37496 CPUtime=0.29 cores=0,2,4,6
/proc/28328/stat : 28328 (pbscip.linux.x8) R 28326 28328 26990 0 -1 4202496 8700 0 0 0 28 1 0 0 20 0 1 0 341841368 38395904 8653 33554432000 4194304 7823515 140734047804704 140734047669320 6794336 0 0 4096 0 0 0 0 17 2 0 0 0 0 0
/proc/28328/statm: 9374 8653 351 887 0 8484 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 37496
[startup+0.700275 s]
/proc/loadavg: 2.00 2.00 2.00 3/176 28328
/proc/meminfo: memFree=27591840/32873844 swapFree=7108/7108
[pid=28328] ppid=28326 vsize=133388 CPUtime=0.68 cores=0,2,4,6
/proc/28328/stat : 28328 (pbscip.linux.x8) R 28326 28328 26990 0 -1 4202496 32942 0 0 0 63 5 0 0 20 0 1 0 341841368 136589312 32541 33554432000 4194304 7823515 140734047804704 140734047669320 4690080 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/28328/statm: 33347 32543 385 887 0 32457 0
Current children cumulated CPU time (s) 0.68
Current children cumulated vsize (KiB) 133388
[startup+1.50027 s]
/proc/loadavg: 2.00 2.00 2.00 3/177 28329
/proc/meminfo: memFree=27423672/32873844 swapFree=7108/7108
[pid=28328] ppid=28326 vsize=221992 CPUtime=1.49 cores=0,2,4,6
/proc/28328/stat : 28328 (pbscip.linux.x8) R 28326 28328 26990 0 -1 4202496 54728 0 0 0 138 11 0 0 20 0 1 0 341841368 227319808 54327 33554432000 4194304 7823515 140734047804704 140734047801640 6954986 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/28328/statm: 55498 54327 427 887 0 54608 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 221992
Solver just ended. Dumping a history of the last processes samples
[startup+1.90028 s]
/proc/loadavg: 2.00 2.00 2.00 3/177 28329
/proc/meminfo: memFree=27423672/32873844 swapFree=7108/7108
[pid=28328] ppid=28326 vsize=242508 CPUtime=1.88 cores=0,2,4,6
/proc/28328/stat : 28328 (pbscip.linux.x8) R 28326 28328 26990 0 -1 4202496 59820 0 0 0 175 13 0 0 20 0 1 0 341841368 248328192 59419 33554432000 4194304 7823515 140734047804704 140734047801640 6954986 0 0 4096 16384 0 0 0 17 2 0 0 0 0 0
/proc/28328/statm: 60627 59419 427 887 0 59737 0
Current children cumulated CPU time (s) 1.88
Current children cumulated vsize (KiB) 242508
[startup+2.30028 s]
/proc/loadavg: 2.00 2.00 2.00 3/177 28329
/proc/meminfo: memFree=27342204/32873844 swapFree=7108/7108
[pid=28328] ppid=28326 vsize=259880 CPUtime=2.29 cores=0,2,4,6
/proc/28328/stat : 28328 (pbscip.linux.x8) R 28326 28328 26990 0 -1 4202496 63604 0 0 0 214 15 0 0 20 0 1 0 341841368 266117120 63203 33554432000 4194304 7823515 140734047804704 140734047801640 4813567 0 0 4096 0 0 0 0 17 2 0 0 0 0 0
/proc/28328/statm: 64970 63203 462 887 0 64080 0
Current children cumulated CPU time (s) 2.29
Current children cumulated vsize (KiB) 259880
Child status: 0
Real time (s): 2.36079
CPU time (s): 2.35364
CPU user time (s): 2.18567
CPU system time (s): 0.167974
CPU usage (%): 99.6974
Max. virtual memory (cumulated for all children) (KiB): 259880
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 2.18567
system time used= 0.167974
maximum resident set size= 252816
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 63612
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= 5
runsolver used 0.004999 second user time and 0.013997 second system time
The end