0.29/0.35 c SCIP version 1.1.0.7
0.29/0.35 c LP-Solver SoPlex 1.4.1
0.29/0.35 c user parameter file <scip.set> not found - using default parameters
0.29/0.35 c read problem <HOME/instance-3739899-1338757264.opb>
0.29/0.35 c original problem has 17290 variables (17290 bin, 0 int, 0 impl, 0 cont) and 59721 constraints
0.39/0.45 c No objective function, only one solution is needed.
0.39/0.45 c start presolving problem
0.39/0.45 c presolving:
1.29/1.36 c presolving (1 rounds):
1.29/1.36 c 2252 deleted vars, 8001 deleted constraints, 2252 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.29/1.36 c 2548456 implications, 0 cliques
1.29/1.37 c presolving detected infeasibility
1.29/1.37 c Presolving Time: 0.88
1.29/1.37 c SATUNSAT-LIN
1.29/1.37 c -----------------------------------------------------------------------------------------------
1.29/1.37 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: 0]
1.29/1.37 c separating/flowcover/freq = c -1
1.29/1.37 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: 0]
1.29/1.37 c separating/cmir/freq = c -1
1.29/1.37 c # additional number of allowed LP iterations
1.29/1.37 c # [type: int, range: [0,2147483647], default: 1000]
1.29/1.37 c heuristics/veclendiving/maxlpiterofs = c 1500
1.29/1.37 c # maximal fraction of diving LP iterations compared to node LP iterations
1.29/1.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.29/1.37 c heuristics/veclendiving/maxlpiterquot = c 0.075
1.29/1.37 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: 10]
1.29/1.37 c heuristics/veclendiving/freq = c -1
1.29/1.37 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: 1]
1.29/1.37 c heuristics/simplerounding/freq = c -1
1.29/1.37 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: 10]
1.29/1.37 c heuristics/shifting/freq = c -1
1.29/1.37 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: 1]
1.29/1.37 c heuristics/rounding/freq = c -1
1.29/1.37 c # additional number of allowed LP iterations
1.29/1.37 c # [type: int, range: [0,2147483647], default: 1000]
1.29/1.37 c heuristics/rootsoldiving/maxlpiterofs = c 1500
1.29/1.37 c # maximal fraction of diving LP iterations compared to node LP iterations
1.29/1.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.29/1.37 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
1.29/1.37 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: 20]
1.29/1.37 c heuristics/rootsoldiving/freq = c -1
1.29/1.37 c # number of nodes added to the contingent of the total nodes
1.29/1.37 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.29/1.37 c heuristics/rens/nodesofs = c 2000
1.29/1.37 c # minimum percentage of integer variables that have to be fixable
1.29/1.37 c # [type: real, range: [0,1], default: 0.5]
1.29/1.37 c heuristics/rens/minfixingrate = c 0.3
1.29/1.37 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: 0]
1.29/1.37 c heuristics/rens/freq = c -1
1.29/1.37 c # additional number of allowed LP iterations
1.29/1.37 c # [type: int, range: [0,2147483647], default: 1000]
1.29/1.37 c heuristics/pscostdiving/maxlpiterofs = c 1500
1.29/1.37 c # maximal fraction of diving LP iterations compared to node LP iterations
1.29/1.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.29/1.37 c heuristics/pscostdiving/maxlpiterquot = c 0.075
1.29/1.37 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: 10]
1.29/1.37 c heuristics/pscostdiving/freq = c -1
1.29/1.37 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: 1]
1.29/1.37 c heuristics/oneopt/freq = c -1
1.29/1.37 c # additional number of allowed LP iterations
1.29/1.37 c # [type: int, range: [0,2147483647], default: 1000]
1.29/1.37 c heuristics/objpscostdiving/maxlpiterofs = c 1500
1.29/1.37 c # maximal fraction of diving LP iterations compared to total iteration number
1.29/1.37 c # [type: real, range: [0,1], default: 0.01]
1.29/1.37 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
1.29/1.37 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: 20]
1.29/1.37 c heuristics/objpscostdiving/freq = c -1
1.29/1.37 c # additional number of allowed LP iterations
1.29/1.37 c # [type: int, range: [0,2147483647], default: 1000]
1.29/1.37 c heuristics/linesearchdiving/maxlpiterofs = c 1500
1.29/1.37 c # maximal fraction of diving LP iterations compared to node LP iterations
1.29/1.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.29/1.37 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
1.29/1.37 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: 10]
1.29/1.37 c heuristics/linesearchdiving/freq = c -1
1.29/1.37 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: 10]
1.29/1.37 c heuristics/intshifting/freq = c -1
1.29/1.37 c # maximal fraction of diving LP iterations compared to node LP iterations
1.29/1.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.29/1.37 c heuristics/intdiving/maxlpiterquot = c 0.075
1.29/1.37 c # additional number of allowed LP iterations
1.29/1.37 c # [type: int, range: [0,2147483647], default: 1000]
1.29/1.37 c heuristics/guideddiving/maxlpiterofs = c 1500
1.29/1.37 c # maximal fraction of diving LP iterations compared to node LP iterations
1.29/1.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.29/1.37 c heuristics/guideddiving/maxlpiterquot = c 0.075
1.29/1.37 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: 10]
1.29/1.37 c heuristics/guideddiving/freq = c -1
1.29/1.37 c # additional number of allowed LP iterations
1.29/1.37 c # [type: int, range: [0,2147483647], default: 1000]
1.29/1.37 c heuristics/fracdiving/maxlpiterofs = c 1500
1.29/1.37 c # maximal fraction of diving LP iterations compared to node LP iterations
1.29/1.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.29/1.37 c heuristics/fracdiving/maxlpiterquot = c 0.075
1.29/1.37 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: 10]
1.29/1.37 c heuristics/fracdiving/freq = c -1
1.29/1.37 c # additional number of allowed LP iterations
1.29/1.37 c # [type: int, range: [0,2147483647], default: 1000]
1.29/1.37 c heuristics/feaspump/maxlpiterofs = c 2000
1.29/1.37 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: 20]
1.29/1.37 c heuristics/feaspump/freq = c -1
1.29/1.37 c # minimum percentage of integer variables that have to be fixed
1.29/1.37 c # [type: real, range: [0,1], default: 0.666]
1.29/1.37 c heuristics/crossover/minfixingrate = c 0.5
1.29/1.37 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.29/1.37 c # [type: real, range: [0,1], default: 0.1]
1.29/1.37 c heuristics/crossover/nodesquot = c 0.15
1.29/1.37 c # number of nodes without incumbent change that heuristic should wait
1.29/1.37 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.29/1.37 c heuristics/crossover/nwaitingnodes = c 100
1.29/1.37 c # number of nodes added to the contingent of the total nodes
1.29/1.37 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.29/1.37 c heuristics/crossover/nodesofs = c 750
1.29/1.37 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: 30]
1.29/1.37 c heuristics/crossover/freq = c -1
1.29/1.37 c # additional number of allowed LP iterations
1.29/1.37 c # [type: int, range: [0,2147483647], default: 1000]
1.29/1.37 c heuristics/coefdiving/maxlpiterofs = c 1500
1.29/1.37 c # maximal fraction of diving LP iterations compared to node LP iterations
1.29/1.37 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.29/1.37 c heuristics/coefdiving/maxlpiterquot = c 0.075
1.29/1.37 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: 10]
1.29/1.37 c heuristics/coefdiving/freq = c -1
1.29/1.37 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: -1]
1.29/1.37 c presolving/probing/maxrounds = c 0
1.29/1.37 c # should presolving try to simplify knapsacks
1.29/1.37 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.29/1.37 c constraints/knapsack/simplifyinequalities = c TRUE
1.29/1.37 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.29/1.37 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.29/1.37 c constraints/knapsack/disaggregation = c FALSE
1.29/1.37 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: -1]
1.29/1.37 c constraints/knapsack/maxnumcardlift = c 0
1.29/1.37 c # should presolving try to simplify inequalities
1.29/1.37 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.29/1.37 c constraints/linear/simplifyinequalities = c TRUE
1.29/1.37 c # maximal number of separation rounds in the root node (-1: unlimited)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: -1]
1.29/1.37 c separating/maxroundsroot = c 5
1.29/1.37 c # maximal number of separation rounds per node (-1: unlimited)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: 5]
1.29/1.37 c separating/maxrounds = c 1
1.29/1.37 c # solving stops, if the given number of solutions were found (-1: no limit)
1.29/1.37 c # [type: int, range: [-1,2147483647], default: -1]
1.29/1.37 c limits/solutions = c 1
1.29/1.37 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.29/1.37 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.29/1.37 c limits/memory = c 13950
1.29/1.37 c # maximal time in seconds to run
1.29/1.37 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.29/1.37 c limits/time = c 1791
1.29/1.37 c # frequency for displaying node information lines
1.29/1.37 c # [type: int, range: [-1,2147483647], default: 100]
1.29/1.37 c display/freq = c 10000
1.29/1.37 c -----------------------------------------------------------------------------------------------
1.29/1.37 c start solving problem
1.29/1.37 c
1.29/1.37 c SCIP Status : problem is solved [infeasible]
1.29/1.37 c Solving Time (sec) : 0.94
1.29/1.37 c Solving Nodes : 0
1.29/1.37 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1.29/1.37 c Dual Bound : -1.00000000000000e+20
1.29/1.37 c Gap : infinite
1.29/1.37 c NODE 0
1.29/1.37 c DUAL BOUND -1e+20
1.29/1.37 c PRIMAL BOUND 1e+20
1.29/1.37 c GAP 1e+20
1.29/1.37 s UNSATISFIABLE
1.29/1.37 c SCIP Status : problem is solved [infeasible]
1.29/1.37 c Solving Time : 0.94
1.29/1.37 c Original Problem :
1.29/1.37 c Problem name : HOME/instance-3739899-1338757264.opb
1.29/1.37 c Variables : 17290 (17290 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.37 c Constraints : 59721 initial, 59721 maximal
1.29/1.37 c Presolved Problem :
1.29/1.37 c Problem name : t_HOME/instance-3739899-1338757264.opb
1.29/1.37 c Variables : 15038 (15038 binary, 0 integer, 0 implicit integer, 0 continuous)
1.29/1.37 c Constraints : 51720 initial, 51720 maximal
1.29/1.37 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.29/1.37 c trivial : 0.00 0 0 0 0 0 0 0 0
1.29/1.37 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.29/1.37 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.29/1.37 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.29/1.37 c implics : 0.00 0 0 0 0 0 0 0 0
1.29/1.37 c probing : 0.00 0 0 0 0 0 0 0 0
1.29/1.37 c linear : 0.84 2252 0 0 2252 0 8001 0 0
1.29/1.37 c root node : - 0 - - 0 - - - -
1.29/1.37 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.29/1.37 c integral : 0 0 0 0 0 0 0 0 0 0
1.29/1.37 c linear : 51720 0 0 0 0 0 0 0 0 0
1.29/1.37 c countsols : 0 0 0 0 0 0 0 0 0 0
1.29/1.37 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.29/1.37 c integral : 0.00 0.00 0.00 0.00 0.00
1.29/1.37 c linear : 0.00 0.00 0.00 0.00 0.00
1.29/1.37 c countsols : 0.00 0.00 0.00 0.00 0.00
1.29/1.37 c Propagators : Time Calls Cutoffs DomReds
1.29/1.37 c pseudoobj : 0.00 0 0 0
1.29/1.37 c rootredcost : 0.00 0 0 0
1.29/1.37 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.29/1.37 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.37 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.37 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.37 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.29/1.37 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.29/1.37 c applied globally : - - - 0 0.0 - - -
1.29/1.37 c applied locally : - - - 0 0.0 - - -
1.29/1.37 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.29/1.37 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.29/1.37 c redcost : 0.00 0 0 0 0 0
1.29/1.37 c impliedbounds : 0.00 0 0 0 0 0
1.29/1.37 c intobj : 0.00 0 0 0 0 0
1.29/1.37 c gomory : 0.00 0 0 0 0 0
1.29/1.37 c strongcg : 0.00 0 0 0 0 0
1.29/1.37 c cmir : 0.00 0 0 0 0 0
1.29/1.37 c flowcover : 0.00 0 0 0 0 0
1.29/1.37 c clique : 0.00 0 0 0 0 0
1.29/1.37 c zerohalf : 0.00 0 0 0 0 0
1.29/1.37 c mcf : 0.00 0 0 0 0 0
1.29/1.37 c Pricers : Time Calls Vars
1.29/1.37 c problem variables: 0.00 0 0
1.29/1.37 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.29/1.37 c pscost : 0.00 0 0 0 0 0 0
1.29/1.37 c inference : 0.00 0 0 0 0 0 0
1.29/1.37 c mostinf : 0.00 0 0 0 0 0 0
1.29/1.37 c leastinf : 0.00 0 0 0 0 0 0
1.29/1.37 c fullstrong : 0.00 0 0 0 0 0 0
1.29/1.37 c allfullstrong : 0.00 0 0 0 0 0 0
1.29/1.37 c random : 0.00 0 0 0 0 0 0
1.29/1.37 c relpscost : 0.00 0 0 0 0 0 0
1.29/1.37 c Primal Heuristics : Time Calls Found
1.29/1.37 c LP solutions : 0.00 - 0
1.29/1.37 c pseudo solutions : 0.00 - 0
1.29/1.37 c simplerounding : 0.00 0 0
1.29/1.37 c rounding : 0.00 0 0
1.29/1.37 c shifting : 0.00 0 0
1.29/1.37 c intshifting : 0.00 0 0
1.29/1.37 c oneopt : 0.00 0 0
1.29/1.37 c fixandinfer : 0.00 0 0
1.29/1.37 c feaspump : 0.00 0 0
1.29/1.37 c coefdiving : 0.00 0 0
1.29/1.37 c pscostdiving : 0.00 0 0
1.29/1.37 c fracdiving : 0.00 0 0
1.29/1.37 c veclendiving : 0.00 0 0
1.29/1.37 c intdiving : 0.00 0 0
1.29/1.37 c actconsdiving : 0.00 0 0
1.29/1.37 c objpscostdiving : 0.00 0 0
1.29/1.37 c rootsoldiving : 0.00 0 0
1.29/1.37 c linesearchdiving : 0.00 0 0
1.29/1.37 c guideddiving : 0.00 0 0
1.29/1.37 c octane : 0.00 0 0
1.29/1.37 c rens : 0.00 0 0
1.29/1.37 c rins : 0.00 0 0
1.29/1.37 c localbranching : 0.00 0 0
1.29/1.37 c mutation : 0.00 0 0
1.29/1.37 c crossover : 0.00 0 0
1.29/1.37 c dins : 0.00 0 0
1.29/1.37 c LP : Time Calls Iterations Iter/call Iter/sec
1.29/1.37 c primal LP : 0.00 0 0 0.00 -
1.29/1.37 c dual LP : 0.00 0 0 0.00 -
1.29/1.37 c barrier LP : 0.00 0 0 0.00 -
1.29/1.37 c diving/probing LP: 0.00 0 0 0.00 -
1.29/1.37 c strong branching : 0.00 0 0 0.00 -
1.29/1.37 c (at root node) : - 0 0 0.00 -
1.29/1.37 c conflict analysis: 0.00 0 0 0.00 -
1.29/1.37 c B&B Tree :
1.29/1.37 c number of runs : 1
1.29/1.37 c nodes : 0
1.29/1.37 c nodes (total) : 0
1.29/1.37 c nodes left : 1
1.29/1.37 c max depth : -1
1.29/1.37 c max depth (total): -1
1.29/1.37 c backtracks : 0 (0.0%)
1.29/1.37 c delayed cutoffs : 0
1.29/1.37 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.29/1.37 c avg switch length: 0.00
1.29/1.37 c switching time : 0.00
1.29/1.37 c Solution :
1.29/1.37 c Solutions found : 0 (0 improvements)
1.29/1.37 c Primal Bound : infeasible
1.29/1.37 c Dual Bound : -
1.29/1.37 c Gap : infinite
1.29/1.37 c Root Dual Bound : -
1.39/1.46 c Time complete: 1.45.
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-3739899-1338757264/watcher-3739899-1338757264 -o /tmp/evaluation-result-3739899-1338757264/solver-3739899-1338757264 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 15500 -f HOME/instance-3739899-1338757264.opb
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.00 2.00 2.00 3/177 13097
/proc/meminfo: memFree=25021224/32873648 swapFree=6852/6852
[pid=13097] ppid=13095 vsize=8836 CPUtime=0 cores=1,3,5,7
/proc/13097/stat : 13097 (pbscip.linux.x8) R 13095 13097 12217 0 -1 4202496 1554 0 0 0 0 0 0 0 20 0 1 0 341853663 9048064 1507 33554432000 4194304 7823515 140734613031328 140733863127656 5878822 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/13097/statm: 2209 1521 351 887 0 1319 0
[startup+0.0303789 s]
/proc/loadavg: 2.00 2.00 2.00 3/177 13097
/proc/meminfo: memFree=25021224/32873648 swapFree=6852/6852
[pid=13097] ppid=13095 vsize=15000 CPUtime=0.02 cores=1,3,5,7
/proc/13097/stat : 13097 (pbscip.linux.x8) R 13095 13097 12217 0 -1 4202496 3086 0 0 0 2 0 0 0 20 0 1 0 341853663 15360000 3038 33554432000 4194304 7823515 140734613031328 140733863127656 5878822 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/13097/statm: 3750 3038 351 887 0 2860 0
Current children cumulated CPU time (s) 0.02
Current children cumulated vsize (KiB) 15000
[startup+0.100296 s]
/proc/loadavg: 2.00 2.00 2.00 3/177 13097
/proc/meminfo: memFree=25021224/32873648 swapFree=6852/6852
[pid=13097] ppid=13095 vsize=22308 CPUtime=0.08 cores=1,3,5,7
/proc/13097/stat : 13097 (pbscip.linux.x8) R 13095 13097 12217 0 -1 4202496 4911 0 0 0 8 0 0 0 20 0 1 0 341853663 22843392 4863 33554432000 4194304 7823515 140734613031328 140734612897432 6908047 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/13097/statm: 5577 4863 351 887 0 4687 0
Current children cumulated CPU time (s) 0.08
Current children cumulated vsize (KiB) 22308
[startup+0.300258 s]
/proc/loadavg: 2.00 2.00 2.00 3/177 13097
/proc/meminfo: memFree=25021224/32873648 swapFree=6852/6852
[pid=13097] ppid=13095 vsize=38696 CPUtime=0.29 cores=1,3,5,7
/proc/13097/stat : 13097 (pbscip.linux.x8) R 13095 13097 12217 0 -1 4202496 9005 0 0 0 28 1 0 0 20 0 1 0 341853663 39624704 8957 33554432000 4194304 7823515 140734613031328 140734612897432 6908091 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/13097/statm: 9674 8957 351 887 0 8784 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 38696
[startup+0.700264 s]
/proc/loadavg: 2.00 2.00 2.00 3/177 13097
/proc/meminfo: memFree=25021224/32873648 swapFree=6852/6852
[pid=13097] ppid=13095 vsize=129732 CPUtime=0.69 cores=1,3,5,7
/proc/13097/stat : 13097 (pbscip.linux.x8) R 13095 13097 12217 0 -1 4202496 31812 0 0 0 64 5 0 0 20 0 1 0 341853663 132845568 31410 33554432000 4194304 7823515 140734613031328 140734612897432 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/13097/statm: 32433 31410 427 887 0 31543 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 129732
Solver just ended. Dumping a history of the last processes samples
[startup+1.10668 s]
/proc/loadavg: 2.00 2.00 2.00 3/178 13098
/proc/meminfo: memFree=24868416/32873648 swapFree=6852/6852
[pid=13097] ppid=13095 vsize=165092 CPUtime=1.1 cores=1,3,5,7
/proc/13097/stat : 13097 (pbscip.linux.x8) R 13095 13097 12217 0 -1 4202496 40615 0 0 0 103 7 0 0 20 0 1 0 341853663 169054208 40213 33554432000 4194304 7823515 140734613031328 140734613028264 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/13097/statm: 41273 40213 427 887 0 40383 0
Current children cumulated CPU time (s) 1.1
Current children cumulated vsize (KiB) 165092
[startup+1.30028 s]
/proc/loadavg: 2.00 2.00 2.00 3/178 13098
/proc/meminfo: memFree=24868416/32873648 swapFree=6852/6852
[pid=13097] ppid=13095 vsize=177484 CPUtime=1.29 cores=1,3,5,7
/proc/13097/stat : 13097 (pbscip.linux.x8) R 13095 13097 12217 0 -1 4202496 43555 0 0 0 121 8 0 0 20 0 1 0 341853663 181743616 43153 33554432000 4194304 7823515 140734613031328 140734613028264 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/13097/statm: 44371 43153 427 887 0 43481 0
Current children cumulated CPU time (s) 1.29
Current children cumulated vsize (KiB) 177484
[startup+1.40028 s]
/proc/loadavg: 2.00 2.00 2.00 3/178 13098
/proc/meminfo: memFree=24868416/32873648 swapFree=6852/6852
[pid=13097] ppid=13095 vsize=181204 CPUtime=1.39 cores=1,3,5,7
/proc/13097/stat : 13097 (pbscip.linux.x8) R 13095 13097 12217 0 -1 4202496 44416 0 0 0 131 8 0 0 20 0 1 0 341853663 185552896 44014 33554432000 4194304 7823515 140734613031328 140734613028264 4205905 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/13097/statm: 45301 44014 462 887 0 44411 0
Current children cumulated CPU time (s) 1.39
Current children cumulated vsize (KiB) 181204
Child status: 0
Real time (s): 1.46102
CPU time (s): 1.45978
CPU user time (s): 1.36579
CPU system time (s): 0.093985
CPU usage (%): 99.9152
Max. virtual memory (cumulated for all children) (KiB): 181204
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 1.36579
system time used= 0.093985
maximum resident set size= 176060
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 44424
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= 3
runsolver used 0.003999 second user time and 0.008998 second system time
The end