Trace number 3450351

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
SCIP spx E SCIP 2.0.1.4b with SoPlex 1.5.0.4UNSAT 0.58491 0.585403

General information on the benchmark

Namenormalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/
manquinho/dbsg/normalized-dbsg_50_25_1_15.opb
MD5SUMebbe5bb724184b6646f7cf4470989c3e
Bench CategoryDEC-SMALLINT-NLC (no optimisation, small integers, non 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.566913
Has Objective FunctionNO
SatisfiableNO
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved
Number of variables100
Total number of constraints152
Number of constraints which are clauses50
Number of constraints which are cardinality constraints (but not clauses)1
Number of constraints which are nor clauses,nor cardinality constraints101
Minimum length of a constraint2
Maximum length of a constraint100
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 15
Number of bits of the biggest number in a constraint 4
Biggest sum of numbers in a constraint 100
Number of bits of the biggest sum of numbers7
Number of products (including duplicates)2996
Sum of products size (including duplicates)5992
Number of different products1498
Sum of products size2996

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.4]
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-3450351-1307113718.opb>
0.00/0.01	c original problem has 1598 variables (1598 bin, 0 int, 0 impl, 0 cont) and 1750 constraints
0.00/0.01	c problem read
0.00/0.01	c No objective function, only one solution is needed.
0.00/0.01	c presolving settings loaded
0.00/0.01	c presolving:
0.00/0.04	c (round 1) 0 del vars, 1598 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 51 upgd conss, 12084 impls, 99 clqs
0.00/0.05	c (round 2) 1498 del vars, 1598 del conss, 0 add conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 151 upgd conss, 12084 impls, 0 clqs
0.00/0.05	c presolving (3 rounds):
0.00/0.05	c  1498 deleted vars, 1598 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.05	c  12084 implications, 0 cliques
0.00/0.05	c presolved problem has 100 variables (100 bin, 0 int, 0 impl, 0 cont) and 152 constraints
0.00/0.05	c     101 constraints of type <knapsack>
0.00/0.05	c      50 constraints of type <setppc>
0.00/0.05	c       1 constraints of type <linear>
0.00/0.05	c transformed objective value is always integral (scale: 1)
0.00/0.05	c Presolving Time: 0.04
0.00/0.05	c - non default parameters ----------------------------------------------------------------------
0.00/0.05	c # SCIP version 2.0.1.5
0.00/0.05	c 
0.00/0.05	c # frequency for displaying node information lines
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.05	c display/freq = 10000
0.00/0.05	c 
0.00/0.05	c # maximal time in seconds to run
0.00/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05	c limits/time = 1800
0.00/0.05	c 
0.00/0.05	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.05	c limits/memory = 13950
0.00/0.05	c 
0.00/0.05	c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05	c limits/solutions = 1
0.00/0.05	c 
0.00/0.05	c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.05	c separating/maxrounds = 1
0.00/0.05	c 
0.00/0.05	c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05	c separating/maxroundsroot = 5
0.00/0.05	c 
0.00/0.05	c # default clock type (1: CPU user seconds, 2: wall clock time)
0.00/0.05	c # [type: int, range: [1,2], default: 1]
0.00/0.05	c timing/clocktype = 2
0.00/0.05	c 
0.00/0.05	c # belongs reading time to solving time?
0.00/0.05	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05	c timing/reading = TRUE
0.00/0.05	c 
0.00/0.05	c # should presolving try to simplify inequalities
0.00/0.05	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05	c constraints/linear/simplifyinequalities = TRUE
0.00/0.05	c 
0.00/0.05	c # add initial coupling inequalities as linear constraints, if 'addCoupling' is true
0.00/0.05	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05	c constraints/indicator/addCouplingCons = TRUE
0.00/0.05	c 
0.00/0.05	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.05	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.05	c constraints/knapsack/disaggregation = FALSE
0.00/0.05	c 
0.00/0.05	c # should presolving try to simplify knapsacks
0.00/0.05	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.05	c constraints/knapsack/simplifyinequalities = TRUE
0.00/0.05	c 
0.00/0.05	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05	c presolving/probing/maxrounds = 0
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05	c heuristics/coefdiving/freq = -1
0.00/0.05	c 
0.00/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05	c heuristics/coefdiving/maxlpiterquot = 0.075
0.00/0.05	c 
0.00/0.05	c # additional number of allowed LP iterations
0.00/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05	c heuristics/coefdiving/maxlpiterofs = 1500
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.05	c heuristics/crossover/freq = -1
0.00/0.05	c 
0.00/0.05	c # number of nodes added to the contingent of the total nodes
0.00/0.05	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05	c heuristics/crossover/nodesofs = 750
0.00/0.05	c 
0.00/0.05	c # number of nodes without incumbent change that heuristic should wait
0.00/0.05	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.05	c heuristics/crossover/nwaitingnodes = 100
0.00/0.05	c 
0.00/0.05	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.05	c # [type: real, range: [0,1], default: 0.1]
0.00/0.05	c heuristics/crossover/nodesquot = 0.15
0.00/0.05	c 
0.00/0.05	c # minimum percentage of integer variables that have to be fixed 
0.00/0.05	c # [type: real, range: [0,1], default: 0.666]
0.00/0.05	c heuristics/crossover/minfixingrate = 0.5
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05	c heuristics/feaspump/freq = -1
0.00/0.05	c 
0.00/0.05	c # additional number of allowed LP iterations
0.00/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05	c heuristics/feaspump/maxlpiterofs = 2000
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05	c heuristics/fracdiving/freq = -1
0.00/0.05	c 
0.00/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05	c heuristics/fracdiving/maxlpiterquot = 0.075
0.00/0.05	c 
0.00/0.05	c # additional number of allowed LP iterations
0.00/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05	c heuristics/fracdiving/maxlpiterofs = 1500
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05	c heuristics/guideddiving/freq = -1
0.00/0.05	c 
0.00/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05	c heuristics/guideddiving/maxlpiterquot = 0.075
0.00/0.05	c 
0.00/0.05	c # additional number of allowed LP iterations
0.00/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05	c heuristics/guideddiving/maxlpiterofs = 1500
0.00/0.05	c 
0.00/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05	c heuristics/intdiving/maxlpiterquot = 0.075
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05	c heuristics/intshifting/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05	c heuristics/linesearchdiving/freq = -1
0.00/0.05	c 
0.00/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05	c heuristics/linesearchdiving/maxlpiterquot = 0.075
0.00/0.05	c 
0.00/0.05	c # additional number of allowed LP iterations
0.00/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05	c heuristics/linesearchdiving/maxlpiterofs = 1500
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05	c heuristics/objpscostdiving/freq = -1
0.00/0.05	c 
0.00/0.05	c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.05	c # [type: real, range: [0,1], default: 0.01]
0.00/0.05	c heuristics/objpscostdiving/maxlpiterquot = 0.015
0.00/0.05	c 
0.00/0.05	c # additional number of allowed LP iterations
0.00/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05	c heuristics/objpscostdiving/maxlpiterofs = 1500
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05	c heuristics/oneopt/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05	c heuristics/pscostdiving/freq = -1
0.00/0.05	c 
0.00/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05	c heuristics/pscostdiving/maxlpiterquot = 0.075
0.00/0.05	c 
0.00/0.05	c # additional number of allowed LP iterations
0.00/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05	c heuristics/pscostdiving/maxlpiterofs = 1500
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05	c heuristics/rens/freq = -1
0.00/0.05	c 
0.00/0.05	c # minimum percentage of integer variables that have to be fixable 
0.00/0.05	c # [type: real, range: [0,1], default: 0.5]
0.00/0.05	c heuristics/rens/minfixingrate = 0.3
0.00/0.05	c 
0.00/0.05	c # number of nodes added to the contingent of the total nodes
0.00/0.05	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.05	c heuristics/rens/nodesofs = 2000
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.05	c heuristics/rootsoldiving/freq = -1
0.00/0.05	c 
0.00/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.05	c heuristics/rootsoldiving/maxlpiterquot = 0.015
0.00/0.05	c 
0.00/0.05	c # additional number of allowed LP iterations
0.00/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05	c heuristics/rootsoldiving/maxlpiterofs = 1500
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05	c heuristics/rounding/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <shiftandpropagate> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05	c heuristics/shiftandpropagate/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05	c heuristics/shifting/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05	c heuristics/simplerounding/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <subnlp> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05	c heuristics/subnlp/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <trivial> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05	c heuristics/trivial/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <trysol> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05	c heuristics/trysol/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <undercover> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05	c heuristics/undercover/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.05	c heuristics/veclendiving/freq = -1
0.00/0.05	c 
0.00/0.05	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.05	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.05	c heuristics/veclendiving/maxlpiterquot = 0.075
0.00/0.05	c 
0.00/0.05	c # additional number of allowed LP iterations
0.00/0.05	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.05	c heuristics/veclendiving/maxlpiterofs = 1500
0.00/0.05	c 
0.00/0.05	c # frequency for calling primal heuristic <zirounding> (-1: never, 0: only at depth freqofs)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.05	c heuristics/zirounding/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05	c separating/cmir/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.05	c separating/flowcover/freq = -1
0.00/0.05	c 
0.00/0.05	c # frequency for calling separator <rapidlearning> (-1: never, 0: only in root node)
0.00/0.05	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.05	c separating/rapidlearning/freq = 0
0.00/0.05	c 
0.00/0.05	c -----------------------------------------------------------------------------------------------
0.00/0.05	c start solving
0.00/0.05	c 
0.00/0.06	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.00/0.06	c   0.1s|     1 |     0 |    78 |     - |4253k|   0 |  48 | 100 | 152 | 100 | 152 |   0 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.09/0.10	c   0.1s|     1 |     0 |   164 |     - |4348k|   0 | 100 | 100 | 173 | 100 | 171 |  19 |   0 |   0 | 0.000000e+00 |      --      |    Inf 
0.09/0.19	c   0.2s|     1 |     0 |   173 |     - |4306k|   0 |  92 | 100 | 153 | 100 | 171 |  19 |   0 |   8 | 0.000000e+00 |      --      |    Inf 
0.29/0.31	c   0.3s|     1 |     0 |   180 |     - |4286k|   0 |  86 | 100 | 147 | 100 | 171 |  19 |   0 |  19 | 0.000000e+00 |      --      |    Inf 
0.29/0.32	c   0.3s|     1 |     0 |   185 |     - |4290k|   0 |  82 | 100 | 147 | 100 | 172 |  20 |   0 |  19 | 0.000000e+00 |      --      |    Inf 
0.29/0.38	c   0.4s|     1 |     0 |   212 |     - |4269k|   0 |  84 | 100 | 141 | 100 | 172 |  20 |   0 |  25 | 0.000000e+00 |      --      |    Inf 
0.39/0.40	c   0.4s|     1 |     0 |   213 |     - |4277k|   0 |  84 | 100 | 141 | 100 | 173 |  21 |   0 |  25 | 0.000000e+00 |      --      |    Inf 
0.39/0.43	c   0.4s|     1 |     0 |   224 |     - |4262k|   0 |  80 | 100 | 137 | 100 | 173 |  21 |   0 |  30 | 0.000000e+00 |      --      |    Inf 
0.39/0.47	c   0.5s|     1 |     0 |   224 |     - |4255k|   0 |   - | 100 | 137 | 100 | 173 |  21 |   0 |  37 | 0.000000e+00 |      --      |    Inf 
0.39/0.47	c (run 1, node 1) restarting after 25 global fixings of integer variables
0.39/0.47	c 
0.39/0.47	c (restart) converted 5 cuts from the global cut pool into linear constraints
0.39/0.47	c 
0.39/0.48	c presolving:
0.39/0.48	c (round 1) 25 del vars, 27 del conss, 0 add conss, 0 chg bounds, 76 chg sides, 76 chg coeffs, 0 upgd conss, 12084 impls, 0 clqs
0.39/0.48	c (round 2) 25 del vars, 27 del conss, 0 add conss, 0 chg bounds, 76 chg sides, 76 chg coeffs, 9 upgd conss, 12084 impls, 0 clqs
0.39/0.48	c (round 3) 25 del vars, 27 del conss, 0 add conss, 0 chg bounds, 80 chg sides, 81 chg coeffs, 9 upgd conss, 12084 impls, 0 clqs
0.39/0.48	c presolving (4 rounds):
0.39/0.48	c  25 deleted vars, 27 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 80 changed sides, 81 changed coefficients
0.39/0.48	c  12084 implications, 0 cliques
0.39/0.48	c presolved problem has 75 variables (75 bin, 0 int, 0 impl, 0 cont) and 115 constraints
0.39/0.48	c      81 constraints of type <knapsack>
0.39/0.48	c      29 constraints of type <setppc>
0.39/0.48	c       1 constraints of type <linear>
0.39/0.48	c       4 constraints of type <logicor>
0.39/0.48	c transformed objective value is always integral (scale: 1)
0.39/0.48	c Presolving Time: 0.04
0.39/0.48	c 
0.39/0.48	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.39/0.48	c   0.5s|     1 |     0 |   309 |     - |4046k|   0 |  52 |  75 | 115 |  75 | 111 |   0 |   0 |  37 | 0.000000e+00 |      --      |    Inf 
0.39/0.49	c   0.5s|     1 |     0 |   325 |     - |4141k|   0 |  61 |  75 | 115 |  75 | 130 |  19 |   0 |  37 | 0.000000e+00 |      --      |    Inf 
0.49/0.51	c   0.5s|     1 |     0 |   334 |     - |4126k|   0 |  58 |  75 | 111 |  75 | 130 |  19 |   0 |  42 | 0.000000e+00 |      --      |    Inf 
0.49/0.53	c   0.5s|     1 |     0 |   348 |     - |4112k|   0 |  57 |  75 | 107 |  75 | 130 |  19 |   0 |  47 | 0.000000e+00 |      --      |    Inf 
0.49/0.55	c   0.5s|     1 |     0 |   379 |     - |4098k|   0 |  52 |  75 | 103 |  75 | 130 |  19 |   0 |  52 | 0.000000e+00 |      --      |    Inf 
0.49/0.57	c   0.6s|     1 |     0 |   379 |     - |4092k|   0 |   - |  75 | 103 |  75 | 130 |  19 |   0 |  57 | 0.000000e+00 |      --      |    Inf 
0.49/0.57	c (run 2, node 1) restarting after 20 global fixings of integer variables
0.49/0.57	c 
0.49/0.57	c (restart) converted 2 cuts from the global cut pool into linear constraints
0.49/0.57	c 
0.49/0.57	c presolving:
0.49/0.57	c (round 1) 20 del vars, 27 del conss, 0 add conss, 0 chg bounds, 81 chg sides, 84 chg coeffs, 2 upgd conss, 12084 impls, 0 clqs
0.49/0.57	c (round 2) 20 del vars, 27 del conss, 0 add conss, 0 chg bounds, 81 chg sides, 86 chg coeffs, 2 upgd conss, 12084 impls, 0 clqs
0.49/0.57	c (round 3) 20 del vars, 27 del conss, 0 add conss, 0 chg bounds, 81 chg sides, 90 chg coeffs, 2 upgd conss, 12084 impls, 0 clqs
0.49/0.57	c (round 4) 20 del vars, 27 del conss, 0 add conss, 0 chg bounds, 81 chg sides, 93 chg coeffs, 2 upgd conss, 12084 impls, 0 clqs
0.49/0.57	c (round 5) 20 del vars, 27 del conss, 0 add conss, 0 chg bounds, 81 chg sides, 95 chg coeffs, 2 upgd conss, 12084 impls, 0 clqs
0.49/0.57	c (round 6) 20 del vars, 27 del conss, 0 add conss, 0 chg bounds, 81 chg sides, 96 chg coeffs, 2 upgd conss, 12084 impls, 0 clqs
0.49/0.57	c (round 7) 20 del vars, 27 del conss, 0 add conss, 0 chg bounds, 81 chg sides, 97 chg coeffs, 2 upgd conss, 12084 impls, 0 clqs
0.49/0.57	c presolving (8 rounds):
0.49/0.57	c  20 deleted vars, 27 deleted constraints, 0 added constraints, 0 tightened bounds, 0 added holes, 81 changed sides, 97 changed coefficients
0.49/0.57	c  12084 implications, 0 cliques
0.49/0.57	c presolved problem has 55 variables (55 bin, 0 int, 0 impl, 0 cont) and 78 constraints
0.49/0.57	c      62 constraints of type <knapsack>
0.49/0.57	c      15 constraints of type <setppc>
0.49/0.57	c       1 constraints of type <linear>
0.49/0.57	c transformed objective value is always integral (scale: 1)
0.49/0.57	c Presolving Time: 0.05
0.49/0.57	c 
0.49/0.57	c  time | node  | left  |LP iter|LP it/n| mem |mdpt |frac |vars |cons |cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.49/0.57	c   0.6s|     1 |     0 |   453 |     - |3893k|   0 |   - |  55 |  78 |  55 |  78 |   0 |   0 |  57 |    cutoff    |      --      |   0.00%
0.49/0.57	c   0.6s|     1 |     0 |   453 |     - |3893k|   0 |   - |  55 |  78 |  55 |  78 |   0 |   0 |  57 |    cutoff    |      --      |   0.00%
0.49/0.57	c 
0.49/0.57	c SCIP Status        : problem is solved [infeasible]
0.49/0.57	c Solving Time (sec) : 0.57
0.49/0.57	c Solving Nodes      : 1 (total of 3 nodes in 3 runs)
0.49/0.57	c Primal Bound       : +1.00000000000000e+20 (0 solutions)
0.49/0.57	c Dual Bound         : +1.00000000000000e+20
0.49/0.57	c Gap                : 0.00 %
0.49/0.57	s UNSATISFIABLE
0.49/0.57	c SCIP Status        : problem is solved [infeasible]
0.49/0.57	c Total Time         :       0.57
0.49/0.57	c   solving          :       0.57
0.49/0.57	c   presolving       :       0.05 (included in solving)
0.49/0.57	c   reading          :       0.01 (included in solving)
0.49/0.57	c Original Problem   :
0.49/0.57	c   Problem name     : HOME/instance-3450351-1307113718.opb
0.49/0.57	c   Variables        : 1598 (1598 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.57	c   Constraints      : 1750 initial, 1750 maximal
0.49/0.57	c Presolved Problem  :
0.49/0.57	c   Problem name     : t_HOME/instance-3450351-1307113718.opb
0.49/0.57	c   Variables        : 55 (55 binary, 0 integer, 0 implicit integer, 0 continuous)
0.49/0.57	c   Constraints      : 78 initial, 78 maximal
0.49/0.57	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons    AddCons   ChgSides   ChgCoefs
0.49/0.57	c   trivial          :       0.00         45          0          0          0          0          0          0          0          0
0.49/0.57	c   dualfix          :       0.00       1498          0          0          0          0          0          0          0          0
0.49/0.57	c   boundshift       :       0.00          0          0          0          0          0          0          0          0          0
0.49/0.57	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0          0
0.49/0.57	c   pseudoobj        :       0.00          0          0          0          0          0          0          0          0          0
0.49/0.57	c   implics          :       0.00          0          0          0          0          0          0          0          0          0
0.49/0.57	c   probing          :       0.00          0          0          0          0          0          0          0          0          0
0.49/0.57	c   knapsack         :       0.01          0          0          0          0          0         46          0        160        177
0.49/0.57	c   setppc           :       0.00          0          0          0          0          0          4          0          0          0
0.49/0.57	c   linear           :       0.00          0          0          0          0          0          0          0          1          1
0.49/0.57	c   logicor          :       0.00          0          0          0          0          0          4          0          0          0
0.49/0.57	c   pseudoboolean    :       0.00          0          0          0          0          0       1598          0          0          0
0.49/0.57	c   root node        :          -         45          -          -         45          -          -          -          -          -
0.49/0.57	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS     #Check   #Resprop    Cutoffs    DomReds       Cuts      Conss   Children
0.49/0.57	c   integral         :          0          0          0          9          0          2          0          0         45          0          0          0
0.49/0.57	c   knapsack         :         62          6         10          0          0          0          0          0          0        146          0          0
0.49/0.57	c   setppc           :         15          6         10          0          0          0          0          0          0          0          0          0
0.49/0.57	c   linear           :          1          7         10          0          0          0          0          0          0          0          0          0
0.49/0.57	c   countsols        :          0          0          0          0          0          0          0          0          0          0          0          0
0.49/0.57	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS      Check    Resprop
0.49/0.57	c   integral         :       0.38       0.00       0.00       0.38       0.00       0.00       0.00
0.49/0.57	c   knapsack         :       0.01       0.01       0.00       0.00       0.00       0.00       0.00
0.49/0.57	c   setppc           :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.49/0.57	c   linear           :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.49/0.57	c   countsols        :       0.00       0.00       0.00       0.00       0.00       0.00       0.00
0.49/0.57	c Propagators        : #Propagate   #Resprop    Cutoffs    DomReds
0.49/0.57	c   vbounds          :          0          0          0          0
0.49/0.57	c   rootredcost      :          0          0          0          0
0.49/0.57	c   pseudoobj        :          0          0          0          0
0.49/0.57	c Propagator Timings :  TotalTime  Propagate    Resprop
0.49/0.57	c   vbounds          :       0.00       0.00       0.00
0.49/0.57	c   rootredcost      :       0.00       0.00       0.00
0.49/0.57	c   pseudoobj        :       0.00       0.00       0.00
0.49/0.57	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
0.49/0.57	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
0.49/0.57	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
0.49/0.57	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
0.49/0.57	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
0.49/0.57	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
0.49/0.57	c   applied globally :          -          -          -          0        0.0          -          -          -
0.49/0.57	c   applied locally  :          -          -          -          0        0.0          -          -          -
0.49/0.57	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
0.49/0.57	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
0.49/0.57	c   redcost          :       0.00          6          0          0          0          0
0.49/0.57	c   impliedbounds    :       0.00          6          0          0          0          0
0.49/0.57	c   intobj           :       0.00          0          0          0          0          0
0.49/0.57	c   gomory           :       0.03          6          0          0          0          0
0.49/0.57	c   cgmip            :       0.00          0          0          0          0          0
0.49/0.57	c   closecuts        :       0.00          0          0          0          0          0
0.49/0.57	c   strongcg         :       0.02          6          0          0         59          0
0.49/0.57	c   cmir             :       0.00          0          0          0          0          0
0.49/0.57	c   flowcover        :       0.00          0          0          0          0          0
0.49/0.57	c   clique           :       0.00          2          0          0          0          0
0.49/0.57	c   zerohalf         :       0.00          0          0          0          0          0
0.49/0.57	c   mcf              :       0.00          2          0          0          0          0
0.49/0.57	c   oddcycle         :       0.00          0          0          0          0          0
0.49/0.57	c   rapidlearning    :       0.02          1          0          0          0         21
0.49/0.57	c Pricers            :       Time      Calls       Vars
0.49/0.57	c   problem variables:       0.00          0          0
0.49/0.57	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
0.49/0.57	c   relpscost        :       0.38          9          0         45          0          0          0
0.49/0.57	c   pscost           :       0.00          0          0          0          0          0          0
0.49/0.57	c   inference        :       0.00          0          0          0          0          0          0
0.49/0.57	c   mostinf          :       0.00          0          0          0          0          0          0
0.49/0.57	c   leastinf         :       0.00          0          0          0          0          0          0
0.49/0.57	c   fullstrong       :       0.00          0          0          0          0          0          0
0.49/0.57	c   allfullstrong    :       0.00          0          0          0          0          0          0
0.49/0.57	c   random           :       0.00          0          0          0          0          0          0
0.49/0.57	c Primal Heuristics  :       Time      Calls      Found
0.49/0.57	c   LP solutions     :       0.00          -          0
0.49/0.57	c   pseudo solutions :       0.00          -          0
0.49/0.57	c   trivial          :       0.00          1          0
0.49/0.57	c   shiftandpropagate:       0.00          0          0
0.49/0.57	c   simplerounding   :       0.00          0          0
0.49/0.57	c   zirounding       :       0.00          0          0
0.49/0.57	c   rounding         :       0.00          0          0
0.49/0.57	c   shifting         :       0.00          0          0
0.49/0.57	c   intshifting      :       0.00          0          0
0.49/0.57	c   oneopt           :       0.00          0          0
0.49/0.57	c   twoopt           :       0.00          0          0
0.49/0.57	c   fixandinfer      :       0.00          0          0
0.49/0.57	c   feaspump         :       0.00          0          0
0.49/0.57	c   clique           :       0.00          0          0
0.49/0.57	c   coefdiving       :       0.00          0          0
0.49/0.57	c   pscostdiving     :       0.00          0          0
0.49/0.57	c   fracdiving       :       0.00          0          0
0.49/0.57	c   veclendiving     :       0.00          0          0
0.49/0.57	c   intdiving        :       0.00          0          0
0.49/0.57	c   actconsdiving    :       0.00          0          0
0.49/0.57	c   objpscostdiving  :       0.00          0          0
0.49/0.57	c   rootsoldiving    :       0.00          0          0
0.49/0.57	c   linesearchdiving :       0.00          0          0
0.49/0.57	c   guideddiving     :       0.00          0          0
0.49/0.57	c   octane           :       0.00          0          0
0.49/0.57	c   rens             :       0.00          0          0
0.49/0.57	c   rins             :       0.00          0          0
0.49/0.57	c   localbranching   :       0.00          0          0
0.49/0.57	c   mutation         :       0.00          0          0
0.49/0.57	c   crossover        :       0.00          0          0
0.49/0.57	c   dins             :       0.00          0          0
0.49/0.57	c   vbounds          :       0.00          0          0
0.49/0.57	c   undercover       :       0.00          0          0
0.49/0.57	c   subnlp           :       0.00          0          0
0.49/0.57	c   trysol           :       0.00          0          0
0.49/0.57	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
0.49/0.57	c   primal LP        :       0.00          0          0       0.00          -
0.49/0.57	c   dual LP          :       0.03         14        453      32.36   13138.81
0.49/0.57	c   lex dual LP      :       0.00          0          0       0.00          -
0.49/0.57	c   barrier LP       :       0.00          0          0       0.00          -
0.49/0.57	c   diving/probing LP:       0.00          0          0       0.00          -
0.49/0.57	c   strong branching :       0.38         57       5151      90.37   13599.61
0.49/0.57	c     (at root node) :          -         57       5151      90.37          -
0.49/0.57	c   conflict analysis:       0.00          0          0       0.00          -
0.49/0.57	c B&B Tree           :
0.49/0.57	c   number of runs   :          3
0.49/0.57	c   nodes            :          1
0.49/0.57	c   nodes (total)    :          3
0.49/0.57	c   nodes left       :          0
0.49/0.57	c   max depth        :          0
0.49/0.57	c   max depth (total):          0
0.49/0.57	c   backtracks       :          0 (0.0%)
0.49/0.57	c   delayed cutoffs  :          0
0.49/0.57	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
0.49/0.57	c   avg switch length:       2.00
0.49/0.57	c   switching time   :       0.00
0.49/0.57	c Solution           :
0.49/0.57	c   Solutions found  :          0 (0 improvements)
0.49/0.57	c   Primal Bound     : infeasible
0.49/0.57	c   Dual Bound       :          -
0.49/0.57	c   Gap              :       0.00 %
0.49/0.57	c   Root Dual Bound  :          -
0.49/0.57	c   Root Iterations  :        453
0.49/0.58	c Time complete: 0.57.

Verifier Data 

ERROR: no interpretation found !

Watcher Data 

runsolver Copyright (C) 2010-2011 Olivier ROUSSEL

This is runsolver version 3.3.0 (svn: 977)

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-3450351-1307113718/watcher-3450351-1307113718 -o /tmp/evaluation-result-3450351-1307113718/solver-3450351-1307113718 -C 1800 -W 1900 -M 15500 HOME/scip-2.0.1.4b.linux.x86_64.gnu.opt.spx -f HOME/instance-3450351-1307113718.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.11 2.04 2.00 2/429 27459
/proc/meminfo: memFree=29062104/32951124 swapFree=43324008/67111528
[pid=27459] ppid=27457 vsize=19016 CPUtime=0.01 cores=1,3,5,7
/proc/27459/stat : 27459 (scip-2.0.1.4b.l) R 27457 27459 22076 0 -1 4202496 3704 0 0 0 1 0 0 0 25 0 1 0 822972293 19472384 3657 33554432000 4194304 9163163 140734055267456 18446744073709551615 5467984 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/27459/statm: 4754 3657 450 1214 0 3536 0

[startup+0.0639969 s]
/proc/loadavg: 2.11 2.04 2.00 2/429 27459
/proc/meminfo: memFree=29062104/32951124 swapFree=43324008/67111528
[pid=27459] ppid=27457 vsize=26308 CPUtime=0.05 cores=1,3,5,7
/proc/27459/stat : 27459 (scip-2.0.1.4b.l) R 27457 27459 22076 0 -1 4202496 5775 0 0 0 5 0 0 0 18 0 1 0 822972293 26939392 5471 33554432000 4194304 9163163 140734055267456 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/27459/statm: 6577 5471 674 1214 0 5359 0
Current children cumulated CPU time (s) 0.05
Current children cumulated vsize (KiB) 26308

[startup+0.100995 s]
/proc/loadavg: 2.11 2.04 2.00 2/429 27459
/proc/meminfo: memFree=29062104/32951124 swapFree=43324008/67111528
[pid=27459] ppid=27457 vsize=36240 CPUtime=0.09 cores=1,3,5,7
/proc/27459/stat : 27459 (scip-2.0.1.4b.l) R 27457 27459 22076 0 -1 4202496 8702 0 0 0 9 0 0 0 18 0 1 0 822972293 37109760 7692 33554432000 4194304 9163163 140734055267456 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/27459/statm: 9060 7692 712 1214 0 7842 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 36240

[startup+0.300954 s]
/proc/loadavg: 2.11 2.04 2.00 2/429 27459
/proc/meminfo: memFree=29062104/32951124 swapFree=43324008/67111528
[pid=27459] ppid=27457 vsize=36240 CPUtime=0.29 cores=1,3,5,7
/proc/27459/stat : 27459 (scip-2.0.1.4b.l) R 27457 27459 22076 0 -1 4202496 8705 0 0 0 28 1 0 0 18 0 1 0 822972293 37109760 7695 33554432000 4194304 9163163 140734055267456 18446744073709551615 7390669 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/27459/statm: 9060 7695 715 1214 0 7842 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 36240

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

[startup+0.500916 s]
/proc/loadavg: 2.11 2.04 2.00 2/429 27459
/proc/meminfo: memFree=29062104/32951124 swapFree=43324008/67111528
[pid=27459] ppid=27457 vsize=35920 CPUtime=0.49 cores=1,3,5,7
/proc/27459/stat : 27459 (scip-2.0.1.4b.l) R 27457 27459 22076 0 -1 4202496 8740 0 0 0 46 3 0 0 18 0 1 0 822972293 36782080 7654 33554432000 4194304 9163163 140734055267456 18446744073709551615 8087562 0 0 4096 16384 0 0 0 17 5 0 0 0
/proc/27459/statm: 8980 7654 717 1214 0 7762 0
Current children cumulated CPU time (s) 0.49
Current children cumulated vsize (KiB) 35920

Child status: 0
Real time (s): 0.585403
CPU time (s): 0.58491
CPU user time (s): 0.544917
CPU system time (s): 0.039993
CPU usage (%): 99.9158
Max. virtual memory (cumulated for all children) (KiB): 36308

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

runsolver used 0.003999 second user time and 0.013997 second system time

The end

Launcher Data 

Begin job on node105 at 2011-06-03 17:08:38
IDJOB=3450351
IDBENCH=48380
IDSOLVER=1948
FILE ID=node105/3450351-1307113718
RUNJOBID= node105-1307109798-27128
PBS_JOBID= 13497984
Free space on /tmp= 73752 MiB

SOLVER NAME= SCIP spx E SCIP 2.0.1.4b with SoPlex 1.5.0.4
BENCH NAME= PB07/normalized-PB07/SATUNSAT-SMALLINT-NLC/submittedPB07/manquinho/dbsg/normalized-dbsg_50_25_1_15.opb
COMMAND LINE= HOME/scip-2.0.1.4b.linux.x86_64.gnu.opt.spx -f BENCHNAME -t TIMEOUT -m MEMLIMIT
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-3450351-1307113718/watcher-3450351-1307113718 -o /tmp/evaluation-result-3450351-1307113718/solver-3450351-1307113718 -C 1800 -W 1900 -M 15500  HOME/scip-2.0.1.4b.linux.x86_64.gnu.opt.spx -f HOME/instance-3450351-1307113718.opb -t 1800 -m 15500

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

MD5SUM BENCH= ebbe5bb724184b6646f7cf4470989c3e
RANDOM SEED=169048974

node105.alineos.net Linux 2.6.18-164.el5 #1 SMP Thu Sep 3 03:28:30 EDT 2009

/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.825
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5333.65
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

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.825
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 16
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5226.15
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

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.825
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 2
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.82
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

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.825
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 18
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.75
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

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.825
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 4
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5410.70
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

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.825
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 20
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.74
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

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.825
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 6
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.82
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]

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.825
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 22
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm syscall nx rdtscp lm constant_tsc ida nonstop_tsc pni monitor ds_cpl vmx est tm2 cx16 xtpr popcnt lahf_lm
bogomips	: 5332.75
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management: [8]


/proc/meminfo:
MemTotal:     32951124 kB
MemFree:      29062508 kB
Buffers:        305116 kB
Cached:         808248 kB
SwapCached:      20984 kB
Active:        2920180 kB
Inactive:       655532 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:     32951124 kB
LowFree:      29062508 kB
SwapTotal:    67111528 kB
SwapFree:     43324008 kB
Dirty:           12048 kB
Writeback:           0 kB
AnonPages:     2459492 kB
Mapped:          22324 kB
Slab:           164340 kB
PageTables:      81288 kB
NFS_Unstable:        0 kB
Bounce:              0 kB
CommitLimit:  83587088 kB
Committed_AS: 114938900 kB
VmallocTotal: 34359738367 kB
VmallocUsed:    296008 kB
VmallocChunk: 34359440975 kB
HugePages_Total:     0
HugePages_Free:      0
HugePages_Rsvd:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 73740 MiB
End job on node105 at 2011-06-03 17:08:39