| Solver Name | Answer | CPU time | Wall clock time |
|---|---|---|---|
| PB11: SCIP spx E_2 2011-06-10 (fixed) | UNSAT | 2.97455 | 2.97754 |
| Name | /DEC-SMALLINT-LIN/oliveras/j120/ normalized-j12049_6-unsat.opb |
| MD5SUM | 9fcf0317a9d230a039d85958f2c2c43b |
| Bench Category | DEC-SMALLINT-LIN (no optimisation, small integers, linear constraints) |
| Best result obtained on this benchmark | UNSAT |
| Best value of the objective obtained on this benchmark | |
| Best CPU time to get the best result obtained on this benchmark | 0.032994 |
| Has Objective Function | NO |
| Satisfiable | |
| (Un)Satisfiability was proved | |
| Best value of the objective function | |
| Optimality of the best value was proved | |
| Number of variables | 30976 |
| Total number of constraints | 107613 |
| Number of constraints which are clauses | 107105 |
| Number of constraints which are cardinality constraints (but not clauses) | 0 |
| Number of constraints which are nor clauses,nor cardinality constraints | 508 |
| Minimum length of a constraint | 1 |
| Maximum length of a constraint | 63 |
| Number of terms in the objective function | 0 |
| Biggest coefficient in the objective function | 0 |
| Number of bits for the biggest coefficient in the objective function | 0 |
| Sum of the numbers in the objective function | 0 |
| Number of bits of the sum of numbers in the objective function | 0 |
| Biggest number in a constraint | 26 |
| Number of bits of the biggest number in a constraint | 5 |
| Biggest sum of numbers in a constraint | 398 |
| Number of bits of the biggest sum of numbers | 9 |
| Number of products (including duplicates) | 0 |
| Sum of products size (including duplicates) | 0 |
| Number of different products | 0 |
| Sum of products size | 0 |
0.00/0.00 c SCIP version 2.0.1.5 [precision: 8 byte] [memory: block] [mode: optimized] [LP solver: SoPlex 1.5.0.5]
0.00/0.00 c Copyright (c) 2002-2011 Konrad-Zuse-Zentrum fuer Informationstechnik Berlin (ZIB)
0.00/0.00 c
0.00/0.00 c user parameter file <scip.set> not found - using default parameters
0.00/0.00 c reading problem <HOME/instance-3739582-1338736206.opb>
0.49/0.59 c original problem has 30976 variables (30976 bin, 0 int, 0 impl, 0 cont) and 107613 constraints
0.49/0.59 c problem read
0.49/0.59 c No objective function, only one solution is needed.
0.49/0.59 c presolving settings loaded
0.69/0.79 c presolving:
2.68/2.78 c presolving (1 rounds):
2.68/2.78 c 3605 deleted vars, 13161 deleted constraints, 0 added constraints, 3605 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
2.68/2.78 c 4518512 implications, 0 cliques
2.68/2.79 c presolving detected infeasibility
2.68/2.79 c Presolving Time: 2.04
2.68/2.79 c - non default parameters ----------------------------------------------------------------------
2.68/2.79 c # SCIP version 2.0.1.5
2.68/2.79 c
2.68/2.79 c # frequency for displaying node information lines
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 100]
2.68/2.79 c display/freq = 10000
2.68/2.79 c
2.68/2.79 c # maximal time in seconds to run
2.68/2.79 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.68/2.79 c limits/time = 1797
2.68/2.79 c
2.68/2.79 c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.68/2.79 c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.68/2.79 c limits/memory = 13950
2.68/2.79 c
2.68/2.79 c # solving stops, if the given number of solutions were found (-1: no limit)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: -1]
2.68/2.79 c limits/solutions = 1
2.68/2.79 c
2.68/2.79 c # maximal number of separation rounds per node (-1: unlimited)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 5]
2.68/2.79 c separating/maxrounds = 1
2.68/2.79 c
2.68/2.79 c # maximal number of separation rounds in the root node (-1: unlimited)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: -1]
2.68/2.79 c separating/maxroundsroot = 5
2.68/2.79 c
2.68/2.79 c # default clock type (1: CPU user seconds, 2: wall clock time)
2.68/2.79 c # [type: int, range: [1,2], default: 1]
2.68/2.79 c timing/clocktype = 2
2.68/2.79 c
2.68/2.79 c # belongs reading time to solving time?
2.68/2.79 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.68/2.79 c timing/reading = TRUE
2.68/2.79 c
2.68/2.79 c # should presolving try to simplify inequalities
2.68/2.79 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.68/2.79 c constraints/linear/simplifyinequalities = TRUE
2.68/2.79 c
2.68/2.79 c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
2.68/2.79 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.68/2.79 c constraints/indicator/addCouplingCons = TRUE
2.68/2.79 c
2.68/2.79 c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.68/2.79 c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.68/2.79 c constraints/knapsack/disaggregation = FALSE
2.68/2.79 c
2.68/2.79 c # should presolving try to simplify knapsacks
2.68/2.79 c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.68/2.79 c constraints/knapsack/simplifyinequalities = TRUE
2.68/2.79 c
2.68/2.79 c # maximal number of presolving rounds the presolver participates in (-1: no limit)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: -1]
2.68/2.79 c presolving/probing/maxrounds = 0
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 10]
2.68/2.79 c heuristics/coefdiving/freq = -1
2.68/2.79 c
2.68/2.79 c # maximal fraction of diving LP iterations compared to node LP iterations
2.68/2.79 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.68/2.79 c heuristics/coefdiving/maxlpiterquot = 0.075
2.68/2.79 c
2.68/2.79 c # additional number of allowed LP iterations
2.68/2.79 c # [type: int, range: [0,2147483647], default: 1000]
2.68/2.79 c heuristics/coefdiving/maxlpiterofs = 1500
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 30]
2.68/2.79 c heuristics/crossover/freq = -1
2.68/2.79 c
2.68/2.79 c # number of nodes added to the contingent of the total nodes
2.68/2.79 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.68/2.79 c heuristics/crossover/nodesofs = 750
2.68/2.79 c
2.68/2.79 c # number of nodes without incumbent change that heuristic should wait
2.68/2.79 c # [type: longint, range: [0,9223372036854775807], default: 200]
2.68/2.79 c heuristics/crossover/nwaitingnodes = 100
2.68/2.79 c
2.68/2.79 c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.68/2.79 c # [type: real, range: [0,1], default: 0.1]
2.68/2.79 c heuristics/crossover/nodesquot = 0.15
2.68/2.79 c
2.68/2.79 c # minimum percentage of integer variables that have to be fixed
2.68/2.79 c # [type: real, range: [0,1], default: 0.666]
2.68/2.79 c heuristics/crossover/minfixingrate = 0.5
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 20]
2.68/2.79 c heuristics/feaspump/freq = -1
2.68/2.79 c
2.68/2.79 c # additional number of allowed LP iterations
2.68/2.79 c # [type: int, range: [0,2147483647], default: 1000]
2.68/2.79 c heuristics/feaspump/maxlpiterofs = 2000
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 10]
2.68/2.79 c heuristics/fracdiving/freq = -1
2.68/2.79 c
2.68/2.79 c # maximal fraction of diving LP iterations compared to node LP iterations
2.68/2.79 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.68/2.79 c heuristics/fracdiving/maxlpiterquot = 0.075
2.68/2.79 c
2.68/2.79 c # additional number of allowed LP iterations
2.68/2.79 c # [type: int, range: [0,2147483647], default: 1000]
2.68/2.79 c heuristics/fracdiving/maxlpiterofs = 1500
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 10]
2.68/2.79 c heuristics/guideddiving/freq = -1
2.68/2.79 c
2.68/2.79 c # maximal fraction of diving LP iterations compared to node LP iterations
2.68/2.79 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.68/2.79 c heuristics/guideddiving/maxlpiterquot = 0.075
2.68/2.79 c
2.68/2.79 c # additional number of allowed LP iterations
2.68/2.79 c # [type: int, range: [0,2147483647], default: 1000]
2.68/2.79 c heuristics/guideddiving/maxlpiterofs = 1500
2.68/2.79 c
2.68/2.79 c # maximal fraction of diving LP iterations compared to node LP iterations
2.68/2.79 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.68/2.79 c heuristics/intdiving/maxlpiterquot = 0.075
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 10]
2.68/2.79 c heuristics/intshifting/freq = -1
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 10]
2.68/2.79 c heuristics/linesearchdiving/freq = -1
2.68/2.79 c
2.68/2.79 c # maximal fraction of diving LP iterations compared to node LP iterations
2.68/2.79 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.68/2.79 c heuristics/linesearchdiving/maxlpiterquot = 0.075
2.68/2.79 c
2.68/2.79 c # additional number of allowed LP iterations
2.68/2.79 c # [type: int, range: [0,2147483647], default: 1000]
2.68/2.79 c heuristics/linesearchdiving/maxlpiterofs = 1500
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 20]
2.68/2.79 c heuristics/objpscostdiving/freq = -1
2.68/2.79 c
2.68/2.79 c # maximal fraction of diving LP iterations compared to total iteration number
2.68/2.79 c # [type: real, range: [0,1], default: 0.01]
2.68/2.79 c heuristics/objpscostdiving/maxlpiterquot = 0.015
2.68/2.79 c
2.68/2.79 c # additional number of allowed LP iterations
2.68/2.79 c # [type: int, range: [0,2147483647], default: 1000]
2.68/2.79 c heuristics/objpscostdiving/maxlpiterofs = 1500
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 1]
2.68/2.79 c heuristics/oneopt/freq = -1
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 10]
2.68/2.79 c heuristics/pscostdiving/freq = -1
2.68/2.79 c
2.68/2.79 c # maximal fraction of diving LP iterations compared to node LP iterations
2.68/2.79 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.68/2.79 c heuristics/pscostdiving/maxlpiterquot = 0.075
2.68/2.79 c
2.68/2.79 c # additional number of allowed LP iterations
2.68/2.79 c # [type: int, range: [0,2147483647], default: 1000]
2.68/2.79 c heuristics/pscostdiving/maxlpiterofs = 1500
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 0]
2.68/2.79 c heuristics/rens/freq = -1
2.68/2.79 c
2.68/2.79 c # minimum percentage of integer variables that have to be fixable
2.68/2.79 c # [type: real, range: [0,1], default: 0.5]
2.68/2.79 c heuristics/rens/minfixingrate = 0.3
2.68/2.79 c
2.68/2.79 c # number of nodes added to the contingent of the total nodes
2.68/2.79 c # [type: longint, range: [0,9223372036854775807], default: 500]
2.68/2.79 c heuristics/rens/nodesofs = 2000
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 20]
2.68/2.79 c heuristics/rootsoldiving/freq = -1
2.68/2.79 c
2.68/2.79 c # maximal fraction of diving LP iterations compared to node LP iterations
2.68/2.79 c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.68/2.79 c heuristics/rootsoldiving/maxlpiterquot = 0.015
2.68/2.79 c
2.68/2.79 c # additional number of allowed LP iterations
2.68/2.79 c # [type: int, range: [0,2147483647], default: 1000]
2.68/2.79 c heuristics/rootsoldiving/maxlpiterofs = 1500
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 1]
2.68/2.79 c heuristics/rounding/freq = -1
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 0]
2.68/2.79 c heuristics/shiftandpropagate/freq = -1
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 10]
2.68/2.79 c heuristics/shifting/freq = -1
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 1]
2.68/2.79 c heuristics/simplerounding/freq = -1
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 1]
2.68/2.79 c heuristics/subnlp/freq = -1
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 0]
2.68/2.79 c heuristics/trivial/freq = -1
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 1]
2.68/2.79 c heuristics/trysol/freq = -1
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 0]
2.68/2.79 c heuristics/undercover/freq = -1
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 10]
2.68/2.79 c heuristics/veclendiving/freq = -1
2.68/2.79 c
2.68/2.79 c # maximal fraction of diving LP iterations compared to node LP iterations
2.68/2.79 c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.68/2.79 c heuristics/veclendiving/maxlpiterquot = 0.075
2.68/2.79 c
2.68/2.79 c # additional number of allowed LP iterations
2.68/2.79 c # [type: int, range: [0,2147483647], default: 1000]
2.68/2.79 c heuristics/veclendiving/maxlpiterofs = 1500
2.68/2.79 c
2.68/2.79 c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 1]
2.68/2.79 c heuristics/zirounding/freq = -1
2.68/2.79 c
2.68/2.79 c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 0]
2.68/2.79 c separating/cmir/freq = -1
2.68/2.79 c
2.68/2.79 c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: 0]
2.68/2.79 c separating/flowcover/freq = -1
2.68/2.79 c
2.68/2.79 c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
2.68/2.79 c # [type: int, range: [-1,2147483647], default: -1]
2.68/2.79 c separating/rapidlearning/freq = 0
2.68/2.79 c
2.68/2.79 c -----------------------------------------------------------------------------------------------
2.68/2.79 c start solving
2.68/2.79 c
2.68/2.79 c SCIP Status : problem is solved [infeasible]
2.68/2.79 c Solving Time (sec) : 2.79
2.68/2.79 c Solving Nodes : 0
2.68/2.79 c Primal Bound : +1.00000000000000e+20 (0 solutions)
2.68/2.79 c Dual Bound : -1.00000000000000e+20
2.68/2.79 c Gap : infinite
2.68/2.79 s UNSATISFIABLE
2.68/2.79 c SCIP Status : problem is solved [infeasible]
2.68/2.79 c Total Time : 2.79
2.68/2.79 c solving : 2.79
2.68/2.79 c presolving : 2.04 (included in solving)
2.68/2.79 c reading : 0.59 (included in solving)
2.68/2.79 c Original Problem :
2.68/2.79 c Problem name : HOME/instance-3739582-1338736206.opb
2.68/2.79 c Variables : 30976 (30976 binary, 0 integer, 0 implicit integer, 0 continuous)
2.68/2.79 c Constraints : 107613 initial, 107613 maximal
2.68/2.79 c Presolved Problem :
2.68/2.79 c Problem name : t_HOME/instance-3739582-1338736206.opb
2.68/2.79 c Variables : 27371 (27371 binary, 0 integer, 0 implicit integer, 0 continuous)
2.68/2.79 c Constraints : 94452 initial, 94452 maximal
2.68/2.79 c Presolvers : Time FixedVars AggrVars ChgTypes ChgBounds AddHoles DelCons AddCons ChgSides ChgCoefs
2.68/2.79 c trivial : 0.00 0 0 0 0 0 0 0 0 0
2.68/2.79 c dualfix : 0.00 0 0 0 0 0 0 0 0 0
2.68/2.79 c boundshift : 0.00 0 0 0 0 0 0 0 0 0
2.68/2.79 c inttobinary : 0.00 0 0 0 0 0 0 0 0 0
2.68/2.79 c pseudoobj : 0.00 0 0 0 0 0 0 0 0 0
2.68/2.79 c implics : 0.00 0 0 0 0 0 0 0 0 0
2.68/2.79 c probing : 0.00 0 0 0 0 0 0 0 0 0
2.68/2.79 c linear : 1.96 3605 0 0 3605 0 13161 0 0 0
2.68/2.79 c root node : - 0 - - 0 - - - - -
2.68/2.79 c Constraints : Number #Separate #Propagate #EnfoLP #EnfoPS #Check #Resprop Cutoffs DomReds Cuts Conss Children
2.68/2.79 c integral : 0 0 0 0 0 0 0 0 0 0 0 0
2.68/2.79 c linear : 94452 0 0 0 0 0 0 0 0 0 0 0
2.68/2.79 c countsols : 0 0 0 0 0 0 0 0 0 0 0 0
2.68/2.79 c Constraint Timings : TotalTime Separate Propagate EnfoLP EnfoPS Check Resprop
2.68/2.79 c integral : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.68/2.79 c linear : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.68/2.79 c countsols : 0.00 0.00 0.00 0.00 0.00 0.00 0.00
2.68/2.79 c Propagators : #Propagate #Resprop Cutoffs DomReds
2.68/2.79 c pseudoobj : 0 0 0 0
2.68/2.79 c rootredcost : 0 0 0 0
2.68/2.79 c vbounds : 0 0 0 0
2.68/2.79 c Propagator Timings : TotalTime Propagate Resprop
2.68/2.79 c pseudoobj : 0.00 0.00 0.00
2.68/2.79 c rootredcost : 0.00 0.00 0.00
2.68/2.79 c vbounds : 0.00 0.00 0.00
2.68/2.79 c Conflict Analysis : Time Calls Success Conflicts Literals Reconvs ReconvLits LP Iters
2.68/2.79 c propagation : 0.00 0 0 0 0.0 0 0.0 -
2.68/2.79 c infeasible LP : 0.00 0 0 0 0.0 0 0.0 0
2.68/2.79 c bound exceed. LP : 0.00 0 0 0 0.0 0 0.0 0
2.68/2.79 c strong branching : 0.00 0 0 0 0.0 0 0.0 0
2.68/2.79 c pseudo solution : 0.00 0 0 0 0.0 0 0.0 -
2.68/2.79 c applied globally : - - - 0 0.0 - - -
2.68/2.79 c applied locally : - - - 0 0.0 - - -
2.68/2.79 c Separators : Time Calls Cutoffs DomReds Cuts Conss
2.68/2.79 c cut pool : 0.00 0 - - 0 - (maximal pool size: 0)
2.68/2.79 c redcost : 0.00 0 0 0 0 0
2.68/2.79 c impliedbounds : 0.00 0 0 0 0 0
2.68/2.79 c intobj : 0.00 0 0 0 0 0
2.68/2.79 c gomory : 0.00 0 0 0 0 0
2.68/2.79 c cgmip : 0.00 0 0 0 0 0
2.68/2.79 c closecuts : 0.00 0 0 0 0 0
2.68/2.79 c strongcg : 0.00 0 0 0 0 0
2.68/2.79 c cmir : 0.00 0 0 0 0 0
2.68/2.79 c flowcover : 0.00 0 0 0 0 0
2.68/2.79 c clique : 0.00 0 0 0 0 0
2.68/2.79 c zerohalf : 0.00 0 0 0 0 0
2.68/2.79 c mcf : 0.00 0 0 0 0 0
2.68/2.79 c oddcycle : 0.00 0 0 0 0 0
2.68/2.79 c rapidlearning : 0.00 0 0 0 0 0
2.68/2.79 c Pricers : Time Calls Vars
2.68/2.79 c problem variables: 0.00 0 0
2.68/2.79 c Branching Rules : Time Calls Cutoffs DomReds Cuts Conss Children
2.68/2.79 c pscost : 0.00 0 0 0 0 0 0
2.68/2.79 c inference : 0.00 0 0 0 0 0 0
2.68/2.79 c mostinf : 0.00 0 0 0 0 0 0
2.68/2.79 c leastinf : 0.00 0 0 0 0 0 0
2.68/2.79 c fullstrong : 0.00 0 0 0 0 0 0
2.68/2.79 c allfullstrong : 0.00 0 0 0 0 0 0
2.68/2.79 c random : 0.00 0 0 0 0 0 0
2.68/2.79 c relpscost : 0.00 0 0 0 0 0 0
2.68/2.79 c Primal Heuristics : Time Calls Found
2.68/2.79 c LP solutions : 0.00 - 0
2.68/2.79 c pseudo solutions : 0.00 - 0
2.68/2.79 c trivial : 0.02 1 0
2.68/2.79 c shiftandpropagate: 0.00 0 0
2.68/2.79 c simplerounding : 0.00 0 0
2.68/2.79 c zirounding : 0.00 0 0
2.68/2.79 c rounding : 0.00 0 0
2.68/2.79 c shifting : 0.00 0 0
2.68/2.79 c intshifting : 0.00 0 0
2.68/2.79 c oneopt : 0.00 0 0
2.68/2.79 c twoopt : 0.00 0 0
2.68/2.79 c fixandinfer : 0.00 0 0
2.68/2.79 c feaspump : 0.00 0 0
2.68/2.79 c clique : 0.00 0 0
2.68/2.79 c coefdiving : 0.00 0 0
2.68/2.79 c pscostdiving : 0.00 0 0
2.68/2.79 c fracdiving : 0.00 0 0
2.68/2.79 c veclendiving : 0.00 0 0
2.68/2.79 c intdiving : 0.00 0 0
2.68/2.79 c actconsdiving : 0.00 0 0
2.68/2.79 c objpscostdiving : 0.00 0 0
2.68/2.79 c rootsoldiving : 0.00 0 0
2.68/2.79 c linesearchdiving : 0.00 0 0
2.68/2.79 c guideddiving : 0.00 0 0
2.68/2.79 c octane : 0.00 0 0
2.68/2.79 c rens : 0.00 0 0
2.68/2.79 c rins : 0.00 0 0
2.68/2.79 c localbranching : 0.00 0 0
2.68/2.79 c mutation : 0.00 0 0
2.68/2.79 c crossover : 0.00 0 0
2.68/2.79 c dins : 0.00 0 0
2.68/2.79 c vbounds : 0.00 0 0
2.68/2.79 c undercover : 0.00 0 0
2.68/2.79 c subnlp : 0.00 0 0
2.68/2.79 c trysol : 0.00 0 0
2.68/2.79 c LP : Time Calls Iterations Iter/call Iter/sec
2.68/2.79 c primal LP : 0.00 0 0 0.00 -
2.68/2.79 c dual LP : 0.00 0 0 0.00 -
2.68/2.79 c lex dual LP : 0.00 0 0 0.00 -
2.68/2.79 c barrier LP : 0.00 0 0 0.00 -
2.68/2.79 c diving/probing LP: 0.00 0 0 0.00 -
2.68/2.79 c strong branching : 0.00 0 0 0.00 -
2.68/2.79 c (at root node) : - 0 0 0.00 -
2.68/2.79 c conflict analysis: 0.00 0 0 0.00 -
2.68/2.79 c B&B Tree :
2.68/2.79 c number of runs : 1
2.68/2.79 c nodes : 0
2.68/2.79 c nodes (total) : 0
2.68/2.79 c nodes left : 1
2.68/2.79 c max depth : -1
2.68/2.79 c max depth (total): -1
2.68/2.79 c backtracks : 0 (0.0%)
2.68/2.79 c delayed cutoffs : 0
2.68/2.79 c repropagations : 0 (0 domain reductions, 0 cutoffs)
2.68/2.79 c avg switch length: 0.00
2.68/2.79 c switching time : 0.00
2.68/2.79 c Solution :
2.68/2.79 c Solutions found : 0 (0 improvements)
2.68/2.79 c Primal Bound : infeasible
2.68/2.79 c Dual Bound : -
2.68/2.79 c Gap : infinite
2.68/2.79 c Root Dual Bound : -
2.68/2.79 c Root Iterations : 0
2.89/2.97 c Time complete: 2.97.
ERROR: no interpretation found !
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-3739582-1338736206/watcher-3739582-1338736206 -o /tmp/evaluation-result-3739582-1338736206/solver-3739582-1338736206 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3739582-1338736206.opb -t 1800 -m 15500 running on 4 cores: 0,2,4,6 Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 1900 seconds Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB Current StackSize limit: 10240 KiB [startup+0 s] /proc/loadavg: 2.00 2.00 2.00 3/177 30913 /proc/meminfo: memFree=27513540/32873844 swapFree=7372/7372 [pid=30913] ppid=30911 vsize=9456 CPUtime=0 cores=0,2,4,6 /proc/30913/stat : 30913 (scip-2.0.1.4b_2) R 30911 30913 26510 0 -1 4202496 1486 0 0 0 0 0 0 0 20 0 1 0 339746726 9682944 1440 33554432000 4194304 9016284 140734264295376 140735228152168 7824814 0 0 4096 0 0 0 0 17 4 0 0 0 0 0 /proc/30913/statm: 2364 1441 311 1178 0 1182 0 [startup+0.048949 s] /proc/loadavg: 2.00 2.00 2.00 3/177 30913 /proc/meminfo: memFree=27513540/32873844 swapFree=7372/7372 [pid=30913] ppid=30911 vsize=22012 CPUtime=0.04 cores=0,2,4,6 /proc/30913/stat : 30913 (scip-2.0.1.4b_2) R 30911 30913 26510 0 -1 4202496 4482 0 0 0 4 0 0 0 20 0 1 0 339746726 22540288 4436 33554432000 4194304 9016284 140734264295376 140735228152168 7928096 0 0 4096 0 0 0 0 17 4 0 0 0 0 0 /proc/30913/statm: 5503 4436 357 1178 0 4321 0 Current children cumulated CPU time (s) 0.04 Current children cumulated vsize (KiB) 22012 [startup+0.10031 s] /proc/loadavg: 2.00 2.00 2.00 3/177 30913 /proc/meminfo: memFree=27513540/32873844 swapFree=7372/7372 [pid=30913] ppid=30911 vsize=32200 CPUtime=0.08 cores=0,2,4,6 /proc/30913/stat : 30913 (scip-2.0.1.4b_2) R 30911 30913 26510 0 -1 4202496 7050 0 0 0 8 0 0 0 20 0 1 0 339746726 32972800 6996 33554432000 4194304 9016284 140734264295376 140735228152168 7928096 0 0 4096 0 0 0 0 17 4 0 0 0 0 0 /proc/30913/statm: 8050 6996 357 1178 0 6868 0 Current children cumulated CPU time (s) 0.08 Current children cumulated vsize (KiB) 32200 [startup+0.300258 s] /proc/loadavg: 2.00 2.00 2.00 3/177 30913 /proc/meminfo: memFree=27513540/32873844 swapFree=7372/7372 [pid=30913] ppid=30911 vsize=46464 CPUtime=0.29 cores=0,2,4,6 /proc/30913/stat : 30913 (scip-2.0.1.4b_2) R 30911 30913 26510 0 -1 4202496 10598 0 0 0 27 2 0 0 20 0 1 0 339746726 47579136 10544 33554432000 4194304 9016284 140734264295376 140735228152168 7870448 0 0 4096 0 0 0 0 17 4 0 0 0 0 0 /proc/30913/statm: 11616 10544 357 1178 0 10434 0 Current children cumulated CPU time (s) 0.29 Current children cumulated vsize (KiB) 46464 [startup+0.700262 s] /proc/loadavg: 2.00 2.00 2.00 3/177 30913 /proc/meminfo: memFree=27513540/32873844 swapFree=7372/7372 [pid=30913] ppid=30911 vsize=146704 CPUtime=0.69 cores=0,2,4,6 /proc/30913/stat : 30913 (scip-2.0.1.4b_2) R 30911 30913 26510 0 -1 4202496 35533 0 0 0 64 5 0 0 20 0 1 0 339746726 150224896 35479 33554432000 4194304 9016284 140734264295376 140734264159272 4318833 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0 /proc/30913/statm: 36676 35479 404 1178 0 35494 0 Current children cumulated CPU time (s) 0.69 Current children cumulated vsize (KiB) 146704 [startup+1.50027 s] /proc/loadavg: 2.00 2.00 2.00 3/178 30914 /proc/meminfo: memFree=27321944/32873844 swapFree=7372/7372 [pid=30913] ppid=30911 vsize=245436 CPUtime=1.49 cores=0,2,4,6 /proc/30913/stat : 30913 (scip-2.0.1.4b_2) R 30911 30913 26510 0 -1 4202496 59712 0 0 0 141 8 0 0 20 0 1 0 339746726 251326464 59658 33554432000 4194304 9016284 140734264295376 140734264290728 6480197 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0 /proc/30913/statm: 61359 59658 484 1178 0 60177 0 Current children cumulated CPU time (s) 1.49 Current children cumulated vsize (KiB) 245436 Solver just ended. Dumping a history of the last processes samples [startup+2.30027 s] /proc/loadavg: 2.00 2.00 2.00 3/178 30914 /proc/meminfo: memFree=27243452/32873844 swapFree=7372/7372 [pid=30913] ppid=30911 vsize=290904 CPUtime=2.29 cores=0,2,4,6 /proc/30913/stat : 30913 (scip-2.0.1.4b_2) R 30911 30913 26510 0 -1 4202496 70885 0 0 0 220 9 0 0 20 0 1 0 339746726 297885696 70831 33554432000 4194304 9016284 140734264295376 140734264290728 6466928 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0 /proc/30913/statm: 72726 70831 484 1178 0 71544 0 Current children cumulated CPU time (s) 2.29 Current children cumulated vsize (KiB) 290904 [startup+2.70028 s] /proc/loadavg: 2.00 2.00 2.00 3/178 30914 /proc/meminfo: memFree=27243452/32873844 swapFree=7372/7372 [pid=30913] ppid=30911 vsize=301636 CPUtime=2.68 cores=0,2,4,6 /proc/30913/stat : 30913 (scip-2.0.1.4b_2) R 30911 30913 26510 0 -1 4202496 73213 0 0 0 259 9 0 0 20 0 1 0 339746726 308875264 73159 33554432000 4194304 9016284 140734264295376 140734264290728 4460361 0 0 4096 16384 0 0 0 17 4 0 0 0 0 0 /proc/30913/statm: 75409 73159 484 1178 0 74227 0 Current children cumulated CPU time (s) 2.68 Current children cumulated vsize (KiB) 301636 [startup+2.90028 s] /proc/loadavg: 2.00 2.00 2.00 3/178 30914 /proc/meminfo: memFree=27243452/32873844 swapFree=7372/7372 [pid=30913] ppid=30911 vsize=269676 CPUtime=2.89 cores=0,2,4,6 /proc/30913/stat : 30913 (scip-2.0.1.4b_2) R 30911 30913 26510 0 -1 4202496 75138 0 0 0 279 10 0 0 20 0 1 0 339746726 276148224 65160 33554432000 4194304 9016284 140734264295376 140734264290728 7933303 0 0 4096 0 0 0 0 17 4 0 0 0 0 0 /proc/30913/statm: 67419 65160 520 1178 0 66237 0 Current children cumulated CPU time (s) 2.89 Current children cumulated vsize (KiB) 269676 Child status: 0 Real time (s): 2.97754 CPU time (s): 2.97455 CPU user time (s): 2.85257 CPU system time (s): 0.121981 CPU usage (%): 99.8995 Max. virtual memory (cumulated for all children) (KiB): 304828 getrusage(RUSAGE_CHILDREN,...) data: user time used= 2.85257 system time used= 0.121981 maximum resident set size= 297404 integral shared memory size= 0 integral unshared data size= 0 integral unshared stack size= 0 page reclaims= 75150 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.002999 second user time and 0.015997 second system time The end
Begin job on node118 at 2012-06-03 17:10:06 IDJOB=3739582 IDBENCH=73684 IDSOLVER=2329 FILE ID=node118/3739582-1338736206 RUNJOBID= node118-1338703112-26526 PBS_JOBID= 14636719 Free space on /tmp= 70952 MiB SOLVER NAME= PB11: SCIP spx E_2 2011-06-10 (fixed) BENCH NAME= PB10/normalized-PB10/DEC-SMALLINT-LIN/oliveras/j120/normalized-j12049_6-unsat.opb COMMAND LINE= HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3739582-1338736206/watcher-3739582-1338736206 -o /tmp/evaluation-result-3739582-1338736206/solver-3739582-1338736206 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3739582-1338736206.opb -t 1800 -m 15500 TIME LIMIT= 1800 seconds MEMORY LIMIT= 15500 MiB NBCORE= 4 MD5SUM BENCH= 9fcf0317a9d230a039d85958f2c2c43b RANDOM SEED=1941850516 node118.alineos.net Linux 2.6.32-71.29.1.el6.x86_64 #1 SMP Mon Jun 27 19:49:27 BST 2011 /proc/cpuinfo: processor : 0 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.212 cache size : 8192 KB physical id : 0 siblings : 4 core id : 0 cpu cores : 4 apicid : 0 initial apicid : 0 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5332.42 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 1 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.212 cache size : 8192 KB physical id : 1 siblings : 4 core id : 0 cpu cores : 4 apicid : 16 initial apicid : 16 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5438.55 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 2 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.212 cache size : 8192 KB physical id : 0 siblings : 4 core id : 1 cpu cores : 4 apicid : 2 initial apicid : 2 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.92 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 3 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.212 cache size : 8192 KB physical id : 1 siblings : 4 core id : 1 cpu cores : 4 apicid : 18 initial apicid : 18 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.91 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 4 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.212 cache size : 8192 KB physical id : 0 siblings : 4 core id : 2 cpu cores : 4 apicid : 4 initial apicid : 4 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5320.68 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 5 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.212 cache size : 8192 KB physical id : 1 siblings : 4 core id : 2 cpu cores : 4 apicid : 20 initial apicid : 20 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.91 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 6 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.212 cache size : 8192 KB physical id : 0 siblings : 4 core id : 3 cpu cores : 4 apicid : 6 initial apicid : 6 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.91 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: processor : 7 vendor_id : GenuineIntel cpu family : 6 model : 26 model name : Intel(R) Xeon(R) CPU X5550 @ 2.67GHz stepping : 5 cpu MHz : 2666.212 cache size : 8192 KB physical id : 1 siblings : 4 core id : 3 cpu cores : 4 apicid : 22 initial apicid : 22 fpu : yes fpu_exception : yes cpuid level : 11 wp : yes flags : fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid bogomips : 5331.92 clflush size : 64 cache_alignment : 64 address sizes : 40 bits physical, 48 bits virtual power management: /proc/meminfo: MemTotal: 32873844 kB MemFree: 27513432 kB Buffers: 496368 kB Cached: 3909728 kB SwapCached: 0 kB Active: 1477196 kB Inactive: 3018252 kB Active(anon): 79068 kB Inactive(anon): 11328 kB Active(file): 1398128 kB Inactive(file): 3006924 kB Unevictable: 7372 kB Mlocked: 7372 kB SwapTotal: 67108856 kB SwapFree: 67108856 kB Dirty: 19844 kB Writeback: 0 kB AnonPages: 59792 kB Mapped: 14528 kB Shmem: 200 kB Slab: 725204 kB SReclaimable: 166412 kB SUnreclaim: 558792 kB KernelStack: 1480 kB PageTables: 3832 kB NFS_Unstable: 0 kB Bounce: 0 kB WritebackTmp: 0 kB CommitLimit: 83545776 kB Committed_AS: 203300 kB VmallocTotal: 34359738367 kB VmallocUsed: 346368 kB VmallocChunk: 34341987984 kB HardwareCorrupted: 0 kB AnonHugePages: 36864 kB HugePages_Total: 0 HugePages_Free: 0 HugePages_Rsvd: 0 HugePages_Surp: 0 Hugepagesize: 2048 kB DirectMap4k: 7872 kB DirectMap2M: 33538048 kB Free space on /tmp at the end= 70936 MiB End job on node118 at 2012-06-03 17:10:09