Trace number 1868080

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
SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009)SAT 2.09968 2.10036

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/
wnqueen/normalized-t2001.13queen13.1110977464.opb
MD5SUMb0491ed63ac891b703b860682674b01c
Bench CategoryDEC-SMALLINT (no optimisation, small integers)
Best result obtained on this benchmarkSAT
Best value of the objective obtained on this benchmark0
Best CPU time to get the best result obtained on this benchmark0.738886
Has Objective FunctionNO
SatisfiableYES
(Un)Satisfiability was provedYES
Best value of the objective function
Optimality of the best value was proved NO
Number of variables169
Total number of constraints101
Number of constraints which are clauses30
Number of constraints which are cardinality constraints (but not clauses)70
Number of constraints which are nor clauses,nor cardinality constraints1
Minimum length of a constraint2
Maximum length of a constraint169
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 38
Number of bits of the biggest number in a constraint 6
Biggest sum of numbers in a constraint 1205
Number of bits of the biggest sum of numbers11
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-1868080-1245115638.opb>
0.00/0.01	c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 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) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 47 upgd conss, 8 impls, 68 clqs
0.00/0.02	c (round 2) 0 del vars, 28 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 73 upgd conss, 8 impls, 68 clqs
0.00/0.02	c presolving (3 rounds):
0.00/0.02	c  0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.02	c  8 implications, 68 cliques
0.00/0.02	c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.02	c       1 constraints of type <knapsack>
0.00/0.02	c      68 constraints of type <setppc>
0.00/0.02	c       4 constraints of type <logicor>
0.00/0.02	c transformed objective value is always integral (scale: 1)
0.00/0.02	c Presolving Time: 0.01
0.00/0.02	c SATUNSAT-LIN
0.00/0.02	c -----------------------------------------------------------------------------------------------
0.00/0.02	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02	c separating/flowcover/freq = c -1
0.00/0.02	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02	c separating/cmir/freq = c -1
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.02	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/veclendiving/freq = c -1
0.00/0.02	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02	c heuristics/simplerounding/freq = c -1
0.00/0.02	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/shifting/freq = c -1
0.00/0.02	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02	c heuristics/rounding/freq = c -1
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.02	c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.02	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02	c heuristics/rootsoldiving/freq = c -1
0.00/0.02	c # number of nodes added to the contingent of the total nodes
0.00/0.02	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.02	c heuristics/rens/nodesofs = c 2000
0.00/0.02	c # minimum percentage of integer variables that have to be fixable 
0.00/0.02	c # [type: real, range: [0,1], default: 0.5]
0.00/0.02	c heuristics/rens/minfixingrate = c 0.3
0.00/0.02	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.02	c heuristics/rens/freq = c -1
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.02	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/pscostdiving/freq = c -1
0.00/0.02	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.02	c heuristics/oneopt/freq = c -1
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.02	c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.02	c # [type: real, range: [0,1], default: 0.01]
0.00/0.02	c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.02	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02	c heuristics/objpscostdiving/freq = c -1
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.02	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/linesearchdiving/freq = c -1
0.00/0.02	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/intshifting/freq = c -1
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.02	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/guideddiving/freq = c -1
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.02	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.02	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.02	c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.02	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.02	c heuristics/fracdiving/freq = c -1
0.00/0.02	c # additional number of allowed LP iterations
0.00/0.02	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.02	c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.02	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.02	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.02	c heuristics/feaspump/freq = c -1
0.00/0.02	c # minimum percentage of integer variables that have to be fixed 
0.00/0.02	c # [type: real, range: [0,1], default: 0.666]
0.00/0.03	c heuristics/crossover/minfixingrate = c 0.5
0.00/0.03	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.03	c # [type: real, range: [0,1], default: 0.1]
0.00/0.03	c heuristics/crossover/nodesquot = c 0.15
0.00/0.03	c # number of nodes without incumbent change that heuristic should wait
0.00/0.03	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.03	c heuristics/crossover/nwaitingnodes = c 100
0.00/0.03	c # number of nodes added to the contingent of the total nodes
0.00/0.03	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.03	c heuristics/crossover/nodesofs = c 750
0.00/0.03	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.03	c heuristics/crossover/freq = c -1
0.00/0.03	c # additional number of allowed LP iterations
0.00/0.03	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.03	c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.03	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.03	c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.03	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.03	c heuristics/coefdiving/freq = c -1
0.00/0.03	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c presolving/probing/maxrounds = c 0
0.00/0.03	c # should presolving try to simplify knapsacks
0.00/0.03	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03	c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.03	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.03	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.03	c constraints/knapsack/disaggregation = c FALSE
0.00/0.03	c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c constraints/knapsack/maxnumcardlift = c 0
0.00/0.03	c # should presolving try to simplify inequalities
0.00/0.03	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.03	c constraints/linear/simplifyinequalities = c TRUE
0.00/0.03	c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c separating/maxroundsroot = c 5
0.00/0.03	c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.03	c separating/maxrounds = c 1
0.00/0.03	c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.03	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.03	c limits/solutions = c 1
0.00/0.03	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03	c limits/memory = c 1620
0.00/0.03	c # maximal time in seconds to run
0.00/0.03	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.03	c limits/time = c 1791
0.00/0.03	c # frequency for displaying node information lines
0.00/0.03	c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.03	c display/freq = c 10000
0.00/0.03	c -----------------------------------------------------------------------------------------------
0.00/0.03	c start solving problem
0.00/0.03	c 
0.00/0.03	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.00/0.03	c   0.0s|     1 |     0 |   148 | 593k|   0 |  39 | 169 |  73 |  73 | 169 |  73 |   0 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.00/0.05	c   0.0s|     1 |     0 |   180 |1041k|   0 |  51 | 169 |  73 |  73 | 169 |  85 |  12 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.00/0.07	c   0.1s|     1 |     0 |   220 |1085k|   0 |  52 | 169 |  73 |  73 | 169 |  93 |  20 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.00/0.09	c   0.1s|     1 |     0 |   270 |1101k|   0 |  52 | 169 |  73 |  73 | 169 |  97 |  24 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.09/0.11	c   0.1s|     1 |     0 |   336 |1113k|   0 |  51 | 169 |  73 |  73 | 169 | 102 |  29 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.09/0.13	c   0.1s|     1 |     0 |   354 |1124k|   0 |  54 | 169 |  73 |  73 | 169 | 108 |  35 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.69/0.79	c   0.8s|     1 |     0 |   430 |1124k|   0 |  49 | 169 |  73 |  73 | 169 | 108 |  35 |   0 |  36 | 1.300000e+01 |      --      |    Inf 
0.89/0.94	c   0.9s|     1 |     0 |   496 |1124k|   0 |  45 | 169 |  73 |  73 | 169 | 108 |  35 |   0 |  45 | 1.300000e+01 |      --      |    Inf 
1.00/1.05	c   1.0s|     1 |     0 |   535 |1124k|   0 |  41 | 169 |  73 |  73 | 169 | 108 |  35 |   0 |  52 | 1.300000e+01 |      --      |    Inf 
1.09/1.11	c   1.1s|     1 |     0 |   562 |1124k|   0 |  44 | 169 |  73 |  73 | 169 | 108 |  35 |   0 |  57 | 1.300000e+01 |      --      |    Inf 
1.19/1.20	c   1.2s|     1 |     0 |   599 |1124k|   0 |  41 | 169 |  73 |  73 | 169 | 108 |  35 |   0 |  63 | 1.300000e+01 |      --      |    Inf 
1.29/1.30	c   1.3s|     1 |     0 |   616 |1124k|   0 |  43 | 169 |  72 |  72 | 169 |  99 |  35 |   0 |  69 | 1.300000e+01 |      --      |    Inf 
1.29/1.34	c   1.3s|     1 |     0 |   631 |1124k|   0 |  44 | 169 |  72 |  72 | 169 |  99 |  35 |   0 |  75 | 1.300000e+01 |      --      |    Inf 
1.29/1.39	c   1.4s|     1 |     0 |   631 |1124k|   0 |   - | 169 |  72 |  72 | 169 |  99 |  35 |   0 |  80 | 1.300000e+01 |      --      |    Inf 
1.29/1.39	c (run 1, node 1) restarting after 36 global fixings of integer variables
1.29/1.39	c 
1.29/1.39	(restart) converted 26 cuts from the global cut pool into linear constraints
1.29/1.40	c 
1.29/1.40	presolving:
1.39/1.40	c (round 1) 36 del vars, 4 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 0 upgd conss, 10 impls, 84 clqs
1.39/1.40	c (round 2) 36 del vars, 4 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 24 upgd conss, 10 impls, 84 clqs
1.39/1.41	c (round 3) 36 del vars, 6 del conss, 0 chg bounds, 1 chg sides, 0 chg coeffs, 24 upgd conss, 10 impls, 84 clqs
1.39/1.41	c presolving (4 rounds):
1.39/1.41	c  36 deleted vars, 6 deleted constraints, 0 tightened bounds, 0 added holes, 1 changed sides, 0 changed coefficients
1.39/1.41	c  10 implications, 84 cliques
1.39/1.41	c presolved problem has 133 variables (133 bin, 0 int, 0 impl, 0 cont) and 92 constraints
1.39/1.41	c       7 constraints of type <knapsack>
1.39/1.41	c      82 constraints of type <setppc>
1.39/1.41	c       3 constraints of type <logicor>
1.39/1.41	c transformed objective value is always integral (scale: 1)
1.39/1.41	c Presolving Time: 0.02
1.39/1.41	c 
1.39/1.41	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
1.39/1.41	c   1.4s|     1 |     0 |   726 | 708k|   0 |  42 | 133 |  92 |  92 | 133 |  92 |   0 |   0 |  80 | 1.300000e+01 |      --      |    Inf 
1.39/1.43	c   1.4s|     1 |     0 |   771 | 928k|   0 |  51 | 133 |  92 |  92 | 133 | 104 |  12 |   0 |  80 | 1.300000e+01 |      --      |    Inf 
1.49/1.54	c   1.5s|     1 |     0 |   818 | 928k|   0 |  46 | 133 |  92 |  92 | 133 | 104 |  12 |   0 |  91 | 1.300000e+01 |      --      |    Inf 
1.79/1.84	c   1.8s|     1 |     0 |   858 | 928k|   0 |  43 | 133 |  92 |  92 | 133 | 104 |  12 |   0 | 119 | 1.300000e+01 |      --      |    Inf 
1.79/1.89	c   1.8s|     1 |     0 |   886 | 928k|   0 |  39 | 133 |  92 |  92 | 133 | 104 |  12 |   0 | 125 | 1.300000e+01 |      --      |    Inf 
1.89/1.94	c   1.9s|     1 |     0 |   942 | 928k|   0 |  41 | 133 |  91 |  91 | 133 | 104 |  12 |   0 | 131 | 1.300000e+01 |      --      |    Inf 
1.89/1.97	c   1.9s|     1 |     0 |   961 | 928k|   0 |  43 | 133 |  91 |  91 | 133 | 104 |  12 |   0 | 136 | 1.300000e+01 |      --      |    Inf 
1.99/2.00	c   1.9s|     1 |     0 |   961 | 928k|   0 |   - | 133 |  91 |  91 | 133 | 104 |  12 |   0 | 141 | 1.300000e+01 |      --      |    Inf 
1.99/2.00	c (run 2, node 1) restarting after 30 global fixings of integer variables
1.99/2.00	c 
1.99/2.00	(restart) converted 12 cuts from the global cut pool into linear constraints
1.99/2.00	c 
1.99/2.00	presolving:
1.99/2.01	c (round 1) 30 del vars, 5 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 12 upgd conss, 28 impls, 80 clqs
1.99/2.02	c presolving (2 rounds):
1.99/2.02	c  30 deleted vars, 5 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
1.99/2.02	c  28 implications, 80 cliques
1.99/2.02	c presolved problem has 103 variables (103 bin, 0 int, 0 impl, 0 cont) and 98 constraints
1.99/2.02	c      13 constraints of type <knapsack>
1.99/2.02	c      81 constraints of type <setppc>
1.99/2.02	c       4 constraints of type <logicor>
1.99/2.02	c transformed objective value is always integral (scale: 1)
1.99/2.02	c Presolving Time: 0.03
1.99/2.02	c 
1.99/2.02	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
1.99/2.02	c   2.0s|     1 |     0 |  1069 | 754k|   0 |  24 | 103 |  98 |  98 | 103 |  98 |   0 |   0 | 141 | 1.300000e+01 |      --      |    Inf 
1.99/2.04	c   2.0s|     1 |     0 |  1108 | 890k|   0 |  43 | 103 |  98 |  98 | 103 | 104 |   6 |   0 | 141 | 1.300000e+01 |      --      |    Inf 
1.99/2.07	c   2.0s|     1 |     0 |  1137 | 885k|   0 |   0 | 103 |  81 |  81 | 103 | 104 |   6 |   0 | 146 | 1.300000e+01 |      --      |    Inf 
1.99/2.07	c (run 3, node 1) restarting after 33 global fixings of integer variables
1.99/2.07	c 
1.99/2.07	(restart) converted 6 cuts from the global cut pool into linear constraints
1.99/2.07	c 
1.99/2.07	presolving:
1.99/2.08	c (round 1) 33 del vars, 7 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 0 upgd conss, 42 impls, 55 clqs
1.99/2.08	c (round 2) 33 del vars, 7 del conss, 0 chg bounds, 0 chg sides, 1 chg coeffs, 5 upgd conss, 42 impls, 55 clqs
1.99/2.08	c presolving (3 rounds):
1.99/2.08	c  33 deleted vars, 7 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 1 changed coefficients
1.99/2.08	c  42 implications, 55 cliques
1.99/2.08	c presolved problem has 70 variables (70 bin, 0 int, 0 impl, 0 cont) and 80 constraints
1.99/2.08	c      18 constraints of type <knapsack>
1.99/2.08	c      60 constraints of type <setppc>
1.99/2.08	c       2 constraints of type <logicor>
1.99/2.08	c transformed objective value is always integral (scale: 1)
1.99/2.08	c Presolving Time: 0.04
1.99/2.08	c 
1.99/2.09	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
1.99/2.09	c   2.0s|     1 |     0 |  1204 | 729k|   0 |   0 |  70 |  80 |  80 |  70 |  80 |   0 |   0 | 146 | 1.300000e+01 |      --      |    Inf 
1.99/2.09	c * 2.0s|     1 |     0 |  1204 | 732k|   0 |   - |  70 |  80 |  80 |  70 |  80 |   0 |   0 | 146 | 1.300000e+01 | 1.300000e+01 |   0.00%
1.99/2.09	c 
1.99/2.09	c SCIP Status        : problem is solved [optimal solution found]
1.99/2.09	c Solving Time (sec) : 2.02
1.99/2.09	c Solving Nodes      : 1 (total of 4 nodes in 4 runs)
1.99/2.09	c Primal Bound       : +1.30000000000000e+01 (1 solutions)
1.99/2.09	c Dual Bound         : +1.30000000000000e+01
1.99/2.09	c Gap                : 0.00 %
1.99/2.09	c NODE         1
1.99/2.09	c DUAL BOUND   13
1.99/2.09	c PRIMAL BOUND 13
1.99/2.09	c GAP          0
1.99/2.09	s SATISFIABLE
1.99/2.09	v -x169 -x168 -x167 -x166 -x165 x164 -x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 -x152 -x151 -x150 -x149 -x148 
1.99/2.09	v -x147 -x146 x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 x135 -x134 -x133 -x132 -x131 -x130 -x129 -x128 -x127 
1.99/2.09	v -x126 -x125 x124 -x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 -x106 
1.99/2.09	v -x105 -x104 -x103 -x102 -x101 -x100 -x99 -x98 -x97 -x96 -x95 -x94 -x93 x92 -x91 -x90 -x89 -x88 -x87 -x86 -x85 -x84 -x83 -x82 
1.99/2.09	v x81 -x80 -x79 x78 -x77 -x76 -x75 -x74 -x73 -x72 -x71 -x70 -x69 -x68 -x67 -x66 -x65 -x64 -x63 -x62 -x61 -x60 -x59 x58 -x57 -x56 
1.99/2.09	v -x55 -x54 -x53 -x52 -x51 -x50 -x49 x48 -x47 -x46 -x45 -x44 -x43 -x42 -x41 -x40 -x39 x38 -x37 -x36 -x35 -x34 -x33 -x32 -x31 
1.99/2.09	v -x30 -x29 -x28 -x27 -x26 -x25 -x24 x23 -x22 -x21 -x20 -x19 -x18 -x17 -x16 -x15 -x14 -x13 -x12 -x11 -x10 -x9 -x8 -x7 -x6 -x5 
1.99/2.09	v x4 -x3 -x2 -x1 
1.99/2.09	c SCIP Status        : problem is solved [optimal solution found]
1.99/2.09	c Solving Time       :       2.02
1.99/2.09	c Original Problem   :
1.99/2.09	c   Problem name     : HOME/instance-1868080-1245115638.opb
1.99/2.09	c   Variables        : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.99/2.09	c   Constraints      : 101 initial, 101 maximal
1.99/2.09	c Presolved Problem  :
1.99/2.09	c   Problem name     : t_HOME/instance-1868080-1245115638.opb
1.99/2.09	c   Variables        : 70 (70 binary, 0 integer, 0 implicit integer, 0 continuous)
1.99/2.09	c   Constraints      : 80 initial, 80 maximal
1.99/2.09	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
1.99/2.09	c   trivial          :       0.00         99          0          0          0          0          0          0          0
1.99/2.09	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
1.99/2.09	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
1.99/2.09	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
1.99/2.09	c   implics          :       0.00          0          0          0          0          0          0          0          0
1.99/2.09	c   probing          :       0.00          0          0          0          0          0          0          0          0
1.99/2.09	c   knapsack         :       0.02          0          0          0          0          0          0          0          1
1.99/2.09	c   setppc           :       0.01          0          0          0          0          0         13          0          0
1.99/2.09	c   linear           :       0.01          0          0          0          0          0         31          1          0
1.99/2.09	c   logicor          :       0.00          0          0          0          0          0          2          0          0
1.99/2.09	c   root node        :          -         99          -          -         99          -          -          -          -
1.99/2.09	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
1.99/2.09	c   integral         :          0          0          0         17          0          0         71          0          0          0
1.99/2.09	c   knapsack         :         18          8         18          2          0          0          0          0          0          0
1.99/2.09	c   setppc           :         60          8         18          2          0          0         28          0          0          0
1.99/2.09	c   logicor          :          2          8          5          2          0          0          0          0          0          0
1.99/2.09	c   countsols        :          0          0          0          2          0          0          0          0          0          0
1.99/2.09	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
1.99/2.09	c   integral         :       1.77       0.00       0.00       1.77       0.00
1.99/2.09	c   knapsack         :       0.00       0.00       0.00       0.00       0.00
1.99/2.09	c   setppc           :       0.00       0.00       0.00       0.00       0.00
1.99/2.09	c   logicor          :       0.00       0.00       0.00       0.00       0.00
1.99/2.09	c   countsols        :       0.00       0.00       0.00       0.00       0.00
1.99/2.09	c Propagators        :       Time      Calls    Cutoffs    DomReds
1.99/2.09	c   rootredcost      :       0.00          0          0          0
1.99/2.09	c   pseudoobj        :       0.00         22          0          0
1.99/2.09	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
1.99/2.09	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
1.99/2.09	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
1.99/2.09	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
1.99/2.09	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
1.99/2.09	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
1.99/2.09	c   applied globally :          -          -          -          0        0.0          -          -          -
1.99/2.09	c   applied locally  :          -          -          -          0        0.0          -          -          -
1.99/2.09	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
1.99/2.09	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 0)
1.99/2.09	c   redcost          :       0.00          8          0          0          0          0
1.99/2.09	c   impliedbounds    :       0.00          7          0          0          0          0
1.99/2.09	c   intobj           :       0.00          0          0          0          0          0
1.99/2.09	c   gomory           :       0.05          8          0          0         63          0
1.99/2.09	c   strongcg         :       0.04          8          0          0        198          0
1.99/2.09	c   cmir             :       0.00          0          0          0          0          0
1.99/2.09	c   flowcover        :       0.00          0          0          0          0          0
1.99/2.09	c   clique           :       0.00          8          0          0         36          0
1.99/2.09	c   zerohalf         :       0.00          0          0          0          0          0
1.99/2.09	c   mcf              :       0.00          4          0          0          0          0
1.99/2.09	c Pricers            :       Time      Calls       Vars
1.99/2.09	c   problem variables:       0.00          0          0
1.99/2.09	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
1.99/2.09	c   relpscost        :       1.77         15          0         71          0          0          0
1.99/2.09	c   pscost           :       0.00          0          0          0          0          0          0
1.99/2.09	c   inference        :       0.00          0          0          0          0          0          0
1.99/2.09	c   mostinf          :       0.00          0          0          0          0          0          0
1.99/2.09	c   leastinf         :       0.00          0          0          0          0          0          0
1.99/2.09	c   fullstrong       :       0.00          0          0          0          0          0          0
1.99/2.09	c   allfullstrong    :       0.00          0          0          0          0          0          0
1.99/2.09	c   random           :       0.00          0          0          0          0          0          0
1.99/2.09	c Primal Heuristics  :       Time      Calls      Found
1.99/2.09	c   LP solutions     :       0.00          -          1
1.99/2.09	c   pseudo solutions :       0.00          -          0
1.99/2.09	c   simplerounding   :       0.00          0          0
1.99/2.09	c   rounding         :       0.00          0          0
1.99/2.09	c   shifting         :       0.00          0          0
1.99/2.09	c   intshifting      :       0.00          0          0
1.99/2.09	c   oneopt           :       0.00          0          0
1.99/2.09	c   fixandinfer      :       0.00          0          0
1.99/2.09	c   feaspump         :       0.00          0          0
1.99/2.09	c   coefdiving       :       0.00          0          0
1.99/2.09	c   pscostdiving     :       0.00          0          0
1.99/2.09	c   fracdiving       :       0.00          0          0
1.99/2.09	c   veclendiving     :       0.00          0          0
1.99/2.09	c   intdiving        :       0.00          0          0
1.99/2.09	c   actconsdiving    :       0.00          0          0
1.99/2.09	c   objpscostdiving  :       0.00          0          0
1.99/2.09	c   rootsoldiving    :       0.00          0          0
1.99/2.09	c   linesearchdiving :       0.00          0          0
1.99/2.09	c   guideddiving     :       0.00          0          0
1.99/2.09	c   octane           :       0.00          0          0
1.99/2.09	c   rens             :       0.00          0          0
1.99/2.09	c   rins             :       0.00          0          0
1.99/2.09	c   localbranching   :       0.00          0          0
1.99/2.09	c   mutation         :       0.00          0          0
1.99/2.09	c   crossover        :       0.00          0          0
1.99/2.09	c   dins             :       0.00          0          0
1.99/2.09	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
1.99/2.09	c   primal LP        :       0.00          0          0       0.00          -
1.99/2.09	c   dual LP          :       0.10         24       1204      50.17   12040.00
1.99/2.09	c   barrier LP       :       0.00          0          0       0.00          -
1.99/2.09	c   diving/probing LP:       0.00          0          0       0.00          -
1.99/2.09	c   strong branching :       1.77        146      19954     136.67   11273.45
1.99/2.09	c     (at root node) :          -        146      19954     136.67          -
1.99/2.09	c   conflict analysis:       0.00          0          0       0.00          -
1.99/2.09	c B&B Tree           :
1.99/2.09	c   number of runs   :          4
1.99/2.09	c   nodes            :          1
1.99/2.09	c   nodes (total)    :          4
1.99/2.09	c   nodes left       :          0
1.99/2.09	c   max depth        :          0
1.99/2.09	c   max depth (total):          0
1.99/2.09	c   backtracks       :          0 (0.0%)
1.99/2.09	c   delayed cutoffs  :          0
1.99/2.09	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
1.99/2.09	c   avg switch length:       2.00
1.99/2.09	c   switching time   :       0.00
1.99/2.09	c Solution           :
1.99/2.09	c   Solutions found  :          1 (1 improvements)
1.99/2.09	c   Primal Bound     : +1.30000000000000e+01   (in run 4, after 1 nodes, 2.02 seconds, depth 0, found by <relaxation>)
1.99/2.09	c   Dual Bound       : +1.30000000000000e+01
1.99/2.09	c   Gap              :       0.00 %
1.99/2.09	c   Root Dual Bound  : +1.30000000000000e+01
1.99/2.09	c Time complete: 2.09.

Verifier Data 

OK	0

Watcher Data 

runsolver version 3.2.9 (svn:492) (c) roussel@cril.univ-artois.fr

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-1868080-1245115638/watcher-1868080-1245115638 -o /tmp/evaluation-result-1868080-1245115638/solver-1868080-1245115638 -C 1800 -W 2000 -M 1800 HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 1800 -f HOME/instance-1868080-1245115638.opb 

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): 2000 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 1843200 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 1894400 KiB
Current StackSize limit: 10240 KiB


[startup+0 s]
/proc/loadavg: 0.92 0.98 1.00 3/64 3974
/proc/meminfo: memFree=1020400/2055920 swapFree=4191900/4192956
[pid=3974] ppid=3972 vsize=4324 CPUtime=0
/proc/3974/stat : 3974 (pbscip.linux.x8) R 3972 3974 3578 0 -1 4194304 474 0 0 0 0 0 0 0 18 0 1 0 179163079 4427776 458 1992294400 4194304 7823515 548682068736 18446744073709551615 6825072 0 0 4096 0 0 0 0 17 1 0 0
/proc/3974/statm: 1082 464 300 886 0 192 0

[startup+0.0172669 s]
/proc/loadavg: 0.92 0.98 1.00 3/64 3974
/proc/meminfo: memFree=1020400/2055920 swapFree=4191900/4192956
[pid=3974] ppid=3972 vsize=10104 CPUtime=0
/proc/3974/stat : 3974 (pbscip.linux.x8) R 3972 3974 3578 0 -1 4194304 2149 0 0 0 0 0 0 0 18 0 1 0 179163079 10346496 1777 1992294400 4194304 7823515 548682068736 18446744073709551615 4685888 0 0 4096 16384 0 0 0 17 1 0 0
/proc/3974/statm: 2526 1777 385 886 0 1636 0
Current children cumulated CPU time (s) 0
Current children cumulated vsize (KiB) 10104

[startup+0.101278 s]
/proc/loadavg: 0.92 0.98 1.00 3/64 3974
/proc/meminfo: memFree=1020400/2055920 swapFree=4191900/4192956
[pid=3974] ppid=3972 vsize=13324 CPUtime=0.09
/proc/3974/stat : 3974 (pbscip.linux.x8) R 3972 3974 3578 0 -1 4194304 2933 0 0 0 8 1 0 0 17 0 1 0 179163079 13643776 2561 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/3974/statm: 3331 2561 548 886 0 2441 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 13324

[startup+0.30131 s]
/proc/loadavg: 0.92 0.98 1.00 3/64 3974
/proc/meminfo: memFree=1020400/2055920 swapFree=4191900/4192956
[pid=3974] ppid=3972 vsize=13592 CPUtime=0.29
/proc/3974/stat : 3974 (pbscip.linux.x8) R 3972 3974 3578 0 -1 4194304 2994 0 0 0 27 2 0 0 18 0 1 0 179163079 13918208 2622 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/3974/statm: 3398 2622 551 886 0 2508 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 13592

[startup+0.70137 s]
/proc/loadavg: 0.92 0.98 1.00 3/64 3974
/proc/meminfo: memFree=1020400/2055920 swapFree=4191900/4192956
[pid=3974] ppid=3972 vsize=13592 CPUtime=0.69
/proc/3974/stat : 3974 (pbscip.linux.x8) R 3972 3974 3578 0 -1 4194304 3007 0 0 0 67 2 0 0 21 0 1 0 179163079 13918208 2635 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/3974/statm: 3398 2635 551 886 0 2508 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 13592

[startup+1.50149 s]
/proc/loadavg: 0.92 0.98 1.00 2/65 3975
/proc/meminfo: memFree=1011944/2055920 swapFree=4191900/4192956
[pid=3974] ppid=3972 vsize=14552 CPUtime=1.49
/proc/3974/stat : 3974 (pbscip.linux.x8) R 3972 3974 3578 0 -1 4194304 3250 0 0 0 145 4 0 0 25 0 1 0 179163079 14901248 2877 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/3974/statm: 3638 2877 559 886 0 2748 0
Current children cumulated CPU time (s) 1.49
Current children cumulated vsize (KiB) 14552

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

[startup+1.90155 s]
/proc/loadavg: 0.92 0.98 1.00 2/65 3975
/proc/meminfo: memFree=1011944/2055920 swapFree=4191900/4192956
[pid=3974] ppid=3972 vsize=14552 CPUtime=1.89
/proc/3974/stat : 3974 (pbscip.linux.x8) R 3972 3974 3578 0 -1 4194304 3250 0 0 0 184 5 0 0 25 0 1 0 179163079 14901248 2877 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/3974/statm: 3638 2877 559 886 0 2748 0
Current children cumulated CPU time (s) 1.89
Current children cumulated vsize (KiB) 14552

[startup+2.00157 s]
/proc/loadavg: 0.92 0.98 1.00 2/65 3975
/proc/meminfo: memFree=1011944/2055920 swapFree=4191900/4192956
[pid=3974] ppid=3972 vsize=14552 CPUtime=1.99
/proc/3974/stat : 3974 (pbscip.linux.x8) R 3972 3974 3578 0 -1 4194304 3250 0 0 0 194 5 0 0 25 0 1 0 179163079 14901248 2877 1992294400 4194304 7823515 548682068736 18446744073709551615 6954986 0 0 4096 16384 0 0 0 17 1 0 0
/proc/3974/statm: 3638 2877 559 886 0 2748 0
Current children cumulated CPU time (s) 1.99
Current children cumulated vsize (KiB) 14552

Child status: 0
Real time (s): 2.10036
CPU time (s): 2.09968
CPU user time (s): 2.03369
CPU system time (s): 0.065989
CPU usage (%): 99.9673
Max. virtual memory (cumulated for all children) (KiB): 14552

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 2.03369
system time used= 0.065989
maximum resident set size= 0
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 3347
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= 5
involuntary context switches= 2

runsolver used 0.004999 second user time and 0.013997 second system time

The end

Launcher Data 

Begin job on node34 at 2009-06-16 03:27:18
IDJOB=1868080
IDBENCH=1207
IDSOLVER=683
FILE ID=node34/1868080-1245115638
PBS_JOBID= 9363634
Free space on /tmp= 66252 MiB

SOLVER NAME= SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009)
BENCH NAME= PB06//final/normalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/wnqueen/normalized-t2001.13queen13.1110977464.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-1868080-1245115638/watcher-1868080-1245115638 -o /tmp/evaluation-result-1868080-1245115638/solver-1868080-1245115638 -C 1800 -W 2000 -M 1800  HOME/pbscip.linux.x86_64.gnu.opt-gcc42.spx -t 1800 -m 1800 -f HOME/instance-1868080-1245115638.opb

TIME LIMIT= 1800 seconds
MEMORY LIMIT= 1800 MiB
MAX NB THREAD= 0

MD5SUM BENCH= b0491ed63ac891b703b860682674b01c
RANDOM SEED=913472098

node34.alineos.net Linux 2.6.9-22.EL.rootsmp #1 SMP Mon Oct 3 08:59:52 CEST 2005

/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.263
cache size	: 2048 KB
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
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 lm pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5914.62
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 15
model		: 4
model name	:                   Intel(R) Xeon(TM) CPU 3.00GHz
stepping	: 3
cpu MHz		: 3000.263
cache size	: 2048 KB
fpu		: yes
fpu_exception	: yes
cpuid level	: 5
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 lm pni monitor ds_cpl cid cx16 xtpr
bogomips	: 5586.94
clflush size	: 64
cache_alignment	: 128
address sizes	: 36 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:      2055920 kB
MemFree:       1020880 kB
Buffers:         83616 kB
Cached:         858616 kB
SwapCached:        384 kB
Active:          95996 kB
Inactive:       859608 kB
HighTotal:           0 kB
HighFree:            0 kB
LowTotal:      2055920 kB
LowFree:       1020880 kB
SwapTotal:     4192956 kB
SwapFree:      4191900 kB
Dirty:            9836 kB
Writeback:           0 kB
Mapped:          21784 kB
Slab:            65552 kB
Committed_AS:   151532 kB
PageTables:       1384 kB
VmallocTotal: 536870911 kB
VmallocUsed:    264952 kB
VmallocChunk: 536605679 kB
HugePages_Total:     0
HugePages_Free:      0
Hugepagesize:     2048 kB

Free space on /tmp at the end= 66244 MiB
End job on node34 at 2009-06-16 03:27:20