0.29/0.33 c SCIP version 1.1.0.7
0.29/0.33 c LP-Solver SoPlex 1.4.1
0.29/0.33 c user parameter file <scip.set> not found - using default parameters
0.29/0.33 c read problem <HOME/instance-3739665-1338756732.opb>
0.29/0.33 c original problem has 17424 variables (17424 bin, 0 int, 0 impl, 0 cont) and 54466 constraints
0.39/0.43 c No objective function, only one solution is needed.
0.39/0.43 c start presolving problem
0.39/0.43 c presolving:
1.10/1.13 c presolving (1 rounds):
1.10/1.13 c 1631 deleted vars, 6548 deleted constraints, 1631 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.10/1.13 c 1936524 implications, 0 cliques
1.10/1.14 c presolving detected infeasibility
1.10/1.14 c Presolving Time: 0.69
1.10/1.14 c SATUNSAT-LIN
1.10/1.14 c -----------------------------------------------------------------------------------------------
1.10/1.14 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 0]
1.10/1.14 c separating/flowcover/freq = c -1
1.10/1.14 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 0]
1.10/1.14 c separating/cmir/freq = c -1
1.10/1.14 c # additional number of allowed LP iterations
1.10/1.14 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.14 c heuristics/veclendiving/maxlpiterofs = c 1500
1.10/1.14 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.14 c heuristics/veclendiving/maxlpiterquot = c 0.075
1.10/1.14 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.14 c heuristics/veclendiving/freq = c -1
1.10/1.14 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 1]
1.10/1.14 c heuristics/simplerounding/freq = c -1
1.10/1.14 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.14 c heuristics/shifting/freq = c -1
1.10/1.14 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 1]
1.10/1.14 c heuristics/rounding/freq = c -1
1.10/1.14 c # additional number of allowed LP iterations
1.10/1.14 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.14 c heuristics/rootsoldiving/maxlpiterofs = c 1500
1.10/1.14 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
1.10/1.14 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
1.10/1.14 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 20]
1.10/1.14 c heuristics/rootsoldiving/freq = c -1
1.10/1.14 c # number of nodes added to the contingent of the total nodes
1.10/1.14 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.10/1.14 c heuristics/rens/nodesofs = c 2000
1.10/1.14 c # minimum percentage of integer variables that have to be fixable
1.10/1.14 c # [type: real, range: [0,1], default: 0.5]
1.10/1.14 c heuristics/rens/minfixingrate = c 0.3
1.10/1.14 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 0]
1.10/1.14 c heuristics/rens/freq = c -1
1.10/1.14 c # additional number of allowed LP iterations
1.10/1.14 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.14 c heuristics/pscostdiving/maxlpiterofs = c 1500
1.10/1.14 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.14 c heuristics/pscostdiving/maxlpiterquot = c 0.075
1.10/1.14 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.14 c heuristics/pscostdiving/freq = c -1
1.10/1.14 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 1]
1.10/1.14 c heuristics/oneopt/freq = c -1
1.10/1.14 c # additional number of allowed LP iterations
1.10/1.14 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.14 c heuristics/objpscostdiving/maxlpiterofs = c 1500
1.10/1.14 c # maximal fraction of diving LP iterations compared to total iteration number
1.10/1.14 c # [type: real, range: [0,1], default: 0.01]
1.10/1.14 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
1.10/1.14 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 20]
1.10/1.14 c heuristics/objpscostdiving/freq = c -1
1.10/1.14 c # additional number of allowed LP iterations
1.10/1.14 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.14 c heuristics/linesearchdiving/maxlpiterofs = c 1500
1.10/1.14 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.14 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
1.10/1.14 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.14 c heuristics/linesearchdiving/freq = c -1
1.10/1.14 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.14 c heuristics/intshifting/freq = c -1
1.10/1.14 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.14 c heuristics/intdiving/maxlpiterquot = c 0.075
1.10/1.14 c # additional number of allowed LP iterations
1.10/1.14 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.14 c heuristics/guideddiving/maxlpiterofs = c 1500
1.10/1.14 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.14 c heuristics/guideddiving/maxlpiterquot = c 0.075
1.10/1.14 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.14 c heuristics/guideddiving/freq = c -1
1.10/1.14 c # additional number of allowed LP iterations
1.10/1.14 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.14 c heuristics/fracdiving/maxlpiterofs = c 1500
1.10/1.14 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.14 c heuristics/fracdiving/maxlpiterquot = c 0.075
1.10/1.14 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.14 c heuristics/fracdiving/freq = c -1
1.10/1.14 c # additional number of allowed LP iterations
1.10/1.14 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.14 c heuristics/feaspump/maxlpiterofs = c 2000
1.10/1.14 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 20]
1.10/1.14 c heuristics/feaspump/freq = c -1
1.10/1.14 c # minimum percentage of integer variables that have to be fixed
1.10/1.14 c # [type: real, range: [0,1], default: 0.666]
1.10/1.14 c heuristics/crossover/minfixingrate = c 0.5
1.10/1.14 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
1.10/1.14 c # [type: real, range: [0,1], default: 0.1]
1.10/1.14 c heuristics/crossover/nodesquot = c 0.15
1.10/1.14 c # number of nodes without incumbent change that heuristic should wait
1.10/1.14 c # [type: longint, range: [0,9223372036854775807], default: 200]
1.10/1.14 c heuristics/crossover/nwaitingnodes = c 100
1.10/1.14 c # number of nodes added to the contingent of the total nodes
1.10/1.14 c # [type: longint, range: [0,9223372036854775807], default: 500]
1.10/1.14 c heuristics/crossover/nodesofs = c 750
1.10/1.14 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 30]
1.10/1.14 c heuristics/crossover/freq = c -1
1.10/1.14 c # additional number of allowed LP iterations
1.10/1.14 c # [type: int, range: [0,2147483647], default: 1000]
1.10/1.14 c heuristics/coefdiving/maxlpiterofs = c 1500
1.10/1.14 c # maximal fraction of diving LP iterations compared to node LP iterations
1.10/1.14 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
1.10/1.14 c heuristics/coefdiving/maxlpiterquot = c 0.075
1.10/1.14 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 10]
1.10/1.14 c heuristics/coefdiving/freq = c -1
1.10/1.14 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: -1]
1.10/1.14 c presolving/probing/maxrounds = c 0
1.10/1.14 c # should presolving try to simplify knapsacks
1.10/1.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.10/1.14 c constraints/knapsack/simplifyinequalities = c TRUE
1.10/1.14 c # should disaggregation of knapsack constraints be allowed in preprocessing?
1.10/1.14 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
1.10/1.14 c constraints/knapsack/disaggregation = c FALSE
1.10/1.14 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: -1]
1.10/1.14 c constraints/knapsack/maxnumcardlift = c 0
1.10/1.14 c # should presolving try to simplify inequalities
1.10/1.14 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
1.10/1.14 c constraints/linear/simplifyinequalities = c TRUE
1.10/1.14 c # maximal number of separation rounds in the root node (-1: unlimited)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: -1]
1.10/1.14 c separating/maxroundsroot = c 5
1.10/1.14 c # maximal number of separation rounds per node (-1: unlimited)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 5]
1.10/1.14 c separating/maxrounds = c 1
1.10/1.14 c # solving stops, if the given number of solutions were found (-1: no limit)
1.10/1.14 c # [type: int, range: [-1,2147483647], default: -1]
1.10/1.14 c limits/solutions = c 1
1.10/1.14 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
1.10/1.14 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.10/1.14 c limits/memory = c 13950
1.10/1.14 c # maximal time in seconds to run
1.10/1.14 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
1.10/1.14 c limits/time = c 1791
1.10/1.14 c # frequency for displaying node information lines
1.10/1.14 c # [type: int, range: [-1,2147483647], default: 100]
1.10/1.14 c display/freq = c 10000
1.10/1.14 c -----------------------------------------------------------------------------------------------
1.10/1.14 c start solving problem
1.10/1.14 c
1.10/1.14 c SCIP Status : problem is solved [infeasible]
1.10/1.14 c Solving Time (sec) : 0.76
1.10/1.14 c Solving Nodes : 0
1.10/1.14 c Primal Bound : +1.00000000000000e+20 (0 solutions)
1.10/1.14 c Dual Bound : -1.00000000000000e+20
1.10/1.14 c Gap : infinite
1.10/1.14 c NODE 0
1.10/1.14 c DUAL BOUND -1e+20
1.10/1.14 c PRIMAL BOUND 1e+20
1.10/1.14 c GAP 1e+20
1.10/1.14 s UNSATISFIABLE
1.10/1.14 c SCIP Status : problem is solved [infeasible]
1.10/1.14 c Solving Time : 0.76
1.10/1.14 c Original Problem :
1.10/1.14 c Problem name : HOME/instance-3739665-1338756732.opb
1.10/1.14 c Variables : 17424 (17424 binary, 0 integer, 0 implicit integer, 0 continuous)
1.10/1.14 c Constraints : 54466 initial, 54466 maximal
1.10/1.14 c Presolved Problem :
1.10/1.14 c Problem name : t_HOME/instance-3739665-1338756732.opb
1.10/1.14 c Variables : 15793 (15793 binary, 0 integer, 0 implicit integer, 0 continuous)
1.10/1.14 c Constraints : 47918 initial, 47918 maximal
1.10/1.14 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
1.10/1.14 c trivial : 0.00 0 0 0 0 0 0 0 0
1.10/1.14 c dualfix : 0.00 0 0 0 0 0 0 0 0
1.10/1.14 c boundshift : 0.00 0 0 0 0 0 0 0 0
1.10/1.14 c inttobinary : 0.00 0 0 0 0 0 0 0 0
1.10/1.14 c implics : 0.00 0 0 0 0 0 0 0 0
1.10/1.14 c probing : 0.00 0 0 0 0 0 0 0 0
1.10/1.14 c linear : 0.65 1631 0 0 1631 0 6548 0 0
1.10/1.14 c root node : - 0 - - 0 - - - -
1.10/1.14 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
1.10/1.14 c integral : 0 0 0 0 0 0 0 0 0 0
1.10/1.14 c linear : 47918 0 0 0 0 0 0 0 0 0
1.10/1.14 c countsols : 0 0 0 0 0 0 0 0 0 0
1.10/1.14 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
1.10/1.14 c integral : 0.00 0.00 0.00 0.00 0.00
1.10/1.14 c linear : 0.00 0.00 0.00 0.00 0.00
1.10/1.14 c countsols : 0.00 0.00 0.00 0.00 0.00
1.10/1.14 c Propagators : Time Calls Cutoffs DomReds
1.10/1.14 c pseudoobj : 0.00 0 0 0
1.10/1.14 c rootredcost : 0.00 0 0 0
1.10/1.14 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
1.10/1.14 c propagation : 0.00 0 0 0 0.0 0 0.0 -
1.10/1.14 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
1.10/1.14 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
1.10/1.14 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
1.10/1.14 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
1.10/1.14 c applied globally : - - - 0 0.0 - - -
1.10/1.14 c applied locally : - - - 0 0.0 - - -
1.10/1.14 c Separators : Time Calls Cutoffs DomReds Cuts Conss
1.10/1.14 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
1.10/1.14 c redcost : 0.00 0 0 0 0 0
1.10/1.14 c impliedbounds : 0.00 0 0 0 0 0
1.10/1.14 c intobj : 0.00 0 0 0 0 0
1.10/1.14 c gomory : 0.00 0 0 0 0 0
1.10/1.14 c strongcg : 0.00 0 0 0 0 0
1.10/1.14 c cmir : 0.00 0 0 0 0 0
1.10/1.14 c flowcover : 0.00 0 0 0 0 0
1.10/1.14 c clique : 0.00 0 0 0 0 0
1.10/1.14 c zerohalf : 0.00 0 0 0 0 0
1.10/1.14 c mcf : 0.00 0 0 0 0 0
1.10/1.14 c Pricers : Time Calls Vars
1.10/1.14 c problem variables: 0.00 0 0
1.10/1.14 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
1.10/1.14 c pscost : 0.00 0 0 0 0 0 0
1.10/1.14 c inference : 0.00 0 0 0 0 0 0
1.10/1.14 c mostinf : 0.00 0 0 0 0 0 0
1.10/1.14 c leastinf : 0.00 0 0 0 0 0 0
1.10/1.14 c fullstrong : 0.00 0 0 0 0 0 0
1.10/1.14 c allfullstrong : 0.00 0 0 0 0 0 0
1.10/1.14 c random : 0.00 0 0 0 0 0 0
1.10/1.14 c relpscost : 0.00 0 0 0 0 0 0
1.10/1.14 c Primal Heuristics : Time Calls Found
1.10/1.14 c LP solutions : 0.00 - 0
1.10/1.14 c pseudo solutions : 0.00 - 0
1.10/1.14 c simplerounding : 0.00 0 0
1.10/1.14 c rounding : 0.00 0 0
1.10/1.14 c shifting : 0.00 0 0
1.10/1.14 c intshifting : 0.00 0 0
1.10/1.14 c oneopt : 0.00 0 0
1.10/1.14 c fixandinfer : 0.00 0 0
1.10/1.14 c feaspump : 0.00 0 0
1.10/1.14 c coefdiving : 0.00 0 0
1.10/1.14 c pscostdiving : 0.00 0 0
1.10/1.14 c fracdiving : 0.00 0 0
1.10/1.14 c veclendiving : 0.00 0 0
1.10/1.14 c intdiving : 0.00 0 0
1.10/1.14 c actconsdiving : 0.00 0 0
1.10/1.14 c objpscostdiving : 0.00 0 0
1.10/1.14 c rootsoldiving : 0.00 0 0
1.10/1.14 c linesearchdiving : 0.00 0 0
1.10/1.14 c guideddiving : 0.00 0 0
1.10/1.14 c octane : 0.00 0 0
1.10/1.14 c rens : 0.00 0 0
1.10/1.14 c rins : 0.00 0 0
1.10/1.14 c localbranching : 0.00 0 0
1.10/1.14 c mutation : 0.00 0 0
1.10/1.14 c crossover : 0.00 0 0
1.10/1.14 c dins : 0.00 0 0
1.10/1.14 c LP : Time Calls Iterations Iter/call Iter/sec
1.10/1.14 c primal LP : 0.00 0 0 0.00 -
1.10/1.14 c dual LP : 0.00 0 0 0.00 -
1.10/1.14 c barrier LP : 0.00 0 0 0.00 -
1.10/1.14 c diving/probing LP: 0.00 0 0 0.00 -
1.10/1.14 c strong branching : 0.00 0 0 0.00 -
1.10/1.14 c (at root node) : - 0 0 0.00 -
1.10/1.14 c conflict analysis: 0.00 0 0 0.00 -
1.10/1.14 c B&B Tree :
1.10/1.14 c number of runs : 1
1.10/1.14 c nodes : 0
1.10/1.14 c nodes (total) : 0
1.10/1.14 c nodes left : 1
1.10/1.14 c max depth : -1
1.10/1.14 c max depth (total): -1
1.10/1.14 c backtracks : 0 (0.0%)
1.10/1.14 c delayed cutoffs : 0
1.10/1.14 c repropagations : 0 (0 domain reductions, 0 cutoffs)
1.10/1.14 c avg switch length: 0.00
1.10/1.14 c switching time : 0.00
1.10/1.14 c Solution :
1.10/1.14 c Solutions found : 0 (0 improvements)
1.10/1.14 c Primal Bound : infeasible
1.10/1.14 c Dual Bound : -
1.10/1.14 c Gap : infinite
1.10/1.14 c Root Dual Bound : -
1.19/1.24 c Time complete: 1.24.
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-3739665-1338756732/watcher-3739665-1338756732 -o /tmp/evaluation-result-3739665-1338756732/solver-3739665-1338756732 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 15500 -f HOME/instance-3739665-1338756732.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.07 2.37 2.69 3/176 10644
/proc/meminfo: memFree=30437300/32873844 swapFree=7900/7900
[pid=10644] ppid=10642 vsize=8708 CPUtime=0 cores=1,3,5,7
/proc/10644/stat : 10644 (pbscip.linux.x8) R 10642 10644 8610 0 -1 4202496 1513 0 0 0 0 0 0 0 20 0 1 0 341797775 8916992 1465 33554432000 4194304 7823515 140736497551536 140736497483448 5878822 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/10644/statm: 2177 1465 351 887 0 1287 0
[startup+0.018937 s]
/proc/loadavg: 2.07 2.37 2.69 3/176 10644
/proc/meminfo: memFree=30437300/32873844 swapFree=7900/7900
[pid=10644] ppid=10642 vsize=11940 CPUtime=0.01 cores=1,3,5,7
/proc/10644/stat : 10644 (pbscip.linux.x8) R 10642 10644 8610 0 -1 4202496 2323 0 0 0 1 0 0 0 20 0 1 0 341797775 12226560 2275 33554432000 4194304 7823515 140736497551536 140736497483448 6896320 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/10644/statm: 2985 2275 351 887 0 2095 0
Current children cumulated CPU time (s) 0.01
Current children cumulated vsize (KiB) 11940
[startup+0.100285 s]
/proc/loadavg: 2.07 2.37 2.69 3/176 10644
/proc/meminfo: memFree=30437300/32873844 swapFree=7900/7900
[pid=10644] ppid=10642 vsize=22160 CPUtime=0.09 cores=1,3,5,7
/proc/10644/stat : 10644 (pbscip.linux.x8) R 10642 10644 8610 0 -1 4202496 4877 0 0 0 9 0 0 0 20 0 1 0 341797775 22691840 4829 33554432000 4194304 7823515 140736497551536 140736497483448 6908057 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/10644/statm: 5540 4829 351 887 0 4650 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 22160
[startup+0.300273 s]
/proc/loadavg: 2.07 2.37 2.69 3/176 10644
/proc/meminfo: memFree=30437300/32873844 swapFree=7900/7900
[pid=10644] ppid=10642 vsize=39676 CPUtime=0.29 cores=1,3,5,7
/proc/10644/stat : 10644 (pbscip.linux.x8) R 10642 10644 8610 0 -1 4202496 9275 0 0 0 28 1 0 0 20 0 1 0 341797775 40628224 9227 33554432000 4194304 7823515 140736497551536 140736497483448 6957168 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/10644/statm: 9919 9227 351 887 0 9029 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 39676
[startup+0.700301 s]
/proc/loadavg: 2.07 2.37 2.69 3/176 10644
/proc/meminfo: memFree=30437300/32873844 swapFree=7900/7900
[pid=10644] ppid=10642 vsize=128960 CPUtime=0.69 cores=1,3,5,7
/proc/10644/stat : 10644 (pbscip.linux.x8) R 10642 10644 8610 0 -1 4202496 31386 0 0 0 65 4 0 0 20 0 1 0 341797775 132055040 30984 33554432000 4194304 7823515 140736497551536 140736497483448 5878822 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/10644/statm: 32240 31021 427 887 0 31350 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 128960
Solver just ended. Dumping a history of the last processes samples
[startup+1.10678 s]
/proc/loadavg: 2.07 2.36 2.68 3/177 10645
/proc/meminfo: memFree=30291592/32873844 swapFree=7900/7900
[pid=10644] ppid=10642 vsize=156272 CPUtime=1.1 cores=1,3,5,7
/proc/10644/stat : 10644 (pbscip.linux.x8) R 10642 10644 8610 0 -1 4202496 38127 0 0 0 104 6 0 0 20 0 1 0 341797775 160022528 37725 33554432000 4194304 7823515 140736497551536 140736497548472 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/10644/statm: 39068 37725 427 887 0 38178 0
Current children cumulated CPU time (s) 1.1
Current children cumulated vsize (KiB) 156272
[startup+1.20038 s]
/proc/loadavg: 2.07 2.36 2.68 3/177 10645
/proc/meminfo: memFree=30291592/32873844 swapFree=7900/7900
[pid=10644] ppid=10642 vsize=157492 CPUtime=1.19 cores=1,3,5,7
/proc/10644/stat : 10644 (pbscip.linux.x8) R 10642 10644 8610 0 -1 4202496 38467 0 0 0 113 6 0 0 20 0 1 0 341797775 161271808 38065 33554432000 4194304 7823515 140736497551536 140736497548472 5875738 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/10644/statm: 39373 38065 462 887 0 38483 0
Current children cumulated CPU time (s) 1.19
Current children cumulated vsize (KiB) 157492
Child status: 0
Real time (s): 1.24889
CPU time (s): 1.24681
CPU user time (s): 1.17582
CPU system time (s): 0.070989
CPU usage (%): 99.8336
Max. virtual memory (cumulated for all children) (KiB): 157492
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 1.17582
system time used= 0.070989
maximum resident set size= 152264
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 38475
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.004999 second user time and 0.009998 second system time
The end