Trace number 3739452

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 0.711891 0.713792

General information on the benchmark

Name/DEC-SMALLINT-LIN/oliveras/j30/
normalized-j3046_4-unsat.opb
MD5SUM194fc06f7c21580ad88e7dc6177066b4
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.012997
Has Objective FunctionNO
Satisfiable
(Un)Satisfiability was proved
Best value of the objective function
Optimality of the best value was proved
Number of variables3968
Total number of constraints13430
Number of constraints which are clauses13178
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints252
Minimum length of a constraint1
Maximum length of a constraint30
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 25
Number of bits of the biggest number in a constraint 5
Biggest sum of numbers in a constraint 187
Number of bits of the biggest sum of numbers8
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-3739452-1338735889.opb>
0.00/0.08	c original problem has 3968 variables (3968 bin, 0 int, 0 impl, 0 cont) and 13430 constraints
0.00/0.08	c problem read
0.00/0.08	c No objective function, only one solution is needed.
0.00/0.08	c presolving settings loaded
0.09/0.10	c presolving:
0.29/0.35	c (round 1) 1414 del vars, 3678 del conss, 0 add conss, 1043 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 598348 impls, 0 clqs
0.39/0.44	c (round 2) 2752 del vars, 8895 del conss, 0 add conss, 2237 chg bounds, 1 chg sides, 1 chg coeffs, 0 upgd conss, 606296 impls, 0 clqs
0.39/0.45	c (round 3) 3070 del vars, 10632 del conss, 0 add conss, 2401 chg bounds, 56 chg sides, 49 chg coeffs, 0 upgd conss, 608748 impls, 0 clqs
0.39/0.46	c (round 4) 3276 del vars, 11219 del conss, 0 add conss, 2524 chg bounds, 75 chg sides, 68 chg coeffs, 0 upgd conss, 611604 impls, 0 clqs
0.39/0.47	c (round 5) 3402 del vars, 11758 del conss, 0 add conss, 2607 chg bounds, 79 chg sides, 72 chg coeffs, 0 upgd conss, 613169 impls, 0 clqs
0.39/0.47	c (round 6) 3478 del vars, 11993 del conss, 0 add conss, 2664 chg bounds, 98 chg sides, 90 chg coeffs, 0 upgd conss, 613593 impls, 0 clqs
0.39/0.47	c (round 7) 3499 del vars, 12084 del conss, 0 add conss, 2669 chg bounds, 110 chg sides, 102 chg coeffs, 0 upgd conss, 613781 impls, 0 clqs
0.39/0.47	c (round 8) 3499 del vars, 12110 del conss, 0 add conss, 2669 chg bounds, 110 chg sides, 102 chg coeffs, 0 upgd conss, 613781 impls, 0 clqs
0.39/0.48	c (round 9) 3499 del vars, 12110 del conss, 0 add conss, 2669 chg bounds, 110 chg sides, 102 chg coeffs, 1320 upgd conss, 613781 impls, 0 clqs
0.39/0.49	c (round 10) 3499 del vars, 12110 del conss, 0 add conss, 2669 chg bounds, 150 chg sides, 302 chg coeffs, 1320 upgd conss, 614581 impls, 66 clqs
0.39/0.49	c (round 11) 3499 del vars, 12111 del conss, 0 add conss, 2669 chg bounds, 165 chg sides, 446 chg coeffs, 1320 upgd conss, 614673 impls, 83 clqs
0.49/0.50	c (round 12) 3499 del vars, 12112 del conss, 0 add conss, 2669 chg bounds, 167 chg sides, 497 chg coeffs, 1320 upgd conss, 614701 impls, 99 clqs
0.49/0.50	c (round 13) 3499 del vars, 12112 del conss, 0 add conss, 2669 chg bounds, 169 chg sides, 526 chg coeffs, 1320 upgd conss, 614729 impls, 111 clqs
0.49/0.50	c (round 14) 3499 del vars, 12112 del conss, 0 add conss, 2669 chg bounds, 169 chg sides, 533 chg coeffs, 1320 upgd conss, 614729 impls, 113 clqs
0.49/0.50	c (round 15) 3499 del vars, 12112 del conss, 0 add conss, 2669 chg bounds, 169 chg sides, 534 chg coeffs, 1320 upgd conss, 614729 impls, 113 clqs
0.49/0.51	c presolving (16 rounds):
0.49/0.51	c  3499 deleted vars, 12112 deleted constraints, 0 added constraints, 2669 tightened bounds, 0 added holes, 169 changed sides, 534 changed coefficients
0.49/0.51	c  614729 implications, 113 cliques
0.49/0.51	c presolved problem has 469 variables (469 bin, 0 int, 0 impl, 0 cont) and 1318 constraints
0.49/0.51	c     190 constraints of type <knapsack>
0.49/0.51	c     950 constraints of type <setppc>
0.49/0.51	c     178 constraints of type <logicor>
0.49/0.51	c transformed objective value is always integral (scale: 1)
0.49/0.51	c Presolving Time: 0.40
0.49/0.51	c - non default parameters ----------------------------------------------------------------------
0.49/0.51	c # SCIP version 2.0.1.5
0.49/0.51	c 
0.49/0.51	c # frequency for displaying node information lines
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 100]
0.49/0.51	c display/freq = 10000
0.49/0.51	c 
0.49/0.51	c # maximal time in seconds to run
0.49/0.51	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.51	c limits/time = 1797
0.49/0.51	c 
0.49/0.51	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.49/0.51	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.49/0.51	c limits/memory = 13950
0.49/0.51	c 
0.49/0.51	c # solving stops, if the given number of solutions were found (-1: no limit)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.51	c limits/solutions = 1
0.49/0.51	c 
0.49/0.51	c # maximal number of separation rounds per node (-1: unlimited)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 5]
0.49/0.51	c separating/maxrounds = 1
0.49/0.51	c 
0.49/0.51	c # maximal number of separation rounds in the root node (-1: unlimited)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.51	c separating/maxroundsroot = 5
0.49/0.51	c 
0.49/0.51	c # default clock type (1: CPU user seconds, 2: wall clock time)
0.49/0.51	c # [type: int, range: [1,2], default: 1]
0.49/0.51	c timing/clocktype = 2
0.49/0.51	c 
0.49/0.51	c # belongs reading time to solving time?
0.49/0.51	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.51	c timing/reading = TRUE
0.49/0.51	c 
0.49/0.51	c # should presolving try to simplify inequalities
0.49/0.51	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.51	c constraints/linear/simplifyinequalities = TRUE
0.49/0.51	c 
0.49/0.51	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.49/0.51	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.51	c constraints/indicator/addCouplingCons = TRUE
0.49/0.51	c 
0.49/0.51	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.49/0.51	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.49/0.51	c constraints/knapsack/disaggregation = FALSE
0.49/0.51	c 
0.49/0.51	c # should presolving try to simplify knapsacks
0.49/0.51	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.49/0.51	c constraints/knapsack/simplifyinequalities = TRUE
0.49/0.51	c 
0.49/0.51	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.51	c presolving/probing/maxrounds = 0
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.51	c heuristics/coefdiving/freq = -1
0.49/0.51	c 
0.49/0.51	c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.51	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.51	c heuristics/coefdiving/maxlpiterquot = 0.075
0.49/0.51	c 
0.49/0.51	c # additional number of allowed LP iterations
0.49/0.51	c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.51	c heuristics/coefdiving/maxlpiterofs = 1500
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 30]
0.49/0.51	c heuristics/crossover/freq = -1
0.49/0.51	c 
0.49/0.51	c # number of nodes added to the contingent of the total nodes
0.49/0.51	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.51	c heuristics/crossover/nodesofs = 750
0.49/0.51	c 
0.49/0.51	c # number of nodes without incumbent change that heuristic should wait
0.49/0.51	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.49/0.51	c heuristics/crossover/nwaitingnodes = 100
0.49/0.51	c 
0.49/0.51	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.49/0.51	c # [type: real, range: [0,1], default: 0.1]
0.49/0.51	c heuristics/crossover/nodesquot = 0.15
0.49/0.51	c 
0.49/0.51	c # minimum percentage of integer variables that have to be fixed 
0.49/0.51	c # [type: real, range: [0,1], default: 0.666]
0.49/0.51	c heuristics/crossover/minfixingrate = 0.5
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.51	c heuristics/feaspump/freq = -1
0.49/0.51	c 
0.49/0.51	c # additional number of allowed LP iterations
0.49/0.51	c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.51	c heuristics/feaspump/maxlpiterofs = 2000
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.51	c heuristics/fracdiving/freq = -1
0.49/0.51	c 
0.49/0.51	c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.51	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.51	c heuristics/fracdiving/maxlpiterquot = 0.075
0.49/0.51	c 
0.49/0.51	c # additional number of allowed LP iterations
0.49/0.51	c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.51	c heuristics/fracdiving/maxlpiterofs = 1500
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.51	c heuristics/guideddiving/freq = -1
0.49/0.51	c 
0.49/0.51	c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.51	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.51	c heuristics/guideddiving/maxlpiterquot = 0.075
0.49/0.51	c 
0.49/0.51	c # additional number of allowed LP iterations
0.49/0.51	c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.51	c heuristics/guideddiving/maxlpiterofs = 1500
0.49/0.51	c 
0.49/0.51	c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.51	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.51	c heuristics/intdiving/maxlpiterquot = 0.075
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.51	c heuristics/intshifting/freq = -1
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.51	c heuristics/linesearchdiving/freq = -1
0.49/0.51	c 
0.49/0.51	c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.51	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.51	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.49/0.51	c 
0.49/0.51	c # additional number of allowed LP iterations
0.49/0.51	c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.51	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.51	c heuristics/objpscostdiving/freq = -1
0.49/0.51	c 
0.49/0.51	c # maximal fraction of diving LP iterations compared to total iteration number
0.49/0.51	c # [type: real, range: [0,1], default: 0.01]
0.49/0.51	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.49/0.51	c 
0.49/0.51	c # additional number of allowed LP iterations
0.49/0.51	c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.51	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.51	c heuristics/oneopt/freq = -1
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.51	c heuristics/pscostdiving/freq = -1
0.49/0.51	c 
0.49/0.51	c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.51	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.51	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.49/0.51	c 
0.49/0.51	c # additional number of allowed LP iterations
0.49/0.51	c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.51	c heuristics/pscostdiving/maxlpiterofs = 1500
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.51	c heuristics/rens/freq = -1
0.49/0.51	c 
0.49/0.51	c # minimum percentage of integer variables that have to be fixable 
0.49/0.51	c # [type: real, range: [0,1], default: 0.5]
0.49/0.51	c heuristics/rens/minfixingrate = 0.3
0.49/0.51	c 
0.49/0.51	c # number of nodes added to the contingent of the total nodes
0.49/0.51	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.49/0.51	c heuristics/rens/nodesofs = 2000
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 20]
0.49/0.51	c heuristics/rootsoldiving/freq = -1
0.49/0.51	c 
0.49/0.51	c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.51	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.49/0.51	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.49/0.51	c 
0.49/0.51	c # additional number of allowed LP iterations
0.49/0.51	c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.51	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.51	c heuristics/rounding/freq = -1
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.51	c heuristics/shiftandpropagate/freq = -1
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.51	c heuristics/shifting/freq = -1
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.51	c heuristics/simplerounding/freq = -1
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.51	c heuristics/subnlp/freq = -1
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.51	c heuristics/trivial/freq = -1
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.51	c heuristics/trysol/freq = -1
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.51	c heuristics/undercover/freq = -1
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 10]
0.49/0.51	c heuristics/veclendiving/freq = -1
0.49/0.51	c 
0.49/0.51	c # maximal fraction of diving LP iterations compared to node LP iterations
0.49/0.51	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.49/0.51	c heuristics/veclendiving/maxlpiterquot = 0.075
0.49/0.51	c 
0.49/0.51	c # additional number of allowed LP iterations
0.49/0.51	c # [type: int, range: [0,2147483647], default: 1000]
0.49/0.51	c heuristics/veclendiving/maxlpiterofs = 1500
0.49/0.51	c 
0.49/0.51	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 1]
0.49/0.51	c heuristics/zirounding/freq = -1
0.49/0.51	c 
0.49/0.51	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.51	c separating/cmir/freq = -1
0.49/0.51	c 
0.49/0.51	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: 0]
0.49/0.51	c separating/flowcover/freq = -1
0.49/0.51	c 
0.49/0.51	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.49/0.51	c # [type: int, range: [-1,2147483647], default: -1]
0.49/0.51	c separating/rapidlearning/freq = 0
0.49/0.51	c 
0.49/0.51	c -----------------------------------------------------------------------------------------------
0.49/0.51	c start solving
0.49/0.51	c 
0.49/0.53	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.49/0.53	c   0.5s|     1 |     0 |   414 |     - |  15M|   0 | 192 | 469 |1318 | 469 |1318 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.59/0.68	c   0.7s|     1 |     0 |   425 |     - |  14M|   0 |   - | 469 |1318 | 469 |1318 |   0 |   0 |   0 |    cutoff    |      --      |   0.00%
0.59/0.68	c   0.7s|     1 |     0 |   425 |     - |  14M|   0 |   - | 469 |1318 | 469 |1318 |   0 |   0 |   0 |    cutoff    |      --      |   0.00%
0.59/0.68	c 
0.59/0.68	c SCIP Status        : problem is solved [infeasible]
0.59/0.68	c Solving Time (sec) : 0.68
0.59/0.68	c Solving Nodes      : 1
0.59/0.68	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
0.59/0.68	c Dual Bound         : +1.00000000000000e+20
0.59/0.68	c Gap                : 0.00 %
0.59/0.68	s UNSATISFIABLE
0.59/0.68	c SCIP Status        : problem is solved [infeasible]
0.59/0.68	c Total Time         :       0.68
0.59/0.68	c   solving          :       0.68
0.59/0.68	c   presolving       :       0.40 (included in solving)
0.59/0.68	c   reading          :       0.08 (included in solving)
0.59/0.68	c Original Problem   :
0.59/0.68	c   Problem name     : HOME/instance-3739452-1338735889.opb
0.59/0.68	c   Variables        : 3968 (3968 binary, 0 integer, 0 implicit integer, 0 continuous)
0.59/0.68	c   Constraints      : 13430 initial, 13430 maximal
0.59/0.68	c Presolved Problem  :
0.59/0.68	c   Problem name     : t_HOME/instance-3739452-1338735889.opb
0.59/0.68	c   Variables        : 469 (469 binary, 0 integer, 0 implicit integer, 0 continuous)
0.59/0.68	c   Constraints      : 1318 initial, 1318 maximal
0.59/0.68	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons    AddCons   ChgSides   ChgCoefs
0.59/0.68	c   trivial          :       0.00        124          0          0          0          0          0          0          0          0
0.59/0.68	c   dualfix          :       0.00         28          0          0          0          0          0          0          0          0
0.59/0.68	c   boundshift       :       0.00          0          0          0          0          0          0          0          0          0
0.59/0.68	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0          0
0.59/0.68	c   pseudoobj        :       0.00          0          0          0          0          0          0          0          0          0
0.59/0.68	c   implics          :       0.00          0         23          0          0          0          0          0          0          0
0.59/0.68	c   probing          :       0.00          0          0          0          0          0          0          0          0          0
0.59/0.68	c   knapsack         :       0.01          0          0          0          0          0          2          0         59        432
0.59/0.68	c   setppc           :       0.01          0          0          0          0          0          0          0          0          0
0.59/0.68	c   linear           :       0.36       2545        779          0       2669          0      12110          0        110        102
0.59/0.68	c   logicor          :       0.00          0          0          0          0          0          0          0          0          0
0.59/0.68	c   root node        :          -        408          -          -        408          -          -          -          -          -
0.59/0.68	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS     #Check   #Resprop    Cutoffs    DomReds       Cuts      Conss   Children
0.59/0.68	c   integral         :          0          0          0          0          0          1          0          0          0          0          0          0
0.59/0.68	c   knapsack         :        190          1          1          0          0          0          0          0          0        123          0          0
0.59/0.68	c   setppc           :        950          1          1          0          0          0          0          0          0          0          0          0
0.59/0.68	c   logicor          :        178          1          1          0          0          0          0          0          0          0          0          0
0.59/0.68	c   countsols        :          0          0          0          0          0          0          0          0          0          0          0          0
0.59/0.68	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS      Check    Resprop
0.59/0.68	c   integral         :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.59/0.68	c   knapsack         :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.59/0.68	c   setppc           :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.59/0.68	c   logicor          :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.59/0.68	c   countsols        :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.59/0.68	c Propagators        : #Propagate   #Resprop    Cutoffs    DomReds
0.59/0.68	c   vbounds          :          0          0          0          0
0.59/0.68	c   rootredcost      :          0          0          0          0
0.59/0.68	c   pseudoobj        :          0          0          0          0
0.59/0.68	c Propagator Timings :  TotalTime  Propagate    Resprop
0.59/0.68	c   vbounds          :       0.00       0.00       0.00
0.59/0.68	c   rootredcost      :       0.00       0.00       0.00
0.59/0.68	c   pseudoobj        :       0.00       0.00       0.00
0.59/0.68	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.59/0.68	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
0.59/0.68	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
0.59/0.68	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.59/0.68	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.59/0.68	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
0.59/0.68	c   applied globally :          -          -          -          0        0.0          -          -          -
0.59/0.68	c   applied locally  :          -          -          -          0        0.0          -          -          -
0.59/0.68	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.59/0.68	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 253)
0.59/0.68	c   redcost          :       0.00          1          0          0          0          0
0.59/0.68	c   impliedbounds    :       0.00          1          0          0         47          0
0.59/0.68	c   intobj           :       0.00          0          0          0          0          0
0.59/0.68	c   gomory           :       0.03          1          0          0        128          0
0.59/0.68	c   cgmip            :       0.00          0          0          0          0          0
0.59/0.68	c   closecuts        :       0.00          0          0          0          0          0
0.59/0.68	c   strongcg         :       0.03          1          0          0        500          0
0.59/0.68	c   cmir             :       0.00          0          0          0          0          0
0.59/0.68	c   flowcover        :       0.00          0          0          0          0          0
0.59/0.68	c   clique           :       0.01          1          0          0          6          0
0.59/0.68	c   zerohalf         :       0.00          0          0          0          0          0
0.59/0.68	c   mcf              :       0.00          1          0          0          0          0
0.59/0.68	c   oddcycle         :       0.00          0          0          0          0          0
0.59/0.68	c   rapidlearning    :       0.08          1          0        408          0          0
0.59/0.68	c Pricers            :       Time      Calls       Vars
0.59/0.68	c   problem variables:       0.00          0          0
0.59/0.68	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.59/0.68	c   pscost           :       0.00          0          0          0          0          0          0
0.59/0.68	c   inference        :       0.00          0          0          0          0          0          0
0.59/0.68	c   mostinf          :       0.00          0          0          0          0          0          0
0.59/0.68	c   leastinf         :       0.00          0          0          0          0          0          0
0.59/0.68	c   fullstrong       :       0.00          0          0          0          0          0          0
0.59/0.68	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.59/0.68	c   random           :       0.00          0          0          0          0          0          0
0.59/0.68	c   relpscost        :       0.00          0          0          0          0          0          0
0.59/0.68	c Primal Heuristics  :       Time      Calls      Found
0.59/0.68	c   LP solutions     :       0.00          -          0
0.59/0.68	c   pseudo solutions :       0.00          -          0
0.59/0.68	c   trivial          :       0.00          1          0
0.59/0.68	c   shiftandpropagate:       0.00          0          0
0.59/0.68	c   simplerounding   :       0.00          0          0
0.59/0.68	c   zirounding       :       0.00          0          0
0.59/0.68	c   rounding         :       0.00          0          0
0.59/0.68	c   shifting         :       0.00          0          0
0.59/0.68	c   intshifting      :       0.00          0          0
0.59/0.68	c   oneopt           :       0.00          0          0
0.59/0.68	c   twoopt           :       0.00          0          0
0.59/0.68	c   fixandinfer      :       0.00          0          0
0.59/0.68	c   feaspump         :       0.00          0          0
0.59/0.68	c   clique           :       0.00          0          0
0.59/0.68	c   coefdiving       :       0.00          0          0
0.59/0.68	c   pscostdiving     :       0.00          0          0
0.59/0.68	c   fracdiving       :       0.00          0          0
0.59/0.68	c   veclendiving     :       0.00          0          0
0.59/0.68	c   intdiving        :       0.00          0          0
0.59/0.68	c   actconsdiving    :       0.00          0          0
0.59/0.68	c   objpscostdiving  :       0.00          0          0
0.59/0.68	c   rootsoldiving    :       0.00          0          0
0.59/0.68	c   linesearchdiving :       0.00          0          0
0.59/0.68	c   guideddiving     :       0.00          0          0
0.59/0.68	c   octane           :       0.00          0          0
0.59/0.68	c   rens             :       0.00          0          0
0.59/0.68	c   rins             :       0.00          0          0
0.59/0.68	c   localbranching   :       0.00          0          0
0.59/0.68	c   mutation         :       0.00          0          0
0.59/0.68	c   crossover        :       0.00          0          0
0.59/0.68	c   dins             :       0.00          0          0
0.59/0.68	c   vbounds          :       0.00          0          0
0.59/0.68	c   undercover       :       0.00          0          0
0.59/0.68	c   subnlp           :       0.00          0          0
0.59/0.68	c   trysol           :       0.00          0          0
0.59/0.68	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.59/0.68	c   primal LP        :       0.00          0          0       0.00          -
0.59/0.68	c   dual LP          :       0.02          2        425     212.50   22912.29
0.59/0.68	c   lex dual LP      :       0.00          0          0       0.00          -
0.59/0.68	c   barrier LP       :       0.00          0          0       0.00          -
0.59/0.68	c   diving/probing LP:       0.00          0          0       0.00          -
0.59/0.68	c   strong branching :       0.00          0          0       0.00          -
0.59/0.68	c     (at root node) :          -          0          0       0.00          -
0.59/0.68	c   conflict analysis:       0.00          0          0       0.00          -
0.59/0.68	c B&B Tree           :
0.59/0.68	c   number of runs   :          1
0.59/0.68	c   nodes            :          1
0.59/0.68	c   nodes (total)    :          1
0.59/0.68	c   nodes left       :          0
0.59/0.68	c   max depth        :          0
0.59/0.68	c   max depth (total):          0
0.59/0.68	c   backtracks       :          0 (0.0%)
0.59/0.68	c   delayed cutoffs  :          0
0.59/0.68	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
0.59/0.68	c   avg switch length:       2.00
0.59/0.68	c   switching time   :       0.00
0.59/0.68	c Solution           :
0.59/0.68	c   Solutions found  :          0 (0 improvements)
0.59/0.68	c   Primal Bound     : infeasible
0.59/0.68	c   Dual Bound       :          -
0.59/0.68	c   Gap              :       0.00 %
0.59/0.68	c   Root Dual Bound  :          -
0.59/0.68	c   Root Iterations  :        425
0.69/0.71	c Time complete: 0.7.

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-3739452-1338735889/watcher-3739452-1338735889 -o /tmp/evaluation-result-3739452-1338735889/solver-3739452-1338735889 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3739452-1338735889.opb -t 1800 -m 15500 

running on 4 cores: 1,3,5,7

Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 1800 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 1830 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 1900 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 15872000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 15923200 KiB
Current StackSize limit: 10240 KiB


[startup+0 s]
/proc/loadavg: 1.99 1.98 1.99 4/174 32639
/proc/meminfo: memFree=28229440/32873852 swapFree=7624/7624
[pid=32639] ppid=32637 vsize=9588 CPUtime=0 cores=1,3,5,7
/proc/32639/stat : 32639 (scip-2.0.1.4b_2) R 32637 32639 29314 0 -1 4202496 1514 0 0 0 0 0 0 0 20 0 1 0 339714330 9818112 1468 33554432000 4194304 9016284 140734403733888 140736186364200 7875499 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/32639/statm: 2397 1468 311 1178 0 1215 0

[startup+0.095536 s]
/proc/loadavg: 1.99 1.98 1.99 4/174 32639
/proc/meminfo: memFree=28229440/32873852 swapFree=7624/7624
[pid=32639] ppid=32637 vsize=32716 CPUtime=0.08 cores=1,3,5,7
/proc/32639/stat : 32639 (scip-2.0.1.4b_2) R 32637 32639 29314 0 -1 4202496 7104 0 0 0 7 1 0 0 20 0 1 0 339714330 33501184 7058 33554432000 4194304 9016284 140734403733888 140736186364200 4319583 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/32639/statm: 8179 7059 404 1178 0 6997 0
Current children cumulated CPU time (s) 0.08
Current children cumulated vsize (KiB) 32716

[startup+0.100414 s]
/proc/loadavg: 1.99 1.98 1.99 4/174 32639
/proc/meminfo: memFree=28229440/32873852 swapFree=7624/7624
[pid=32639] ppid=32637 vsize=35276 CPUtime=0.09 cores=1,3,5,7
/proc/32639/stat : 32639 (scip-2.0.1.4b_2) R 32637 32639 29314 0 -1 4202496 7748 0 0 0 8 1 0 0 20 0 1 0 339714330 36122624 7702 33554432000 4194304 9016284 140734403733888 140736186364200 5146864 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/32639/statm: 8819 7712 411 1178 0 7637 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 35276

[startup+0.300296 s]
/proc/loadavg: 1.99 1.98 1.99 4/174 32639
/proc/meminfo: memFree=28229440/32873852 swapFree=7624/7624
[pid=32639] ppid=32637 vsize=57324 CPUtime=0.29 cores=1,3,5,7
/proc/32639/stat : 32639 (scip-2.0.1.4b_2) R 32637 32639 29314 0 -1 4202496 13016 0 0 0 27 2 0 0 20 0 1 0 339714330 58699776 12970 33554432000 4194304 9016284 140734403733888 140736186364200 6479349 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/32639/statm: 14331 12970 491 1178 0 13149 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 57324

[startup+0.700222 s]
/proc/loadavg: 1.99 1.98 1.99 4/174 32639
/proc/meminfo: memFree=28229440/32873852 swapFree=7624/7624
[pid=32639] ppid=32637 vsize=59572 CPUtime=0.69 cores=1,3,5,7
/proc/32639/stat : 32639 (scip-2.0.1.4b_2) R 32637 32639 29314 0 -1 4202496 18924 0 0 0 66 3 0 0 20 0 1 0 339714330 61001728 14054 33554432000 4194304 9016284 140734403733888 140734403729560 6812620 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/32639/statm: 14893 14054 688 1178 0 13711 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 59572

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

Child status: 0
Real time (s): 0.713792
CPU time (s): 0.711891
CPU user time (s): 0.672897
CPU system time (s): 0.038994
CPU usage (%): 99.7337
Max. virtual memory (cumulated for all children) (KiB): 63748

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.672897
system time used= 0.038994
maximum resident set size= 74284
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 18929
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= 2

runsolver used 0.003999 second user time and 0.005999 second system time

The end

Launcher Data 

Begin job on node131 at 2012-06-03 17:04:49
IDJOB=3739452
IDBENCH=72884
IDSOLVER=2329
FILE ID=node131/3739452-1338735889
RUNJOBID= node131-1338713677-29331
PBS_JOBID= 14636738
Free space on /tmp= 71388 MiB

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

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

MD5SUM BENCH= 194fc06f7c21580ad88e7dc6177066b4
RANDOM SEED=1523219772

node131.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.805
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.61
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.805
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.805
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.91
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.805
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.805
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.91
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.805
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.805
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.92
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.805
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:       32873852 kB
MemFree:        28229068 kB
Buffers:          560784 kB
Cached:          3095760 kB
SwapCached:         2348 kB
Active:          1565948 kB
Inactive:        2207528 kB
Active(anon):     112744 kB
Inactive(anon):     3664 kB
Active(file):    1453204 kB
Inactive(file):  2203864 kB
Unevictable:        7624 kB
Mlocked:            7624 kB
SwapTotal:      67108856 kB
SwapFree:       67099088 kB
Dirty:             17204 kB
Writeback:             0 kB
AnonPages:        124740 kB
Mapped:            17240 kB
Shmem:                 0 kB
Slab:             729256 kB
SReclaimable:     171148 kB
SUnreclaim:       558108 kB
KernelStack:        1424 kB
PageTables:         4308 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83545780 kB
Committed_AS:     239764 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      346360 kB
VmallocChunk:   34341988004 kB
HardwareCorrupted:     0 kB
AnonHugePages:     86016 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= 71372 MiB
End job on node131 at 2012-06-03 17:04:50