Trace number 3730618

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
PB09: SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009)UNSAT 2.19267 2.19495

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/web/
uclid_pb_benchmarks/normalized-44s.smv.opb
MD5SUMba3977c9125baf6c78f0402072fa33d8
Bench CategoryDEC-SMALLINT (no optimisation, small integers)
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.003998
Has Objective FunctionNO
SatisfiableNO
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved
Number of variables495
Total number of constraints940
Number of constraints which are clauses800
Number of constraints which are cardinality constraints (but not clauses)0
Number of constraints which are nor clauses,nor cardinality constraints140
Minimum length of a constraint1
Maximum length of a constraint13
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 68
Number of bits of the biggest number in a constraint 7
Biggest sum of numbers in a constraint 257
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.01	c SCIP version 1.1.0.7
0.00/0.01	c LP-Solver SoPlex 1.4.1
0.00/0.01	c user parameter file <scip.set> not found - using default parameters
0.00/0.01	c read problem <HOME/instance-3730618-1338682988.opb>
0.00/0.01	c original problem has 495 variables (495 bin, 0 int, 0 impl, 0 cont) and 940 constraints
0.00/0.01	c No objective function, only one solution is needed.
0.00/0.01	c start presolving problem
0.00/0.01	c presolving:
0.00/0.02	c (round 1) 65 del vars, 17 del conss, 5 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6200 impls, 0 clqs
0.00/0.02	c (round 2) 66 del vars, 135 del conss, 6 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6200 impls, 0 clqs
0.00/0.02	c (round 3) 68 del vars, 138 del conss, 8 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6200 impls, 0 clqs
0.00/0.02	c (round 4) 70 del vars, 143 del conss, 10 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6218 impls, 0 clqs
0.00/0.02	c (round 5) 74 del vars, 149 del conss, 14 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6218 impls, 0 clqs
0.00/0.02	c (round 6) 88 del vars, 176 del conss, 23 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6316 impls, 0 clqs
0.00/0.02	c (round 7) 95 del vars, 198 del conss, 29 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6370 impls, 0 clqs
0.00/0.02	c (round 8) 104 del vars, 214 del conss, 33 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6480 impls, 0 clqs
0.00/0.02	c (round 9) 112 del vars, 236 del conss, 37 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6520 impls, 0 clqs
0.00/0.02	c (round 10) 119 del vars, 255 del conss, 41 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6584 impls, 0 clqs
0.00/0.02	c (round 11) 127 del vars, 272 del conss, 45 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6664 impls, 0 clqs
0.00/0.02	c (round 12) 140 del vars, 301 del conss, 52 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6797 impls, 0 clqs
0.00/0.02	c (round 13) 147 del vars, 325 del conss, 58 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6811 impls, 0 clqs
0.00/0.02	c (round 14) 155 del vars, 344 del conss, 65 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6823 impls, 0 clqs
0.00/0.02	c (round 15) 164 del vars, 362 del conss, 71 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6871 impls, 0 clqs
0.00/0.03	c (round 16) 166 del vars, 377 del conss, 73 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6873 impls, 0 clqs
0.00/0.03	c (round 17) 170 del vars, 383 del conss, 77 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6873 impls, 0 clqs
0.00/0.03	c (round 18) 177 del vars, 396 del conss, 83 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 6965 impls, 0 clqs
0.00/0.03	c (round 19) 184 del vars, 417 del conss, 89 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 7067 impls, 0 clqs
0.00/0.03	c (round 20) 195 del vars, 444 del conss, 94 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 7191 impls, 0 clqs
0.00/0.03	c (round 21) 199 del vars, 464 del conss, 96 chg bounds, 70 chg sides, 144 chg coeffs, 0 upgd conss, 7203 impls, 0 clqs
0.00/0.03	c (round 22) 205 del vars, 477 del conss, 98 chg bounds, 71 chg sides, 145 chg coeffs, 0 upgd conss, 7243 impls, 0 clqs
0.00/0.03	c (round 23) 212 del vars, 496 del conss, 100 chg bounds, 73 chg sides, 148 chg coeffs, 0 upgd conss, 7262 impls, 0 clqs
0.00/0.03	c (round 24) 225 del vars, 528 del conss, 105 chg bounds, 75 chg sides, 152 chg coeffs, 0 upgd conss, 7326 impls, 0 clqs
0.00/0.03	c (round 25) 225 del vars, 549 del conss, 105 chg bounds, 75 chg sides, 152 chg coeffs, 0 upgd conss, 7326 impls, 0 clqs
0.00/0.04	c (round 26) 225 del vars, 556 del conss, 105 chg bounds, 75 chg sides, 152 chg coeffs, 377 upgd conss, 7326 impls, 0 clqs
0.00/0.04	c (round 27) 267 del vars, 563 del conss, 105 chg bounds, 75 chg sides, 152 chg coeffs, 377 upgd conss, 7326 impls, 0 clqs
0.00/0.04	c presolving (28 rounds):
0.00/0.04	c  267 deleted vars, 563 deleted constraints, 105 tightened bounds, 0 added holes, 75 changed sides, 152 changed coefficients
0.00/0.04	c  7326 implications, 0 cliques
0.00/0.04	c presolved problem has 228 variables (228 bin, 0 int, 0 impl, 0 cont) and 377 constraints
0.00/0.04	c     112 constraints of type <knapsack>
0.00/0.04	c     265 constraints of type <logicor>
0.00/0.04	c transformed objective value is always integral (scale: 1)
0.00/0.04	c Presolving Time: 0.03
0.00/0.04	c SATUNSAT-LIN
0.00/0.04	c -----------------------------------------------------------------------------------------------
0.00/0.04	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04	c separating/flowcover/freq = c -1
0.00/0.04	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04	c separating/cmir/freq = c -1
0.00/0.04	c # additional number of allowed LP iterations
0.00/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04	c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04	c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.04	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04	c heuristics/veclendiving/freq = c -1
0.00/0.04	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04	c heuristics/simplerounding/freq = c -1
0.00/0.04	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04	c heuristics/shifting/freq = c -1
0.00/0.04	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04	c heuristics/rounding/freq = c -1
0.00/0.04	c # additional number of allowed LP iterations
0.00/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04	c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.04	c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.04	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.04	c heuristics/rootsoldiving/freq = c -1
0.00/0.04	c # number of nodes added to the contingent of the total nodes
0.00/0.04	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.04	c heuristics/rens/nodesofs = c 2000
0.00/0.04	c # minimum percentage of integer variables that have to be fixable 
0.00/0.04	c # [type: real, range: [0,1], default: 0.5]
0.00/0.04	c heuristics/rens/minfixingrate = c 0.3
0.00/0.04	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.04	c heuristics/rens/freq = c -1
0.00/0.04	c # additional number of allowed LP iterations
0.00/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04	c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04	c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.04	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04	c heuristics/pscostdiving/freq = c -1
0.00/0.04	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.04	c heuristics/oneopt/freq = c -1
0.00/0.04	c # additional number of allowed LP iterations
0.00/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04	c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.04	c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.04	c # [type: real, range: [0,1], default: 0.01]
0.00/0.04	c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.04	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.04	c heuristics/objpscostdiving/freq = c -1
0.00/0.04	c # additional number of allowed LP iterations
0.00/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04	c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04	c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.04	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04	c heuristics/linesearchdiving/freq = c -1
0.00/0.04	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04	c heuristics/intshifting/freq = c -1
0.00/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04	c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.04	c # additional number of allowed LP iterations
0.00/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04	c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04	c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.04	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04	c heuristics/guideddiving/freq = c -1
0.00/0.04	c # additional number of allowed LP iterations
0.00/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04	c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04	c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.04	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04	c heuristics/fracdiving/freq = c -1
0.00/0.04	c # additional number of allowed LP iterations
0.00/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04	c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.04	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.04	c heuristics/feaspump/freq = c -1
0.00/0.04	c # minimum percentage of integer variables that have to be fixed 
0.00/0.04	c # [type: real, range: [0,1], default: 0.666]
0.00/0.04	c heuristics/crossover/minfixingrate = c 0.5
0.00/0.04	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.04	c # [type: real, range: [0,1], default: 0.1]
0.00/0.04	c heuristics/crossover/nodesquot = c 0.15
0.00/0.04	c # number of nodes without incumbent change that heuristic should wait
0.00/0.04	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.04	c heuristics/crossover/nwaitingnodes = c 100
0.00/0.04	c # number of nodes added to the contingent of the total nodes
0.00/0.04	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.04	c heuristics/crossover/nodesofs = c 750
0.00/0.04	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.04	c heuristics/crossover/freq = c -1
0.00/0.04	c # additional number of allowed LP iterations
0.00/0.04	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.04	c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.04	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.04	c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.04	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.04	c heuristics/coefdiving/freq = c -1
0.00/0.04	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04	c presolving/probing/maxrounds = c 0
0.00/0.04	c # should presolving try to simplify knapsacks
0.00/0.04	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04	c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.04	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.04	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.04	c constraints/knapsack/disaggregation = c FALSE
0.00/0.04	c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04	c constraints/knapsack/maxnumcardlift = c 0
0.00/0.04	c # should presolving try to simplify inequalities
0.00/0.04	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.04	c constraints/linear/simplifyinequalities = c TRUE
0.00/0.04	c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04	c separating/maxroundsroot = c 5
0.00/0.04	c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.04	c separating/maxrounds = c 1
0.00/0.04	c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.04	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.04	c limits/solutions = c 1
0.00/0.04	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04	c limits/memory = c 13950
0.00/0.04	c # maximal time in seconds to run
0.00/0.04	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.04	c limits/time = c 1791
0.00/0.04	c # frequency for displaying node information lines
0.00/0.04	c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.04	c display/freq = c 10000
0.00/0.04	c -----------------------------------------------------------------------------------------------
0.00/0.04	c start solving problem
0.00/0.04	c 
0.00/0.04	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.00/0.04	c   0.0s|     1 |     0 |   114 |1955k|   0 |  94 | 228 | 377 | 377 | 228 | 377 |   0 |   0 |   0 | 1.397425e+02 |      --      |    Inf 
0.00/0.05	c   0.0s|     1 |     0 |   161 |2010k|   0 |  60 | 228 | 377 | 377 | 228 | 396 |  19 |   0 |   0 | 1.542344e+02 |      --      |    Inf 
0.00/0.05	c   0.0s|     1 |     0 |   238 |2031k|   0 |  84 | 228 | 377 | 377 | 228 | 414 |  37 |   0 |   0 | 1.617813e+02 |      --      |    Inf 
0.00/0.06	c   0.1s|     1 |     0 |   309 |2090k|   0 |  91 | 228 | 377 | 377 | 228 | 441 |  64 |   0 |   0 | 1.641360e+02 |      --      |    Inf 
0.06/0.07	c   0.1s|     1 |     0 |   415 |2140k|   0 | 106 | 228 | 377 | 377 | 228 | 467 |  90 |   0 |   0 | 1.659111e+02 |      --      |    Inf 
0.06/0.08	c   0.1s|     1 |     0 |   456 |2177k|   0 | 120 | 228 | 377 | 377 | 228 | 483 | 106 |   0 |   0 | 1.665188e+02 |      --      |    Inf 
0.09/0.19	c   0.2s|     1 |     0 |   461 |2176k|   0 | 121 | 228 | 377 | 377 | 228 | 483 | 106 |   0 |  44 | 1.665759e+02 |      --      |    Inf 
0.19/0.23	c   0.2s|     1 |     0 |   472 |2175k|   0 | 111 | 228 | 377 | 377 | 228 | 483 | 106 |   0 |  61 | 1.671188e+02 |      --      |    Inf 
0.19/0.26	c   0.2s|     1 |     2 |   472 |2175k|   0 | 111 | 228 | 377 | 377 | 228 | 483 | 106 |   0 |  78 | 1.671188e+02 |      --      |    Inf 
2.09/2.18	c 
2.09/2.18	c SCIP Status        : problem is solved [infeasible]
2.09/2.18	c Solving Time (sec) : 2.12
2.09/2.18	c Solving Nodes      : 83
2.09/2.18	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
2.09/2.18	c Dual Bound         : +1.00000000000000e+20
2.09/2.18	c Gap                : 0.00 %
2.09/2.18	c NODE         83
2.09/2.18	c DUAL BOUND   1e+20
2.09/2.18	c PRIMAL BOUND 1e+20
2.09/2.18	c GAP          0
2.09/2.18	s UNSATISFIABLE
2.09/2.18	c SCIP Status        : problem is solved [infeasible]
2.09/2.18	c Solving Time       :       2.12
2.09/2.18	c Original Problem   :
2.09/2.18	c   Problem name     : HOME/instance-3730618-1338682988.opb
2.09/2.18	c   Variables        : 495 (495 binary, 0 integer, 0 implicit integer, 0 continuous)
2.09/2.18	c   Constraints      : 940 initial, 940 maximal
2.09/2.18	c Presolved Problem  :
2.09/2.18	c   Problem name     : t_HOME/instance-3730618-1338682988.opb
2.09/2.18	c   Variables        : 228 (228 binary, 0 integer, 0 implicit integer, 0 continuous)
2.09/2.18	c   Constraints      : 377 initial, 389 maximal
2.09/2.18	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
2.09/2.18	c   trivial          :       0.00          0          0          0          0          0          0          0          0
2.09/2.18	c   dualfix          :       0.00          1          0          0          0          0          0          0          0
2.09/2.18	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
2.09/2.18	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
2.09/2.18	c   implics          :       0.00          0        116          0          0          0          0          0          0
2.09/2.18	c   probing          :       0.00          0          0          0          0          0          0          0          0
2.09/2.18	c   knapsack         :       0.00          0          0          0          0          0          0          0          0
2.09/2.18	c   linear           :       0.02        105         45          0        105          0        563         75        152
2.09/2.18	c   logicor          :       0.01          0          0          0          0          0          0          0          0
2.09/2.18	c   root node        :          -         12          -          -         12          -          -          -          -
2.09/2.18	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
2.09/2.18	c   integral         :          0          0          0        106          0         35         56          0          0         84
2.09/2.18	c   knapsack         :        112          5        475          0          0          0          0        186          0          0
2.09/2.18	c   logicor          :        265+         5        435          0          0          4        780          0          0          0
2.09/2.18	c   countsols        :          0          0          0          0          0          0          0          0          0          0
2.09/2.18	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
2.09/2.18	c   integral         :       1.95       0.00       0.00       1.95       0.00
2.09/2.18	c   knapsack         :       0.00       0.00       0.00       0.00       0.00
2.09/2.18	c   logicor          :       0.00       0.00       0.00       0.00       0.00
2.09/2.18	c   countsols        :       0.00       0.00       0.00       0.00       0.00
2.09/2.18	c Propagators        :       Time      Calls    Cutoffs    DomReds
2.09/2.18	c   rootredcost      :       0.00          0          0          0
2.09/2.18	c   pseudoobj        :       0.00        486          0          0
2.09/2.18	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
2.09/2.18	c   propagation      :       0.00          4          4          7        3.6          4        3.2          -
2.09/2.18	c   infeasible LP    :       0.00          2          2          3        2.0          0        0.0          0
2.09/2.18	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
2.09/2.18	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
2.09/2.18	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
2.09/2.18	c   applied globally :          -          -          -         12        2.9          -          -          -
2.09/2.18	c   applied locally  :          -          -          -          0        0.0          -          -          -
2.09/2.18	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
2.09/2.18	c   cut pool         :       0.00          4          -          -         62          -    (maximal pool size: 359)
2.09/2.18	c   redcost          :       0.00         81          0          0          0          0
2.09/2.18	c   impliedbounds    :       0.00          5          0          0          0          0
2.09/2.18	c   intobj           :       0.00          0          0          0          0          0
2.09/2.18	c   gomory           :       0.00          5          0          0        737          0
2.09/2.18	c   strongcg         :       0.03          5          0          0        749          0
2.09/2.18	c   cmir             :       0.00          0          0          0          0          0
2.09/2.18	c   flowcover        :       0.00          0          0          0          0          0
2.09/2.18	c   clique           :       0.00          5          0          0         14          0
2.09/2.18	c   zerohalf         :       0.00          0          0          0          0          0
2.09/2.18	c   mcf              :       0.00          1          0          0          0          0
2.09/2.18	c Pricers            :       Time      Calls       Vars
2.09/2.18	c   problem variables:       0.00          0          0
2.09/2.18	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
2.09/2.18	c   relpscost        :       1.95        106         35         56          0          0         84
2.09/2.18	c   pscost           :       0.00          0          0          0          0          0          0
2.09/2.18	c   inference        :       0.00          0          0          0          0          0          0
2.09/2.18	c   mostinf          :       0.00          0          0          0          0          0          0
2.09/2.18	c   leastinf         :       0.00          0          0          0          0          0          0
2.09/2.18	c   fullstrong       :       0.00          0          0          0          0          0          0
2.09/2.18	c   allfullstrong    :       0.00          0          0          0          0          0          0
2.09/2.18	c   random           :       0.00          0          0          0          0          0          0
2.09/2.18	c Primal Heuristics  :       Time      Calls      Found
2.09/2.18	c   LP solutions     :       0.00          -          0
2.09/2.18	c   pseudo solutions :       0.00          -          0
2.09/2.18	c   simplerounding   :       0.00          0          0
2.09/2.18	c   rounding         :       0.00          0          0
2.09/2.18	c   shifting         :       0.00          0          0
2.09/2.18	c   intshifting      :       0.00          0          0
2.09/2.18	c   oneopt           :       0.00          0          0
2.09/2.18	c   fixandinfer      :       0.00          0          0
2.09/2.18	c   feaspump         :       0.00          0          0
2.09/2.18	c   coefdiving       :       0.00          0          0
2.09/2.18	c   pscostdiving     :       0.00          0          0
2.09/2.18	c   fracdiving       :       0.00          0          0
2.09/2.18	c   veclendiving     :       0.00          0          0
2.09/2.18	c   intdiving        :       0.00          0          0
2.09/2.18	c   actconsdiving    :       0.00          0          0
2.09/2.18	c   objpscostdiving  :       0.00          0          0
2.09/2.18	c   rootsoldiving    :       0.00          0          0
2.09/2.18	c   linesearchdiving :       0.00          0          0
2.09/2.18	c   guideddiving     :       0.00          0          0
2.09/2.18	c   octane           :       0.00          0          0
2.09/2.18	c   rens             :       0.00          0          0
2.09/2.18	c   rins             :       0.00          0          0
2.09/2.18	c   localbranching   :       0.00          0          0
2.09/2.18	c   mutation         :       0.00          0          0
2.09/2.18	c   crossover        :       0.00          0          0
2.09/2.18	c   dins             :       0.00          0          0
2.09/2.18	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
2.09/2.19	c   primal LP        :       0.00          0          0       0.00          -
2.09/2.19	c   dual LP          :       0.10        113       2789      24.68   27890.00
2.09/2.19	c   barrier LP       :       0.00          0          0       0.00          -
2.09/2.19	c   diving/probing LP:       0.00          0          0       0.00          -
2.09/2.19	c   strong branching :       1.95       1011      33007      32.65   16926.67
2.09/2.19	c     (at root node) :          -         78       2655      34.04          -
2.09/2.19	c   conflict analysis:       0.00          0          0       0.00          -
2.09/2.19	c B&B Tree           :
2.09/2.19	c   number of runs   :          1
2.09/2.19	c   nodes            :         83
2.09/2.19	c   nodes (total)    :         83
2.09/2.19	c   nodes left       :          0
2.09/2.19	c   max depth        :         11
2.09/2.19	c   max depth (total):         11
2.09/2.19	c   backtracks       :         24 (28.9%)
2.09/2.19	c   delayed cutoffs  :          2
2.09/2.19	c   repropagations   :          8 (16 domain reductions, 0 cutoffs)
2.09/2.19	c   avg switch length:       2.94
2.09/2.19	c   switching time   :       0.00
2.09/2.19	c Solution           :
2.09/2.19	c   Solutions found  :          0 (0 improvements)
2.09/2.19	c   Primal Bound     : infeasible
2.09/2.19	c   Dual Bound       :          -
2.09/2.19	c   Gap              :       0.00 %
2.09/2.19	c   Root Dual Bound  : +1.67118750000000e+02
2.09/2.19	c Time complete: 2.19.

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-3730618-1338682988/watcher-3730618-1338682988 -o /tmp/evaluation-result-3730618-1338682988/solver-3730618-1338682988 -C 1800 -W 1900 -M 15500 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 15500 -f HOME/instance-3730618-1338682988.opb 

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.13 2.06 1.94 3/176 20422
/proc/meminfo: memFree=25621504/32873844 swapFree=7116/7116
[pid=20422] ppid=20420 vsize=8560 CPUtime=0 cores=1,3,5,7
/proc/20422/stat : 20422 (pbscip.linux.x8) R 20420 20422 10620 0 -1 4202496 1496 0 0 0 0 0 0 0 20 0 1 0 334423851 8765440 1448 33554432000 4194304 7823515 140736522115392 140736925826232 6883856 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/20422/statm: 2140 1451 351 887 0 1250 0

[startup+0.0675601 s]
/proc/loadavg: 2.13 2.06 1.94 3/176 20422
/proc/meminfo: memFree=25621504/32873844 swapFree=7116/7116
[pid=20422] ppid=20420 vsize=15652 CPUtime=0.06 cores=1,3,5,7
/proc/20422/stat : 20422 (pbscip.linux.x8) R 20420 20422 10620 0 -1 4202496 3540 0 0 0 5 1 0 0 20 0 1 0 334423851 16027648 3136 33554432000 4194304 7823515 140736522115392 140736521981080 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/20422/statm: 3913 3136 552 887 0 3023 0
Current children cumulated CPU time (s) 0.06
Current children cumulated vsize (KiB) 15652

[startup+0.100379 s]
/proc/loadavg: 2.13 2.06 1.94 3/176 20422
/proc/meminfo: memFree=25621504/32873844 swapFree=7116/7116
[pid=20422] ppid=20420 vsize=15996 CPUtime=0.09 cores=1,3,5,7
/proc/20422/stat : 20422 (pbscip.linux.x8) R 20420 20422 10620 0 -1 4202496 3638 0 0 0 8 1 0 0 20 0 1 0 334423851 16379904 3231 33554432000 4194304 7823515 140736522115392 140736521981080 6237364 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/20422/statm: 3999 3231 555 887 0 3109 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 15996

[startup+0.300229 s]
/proc/loadavg: 2.13 2.06 1.94 3/176 20422
/proc/meminfo: memFree=25621504/32873844 swapFree=7116/7116
[pid=20422] ppid=20420 vsize=15996 CPUtime=0.29 cores=1,3,5,7
/proc/20422/stat : 20422 (pbscip.linux.x8) R 20420 20422 10620 0 -1 4202496 3640 0 0 0 28 1 0 0 20 0 1 0 334423851 16379904 3233 33554432000 4194304 7823515 140736522115392 140736522110056 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/20422/statm: 3999 3233 557 887 0 3109 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 15996

[startup+0.700231 s]
/proc/loadavg: 2.13 2.06 1.94 3/176 20422
/proc/meminfo: memFree=25621504/32873844 swapFree=7116/7116
[pid=20422] ppid=20420 vsize=15996 CPUtime=0.69 cores=1,3,5,7
/proc/20422/stat : 20422 (pbscip.linux.x8) R 20420 20422 10620 0 -1 4202496 3640 0 0 0 67 2 0 0 20 0 1 0 334423851 16379904 3233 33554432000 4194304 7823515 140736522115392 140736522110056 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/20422/statm: 3999 3233 557 887 0 3109 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 15996

[startup+1.50023 s]
/proc/loadavg: 2.12 2.06 1.94 3/177 20423
/proc/meminfo: memFree=25610360/32873844 swapFree=7116/7116
[pid=20422] ppid=20420 vsize=15996 CPUtime=1.49 cores=1,3,5,7
/proc/20422/stat : 20422 (pbscip.linux.x8) R 20420 20422 10620 0 -1 4202496 3647 0 0 0 145 4 0 0 20 0 1 0 334423851 16379904 3240 33554432000 4194304 7823515 140736522115392 140736522110088 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/20422/statm: 3999 3240 564 887 0 3109 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 15996

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

[startup+1.90023 s]
/proc/loadavg: 2.12 2.06 1.94 3/177 20423
/proc/meminfo: memFree=25610360/32873844 swapFree=7116/7116
[pid=20422] ppid=20420 vsize=15996 CPUtime=1.89 cores=1,3,5,7
/proc/20422/stat : 20422 (pbscip.linux.x8) R 20420 20422 10620 0 -1 4202496 3647 0 0 0 184 5 0 0 20 0 1 0 334423851 16379904 3240 33554432000 4194304 7823515 140736522115392 140736522110088 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/20422/statm: 3999 3240 564 887 0 3109 0
Current children cumulated CPU time (s) 1.89
Current children cumulated vsize (KiB) 15996

[startup+2.10023 s]
/proc/loadavg: 2.12 2.06 1.94 3/177 20423
/proc/meminfo: memFree=25609616/32873844 swapFree=7116/7116
[pid=20422] ppid=20420 vsize=15996 CPUtime=2.09 cores=1,3,5,7
/proc/20422/stat : 20422 (pbscip.linux.x8) R 20420 20422 10620 0 -1 4202496 3647 0 0 0 204 5 0 0 20 0 1 0 334423851 16379904 3240 33554432000 4194304 7823515 140736522115392 140736522110088 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/20422/statm: 3999 3240 564 887 0 3109 0
Current children cumulated CPU time (s) 2.09
Current children cumulated vsize (KiB) 15996

Child status: 0
Real time (s): 2.19495
CPU time (s): 2.19267
CPU user time (s): 2.13168
CPU system time (s): 0.06099
CPU usage (%): 99.8958
Max. virtual memory (cumulated for all children) (KiB): 15996

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 2.13167
system time used= 0.06099
maximum resident set size= 12980
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 3656
page faults= 0
swaps= 0
block input operations= 0
block output operations= 0
messages sent= 0
messages received= 0
signals received= 0
voluntary context switches= 3
involuntary context switches= 5

runsolver used 0.006998 second user time and 0.014997 second system time

The end

Launcher Data 

Begin job on node138 at 2012-06-03 02:23:08
IDJOB=3730618
IDBENCH=1457
IDSOLVER=2321
FILE ID=node138/3730618-1338682988
RUNJOBID= node138-1338679216-19463
PBS_JOBID= 14636675
Free space on /tmp= 70764 MiB

SOLVER NAME= PB09: SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009)
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/web/uclid_pb_benchmarks/normalized-44s.smv.opb
COMMAND LINE= HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t TIMEOUT -m MEMLIMIT -f BENCHNAME
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3730618-1338682988/watcher-3730618-1338682988 -o /tmp/evaluation-result-3730618-1338682988/solver-3730618-1338682988 -C 1800 -W 1900 -M 15500  HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 15500 -f HOME/instance-3730618-1338682988.opb

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

MD5SUM BENCH= ba3977c9125baf6c78f0402072fa33d8
RANDOM SEED=840440609

node138.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		: 2667.347
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	: 5334.69
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		: 2667.347
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		: 2667.347
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		: 2667.347
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		: 2667.347
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		: 2667.347
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		: 2667.347
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		: 2667.347
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 22
initial apicid	: 22
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.91
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:       32873844 kB
MemFree:        25622148 kB
Buffers:          708904 kB
Cached:          3906556 kB
SwapCached:          208 kB
Active:          4057464 kB
Inactive:        2289144 kB
Active(anon):    1707048 kB
Inactive(anon):    19564 kB
Active(file):    2350416 kB
Inactive(file):  2269580 kB
Unevictable:        7116 kB
Mlocked:            7116 kB
SwapTotal:      67108856 kB
SwapFree:       67108648 kB
Dirty:              9708 kB
Writeback:             0 kB
AnonPages:       1714664 kB
Mapped:            16384 kB
Shmem:               200 kB
Slab:             764076 kB
SReclaimable:     205964 kB
SUnreclaim:       558112 kB
KernelStack:        1472 kB
PageTables:         7332 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83545776 kB
Committed_AS:    1908816 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      346368 kB
VmallocChunk:   34341987984 kB
HardwareCorrupted:     0 kB
AnonHugePages:    247808 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= 70756 MiB
End job on node138 at 2012-06-03 02:23:10