0.59/0.67 c SCIP version 1.1.0.7
0.59/0.67 c LP-Solver SoPlex 1.4.1
0.59/0.67 c user parameter file <scip.set> not found - using default parameters
0.59/0.67 c read problem <HOME/instance-3739574-1338756475.opb>
0.59/0.67 c original problem has 30976 variables (30976 bin, 0 int, 0 impl, 0 cont) and 107613 constraints
0.78/0.85 c No objective function, only one solution is needed.
0.78/0.85 c start presolving problem
0.78/0.85 c presolving:
2.49/2.57 c presolving (1 rounds):
2.49/2.57 c 3605 deleted vars, 13161 deleted constraints, 3605 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.49/2.57 c 4518512 implications, 0 cliques
2.49/2.58 c presolving detected infeasibility
2.49/2.58 c Presolving Time: 1.68
2.49/2.58 c SATUNSAT-LIN
2.49/2.58 c -----------------------------------------------------------------------------------------------
2.49/2.58 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: 0]
2.49/2.58 c separating/flowcover/freq = c -1
2.49/2.58 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: 0]
2.49/2.58 c separating/cmir/freq = c -1
2.49/2.58 c # additional number of allowed LP iterations
2.49/2.58 c # [type: int, range: [0,2147483647], default: 1000]
2.49/2.58 c heuristics/veclendiving/maxlpiterofs = c 1500
2.49/2.58 c # maximal fraction of diving LP iterations compared to node LP iterations
2.49/2.58 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.49/2.58 c heuristics/veclendiving/maxlpiterquot = c 0.075
2.49/2.58 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: 10]
2.49/2.58 c heuristics/veclendiving/freq = c -1
2.49/2.58 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: 1]
2.49/2.58 c heuristics/simplerounding/freq = c -1
2.49/2.58 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: 10]
2.49/2.58 c heuristics/shifting/freq = c -1
2.49/2.58 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: 1]
2.49/2.58 c heuristics/rounding/freq = c -1
2.49/2.58 c # additional number of allowed LP iterations
2.49/2.58 c # [type: int, range: [0,2147483647], default: 1000]
2.49/2.58 c heuristics/rootsoldiving/maxlpiterofs = c 1500
2.49/2.58 c # maximal fraction of diving LP iterations compared to node LP iterations
2.49/2.58 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.49/2.58 c heuristics/rootsoldiving/maxlpiterquot = c 0.015
2.49/2.58 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: 20]
2.49/2.58 c heuristics/rootsoldiving/freq = c -1
2.49/2.58 c # number of nodes added to the contingent of the total nodes
2.49/2.58 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.49/2.58 c heuristics/rens/nodesofs = c 2000
2.49/2.58 c # minimum percentage of integer variables that have to be fixable
2.49/2.58 c # [type: real, range: [0,1], default: 0.5]
2.49/2.58 c heuristics/rens/minfixingrate = c 0.3
2.49/2.58 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: 0]
2.49/2.58 c heuristics/rens/freq = c -1
2.49/2.58 c # additional number of allowed LP iterations
2.49/2.58 c # [type: int, range: [0,2147483647], default: 1000]
2.49/2.58 c heuristics/pscostdiving/maxlpiterofs = c 1500
2.49/2.58 c # maximal fraction of diving LP iterations compared to node LP iterations
2.49/2.58 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.49/2.58 c heuristics/pscostdiving/maxlpiterquot = c 0.075
2.49/2.58 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: 10]
2.49/2.58 c heuristics/pscostdiving/freq = c -1
2.49/2.58 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: 1]
2.49/2.58 c heuristics/oneopt/freq = c -1
2.49/2.58 c # additional number of allowed LP iterations
2.49/2.58 c # [type: int, range: [0,2147483647], default: 1000]
2.49/2.58 c heuristics/objpscostdiving/maxlpiterofs = c 1500
2.49/2.58 c # maximal fraction of diving LP iterations compared to total iteration number
2.49/2.58 c # [type: real, range: [0,1], default: 0.01]
2.49/2.58 c heuristics/objpscostdiving/maxlpiterquot = c 0.015
2.49/2.58 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: 20]
2.49/2.58 c heuristics/objpscostdiving/freq = c -1
2.49/2.58 c # additional number of allowed LP iterations
2.49/2.58 c # [type: int, range: [0,2147483647], default: 1000]
2.49/2.58 c heuristics/linesearchdiving/maxlpiterofs = c 1500
2.49/2.58 c # maximal fraction of diving LP iterations compared to node LP iterations
2.49/2.58 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.49/2.58 c heuristics/linesearchdiving/maxlpiterquot = c 0.075
2.49/2.58 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: 10]
2.49/2.58 c heuristics/linesearchdiving/freq = c -1
2.49/2.58 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: 10]
2.49/2.58 c heuristics/intshifting/freq = c -1
2.49/2.58 c # maximal fraction of diving LP iterations compared to node LP iterations
2.49/2.58 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.49/2.58 c heuristics/intdiving/maxlpiterquot = c 0.075
2.49/2.58 c # additional number of allowed LP iterations
2.49/2.58 c # [type: int, range: [0,2147483647], default: 1000]
2.49/2.58 c heuristics/guideddiving/maxlpiterofs = c 1500
2.49/2.58 c # maximal fraction of diving LP iterations compared to node LP iterations
2.49/2.58 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.49/2.58 c heuristics/guideddiving/maxlpiterquot = c 0.075
2.49/2.58 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: 10]
2.49/2.58 c heuristics/guideddiving/freq = c -1
2.49/2.58 c # additional number of allowed LP iterations
2.49/2.58 c # [type: int, range: [0,2147483647], default: 1000]
2.49/2.58 c heuristics/fracdiving/maxlpiterofs = c 1500
2.49/2.58 c # maximal fraction of diving LP iterations compared to node LP iterations
2.49/2.58 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.49/2.58 c heuristics/fracdiving/maxlpiterquot = c 0.075
2.49/2.58 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: 10]
2.49/2.58 c heuristics/fracdiving/freq = c -1
2.49/2.58 c # additional number of allowed LP iterations
2.49/2.58 c # [type: int, range: [0,2147483647], default: 1000]
2.49/2.58 c heuristics/feaspump/maxlpiterofs = c 2000
2.49/2.58 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: 20]
2.49/2.58 c heuristics/feaspump/freq = c -1
2.49/2.58 c # minimum percentage of integer variables that have to be fixed
2.49/2.58 c # [type: real, range: [0,1], default: 0.666]
2.49/2.58 c heuristics/crossover/minfixingrate = c 0.5
2.49/2.58 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.49/2.58 c # [type: real, range: [0,1], default: 0.1]
2.49/2.58 c heuristics/crossover/nodesquot = c 0.15
2.49/2.58 c # number of nodes without incumbent change that heuristic should wait
2.49/2.58 c # [type: longint, range: [0,9223372036854775807], default: 200]
2.49/2.58 c heuristics/crossover/nwaitingnodes = c 100
2.49/2.58 c # number of nodes added to the contingent of the total nodes
2.49/2.58 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.49/2.58 c heuristics/crossover/nodesofs = c 750
2.49/2.58 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: 30]
2.49/2.58 c heuristics/crossover/freq = c -1
2.49/2.58 c # additional number of allowed LP iterations
2.49/2.58 c # [type: int, range: [0,2147483647], default: 1000]
2.49/2.58 c heuristics/coefdiving/maxlpiterofs = c 1500
2.49/2.58 c # maximal fraction of diving LP iterations compared to node LP iterations
2.49/2.58 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.49/2.58 c heuristics/coefdiving/maxlpiterquot = c 0.075
2.49/2.58 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: 10]
2.49/2.58 c heuristics/coefdiving/freq = c -1
2.49/2.58 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: -1]
2.49/2.58 c presolving/probing/maxrounds = c 0
2.49/2.58 c # should presolving try to simplify knapsacks
2.49/2.58 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.49/2.58 c constraints/knapsack/simplifyinequalities = c TRUE
2.49/2.58 c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.49/2.58 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.49/2.58 c constraints/knapsack/disaggregation = c FALSE
2.49/2.58 c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: -1]
2.49/2.58 c constraints/knapsack/maxnumcardlift = c 0
2.49/2.58 c # should presolving try to simplify inequalities
2.49/2.58 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.49/2.58 c constraints/linear/simplifyinequalities = c TRUE
2.49/2.58 c # maximal number of separation rounds in the root node (-1: unlimited)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: -1]
2.49/2.58 c separating/maxroundsroot = c 5
2.49/2.58 c # maximal number of separation rounds per node (-1: unlimited)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: 5]
2.49/2.58 c separating/maxrounds = c 1
2.49/2.58 c # solving stops, if the given number of solutions were found (-1: no limit)
2.49/2.58 c # [type: int, range: [-1,2147483647], default: -1]
2.49/2.58 c limits/solutions = c 1
2.49/2.58 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.49/2.58 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.49/2.58 c limits/memory = c 13950
2.49/2.58 c # maximal time in seconds to run
2.49/2.58 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.49/2.58 c limits/time = c 1791
2.49/2.58 c # frequency for displaying node information lines
2.49/2.58 c # [type: int, range: [-1,2147483647], default: 100]
2.49/2.58 c display/freq = c 10000
2.49/2.58 c -----------------------------------------------------------------------------------------------
2.49/2.58 c start solving problem
2.49/2.58 c
2.49/2.58 c SCIP Status : problem is solved [infeasible]
2.49/2.58 c Solving Time (sec) : 1.81
2.49/2.58 c Solving Nodes : 0
2.49/2.58 c Primal Bound : +1.00000000000000e+20 (0 solutions)
2.49/2.58 c Dual Bound : -1.00000000000000e+20
2.49/2.58 c Gap : infinite
2.49/2.58 c NODE 0
2.49/2.58 c DUAL BOUND -1e+20
2.49/2.58 c PRIMAL BOUND 1e+20
2.49/2.58 c GAP 1e+20
2.49/2.58 s UNSATISFIABLE
2.49/2.58 c SCIP Status : problem is solved [infeasible]
2.49/2.58 c Solving Time : 1.81
2.49/2.58 c Original Problem :
2.49/2.58 c Problem name : HOME/instance-3739574-1338756475.opb
2.49/2.58 c Variables : 30976 (30976 binary, 0 integer, 0 implicit integer, 0 continuous)
2.49/2.58 c Constraints : 107613 initial, 107613 maximal
2.49/2.58 c Presolved Problem :
2.49/2.58 c Problem name : t_HOME/instance-3739574-1338756475.opb
2.49/2.58 c Variables : 27371 (27371 binary, 0 integer, 0 implicit integer, 0 continuous)
2.49/2.58 c Constraints : 94452 initial, 94452 maximal
2.49/2.58 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons ChgSides ChgCoefs
2.49/2.58 c trivial : 0.00 0 0 0 0 0 0 0 0
2.49/2.58 c dualfix : 0.00 0 0 0 0 0 0 0 0
2.49/2.58 c boundshift : 0.00 0 0 0 0 0 0 0 0
2.49/2.58 c inttobinary : 0.00 0 0 0 0 0 0 0 0
2.49/2.58 c implics : 0.00 0 0 0 0 0 0 0 0
2.49/2.58 c probing : 0.00 0 0 0 0 0 0 0 0
2.49/2.58 c linear : 1.62 3605 0 0 3605 0 13161 0 0
2.49/2.58 c root node : - 0 - - 0 - - - -
2.49/2.58 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS Cutoffs DomReds Cuts Conss Children
2.49/2.58 c integral : 0 0 0 0 0 0 0 0 0 0
2.49/2.58 c linear : 94452 0 0 0 0 0 0 0 0 0
2.49/2.58 c countsols : 0 0 0 0 0 0 0 0 0 0
2.49/2.58 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS
2.49/2.58 c integral : 0.00 0.00 0.00 0.00 0.00
2.49/2.58 c linear : 0.00 0.00 0.00 0.00 0.00
2.49/2.58 c countsols : 0.00 0.00 0.00 0.00 0.00
2.49/2.58 c Propagators : Time Calls Cutoffs DomReds
2.49/2.58 c pseudoobj : 0.00 0 0 0
2.49/2.58 c rootredcost : 0.00 0 0 0
2.49/2.58 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.49/2.58 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.49/2.58 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.49/2.58 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.49/2.58 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.49/2.58 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.49/2.58 c applied globally : - - - 0 0.0 - - -
2.49/2.58 c applied locally : - - - 0 0.0 - - -
2.49/2.58 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.49/2.58 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
2.49/2.58 c redcost : 0.00 0 0 0 0 0
2.49/2.58 c impliedbounds : 0.00 0 0 0 0 0
2.49/2.58 c intobj : 0.00 0 0 0 0 0
2.49/2.58 c gomory : 0.00 0 0 0 0 0
2.49/2.58 c strongcg : 0.00 0 0 0 0 0
2.49/2.58 c cmir : 0.00 0 0 0 0 0
2.49/2.58 c flowcover : 0.00 0 0 0 0 0
2.49/2.58 c clique : 0.00 0 0 0 0 0
2.49/2.58 c zerohalf : 0.00 0 0 0 0 0
2.49/2.58 c mcf : 0.00 0 0 0 0 0
2.49/2.58 c Pricers : Time Calls Vars
2.49/2.58 c problem variables: 0.00 0 0
2.49/2.58 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.49/2.58 c pscost : 0.00 0 0 0 0 0 0
2.49/2.58 c inference : 0.00 0 0 0 0 0 0
2.49/2.58 c mostinf : 0.00 0 0 0 0 0 0
2.49/2.58 c leastinf : 0.00 0 0 0 0 0 0
2.49/2.58 c fullstrong : 0.00 0 0 0 0 0 0
2.49/2.58 c allfullstrong : 0.00 0 0 0 0 0 0
2.49/2.58 c random : 0.00 0 0 0 0 0 0
2.49/2.58 c relpscost : 0.00 0 0 0 0 0 0
2.49/2.58 c Primal Heuristics : Time Calls Found
2.49/2.58 c LP solutions : 0.00 - 0
2.49/2.58 c pseudo solutions : 0.00 - 0
2.49/2.58 c simplerounding : 0.00 0 0
2.49/2.58 c rounding : 0.00 0 0
2.49/2.58 c shifting : 0.00 0 0
2.49/2.58 c intshifting : 0.00 0 0
2.49/2.58 c oneopt : 0.00 0 0
2.49/2.58 c fixandinfer : 0.00 0 0
2.49/2.58 c feaspump : 0.00 0 0
2.49/2.58 c coefdiving : 0.00 0 0
2.49/2.58 c pscostdiving : 0.00 0 0
2.49/2.58 c fracdiving : 0.00 0 0
2.49/2.58 c veclendiving : 0.00 0 0
2.49/2.58 c intdiving : 0.00 0 0
2.49/2.58 c actconsdiving : 0.00 0 0
2.49/2.58 c objpscostdiving : 0.00 0 0
2.49/2.58 c rootsoldiving : 0.00 0 0
2.49/2.58 c linesearchdiving : 0.00 0 0
2.49/2.58 c guideddiving : 0.00 0 0
2.49/2.58 c octane : 0.00 0 0
2.49/2.58 c rens : 0.00 0 0
2.49/2.58 c rins : 0.00 0 0
2.49/2.58 c localbranching : 0.00 0 0
2.49/2.58 c mutation : 0.00 0 0
2.49/2.58 c crossover : 0.00 0 0
2.49/2.58 c dins : 0.00 0 0
2.49/2.58 c LP : Time Calls Iterations Iter/call Iter/sec
2.49/2.58 c primal LP : 0.00 0 0 0.00 -
2.49/2.58 c dual LP : 0.00 0 0 0.00 -
2.49/2.58 c barrier LP : 0.00 0 0 0.00 -
2.49/2.58 c diving/probing LP: 0.00 0 0 0.00 -
2.49/2.58 c strong branching : 0.00 0 0 0.00 -
2.49/2.58 c (at root node) : - 0 0 0.00 -
2.49/2.58 c conflict analysis: 0.00 0 0 0.00 -
2.49/2.58 c B&B Tree :
2.49/2.58 c number of runs : 1
2.49/2.58 c nodes : 0
2.49/2.58 c nodes (total) : 0
2.49/2.58 c nodes left : 1
2.49/2.58 c max depth : -1
2.49/2.58 c max depth (total): -1
2.49/2.58 c backtracks : 0 (0.0%)
2.49/2.58 c delayed cutoffs : 0
2.49/2.58 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.49/2.58 c avg switch length: 0.00
2.49/2.58 c switching time : 0.00
2.49/2.58 c Solution :
2.49/2.58 c Solutions found : 0 (0 improvements)
2.49/2.58 c Primal Bound : infeasible
2.49/2.58 c Dual Bound : -
2.49/2.58 c Gap : infinite
2.49/2.58 c Root Dual Bound : -
2.69/2.74 c Time complete: 2.74.
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-3739574-1338756475/watcher-3739574-1338756475 -o /tmp/evaluation-result-3739574-1338756475/solver-3739574-1338756475 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 15500 -f HOME/instance-3739574-1338756475.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.06 2.02 2.00 3/178 22188
/proc/meminfo: memFree=28440828/32873844 swapFree=7380/7380
[pid=22188] ppid=22186 vsize=8180 CPUtime=0 cores=0,2,4,6
/proc/22188/stat : 22188 (pbscip.linux.x8) R 22186 22188 21332 0 -1 4202496 1226 0 0 0 0 0 0 0 20 0 1 0 341772325 8376320 1178 33554432000 4194304 7823515 140737352782480 140735566307640 4402248 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/22188/statm: 2045 1183 335 887 0 1155 0
[startup+0.066071 s]
/proc/loadavg: 2.06 2.02 2.00 3/178 22188
/proc/meminfo: memFree=28440828/32873844 swapFree=7380/7380
[pid=22188] ppid=22186 vsize=19000 CPUtime=0.05 cores=0,2,4,6
/proc/22188/stat : 22188 (pbscip.linux.x8) R 22186 22188 21332 0 -1 4202496 4083 0 0 0 5 0 0 0 20 0 1 0 341772325 19456000 4035 33554432000 4194304 7823515 140737352782480 140735566307640 6908062 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/22188/statm: 4750 4035 351 887 0 3860 0
Current children cumulated CPU time (s) 0.05
Current children cumulated vsize (KiB) 19000
[startup+0.100277 s]
/proc/loadavg: 2.06 2.02 2.00 3/178 22188
/proc/meminfo: memFree=28440828/32873844 swapFree=7380/7380
[pid=22188] ppid=22186 vsize=25436 CPUtime=0.09 cores=0,2,4,6
/proc/22188/stat : 22188 (pbscip.linux.x8) R 22186 22188 21332 0 -1 4202496 5485 0 0 0 9 0 0 0 20 0 1 0 341772325 26046464 5438 33554432000 4194304 7823515 140737352782480 140737352648584 5878822 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/22188/statm: 6359 5468 351 887 0 5469 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 25436
[startup+0.300227 s]
/proc/loadavg: 2.06 2.02 2.00 3/178 22188
/proc/meminfo: memFree=28440828/32873844 swapFree=7380/7380
[pid=22188] ppid=22186 vsize=37552 CPUtime=0.29 cores=0,2,4,6
/proc/22188/stat : 22188 (pbscip.linux.x8) R 22186 22188 21332 0 -1 4202496 8726 0 0 0 28 1 0 0 20 0 1 0 341772325 38453248 8678 33554432000 4194304 7823515 140737352782480 140737352648584 6908032 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/22188/statm: 9388 8678 351 887 0 8498 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 37552
[startup+0.700207 s]
/proc/loadavg: 2.06 2.02 2.00 3/178 22188
/proc/meminfo: memFree=28440828/32873844 swapFree=7380/7380
[pid=22188] ppid=22186 vsize=89524 CPUtime=0.68 cores=0,2,4,6
/proc/22188/stat : 22188 (pbscip.linux.x8) R 22186 22188 21332 0 -1 4202496 21984 0 0 0 66 2 0 0 20 0 1 0 341772325 91672576 21582 33554432000 4194304 7823515 140737352782480 140737352648584 5741588 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/22188/statm: 22381 21583 367 887 0 21491 0
Current children cumulated CPU time (s) 0.68
Current children cumulated vsize (KiB) 89524
[startup+1.5002 s]
/proc/loadavg: 2.06 2.01 2.00 3/179 22189
/proc/meminfo: memFree=28123116/32873844 swapFree=7380/7380
[pid=22188] ppid=22186 vsize=230980 CPUtime=1.49 cores=0,2,4,6
/proc/22188/stat : 22188 (pbscip.linux.x8) R 22186 22188 21332 0 -1 4202496 57072 0 0 0 141 8 0 0 20 0 1 0 341772325 236523520 56670 33554432000 4194304 7823515 140737352782480 140737352779416 6954986 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/22188/statm: 57745 56670 427 887 0 56855 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 230980
Solver just ended. Dumping a history of the last processes samples
[startup+2.30024 s]
/proc/loadavg: 2.06 2.01 2.00 3/179 22189
/proc/meminfo: memFree=27944788/32873844 swapFree=7380/7380
[pid=22188] ppid=22186 vsize=277328 CPUtime=2.28 cores=0,2,4,6
/proc/22188/stat : 22188 (pbscip.linux.x8) R 22186 22188 21332 0 -1 4202496 68372 0 0 0 218 10 0 0 20 0 1 0 341772325 283983872 67970 33554432000 4194304 7823515 140737352782480 140737352779416 5808468 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/22188/statm: 69332 67970 427 887 0 68442 0
Current children cumulated CPU time (s) 2.28
Current children cumulated vsize (KiB) 277328
[startup+2.70027 s]
/proc/loadavg: 2.06 2.01 2.00 3/179 22189
/proc/meminfo: memFree=27944788/32873844 swapFree=7380/7380
[pid=22188] ppid=22186 vsize=287212 CPUtime=2.69 cores=0,2,4,6
/proc/22188/stat : 22188 (pbscip.linux.x8) R 22186 22188 21332 0 -1 4202496 70624 0 0 0 258 11 0 0 20 0 1 0 341772325 294105088 70222 33554432000 4194304 7823515 140737352782480 140737352779416 4788288 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/22188/statm: 71803 70222 463 887 0 70913 0
Current children cumulated CPU time (s) 2.69
Current children cumulated vsize (KiB) 287212
Child status: 0
Real time (s): 2.74681
CPU time (s): 2.74358
CPU user time (s): 2.6106
CPU system time (s): 0.132979
CPU usage (%): 99.8824
Max. virtual memory (cumulated for all children) (KiB): 287212
getrusage(RUSAGE_CHILDREN,...) data:
user time used= 2.6106
system time used= 0.132979
maximum resident set size= 280888
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 70631
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= 15
runsolver used 0.003999 second user time and 0.016997 second system time
The end