Trace number 3739972

Some explanations

A solver is run under the control of another program named runsolver. runsolver is in charge of imposing the CPU time limit and the memory limit to the solver. It also monitors some information about the process. The trace of the execution of a solver is divided into four (or five) parts:
  1. SOLVER DATA
    This is the output of the solver (stdout and stderr).
    Note that some very long lines in this section may be truncated by your web browser ! In such a case, you may want to use the "Download as text" link to get the trace as a text file.

    When the --timestamp option is passed to the runsolver program, each line output by the solver is prepended with a timestamp which indicates at what time the line was output by the solver. Times are relative to the start of the program, given in seconds. The first timestamp (if present) is estimated CPU time. The last timestamp is wall clock time.

    As some 'v lines' may be very long (sometimes several megabytes), the 'v line' output by your solver may be split on several lines to help limit the size of the trace recorded in the database. In any case, the exact output of your solver is preserved in a trace file.
  2. VERIFIER DATA
    The output of the solver is piped to a verifier program which will search a value line "v " and, if found, will check that the given interpretation satisfies all constraints.
  3. CONVERSION SCRIPT DATA (Optionnal)
    When a conversion script is used, this section shows the messages that were output by the conversion script.
  4. WATCHER DATA
    This is the informations gathered by the runsolver program. It first prints the different limits. There's a first limit on CPU time set to X seconds (see the parameters in the trace). After this time has ellapsed, runsolver sends a SIGTERM and 2 seconds later a SIGKILL to the solver. For safety, there's also another limit set to X+30 seconds which will send a SIGXPU to the solver. The last limit is on the virtual memory used by the process (see the parameters in the trace).
    Every ten seconds, the runsolver process fetches the content of /proc/loadavg, /proc/pid/stat and /proc/pid/statm (see man proc) and prints it as raw data. This is only recorded in case we need to investigate the behaviour of a solver. The memory used by the solver (vsize) is also given every ten seconds.
    When the solver exits, runsolver prints some informations such as status and time. CPU usage is the ratio CPU Time/Real Time.
  5. LAUNCHER DATA
    These informations are related to the script which will launch the solver. The most important informations are the command line given to the solver, the md5sum of the different files and the dump of the /proc/cpuinfo and /proc/meminfo which provides some useful information on the computer.

Solver answer on this benchmark

Solver NameAnswerCPU timeWall clock time
PB11: SCIP spx E_2 2011-06-10 (fixed)UNSAT 1.11483 1.11551

General information on the benchmark

Name/DEC-SMALLINT-LIN/oliveras/j60/
normalized-j601_8-unsat.opb
MD5SUM7f114e89a22e1f8645509e0e3ad06e41
Bench CategoryDEC-SMALLINT-LIN (no optimisation, small integers, linear constraints)
Best result obtained on this benchmarkUNSAT
Best value of the objective obtained on this benchmark
Best CPU time to get the best result obtained on this benchmark0.021996
Has Objective FunctionNO
Satisfiable
(Un)Satisfiability was proved
Best value of the objective function
Optimality of the best value was proved
Number of variables9150
Total number of constraints28514
Number of constraints which are clauses28218
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints296
Minimum length of a constraint1
Maximum length of a constraint21
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 14
Number of bits of the biggest number in a constraint 4
Biggest sum of numbers in a constraint 119
Number of bits of the biggest sum of numbers7
Number of products (including duplicates)0
Sum of products size (including duplicates)0
Number of different products0
Sum of products size0

Solver Data 

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-3739972-1338738284.opb>
0.09/0.16	c original problem has 9150 variables (9150 bin, 0 int, 0 impl, 0 cont) and 28514 constraints
0.09/0.16	c problem read
0.09/0.16	c No objective function, only one solution is needed.
0.09/0.16	c presolving settings loaded
0.19/0.21	c presolving:
0.69/0.78	c (round 1) 2455 del vars, 6607 del conss, 0 add conss, 1633 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1477968 impls, 0 clqs
0.99/1.01	c (round 2) 5590 del vars, 17067 del conss, 0 add conss, 4541 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 1496064 impls, 0 clqs
0.99/1.03	c (round 3) 6440 del vars, 21095 del conss, 0 add conss, 4965 chg bounds, 63 chg sides, 48 chg coeffs, 0 upgd conss, 1501160 impls, 0 clqs
0.99/1.05	c (round 4) 6897 del vars, 22441 del conss, 0 add conss, 5275 chg bounds, 115 chg sides, 86 chg coeffs, 0 upgd conss, 1506676 impls, 0 clqs
0.99/1.06	c (round 5) 7162 del vars, 23361 del conss, 0 add conss, 5424 chg bounds, 126 chg sides, 100 chg coeffs, 0 upgd conss, 1509805 impls, 0 clqs
0.99/1.06	c (round 6) 7285 del vars, 23772 del conss, 0 add conss, 5485 chg bounds, 129 chg sides, 105 chg coeffs, 0 upgd conss, 1512135 impls, 0 clqs
0.99/1.07	c (round 7) 7396 del vars, 24041 del conss, 0 add conss, 5563 chg bounds, 133 chg sides, 111 chg coeffs, 0 upgd conss, 1512975 impls, 0 clqs
0.99/1.07	c (round 8) 7545 del vars, 24359 del conss, 0 add conss, 5637 chg bounds, 145 chg sides, 121 chg coeffs, 0 upgd conss, 1515573 impls, 1 clqs
0.99/1.07	c presolving (9 rounds):
0.99/1.07	c  7600 deleted vars, 24576 deleted constraints, 0 added constraints, 5665 tightened bounds, 0 added holes, 153 changed sides, 129 changed coefficients
0.99/1.07	c  1516290 implications, 1 cliques
0.99/1.07	c presolving detected infeasibility
0.99/1.07	c Presolving Time: 0.87
0.99/1.07	c - non default parameters ----------------------------------------------------------------------
0.99/1.07	c # SCIP version 2.0.1.5
0.99/1.07	c 
0.99/1.07	c # frequency for displaying node information lines
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 100]
0.99/1.07	c display/freq = 10000
0.99/1.07	c 
0.99/1.07	c # maximal time in seconds to run
0.99/1.07	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.99/1.07	c limits/time = 1797
0.99/1.07	c 
0.99/1.07	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.99/1.07	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.99/1.07	c limits/memory = 13950
0.99/1.07	c 
0.99/1.07	c # solving stops, if the given number of solutions were found (-1: no limit)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: -1]
0.99/1.07	c limits/solutions = 1
0.99/1.07	c 
0.99/1.07	c # maximal number of separation rounds per node (-1: unlimited)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 5]
0.99/1.07	c separating/maxrounds = 1
0.99/1.07	c 
0.99/1.07	c # maximal number of separation rounds in the root node (-1: unlimited)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: -1]
0.99/1.07	c separating/maxroundsroot = 5
0.99/1.07	c 
0.99/1.07	c # default clock type (1: CPU user seconds, 2: wall clock time)
0.99/1.07	c # [type: int, range: [1,2], default: 1]
0.99/1.07	c timing/clocktype = 2
0.99/1.07	c 
0.99/1.07	c # belongs reading time to solving time?
0.99/1.07	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.99/1.07	c timing/reading = TRUE
0.99/1.07	c 
0.99/1.07	c # should presolving try to simplify inequalities
0.99/1.07	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.99/1.07	c constraints/linear/simplifyinequalities = TRUE
0.99/1.07	c 
0.99/1.07	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.99/1.07	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.99/1.07	c constraints/indicator/addCouplingCons = TRUE
0.99/1.07	c 
0.99/1.07	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.99/1.07	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.99/1.07	c constraints/knapsack/disaggregation = FALSE
0.99/1.07	c 
0.99/1.07	c # should presolving try to simplify knapsacks
0.99/1.07	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.99/1.07	c constraints/knapsack/simplifyinequalities = TRUE
0.99/1.07	c 
0.99/1.07	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: -1]
0.99/1.07	c presolving/probing/maxrounds = 0
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.07	c heuristics/coefdiving/freq = -1
0.99/1.07	c 
0.99/1.07	c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.99/1.07	c heuristics/coefdiving/maxlpiterquot = 0.075
0.99/1.07	c 
0.99/1.07	c # additional number of allowed LP iterations
0.99/1.07	c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.07	c heuristics/coefdiving/maxlpiterofs = 1500
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 30]
0.99/1.07	c heuristics/crossover/freq = -1
0.99/1.07	c 
0.99/1.07	c # number of nodes added to the contingent of the total nodes
0.99/1.07	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.99/1.07	c heuristics/crossover/nodesofs = 750
0.99/1.07	c 
0.99/1.07	c # number of nodes without incumbent change that heuristic should wait
0.99/1.07	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.99/1.07	c heuristics/crossover/nwaitingnodes = 100
0.99/1.07	c 
0.99/1.07	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.99/1.07	c # [type: real, range: [0,1], default: 0.1]
0.99/1.07	c heuristics/crossover/nodesquot = 0.15
0.99/1.07	c 
0.99/1.07	c # minimum percentage of integer variables that have to be fixed 
0.99/1.07	c # [type: real, range: [0,1], default: 0.666]
0.99/1.07	c heuristics/crossover/minfixingrate = 0.5
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 20]
0.99/1.07	c heuristics/feaspump/freq = -1
0.99/1.07	c 
0.99/1.07	c # additional number of allowed LP iterations
0.99/1.07	c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.07	c heuristics/feaspump/maxlpiterofs = 2000
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.07	c heuristics/fracdiving/freq = -1
0.99/1.07	c 
0.99/1.07	c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.99/1.07	c heuristics/fracdiving/maxlpiterquot = 0.075
0.99/1.07	c 
0.99/1.07	c # additional number of allowed LP iterations
0.99/1.07	c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.07	c heuristics/fracdiving/maxlpiterofs = 1500
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.07	c heuristics/guideddiving/freq = -1
0.99/1.07	c 
0.99/1.07	c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.99/1.07	c heuristics/guideddiving/maxlpiterquot = 0.075
0.99/1.07	c 
0.99/1.07	c # additional number of allowed LP iterations
0.99/1.07	c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.07	c heuristics/guideddiving/maxlpiterofs = 1500
0.99/1.07	c 
0.99/1.07	c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.99/1.07	c heuristics/intdiving/maxlpiterquot = 0.075
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.07	c heuristics/intshifting/freq = -1
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.07	c heuristics/linesearchdiving/freq = -1
0.99/1.07	c 
0.99/1.07	c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.99/1.07	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.99/1.07	c 
0.99/1.07	c # additional number of allowed LP iterations
0.99/1.07	c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.07	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 20]
0.99/1.07	c heuristics/objpscostdiving/freq = -1
0.99/1.07	c 
0.99/1.07	c # maximal fraction of diving LP iterations compared to total iteration number
0.99/1.07	c # [type: real, range: [0,1], default: 0.01]
0.99/1.07	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.99/1.07	c 
0.99/1.07	c # additional number of allowed LP iterations
0.99/1.07	c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.07	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 1]
0.99/1.07	c heuristics/oneopt/freq = -1
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.07	c heuristics/pscostdiving/freq = -1
0.99/1.07	c 
0.99/1.07	c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.99/1.07	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.99/1.07	c 
0.99/1.07	c # additional number of allowed LP iterations
0.99/1.07	c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.07	c heuristics/pscostdiving/maxlpiterofs = 1500
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 0]
0.99/1.07	c heuristics/rens/freq = -1
0.99/1.07	c 
0.99/1.07	c # minimum percentage of integer variables that have to be fixable 
0.99/1.07	c # [type: real, range: [0,1], default: 0.5]
0.99/1.07	c heuristics/rens/minfixingrate = 0.3
0.99/1.07	c 
0.99/1.07	c # number of nodes added to the contingent of the total nodes
0.99/1.07	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.99/1.07	c heuristics/rens/nodesofs = 2000
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 20]
0.99/1.07	c heuristics/rootsoldiving/freq = -1
0.99/1.07	c 
0.99/1.07	c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.99/1.07	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.99/1.07	c 
0.99/1.07	c # additional number of allowed LP iterations
0.99/1.07	c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.07	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 1]
0.99/1.07	c heuristics/rounding/freq = -1
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 0]
0.99/1.07	c heuristics/shiftandpropagate/freq = -1
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.07	c heuristics/shifting/freq = -1
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 1]
0.99/1.07	c heuristics/simplerounding/freq = -1
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 1]
0.99/1.07	c heuristics/subnlp/freq = -1
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 0]
0.99/1.07	c heuristics/trivial/freq = -1
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 1]
0.99/1.07	c heuristics/trysol/freq = -1
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 0]
0.99/1.07	c heuristics/undercover/freq = -1
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 10]
0.99/1.07	c heuristics/veclendiving/freq = -1
0.99/1.07	c 
0.99/1.07	c # maximal fraction of diving LP iterations compared to node LP iterations
0.99/1.07	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.99/1.07	c heuristics/veclendiving/maxlpiterquot = 0.075
0.99/1.07	c 
0.99/1.07	c # additional number of allowed LP iterations
0.99/1.07	c # [type: int, range: [0,2147483647], default: 1000]
0.99/1.07	c heuristics/veclendiving/maxlpiterofs = 1500
0.99/1.07	c 
0.99/1.07	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 1]
0.99/1.07	c heuristics/zirounding/freq = -1
0.99/1.07	c 
0.99/1.07	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 0]
0.99/1.07	c separating/cmir/freq = -1
0.99/1.07	c 
0.99/1.07	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: 0]
0.99/1.07	c separating/flowcover/freq = -1
0.99/1.07	c 
0.99/1.07	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.99/1.07	c # [type: int, range: [-1,2147483647], default: -1]
0.99/1.07	c separating/rapidlearning/freq = 0
0.99/1.07	c 
0.99/1.07	c -----------------------------------------------------------------------------------------------
0.99/1.07	c start solving
0.99/1.07	c 
0.99/1.07	c SCIP Status        : problem is solved [infeasible]
0.99/1.07	c Solving Time (sec) : 1.07
0.99/1.07	c Solving Nodes      : 0
0.99/1.07	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
0.99/1.07	c Dual Bound         : -1.00000000000000e+20
0.99/1.07	c Gap                : infinite
0.99/1.07	s UNSATISFIABLE
0.99/1.07	c SCIP Status        : problem is solved [infeasible]
0.99/1.07	c Total Time         :       1.07
0.99/1.07	c   solving          :       1.07
0.99/1.07	c   presolving       :       0.87 (included in solving)
0.99/1.07	c   reading          :       0.16 (included in solving)
0.99/1.07	c Original Problem   :
0.99/1.07	c   Problem name     : HOME/instance-3739972-1338738284.opb
0.99/1.07	c   Variables        : 9150 (9150 binary, 0 integer, 0 implicit integer, 0 continuous)
0.99/1.07	c   Constraints      : 28514 initial, 28514 maximal
0.99/1.07	c Presolved Problem  :
0.99/1.07	c   Problem name     : t_HOME/instance-3739972-1338738284.opb
0.99/1.07	c   Variables        : 1550 (1550 binary, 0 integer, 0 implicit integer, 0 continuous)
0.99/1.07	c   Constraints      : 3938 initial, 3938 maximal
0.99/1.07	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons    AddCons   ChgSides   ChgCoefs
0.99/1.07	c   trivial          :       0.00        376          0          0          0          0          0          0          0          0
0.99/1.07	c   dualfix          :       0.01         59          0          0          0          0          0          0          0          0
0.99/1.07	c   boundshift       :       0.00          0          0          0          0          0          0          0          0          0
0.99/1.07	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0          0
0.99/1.07	c   pseudoobj        :       0.00          0          0          0          0          0          0          0          0          0
0.99/1.07	c   implics          :       0.01          0         92          0          0          0          0          0          0          0
0.99/1.07	c   probing          :       0.00          0          0          0          0          0          0          0          0          0
0.99/1.07	c   linear           :       0.83       5291       1782          0       5665          0      24576          0        153        129
0.99/1.07	c   root node        :          -          0          -          -          0          -          -          -          -          -
0.99/1.07	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS     #Check   #Resprop    Cutoffs    DomReds       Cuts      Conss   Children
0.99/1.07	c   integral         :          0          0          0          0          0          0          0          0          0          0          0          0
0.99/1.07	c   linear           :       3938          0          0          0          0          0          0          0          0          0          0          0
0.99/1.07	c   countsols        :          0          0          0          0          0          0          0          0          0          0          0          0
0.99/1.07	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS      Check    Resprop
0.99/1.07	c   integral         :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.99/1.07	c   linear           :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.99/1.07	c   countsols        :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.99/1.07	c Propagators        : #Propagate   #Resprop    Cutoffs    DomReds
0.99/1.07	c   pseudoobj        :          0          0          0          0
0.99/1.07	c   rootredcost      :          0          0          0          0
0.99/1.07	c   vbounds          :          0          0          0          0
0.99/1.07	c Propagator Timings :  TotalTime  Propagate    Resprop
0.99/1.07	c   pseudoobj        :       0.00       0.00       0.00
0.99/1.07	c   rootredcost      :       0.00       0.00       0.00
0.99/1.07	c   vbounds          :       0.00       0.00       0.00
0.99/1.07	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.99/1.07	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
0.99/1.07	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
0.99/1.07	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.99/1.07	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.99/1.07	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
0.99/1.07	c   applied globally :          -          -          -          0        0.0          -          -          -
0.99/1.07	c   applied locally  :          -          -          -          0        0.0          -          -          -
0.99/1.07	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.99/1.07	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
0.99/1.07	c   redcost          :       0.00          0          0          0          0          0
0.99/1.07	c   impliedbounds    :       0.00          0          0          0          0          0
0.99/1.07	c   intobj           :       0.00          0          0          0          0          0
0.99/1.07	c   gomory           :       0.00          0          0          0          0          0
0.99/1.07	c   cgmip            :       0.00          0          0          0          0          0
0.99/1.07	c   closecuts        :       0.00          0          0          0          0          0
0.99/1.07	c   strongcg         :       0.00          0          0          0          0          0
0.99/1.07	c   cmir             :       0.00          0          0          0          0          0
0.99/1.07	c   flowcover        :       0.00          0          0          0          0          0
0.99/1.07	c   clique           :       0.00          0          0          0          0          0
0.99/1.07	c   zerohalf         :       0.00          0          0          0          0          0
0.99/1.07	c   mcf              :       0.00          0          0          0          0          0
0.99/1.07	c   oddcycle         :       0.00          0          0          0          0          0
0.99/1.07	c   rapidlearning    :       0.00          0          0          0          0          0
0.99/1.07	c Pricers            :       Time      Calls       Vars
0.99/1.07	c   problem variables:       0.00          0          0
0.99/1.07	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.99/1.07	c   pscost           :       0.00          0          0          0          0          0          0
0.99/1.07	c   inference        :       0.00          0          0          0          0          0          0
0.99/1.07	c   mostinf          :       0.00          0          0          0          0          0          0
0.99/1.07	c   leastinf         :       0.00          0          0          0          0          0          0
0.99/1.07	c   fullstrong       :       0.00          0          0          0          0          0          0
0.99/1.07	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.99/1.07	c   random           :       0.00          0          0          0          0          0          0
0.99/1.07	c   relpscost        :       0.00          0          0          0          0          0          0
0.99/1.07	c Primal Heuristics  :       Time      Calls      Found
0.99/1.07	c   LP solutions     :       0.00          -          0
0.99/1.07	c   pseudo solutions :       0.00          -          0
0.99/1.07	c   trivial          :       0.01          1          0
0.99/1.07	c   shiftandpropagate:       0.00          0          0
0.99/1.07	c   simplerounding   :       0.00          0          0
0.99/1.07	c   zirounding       :       0.00          0          0
0.99/1.07	c   rounding         :       0.00          0          0
0.99/1.07	c   shifting         :       0.00          0          0
0.99/1.07	c   intshifting      :       0.00          0          0
0.99/1.07	c   oneopt           :       0.00          0          0
0.99/1.07	c   twoopt           :       0.00          0          0
0.99/1.07	c   fixandinfer      :       0.00          0          0
0.99/1.07	c   feaspump         :       0.00          0          0
0.99/1.07	c   clique           :       0.00          0          0
0.99/1.07	c   coefdiving       :       0.00          0          0
0.99/1.07	c   pscostdiving     :       0.00          0          0
0.99/1.07	c   fracdiving       :       0.00          0          0
0.99/1.07	c   veclendiving     :       0.00          0          0
0.99/1.07	c   intdiving        :       0.00          0          0
0.99/1.07	c   actconsdiving    :       0.00          0          0
0.99/1.07	c   objpscostdiving  :       0.00          0          0
0.99/1.07	c   rootsoldiving    :       0.00          0          0
0.99/1.07	c   linesearchdiving :       0.00          0          0
0.99/1.07	c   guideddiving     :       0.00          0          0
0.99/1.07	c   octane           :       0.00          0          0
0.99/1.07	c   rens             :       0.00          0          0
0.99/1.07	c   rins             :       0.00          0          0
0.99/1.07	c   localbranching   :       0.00          0          0
0.99/1.07	c   mutation         :       0.00          0          0
0.99/1.07	c   crossover        :       0.00          0          0
0.99/1.07	c   dins             :       0.00          0          0
0.99/1.07	c   vbounds          :       0.00          0          0
0.99/1.07	c   undercover       :       0.00          0          0
0.99/1.07	c   subnlp           :       0.00          0          0
0.99/1.07	c   trysol           :       0.00          0          0
0.99/1.07	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.99/1.07	c   primal LP        :       0.00          0          0       0.00          -
0.99/1.07	c   dual LP          :       0.00          0          0       0.00          -
0.99/1.07	c   lex dual LP      :       0.00          0          0       0.00          -
0.99/1.07	c   barrier LP       :       0.00          0          0       0.00          -
0.99/1.07	c   diving/probing LP:       0.00          0          0       0.00          -
0.99/1.07	c   strong branching :       0.00          0          0       0.00          -
0.99/1.07	c     (at root node) :          -          0          0       0.00          -
0.99/1.07	c   conflict analysis:       0.00          0          0       0.00          -
0.99/1.07	c B&B Tree           :
0.99/1.07	c   number of runs   :          1
0.99/1.07	c   nodes            :          0
0.99/1.07	c   nodes (total)    :          0
0.99/1.07	c   nodes left       :          1
0.99/1.07	c   max depth        :         -1
0.99/1.07	c   max depth (total):         -1
0.99/1.07	c   backtracks       :          0 (0.0%)
0.99/1.07	c   delayed cutoffs  :          0
0.99/1.07	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
0.99/1.07	c   avg switch length:       0.00
0.99/1.07	c   switching time   :       0.00
0.99/1.07	c Solution           :
0.99/1.07	c   Solutions found  :          0 (0 improvements)
0.99/1.07	c   Primal Bound     : infeasible
0.99/1.07	c   Dual Bound       :          -
0.99/1.07	c   Gap              :   infinite
0.99/1.07	c   Root Dual Bound  :          -
0.99/1.07	c   Root Iterations  :          0
1.09/1.11	c Time complete: 1.1.

Verifier Data 

ERROR: no interpretation found !

Watcher Data 

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-3739972-1338738284/watcher-3739972-1338738284 -o /tmp/evaluation-result-3739972-1338738284/solver-3739972-1338738284 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3739972-1338738284.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.07 2.05 2.00 2/176 16535
/proc/meminfo: memFree=26963044/32873648 swapFree=6860/6860
[pid=16535] ppid=16533 vsize=9588 CPUtime=0 cores=0,2,4,6
/proc/16535/stat : 16535 (scip-2.0.1.4b_2) R 16533 16535 13307 0 -1 4202496 1526 0 0 0 0 0 0 0 20 0 1 0 339954436 9818112 1481 33554432000 4194304 9016284 140733834944224 140737293353848 7875499 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/16535/statm: 2397 1483 311 1178 0 1215 0

[startup+0.0747279 s]
/proc/loadavg: 2.07 2.05 2.00 2/176 16535
/proc/meminfo: memFree=26963044/32873648 swapFree=6860/6860
[pid=16535] ppid=16533 vsize=23124 CPUtime=0.06 cores=0,2,4,6
/proc/16535/stat : 16535 (scip-2.0.1.4b_2) R 16533 16535 13307 0 -1 4202496 4776 0 0 0 6 0 0 0 20 0 1 0 339954436 23678976 4731 33554432000 4194304 9016284 140733834944224 140737293353848 7870483 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/16535/statm: 5781 4731 357 1178 0 4599 0
Current children cumulated CPU time (s) 0.06
Current children cumulated vsize (KiB) 23124

[startup+0.100221 s]
/proc/loadavg: 2.07 2.05 2.00 2/176 16535
/proc/meminfo: memFree=26963044/32873648 swapFree=6860/6860
[pid=16535] ppid=16533 vsize=24672 CPUtime=0.09 cores=0,2,4,6
/proc/16535/stat : 16535 (scip-2.0.1.4b_2) R 16533 16535 13307 0 -1 4202496 5161 0 0 0 9 0 0 0 20 0 1 0 339954436 25264128 5116 33554432000 4194304 9016284 140733834944224 140737293353848 7928096 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/16535/statm: 6168 5116 357 1178 0 4986 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 24672

[startup+0.300182 s]
/proc/loadavg: 2.07 2.05 2.00 2/176 16535
/proc/meminfo: memFree=26963044/32873648 swapFree=6860/6860
[pid=16535] ppid=16533 vsize=73780 CPUtime=0.29 cores=0,2,4,6
/proc/16535/stat : 16535 (scip-2.0.1.4b_2) R 16533 16535 13307 0 -1 4202496 17080 0 0 0 27 2 0 0 20 0 1 0 339954436 75550720 17035 33554432000 4194304 9016284 140733834944224 140737293353848 7824814 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/16535/statm: 18445 17038 484 1178 0 17263 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 73780

[startup+0.700173 s]
/proc/loadavg: 2.07 2.05 2.00 2/176 16535
/proc/meminfo: memFree=26963044/32873648 swapFree=6860/6860
[pid=16535] ppid=16533 vsize=106396 CPUtime=0.69 cores=0,2,4,6
/proc/16535/stat : 16535 (scip-2.0.1.4b_2) R 16533 16535 13307 0 -1 4202496 25148 0 0 0 66 3 0 0 20 0 1 0 339954436 108949504 25103 33554432000 4194304 9016284 140733834944224 140733834939528 4916910 0 0 4096 16384 0 0 0 17 0 0 0 0 0 0
/proc/16535/statm: 26599 25103 491 1178 0 25417 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 106396

Solver just ended. Dumping a history of the last processes samples

[startup+1.1066 s]
/proc/loadavg: 2.07 2.04 2.00 3/177 16536
/proc/meminfo: memFree=26859968/32873648 swapFree=6860/6860
[pid=16535] ppid=16533 vsize=81812 CPUtime=1.09 cores=0,2,4,6
/proc/16535/stat : 16535 (scip-2.0.1.4b_2) R 16533 16535 13307 0 -1 4202496 26712 0 0 0 106 3 0 0 20 0 1 0 339954436 83775488 19291 33554432000 4194304 9016284 140733834944224 140733834939896 6812620 0 0 4096 0 0 0 0 17 0 0 0 0 0 0
/proc/16535/statm: 20453 19291 530 1178 0 19271 0
Current children cumulated CPU time (s) 1.09
Current children cumulated vsize (KiB) 81812

Child status: 0
Real time (s): 1.11551
CPU time (s): 1.11483
CPU user time (s): 1.06984
CPU system time (s): 0.044993
CPU usage (%): 99.9389
Max. virtual memory (cumulated for all children) (KiB): 110532

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 1.06984
system time used= 0.044993
maximum resident set size= 105628
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 26722
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.002999 second user time and 0.010998 second system time

The end

Launcher Data 

Begin job on node116 at 2012-06-03 17:44:44
IDJOB=3739972
IDBENCH=75846
IDSOLVER=2329
FILE ID=node116/3739972-1338738284
RUNJOBID= node116-1338713903-13323
PBS_JOBID= 14636747
Free space on /tmp= 71020 MiB

SOLVER NAME= PB11: SCIP spx E_2 2011-06-10 (fixed)
BENCH NAME= PB10/normalized-PB10/DEC-SMALLINT-LIN/oliveras/j60/normalized-j601_8-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-3739972-1338738284/watcher-3739972-1338738284 -o /tmp/evaluation-result-3739972-1338738284/solver-3739972-1338738284 -C 1800 -W 1900 -M 15500  HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3739972-1338738284.opb -t 1800 -m 15500

TIME LIMIT= 1800 seconds
MEMORY LIMIT= 15500 MiB
NBCORE= 4

MD5SUM BENCH= 7f114e89a22e1f8645509e0e3ad06e41
RANDOM SEED=250884526

node116.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.556
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	: 5333.11
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.556
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	: 5331.91
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.556
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	: 5438.54
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.556
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.556
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	: 5331.92
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.556
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.92
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.556
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.90
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.556
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.91
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:       32873648 kB
MemFree:        26963044 kB
Buffers:          553572 kB
Cached:          4127692 kB
SwapCached:         3028 kB
Active:          2558572 kB
Inactive:        2437644 kB
Active(anon):     304748 kB
Inactive(anon):     8500 kB
Active(file):    2253824 kB
Inactive(file):  2429144 kB
Unevictable:        6860 kB
Mlocked:            6860 kB
SwapTotal:      67108856 kB
SwapFree:       67103480 kB
Dirty:             17340 kB
Writeback:             0 kB
AnonPages:        315468 kB
Mapped:            14560 kB
Shmem:                68 kB
Slab:             775804 kB
SReclaimable:     219612 kB
SUnreclaim:       556192 kB
KernelStack:        1472 kB
PageTables:         4436 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83545680 kB
Committed_AS:     429532 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      346400 kB
VmallocChunk:   34341988052 kB
HardwareCorrupted:     0 kB
AnonHugePages:    235520 kB
HugePages_Total:       0
HugePages_Free:        0
HugePages_Rsvd:        0
HugePages_Surp:        0
Hugepagesize:       2048 kB
DirectMap4k:        7680 kB
DirectMap2M:    33538048 kB

Free space on /tmp at the end= 71000 MiB
End job on node116 at 2012-06-03 17:44:45