Trace number 3739881

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 3.2595 3.26141

General information on the benchmark

Name/DEC-SMALLINT-LIN/oliveras/j90/
normalized-j9038_3-unsat.opb
MD5SUM1db80fe15b68bee40f16b4e3f4788f73
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.042993
Has Objective FunctionNO
Satisfiable
(Un)Satisfiability was proved
Best value of the objective function
Optimality of the best value was proved
Number of variables16198
Total number of constraints55731
Number of constraints which are clauses55379
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints352
Minimum length of a constraint1
Maximum length of a constraint54
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 33
Number of bits of the biggest number in a constraint 6
Biggest sum of numbers in a constraint 331
Number of bits of the biggest sum of numbers9
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-3739881-1338737980.opb>
0.29/0.32	c original problem has 16198 variables (16198 bin, 0 int, 0 impl, 0 cont) and 55731 constraints
0.29/0.32	c problem read
0.29/0.32	c No objective function, only one solution is needed.
0.29/0.32	c presolving settings loaded
0.38/0.44	c presolving:
1.59/1.66	c (round 1) 5967 del vars, 17051 del conss, 0 add conss, 4727 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2760512 impls, 0 clqs
2.09/2.11	c (round 2) 10635 del vars, 36202 del conss, 0 add conss, 9007 chg bounds, 0 chg sides, 0 chg coeffs, 0 upgd conss, 2791185 impls, 0 clqs
2.09/2.18	c (round 3) 12081 del vars, 42941 del conss, 0 add conss, 9942 chg bounds, 45 chg sides, 38 chg coeffs, 0 upgd conss, 2801314 impls, 0 clqs
2.19/2.22	c (round 4) 13157 del vars, 46667 del conss, 0 add conss, 10746 chg bounds, 82 chg sides, 63 chg coeffs, 0 upgd conss, 2811143 impls, 0 clqs
2.19/2.24	c (round 5) 13730 del vars, 48793 del conss, 0 add conss, 11122 chg bounds, 93 chg sides, 76 chg coeffs, 0 upgd conss, 2816830 impls, 0 clqs
2.19/2.26	c (round 6) 14018 del vars, 49827 del conss, 0 add conss, 11336 chg bounds, 101 chg sides, 85 chg coeffs, 0 upgd conss, 2819178 impls, 0 clqs
2.19/2.26	c (round 7) 14199 del vars, 50392 del conss, 0 add conss, 11441 chg bounds, 122 chg sides, 111 chg coeffs, 0 upgd conss, 2821870 impls, 3 clqs
2.19/2.27	c (round 8) 14330 del vars, 50730 del conss, 0 add conss, 11495 chg bounds, 154 chg sides, 139 chg coeffs, 0 upgd conss, 2827832 impls, 4 clqs
2.19/2.28	c (round 9) 14379 del vars, 50923 del conss, 0 add conss, 11518 chg bounds, 159 chg sides, 143 chg coeffs, 0 upgd conss, 2828660 impls, 4 clqs
2.19/2.28	c (round 10) 14402 del vars, 51020 del conss, 0 add conss, 11531 chg bounds, 169 chg sides, 152 chg coeffs, 0 upgd conss, 2829659 impls, 2 clqs
2.19/2.28	c (round 11) 14423 del vars, 51075 del conss, 0 add conss, 11540 chg bounds, 174 chg sides, 158 chg coeffs, 0 upgd conss, 2829778 impls, 2 clqs
2.19/2.28	c (round 12) 14427 del vars, 51110 del conss, 0 add conss, 11542 chg bounds, 176 chg sides, 160 chg coeffs, 0 upgd conss, 2829798 impls, 2 clqs
2.19/2.29	c (round 13) 14429 del vars, 51118 del conss, 0 add conss, 11542 chg bounds, 176 chg sides, 160 chg coeffs, 0 upgd conss, 2829824 impls, 2 clqs
2.19/2.29	c (round 14) 14429 del vars, 51120 del conss, 0 add conss, 11542 chg bounds, 176 chg sides, 160 chg coeffs, 0 upgd conss, 2829824 impls, 2 clqs
2.29/2.31	c (round 15) 14429 del vars, 51132 del conss, 0 add conss, 11542 chg bounds, 176 chg sides, 160 chg coeffs, 4599 upgd conss, 2829824 impls, 2 clqs
2.29/2.33	c (round 16) 14478 del vars, 51194 del conss, 0 add conss, 11547 chg bounds, 209 chg sides, 288 chg coeffs, 4599 upgd conss, 2831238 impls, 75 clqs
2.29/2.34	c (round 17) 14499 del vars, 51275 del conss, 0 add conss, 11547 chg bounds, 220 chg sides, 362 chg coeffs, 4599 upgd conss, 2832102 impls, 101 clqs
2.29/2.34	c (round 18) 14523 del vars, 51305 del conss, 0 add conss, 11552 chg bounds, 222 chg sides, 402 chg coeffs, 4599 upgd conss, 2833031 impls, 105 clqs
2.29/2.35	c (round 19) 14529 del vars, 51348 del conss, 0 add conss, 11552 chg bounds, 231 chg sides, 454 chg coeffs, 4599 upgd conss, 2833281 impls, 110 clqs
2.29/2.36	c (round 20) 14529 del vars, 51349 del conss, 0 add conss, 11552 chg bounds, 236 chg sides, 493 chg coeffs, 4599 upgd conss, 2833281 impls, 114 clqs
2.29/2.37	c (round 21) 14529 del vars, 51354 del conss, 0 add conss, 11552 chg bounds, 236 chg sides, 506 chg coeffs, 4599 upgd conss, 2833281 impls, 117 clqs
2.29/2.37	c presolving (22 rounds):
2.29/2.37	c  14529 deleted vars, 51354 deleted constraints, 0 added constraints, 11552 tightened bounds, 0 added holes, 236 changed sides, 513 changed coefficients
2.29/2.37	c  2833281 implications, 118 cliques
2.29/2.37	c presolved problem has 1669 variables (1669 bin, 0 int, 0 impl, 0 cont) and 4377 constraints
2.29/2.37	c     223 constraints of type <knapsack>
2.29/2.37	c    3388 constraints of type <setppc>
2.29/2.37	c     766 constraints of type <logicor>
2.29/2.37	c transformed objective value is always integral (scale: 1)
2.29/2.37	c Presolving Time: 1.97
2.29/2.37	c - non default parameters ----------------------------------------------------------------------
2.29/2.37	c # SCIP version 2.0.1.5
2.29/2.37	c 
2.29/2.37	c # frequency for displaying node information lines
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 100]
2.29/2.37	c display/freq = 10000
2.29/2.37	c 
2.29/2.37	c # maximal time in seconds to run
2.29/2.37	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.29/2.37	c limits/time = 1797
2.29/2.37	c 
2.29/2.37	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
2.29/2.37	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
2.29/2.37	c limits/memory = 13950
2.29/2.37	c 
2.29/2.37	c # solving stops, if the given number of solutions were found (-1: no limit)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: -1]
2.29/2.37	c limits/solutions = 1
2.29/2.37	c 
2.29/2.37	c # maximal number of separation rounds per node (-1: unlimited)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 5]
2.29/2.37	c separating/maxrounds = 1
2.29/2.37	c 
2.29/2.37	c # maximal number of separation rounds in the root node (-1: unlimited)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: -1]
2.29/2.37	c separating/maxroundsroot = 5
2.29/2.37	c 
2.29/2.37	c # default clock type (1: CPU user seconds, 2: wall clock time)
2.29/2.37	c # [type: int, range: [1,2], default: 1]
2.29/2.37	c timing/clocktype = 2
2.29/2.37	c 
2.29/2.37	c # belongs reading time to solving time?
2.29/2.37	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.29/2.37	c timing/reading = TRUE
2.29/2.37	c 
2.29/2.37	c # should presolving try to simplify inequalities
2.29/2.37	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.29/2.37	c constraints/linear/simplifyinequalities = TRUE
2.29/2.37	c 
2.29/2.37	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
2.29/2.37	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.29/2.37	c constraints/indicator/addCouplingCons = TRUE
2.29/2.37	c 
2.29/2.37	c # should disaggregation of knapsack constraints be allowed in preprocessing?
2.29/2.37	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
2.29/2.37	c constraints/knapsack/disaggregation = FALSE
2.29/2.37	c 
2.29/2.37	c # should presolving try to simplify knapsacks
2.29/2.37	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
2.29/2.37	c constraints/knapsack/simplifyinequalities = TRUE
2.29/2.37	c 
2.29/2.37	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: -1]
2.29/2.37	c presolving/probing/maxrounds = 0
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 10]
2.29/2.37	c heuristics/coefdiving/freq = -1
2.29/2.37	c 
2.29/2.37	c # maximal fraction of diving LP iterations compared to node LP iterations
2.29/2.37	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.29/2.37	c heuristics/coefdiving/maxlpiterquot = 0.075
2.29/2.37	c 
2.29/2.37	c # additional number of allowed LP iterations
2.29/2.37	c # [type: int, range: [0,2147483647], default: 1000]
2.29/2.37	c heuristics/coefdiving/maxlpiterofs = 1500
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 30]
2.29/2.37	c heuristics/crossover/freq = -1
2.29/2.37	c 
2.29/2.37	c # number of nodes added to the contingent of the total nodes
2.29/2.37	c # [type: longint, range: [0,9223372036854775807], default: 500]
2.29/2.37	c heuristics/crossover/nodesofs = 750
2.29/2.37	c 
2.29/2.37	c # number of nodes without incumbent change that heuristic should wait
2.29/2.37	c # [type: longint, range: [0,9223372036854775807], default: 200]
2.29/2.37	c heuristics/crossover/nwaitingnodes = 100
2.29/2.37	c 
2.29/2.37	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
2.29/2.37	c # [type: real, range: [0,1], default: 0.1]
2.29/2.37	c heuristics/crossover/nodesquot = 0.15
2.29/2.37	c 
2.29/2.37	c # minimum percentage of integer variables that have to be fixed 
2.29/2.37	c # [type: real, range: [0,1], default: 0.666]
2.29/2.37	c heuristics/crossover/minfixingrate = 0.5
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 20]
2.29/2.37	c heuristics/feaspump/freq = -1
2.29/2.37	c 
2.29/2.37	c # additional number of allowed LP iterations
2.29/2.37	c # [type: int, range: [0,2147483647], default: 1000]
2.29/2.37	c heuristics/feaspump/maxlpiterofs = 2000
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 10]
2.29/2.37	c heuristics/fracdiving/freq = -1
2.29/2.37	c 
2.29/2.37	c # maximal fraction of diving LP iterations compared to node LP iterations
2.29/2.37	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.29/2.37	c heuristics/fracdiving/maxlpiterquot = 0.075
2.29/2.37	c 
2.29/2.37	c # additional number of allowed LP iterations
2.29/2.37	c # [type: int, range: [0,2147483647], default: 1000]
2.29/2.37	c heuristics/fracdiving/maxlpiterofs = 1500
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 10]
2.29/2.37	c heuristics/guideddiving/freq = -1
2.29/2.37	c 
2.29/2.37	c # maximal fraction of diving LP iterations compared to node LP iterations
2.29/2.37	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.29/2.37	c heuristics/guideddiving/maxlpiterquot = 0.075
2.29/2.37	c 
2.29/2.37	c # additional number of allowed LP iterations
2.29/2.37	c # [type: int, range: [0,2147483647], default: 1000]
2.29/2.37	c heuristics/guideddiving/maxlpiterofs = 1500
2.29/2.37	c 
2.29/2.37	c # maximal fraction of diving LP iterations compared to node LP iterations
2.29/2.37	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.29/2.37	c heuristics/intdiving/maxlpiterquot = 0.075
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 10]
2.29/2.37	c heuristics/intshifting/freq = -1
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 10]
2.29/2.37	c heuristics/linesearchdiving/freq = -1
2.29/2.37	c 
2.29/2.37	c # maximal fraction of diving LP iterations compared to node LP iterations
2.29/2.37	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.29/2.37	c heuristics/linesearchdiving/maxlpiterquot = 0.075
2.29/2.37	c 
2.29/2.37	c # additional number of allowed LP iterations
2.29/2.37	c # [type: int, range: [0,2147483647], default: 1000]
2.29/2.37	c heuristics/linesearchdiving/maxlpiterofs = 1500
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 20]
2.29/2.37	c heuristics/objpscostdiving/freq = -1
2.29/2.37	c 
2.29/2.37	c # maximal fraction of diving LP iterations compared to total iteration number
2.29/2.37	c # [type: real, range: [0,1], default: 0.01]
2.29/2.37	c heuristics/objpscostdiving/maxlpiterquot = 0.015
2.29/2.37	c 
2.29/2.37	c # additional number of allowed LP iterations
2.29/2.37	c # [type: int, range: [0,2147483647], default: 1000]
2.29/2.37	c heuristics/objpscostdiving/maxlpiterofs = 1500
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 1]
2.29/2.37	c heuristics/oneopt/freq = -1
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 10]
2.29/2.37	c heuristics/pscostdiving/freq = -1
2.29/2.37	c 
2.29/2.37	c # maximal fraction of diving LP iterations compared to node LP iterations
2.29/2.37	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.29/2.37	c heuristics/pscostdiving/maxlpiterquot = 0.075
2.29/2.37	c 
2.29/2.37	c # additional number of allowed LP iterations
2.29/2.37	c # [type: int, range: [0,2147483647], default: 1000]
2.29/2.37	c heuristics/pscostdiving/maxlpiterofs = 1500
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 0]
2.29/2.37	c heuristics/rens/freq = -1
2.29/2.37	c 
2.29/2.37	c # minimum percentage of integer variables that have to be fixable 
2.29/2.37	c # [type: real, range: [0,1], default: 0.5]
2.29/2.37	c heuristics/rens/minfixingrate = 0.3
2.29/2.37	c 
2.29/2.37	c # number of nodes added to the contingent of the total nodes
2.29/2.37	c # [type: longint, range: [0,9223372036854775807], default: 500]
2.29/2.37	c heuristics/rens/nodesofs = 2000
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 20]
2.29/2.37	c heuristics/rootsoldiving/freq = -1
2.29/2.37	c 
2.29/2.37	c # maximal fraction of diving LP iterations compared to node LP iterations
2.29/2.37	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
2.29/2.37	c heuristics/rootsoldiving/maxlpiterquot = 0.015
2.29/2.37	c 
2.29/2.37	c # additional number of allowed LP iterations
2.29/2.37	c # [type: int, range: [0,2147483647], default: 1000]
2.29/2.37	c heuristics/rootsoldiving/maxlpiterofs = 1500
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 1]
2.29/2.37	c heuristics/rounding/freq = -1
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 0]
2.29/2.37	c heuristics/shiftandpropagate/freq = -1
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 10]
2.29/2.37	c heuristics/shifting/freq = -1
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 1]
2.29/2.37	c heuristics/simplerounding/freq = -1
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 1]
2.29/2.37	c heuristics/subnlp/freq = -1
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 0]
2.29/2.37	c heuristics/trivial/freq = -1
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 1]
2.29/2.37	c heuristics/trysol/freq = -1
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 0]
2.29/2.37	c heuristics/undercover/freq = -1
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 10]
2.29/2.37	c heuristics/veclendiving/freq = -1
2.29/2.37	c 
2.29/2.37	c # maximal fraction of diving LP iterations compared to node LP iterations
2.29/2.37	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
2.29/2.37	c heuristics/veclendiving/maxlpiterquot = 0.075
2.29/2.37	c 
2.29/2.37	c # additional number of allowed LP iterations
2.29/2.37	c # [type: int, range: [0,2147483647], default: 1000]
2.29/2.37	c heuristics/veclendiving/maxlpiterofs = 1500
2.29/2.37	c 
2.29/2.37	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 1]
2.29/2.37	c heuristics/zirounding/freq = -1
2.29/2.37	c 
2.29/2.37	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 0]
2.29/2.37	c separating/cmir/freq = -1
2.29/2.37	c 
2.29/2.37	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: 0]
2.29/2.37	c separating/flowcover/freq = -1
2.29/2.37	c 
2.29/2.37	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
2.29/2.37	c # [type: int, range: [-1,2147483647], default: -1]
2.29/2.37	c separating/rapidlearning/freq = 0
2.29/2.37	c 
2.29/2.37	c -----------------------------------------------------------------------------------------------
2.29/2.37	c start solving
2.29/2.37	c 
2.49/2.56	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
2.49/2.56	c   2.6s|     1 |     0 |  1780 |     - |  61M|   0 | 421 |1669 |4377 |1669 |4339 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
3.09/3.18	c   3.2s|     1 |     0 |  1925 |     - |  58M|   0 |   - |1669 |4377 |1669 |4339 |   0 |   0 |   0 |    cutoff    |      --      |   0.00%
3.09/3.18	c   3.2s|     1 |     0 |  1925 |     - |  58M|   0 |   - |1669 |4377 |1669 |4339 |   0 |   0 |   0 |    cutoff    |      --      |   0.00%
3.09/3.18	c 
3.09/3.18	c SCIP Status        : problem is solved [infeasible]
3.09/3.18	c Solving Time (sec) : 3.18
3.09/3.18	c Solving Nodes      : 1
3.09/3.18	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
3.09/3.18	c Dual Bound         : +1.00000000000000e+20
3.09/3.18	c Gap                : 0.00 %
3.09/3.18	s UNSATISFIABLE
3.09/3.18	c SCIP Status        : problem is solved [infeasible]
3.09/3.18	c Total Time         :       3.18
3.09/3.18	c   solving          :       3.18
3.09/3.18	c   presolving       :       1.97 (included in solving)
3.09/3.18	c   reading          :       0.31 (included in solving)
3.09/3.18	c Original Problem   :
3.09/3.18	c   Problem name     : HOME/instance-3739881-1338737980.opb
3.09/3.18	c   Variables        : 16198 (16198 binary, 0 integer, 0 implicit integer, 0 continuous)
3.09/3.18	c   Constraints      : 55731 initial, 55731 maximal
3.09/3.18	c Presolved Problem  :
3.09/3.18	c   Problem name     : t_HOME/instance-3739881-1338737980.opb
3.09/3.18	c   Variables        : 1669 (1669 binary, 0 integer, 0 implicit integer, 0 continuous)
3.09/3.18	c   Constraints      : 4377 initial, 4377 maximal
3.09/3.18	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons    AddCons   ChgSides   ChgCoefs
3.09/3.18	c   trivial          :       0.01        374          0          0          0          0          0          0          0          0
3.09/3.18	c   dualfix          :       0.01         97          0          0          0          0          0          0          0          0
3.09/3.18	c   boundshift       :       0.00          0          0          0          0          0          0          0          0          0
3.09/3.18	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0          0
3.09/3.18	c   pseudoobj        :       0.00          0          0          0          0          0          0          0          0          0
3.09/3.18	c   implics          :       0.03          0        129          0          0          0          0          0          0          0
3.09/3.18	c   probing          :       0.00          0          0          0          0          0          0          0          0          0
3.09/3.18	c   knapsack         :       0.03         17          0          0          0          0          1          0         60        353
3.09/3.18	c   setppc           :       0.01         30          0          0          5          0        217          0          0          0
3.09/3.18	c   linear           :       1.78      11183       2699          0      11542          0      51132          0        176        160
3.09/3.18	c   logicor          :       0.02          0          0          0          5          0          4          0          0          0
3.09/3.18	c   root node        :          -        705          -          -        705          -          -          -          -          -
3.09/3.18	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS     #Check   #Resprop    Cutoffs    DomReds       Cuts      Conss   Children
3.09/3.18	c   integral         :          0          0          0          0          0          1          0          0          0          0          0          0
3.09/3.18	c   knapsack         :        223          1          1          0          0          0          0          0          0         99          0          0
3.09/3.18	c   setppc           :       3388          1          1          0          0          0          0          0          0          0          0          0
3.09/3.18	c   logicor          :        766          1          1          0          0          0          0          0          0          0          0          0
3.09/3.18	c   countsols        :          0          0          0          0          0          0          0          0          0          0          0          0
3.09/3.18	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS      Check    Resprop
3.09/3.18	c   integral         :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
3.09/3.18	c   knapsack         :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
3.09/3.18	c   setppc           :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
3.09/3.18	c   logicor          :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
3.09/3.18	c   countsols        :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
3.09/3.18	c Propagators        : #Propagate   #Resprop    Cutoffs    DomReds
3.09/3.18	c   vbounds          :          0          0          0          0
3.09/3.18	c   rootredcost      :          0          0          0          0
3.09/3.18	c   pseudoobj        :          0          0          0          0
3.09/3.18	c Propagator Timings :  TotalTime  Propagate    Resprop
3.09/3.18	c   vbounds          :       0.00       0.00       0.00
3.09/3.18	c   rootredcost      :       0.00       0.00       0.00
3.09/3.18	c   pseudoobj        :       0.00       0.00       0.00
3.09/3.18	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
3.09/3.18	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
3.09/3.18	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
3.09/3.18	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
3.09/3.18	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
3.09/3.18	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
3.09/3.18	c   applied globally :          -          -          -          0        0.0          -          -          -
3.09/3.18	c   applied locally  :          -          -          -          0        0.0          -          -          -
3.09/3.18	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
3.09/3.18	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 197)
3.09/3.18	c   redcost          :       0.00          1          0          0          0          0
3.09/3.18	c   impliedbounds    :       0.00          1          0          0          7          0
3.09/3.18	c   intobj           :       0.00          0          0          0          0          0
3.09/3.18	c   gomory           :       0.16          1          0          0         43          0
3.09/3.18	c   cgmip            :       0.00          0          0          0          0          0
3.09/3.18	c   closecuts        :       0.00          0          0          0          0          0
3.09/3.18	c   strongcg         :       0.07          1          0          0        500          0
3.09/3.18	c   cmir             :       0.00          0          0          0          0          0
3.09/3.18	c   flowcover        :       0.00          0          0          0          0          0
3.09/3.18	c   clique           :       0.03          1          0          0          7          0
3.09/3.18	c   zerohalf         :       0.00          0          0          0          0          0
3.09/3.18	c   mcf              :       0.01          1          0          0          0          0
3.09/3.18	c   oddcycle         :       0.00          0          0          0          0          0
3.09/3.18	c   rapidlearning    :       0.34          1          0        705          0          0
3.09/3.18	c Pricers            :       Time      Calls       Vars
3.09/3.18	c   problem variables:       0.00          0          0
3.09/3.18	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
3.09/3.18	c   pscost           :       0.00          0          0          0          0          0          0
3.09/3.18	c   inference        :       0.00          0          0          0          0          0          0
3.09/3.18	c   mostinf          :       0.00          0          0          0          0          0          0
3.09/3.18	c   leastinf         :       0.00          0          0          0          0          0          0
3.09/3.18	c   fullstrong       :       0.00          0          0          0          0          0          0
3.09/3.18	c   allfullstrong    :       0.00          0          0          0          0          0          0
3.09/3.18	c   random           :       0.00          0          0          0          0          0          0
3.09/3.18	c   relpscost        :       0.00          0          0          0          0          0          0
3.09/3.18	c Primal Heuristics  :       Time      Calls      Found
3.09/3.18	c   LP solutions     :       0.00          -          0
3.09/3.18	c   pseudo solutions :       0.00          -          0
3.09/3.18	c   trivial          :       0.01          1          0
3.09/3.18	c   shiftandpropagate:       0.00          0          0
3.09/3.18	c   simplerounding   :       0.00          0          0
3.09/3.18	c   zirounding       :       0.00          0          0
3.09/3.18	c   rounding         :       0.00          0          0
3.09/3.18	c   shifting         :       0.00          0          0
3.09/3.18	c   intshifting      :       0.00          0          0
3.09/3.18	c   oneopt           :       0.00          0          0
3.09/3.18	c   twoopt           :       0.00          0          0
3.09/3.18	c   fixandinfer      :       0.00          0          0
3.09/3.18	c   feaspump         :       0.00          0          0
3.09/3.18	c   clique           :       0.00          0          0
3.09/3.18	c   coefdiving       :       0.00          0          0
3.09/3.18	c   pscostdiving     :       0.00          0          0
3.09/3.18	c   fracdiving       :       0.00          0          0
3.09/3.18	c   veclendiving     :       0.00          0          0
3.09/3.18	c   intdiving        :       0.00          0          0
3.09/3.18	c   actconsdiving    :       0.00          0          0
3.09/3.18	c   objpscostdiving  :       0.00          0          0
3.09/3.18	c   rootsoldiving    :       0.00          0          0
3.09/3.18	c   linesearchdiving :       0.00          0          0
3.09/3.18	c   guideddiving     :       0.00          0          0
3.09/3.18	c   octane           :       0.00          0          0
3.09/3.18	c   rens             :       0.00          0          0
3.09/3.18	c   rins             :       0.00          0          0
3.09/3.18	c   localbranching   :       0.00          0          0
3.09/3.18	c   mutation         :       0.00          0          0
3.09/3.18	c   crossover        :       0.00          0          0
3.09/3.18	c   dins             :       0.00          0          0
3.09/3.18	c   vbounds          :       0.00          0          0
3.09/3.18	c   undercover       :       0.00          0          0
3.09/3.18	c   subnlp           :       0.00          0          0
3.09/3.18	c   trysol           :       0.00          0          0
3.09/3.18	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
3.09/3.18	c   primal LP        :       0.00          0          0       0.00          -
3.09/3.18	c   dual LP          :       0.20          2       1925     962.50    9842.72
3.09/3.18	c   lex dual LP      :       0.00          0          0       0.00          -
3.09/3.18	c   barrier LP       :       0.00          0          0       0.00          -
3.09/3.18	c   diving/probing LP:       0.00          0          0       0.00          -
3.09/3.18	c   strong branching :       0.00          0          0       0.00          -
3.09/3.18	c     (at root node) :          -          0          0       0.00          -
3.09/3.18	c   conflict analysis:       0.00          0          0       0.00          -
3.09/3.18	c B&B Tree           :
3.09/3.18	c   number of runs   :          1
3.09/3.18	c   nodes            :          1
3.09/3.18	c   nodes (total)    :          1
3.09/3.18	c   nodes left       :          0
3.09/3.18	c   max depth        :          0
3.09/3.18	c   max depth (total):          0
3.09/3.18	c   backtracks       :          0 (0.0%)
3.09/3.18	c   delayed cutoffs  :          0
3.09/3.18	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
3.09/3.18	c   avg switch length:       2.00
3.09/3.18	c   switching time   :       0.00
3.09/3.18	c Solution           :
3.09/3.18	c   Solutions found  :          0 (0 improvements)
3.09/3.18	c   Primal Bound     : infeasible
3.09/3.18	c   Dual Bound       :          -
3.09/3.18	c   Gap              :       0.00 %
3.09/3.18	c   Root Dual Bound  :          -
3.09/3.18	c   Root Iterations  :       1925
3.20/3.26	c Time complete: 3.25.

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-3739881-1338737980/watcher-3739881-1338737980 -o /tmp/evaluation-result-3739881-1338737980/solver-3739881-1338737980 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b_2.linux.x86_64.gnu.opt.spx -f HOME/instance-3739881-1338737980.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: 2.14 2.07 2.02 3/174 1033
/proc/meminfo: memFree=27903016/32873852 swapFree=7624/7624
[pid=1033] ppid=1031 vsize=9040 CPUtime=0 cores=1,3,5,7
/proc/1033/stat : 1033 (scip-2.0.1.4b_2) R 1031 1033 29314 0 -1 4202496 1267 0 0 0 0 0 0 0 20 0 1 0 339923499 9256960 1222 33554432000 4194304 9016284 140736641236512 140734899606840 4447263 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/1033/statm: 2260 1227 191 1178 0 1078 0

[startup+0.0911869 s]
/proc/loadavg: 2.14 2.07 2.02 3/174 1033
/proc/meminfo: memFree=27903016/32873852 swapFree=7624/7624
[pid=1033] ppid=1031 vsize=25644 CPUtime=0.08 cores=1,3,5,7
/proc/1033/stat : 1033 (scip-2.0.1.4b_2) R 1031 1033 29314 0 -1 4202496 5407 0 0 0 8 0 0 0 20 0 1 0 339923499 26259456 5362 33554432000 4194304 9016284 140736641236512 140734899606840 6152096 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/1033/statm: 6411 5362 357 1178 0 5229 0
Current children cumulated CPU time (s) 0.08
Current children cumulated vsize (KiB) 25644

[startup+0.100361 s]
/proc/loadavg: 2.14 2.07 2.02 3/174 1033
/proc/meminfo: memFree=27903016/32873852 swapFree=7624/7624
[pid=1033] ppid=1031 vsize=26948 CPUtime=0.08 cores=1,3,5,7
/proc/1033/stat : 1033 (scip-2.0.1.4b_2) R 1031 1033 29314 0 -1 4202496 5730 0 0 0 8 0 0 0 20 0 1 0 339923499 27594752 5685 33554432000 4194304 9016284 140736641236512 140734899606840 6813403 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/1033/statm: 6737 5685 357 1178 0 5555 0
Current children cumulated CPU time (s) 0.08
Current children cumulated vsize (KiB) 26948

[startup+0.300293 s]
/proc/loadavg: 2.14 2.07 2.02 3/174 1033
/proc/meminfo: memFree=27903016/32873852 swapFree=7624/7624
[pid=1033] ppid=1031 vsize=45404 CPUtime=0.29 cores=1,3,5,7
/proc/1033/stat : 1033 (scip-2.0.1.4b_2) R 1031 1033 29314 0 -1 4202496 10340 0 0 0 28 1 0 0 20 0 1 0 339923499 46493696 10295 33554432000 4194304 9016284 140736641236512 140734899606840 7870478 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/1033/statm: 11351 10295 357 1178 0 10169 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 45404

[startup+0.700296 s]
/proc/loadavg: 2.14 2.07 2.02 3/174 1033
/proc/meminfo: memFree=27903016/32873852 swapFree=7624/7624
[pid=1033] ppid=1031 vsize=129040 CPUtime=0.69 cores=1,3,5,7
/proc/1033/stat : 1033 (scip-2.0.1.4b_2) R 1031 1033 29314 0 -1 4202496 30725 0 0 0 64 5 0 0 20 0 1 0 339923499 132136960 30680 33554432000 4194304 9016284 140736641236512 140736641231816 6480197 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/1033/statm: 32260 30680 484 1178 0 31078 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 129040

[startup+1.50032 s]
/proc/loadavg: 2.14 2.07 2.02 3/175 1034
/proc/meminfo: memFree=27755464/32873852 swapFree=7624/7624
[pid=1033] ppid=1031 vsize=173532 CPUtime=1.49 cores=1,3,5,7
/proc/1033/stat : 1033 (scip-2.0.1.4b_2) R 1031 1033 29314 0 -1 4202496 41660 0 0 0 142 7 0 0 20 0 1 0 339923499 177696768 41615 33554432000 4194304 9016284 140736641236512 140736641231816 6480389 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/1033/statm: 43383 41615 491 1178 0 42201 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 173532

[startup+3.1003 s]
/proc/loadavg: 2.14 2.07 2.02 3/175 1034
/proc/meminfo: memFree=27736104/32873852 swapFree=7624/7624
[pid=1033] ppid=1031 vsize=204744 CPUtime=3.09 cores=1,3,5,7
/proc/1033/stat : 1033 (scip-2.0.1.4b_2) R 1031 1033 29314 0 -1 4202496 51497 0 0 0 300 9 0 0 20 0 1 0 339923499 209657856 49427 33554432000 4194304 9016284 140736641236512 140736641231576 7875499 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/1033/statm: 51186 49427 679 1178 0 50004 0
Current children cumulated CPU time (s) 3.09
Current children cumulated vsize (KiB) 204744

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

[startup+3.20033 s]
/proc/loadavg: 2.14 2.07 2.02 3/175 1034
/proc/meminfo: memFree=27710684/32873852 swapFree=7624/7624
[pid=1033] ppid=1031 vsize=193712 CPUtime=3.2 cores=1,3,5,7
/proc/1033/stat : 1033 (scip-2.0.1.4b_2) R 1031 1033 29314 0 -1 4202496 51629 0 0 0 311 9 0 0 20 0 1 0 339923499 198361088 46702 33554432000 4194304 9016284 140736641236512 140736641231576 4895868 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/1033/statm: 48428 46702 688 1178 0 47246 0
Current children cumulated CPU time (s) 3.2
Current children cumulated vsize (KiB) 193712

Child status: 0
Real time (s): 3.26141
CPU time (s): 3.2595
CPU user time (s): 3.15752
CPU system time (s): 0.101984
CPU usage (%): 99.9416
Max. virtual memory (cumulated for all children) (KiB): 204744

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 3.15752
system time used= 0.101984
maximum resident set size= 198136
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 51634
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= 4

runsolver used 0.005999 second user time and 0.021996 second system time

The end

Launcher Data 

Begin job on node131 at 2012-06-03 17:39:40
IDJOB=3739881
IDBENCH=75432
IDSOLVER=2329
FILE ID=node131/3739881-1338737980
RUNJOBID= node131-1338713677-29331
PBS_JOBID= 14636738
Free space on /tmp= 71384 MiB

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

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

MD5SUM BENCH= 1db80fe15b68bee40f16b4e3f4788f73
RANDOM SEED=77541464

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:        27903660 kB
Buffers:          561652 kB
Cached:          3102368 kB
SwapCached:         2348 kB
Active:          1895472 kB
Inactive:        2205496 kB
Active(anon):     432944 kB
Inactive(anon):     3912 kB
Active(file):    1462528 kB
Inactive(file):  2201584 kB
Unevictable:        7624 kB
Mlocked:            7624 kB
SwapTotal:      67108856 kB
SwapFree:       67099088 kB
Dirty:             18384 kB
Writeback:             0 kB
AnonPages:        441292 kB
Mapped:            17168 kB
Shmem:                 0 kB
Slab:             729172 kB
SReclaimable:     171200 kB
SUnreclaim:       557972 kB
KernelStack:        1456 kB
PageTables:         4880 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83545780 kB
Committed_AS:     560696 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      346360 kB
VmallocChunk:   34341988004 kB
HardwareCorrupted:     0 kB
AnonHugePages:    337920 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= 71368 MiB
End job on node131 at 2012-06-03 17:39:44