Trace number 3729123

Some explanations

A solver is run under the control of another program named runsolver. runsolver is in charge of imposing the CPU time limit and the memory limit to the solver. It also monitors some information about the process. The trace of the execution of a solver is divided into four (or five) parts:
  1. SOLVER DATA
    This is the output of the solver (stdout and stderr).
    Note that some very long lines in this section may be truncated by your web browser ! In such a case, you may want to use the "Download as text" link to get the trace as a text file.

    When the --timestamp option is passed to the runsolver program, each line output by the solver is prepended with a timestamp which indicates at what time the line was output by the solver. Times are relative to the start of the program, given in seconds. The first timestamp (if present) is estimated CPU time. The last timestamp is wall clock time.

    As some 'v lines' may be very long (sometimes several megabytes), the 'v line' output by your solver may be split on several lines to help limit the size of the trace recorded in the database. In any case, the exact output of your solver is preserved in a trace file.
  2. VERIFIER DATA
    The output of the solver is piped to a verifier program which will search a value line "v " and, if found, will check that the given interpretation satisfies all constraints.
  3. CONVERSION SCRIPT DATA (Optionnal)
    When a conversion script is used, this section shows the messages that were output by the conversion script.
  4. WATCHER DATA
    This is the informations gathered by the runsolver program. It first prints the different limits. There's a first limit on CPU time set to X seconds (see the parameters in the trace). After this time has ellapsed, runsolver sends a SIGTERM and 2 seconds later a SIGKILL to the solver. For safety, there's also another limit set to X+30 seconds which will send a SIGXPU to the solver. The last limit is on the virtual memory used by the process (see the parameters in the trace).
    Every ten seconds, the runsolver process fetches the content of /proc/loadavg, /proc/pid/stat and /proc/pid/statm (see man proc) and prints it as raw data. This is only recorded in case we need to investigate the behaviour of a solver. The memory used by the solver (vsize) is also given every ten seconds.
    When the solver exits, runsolver prints some informations such as status and time. CPU usage is the ratio CPU Time/Real Time.
  5. LAUNCHER DATA
    These informations are related to the script which will launch the solver. The most important informations are the command line given to the solver, the md5sum of the different files and the dump of the /proc/cpuinfo and /proc/meminfo which provides some useful information on the computer.

Solver answer on this benchmark

Solver NameAnswerCPU timeWall clock time
PB09: SCIPspx SCIP 1.1.0.7 with SoPLEX 1.4.1(24.4.2009)SAT 1.42778 1.42911

General information on the benchmark

Namenormalized-PB06/SATUNSAT-SMALLINT/submitted-PB06/namasivayam/
wnqueen/normalized-t2001.13queen13.1110970277.opb
MD5SUM6be9a20fbf662ba035d4f80998506e8e
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.029995
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 1155
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.00	c SCIP version 1.1.0.7
0.00/0.00	c LP-Solver SoPlex 1.4.1
0.00/0.00	c user parameter file <scip.set> not found - using default parameters
0.00/0.00	c read problem <HOME/instance-3729123-1338679258.opb>
0.00/0.00	c original problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 101 constraints
0.00/0.00	c No objective function, only one solution is needed.
0.00/0.00	c start presolving problem
0.00/0.00	c presolving:
0.00/0.01	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.01	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.01	c presolving (3 rounds):
0.00/0.01	c  0 deleted vars, 28 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.00/0.01	c  8 implications, 68 cliques
0.00/0.01	c presolved problem has 169 variables (169 bin, 0 int, 0 impl, 0 cont) and 73 constraints
0.00/0.01	c       1 constraints of type <knapsack>
0.00/0.01	c      68 constraints of type <setppc>
0.00/0.01	c       4 constraints of type <logicor>
0.00/0.01	c transformed objective value is always integral (scale: 1)
0.00/0.01	c Presolving Time: 0.00
0.00/0.01	c SATUNSAT-LIN
0.00/0.01	c -----------------------------------------------------------------------------------------------
0.00/0.01	c # frequency for calling separator <flowcover> (-1: never, 0: only in root node)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01	c separating/flowcover/freq = c -1
0.00/0.01	c # frequency for calling separator <cmir> (-1: never, 0: only in root node)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01	c separating/cmir/freq = c -1
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/veclendiving/maxlpiterofs = c 1500
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01	c heuristics/veclendiving/maxlpiterquot = c 0.075
0.00/0.01	c # frequency for calling primal heuristic <veclendiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/veclendiving/freq = c -1
0.00/0.01	c # frequency for calling primal heuristic <simplerounding> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01	c heuristics/simplerounding/freq = c -1
0.00/0.01	c # frequency for calling primal heuristic <shifting> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/shifting/freq = c -1
0.00/0.01	c # frequency for calling primal heuristic <rounding> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01	c heuristics/rounding/freq = c -1
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/rootsoldiving/maxlpiterofs = c 1500
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.01]
0.00/0.01	c heuristics/rootsoldiving/maxlpiterquot = c 0.015
0.00/0.01	c # frequency for calling primal heuristic <rootsoldiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01	c heuristics/rootsoldiving/freq = c -1
0.00/0.01	c # number of nodes added to the contingent of the total nodes
0.00/0.01	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01	c heuristics/rens/nodesofs = c 2000
0.00/0.01	c # minimum percentage of integer variables that have to be fixable 
0.00/0.01	c # [type: real, range: [0,1], default: 0.5]
0.00/0.01	c heuristics/rens/minfixingrate = c 0.3
0.00/0.01	c # frequency for calling primal heuristic <rens> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 0]
0.00/0.01	c heuristics/rens/freq = c -1
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/pscostdiving/maxlpiterofs = c 1500
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01	c heuristics/pscostdiving/maxlpiterquot = c 0.075
0.00/0.01	c # frequency for calling primal heuristic <pscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/pscostdiving/freq = c -1
0.00/0.01	c # frequency for calling primal heuristic <oneopt> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 1]
0.00/0.01	c heuristics/oneopt/freq = c -1
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/objpscostdiving/maxlpiterofs = c 1500
0.00/0.01	c # maximal fraction of diving LP iterations compared to total iteration number
0.00/0.01	c # [type: real, range: [0,1], default: 0.01]
0.00/0.01	c heuristics/objpscostdiving/maxlpiterquot = c 0.015
0.00/0.01	c # frequency for calling primal heuristic <objpscostdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01	c heuristics/objpscostdiving/freq = c -1
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/linesearchdiving/maxlpiterofs = c 1500
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01	c heuristics/linesearchdiving/maxlpiterquot = c 0.075
0.00/0.01	c # frequency for calling primal heuristic <linesearchdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/linesearchdiving/freq = c -1
0.00/0.01	c # frequency for calling primal heuristic <intshifting> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/intshifting/freq = c -1
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01	c heuristics/intdiving/maxlpiterquot = c 0.075
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/guideddiving/maxlpiterofs = c 1500
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01	c heuristics/guideddiving/maxlpiterquot = c 0.075
0.00/0.01	c # frequency for calling primal heuristic <guideddiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/guideddiving/freq = c -1
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/fracdiving/maxlpiterofs = c 1500
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01	c heuristics/fracdiving/maxlpiterquot = c 0.075
0.00/0.01	c # frequency for calling primal heuristic <fracdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/fracdiving/freq = c -1
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/feaspump/maxlpiterofs = c 2000
0.00/0.01	c # frequency for calling primal heuristic <feaspump> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 20]
0.00/0.01	c heuristics/feaspump/freq = c -1
0.00/0.01	c # minimum percentage of integer variables that have to be fixed 
0.00/0.01	c # [type: real, range: [0,1], default: 0.666]
0.00/0.01	c heuristics/crossover/minfixingrate = c 0.5
0.00/0.01	c # contingent of sub problem nodes in relation to the number of nodes of the original problem
0.00/0.01	c # [type: real, range: [0,1], default: 0.1]
0.00/0.01	c heuristics/crossover/nodesquot = c 0.15
0.00/0.01	c # number of nodes without incumbent change that heuristic should wait
0.00/0.01	c # [type: longint, range: [0,9223372036854775807], default: 200]
0.00/0.01	c heuristics/crossover/nwaitingnodes = c 100
0.00/0.01	c # number of nodes added to the contingent of the total nodes
0.00/0.01	c # [type: longint, range: [0,9223372036854775807], default: 500]
0.00/0.01	c heuristics/crossover/nodesofs = c 750
0.00/0.01	c # frequency for calling primal heuristic <crossover> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 30]
0.00/0.01	c heuristics/crossover/freq = c -1
0.00/0.01	c # additional number of allowed LP iterations
0.00/0.01	c # [type: int, range: [0,2147483647], default: 1000]
0.00/0.01	c heuristics/coefdiving/maxlpiterofs = c 1500
0.00/0.01	c # maximal fraction of diving LP iterations compared to node LP iterations
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 0.05]
0.00/0.01	c heuristics/coefdiving/maxlpiterquot = c 0.075
0.00/0.01	c # frequency for calling primal heuristic <coefdiving> (-1: never, 0: only at depth freqofs)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 10]
0.00/0.01	c heuristics/coefdiving/freq = c -1
0.00/0.01	c # maximal number of presolving rounds the presolver participates in (-1: no limit)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01	c presolving/probing/maxrounds = c 0
0.00/0.01	c # should presolving try to simplify knapsacks
0.00/0.01	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01	c constraints/knapsack/simplifyinequalities = c TRUE
0.00/0.01	c # should disaggregation of knapsack constraints be allowed in preprocessing?
0.00/0.01	c # [type: bool, range: {TRUE,FALSE}, default: TRUE]
0.00/0.01	c constraints/knapsack/disaggregation = c FALSE
0.00/0.01	c # maximal number of cardinality inequalities lifted per separation round (-1: unlimited)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01	c constraints/knapsack/maxnumcardlift = c 0
0.00/0.01	c # should presolving try to simplify inequalities
0.00/0.01	c # [type: bool, range: {TRUE,FALSE}, default: FALSE]
0.00/0.01	c constraints/linear/simplifyinequalities = c TRUE
0.00/0.01	c # maximal number of separation rounds in the root node (-1: unlimited)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01	c separating/maxroundsroot = c 5
0.00/0.01	c # maximal number of separation rounds per node (-1: unlimited)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 5]
0.00/0.01	c separating/maxrounds = c 1
0.00/0.01	c # solving stops, if the given number of solutions were found (-1: no limit)
0.00/0.01	c # [type: int, range: [-1,2147483647], default: -1]
0.00/0.01	c limits/solutions = c 1
0.00/0.01	c # maximal memory usage in MB; reported memory usage is lower than real memory usage!
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01	c limits/memory = c 13950
0.00/0.01	c # maximal time in seconds to run
0.00/0.01	c # [type: real, range: [0,1.79769313486232e+308], default: 1e+20]
0.00/0.01	c limits/time = c 1791
0.00/0.01	c # frequency for displaying node information lines
0.00/0.01	c # [type: int, range: [-1,2147483647], default: 100]
0.00/0.01	c display/freq = c 10000
0.00/0.01	c -----------------------------------------------------------------------------------------------
0.00/0.01	c start solving problem
0.00/0.01	c 
0.00/0.01	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.00/0.01	c   0.0s|     1 |     0 |   116 | 593k|   0 |  44 | 169 |  73 |  73 | 169 |  73 |   0 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.00/0.02	c   0.0s|     1 |     0 |   136 | 783k|   0 |  50 | 169 |  73 |  73 | 169 |  84 |  11 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.00/0.03	c   0.0s|     1 |     0 |   160 |1061k|   0 |  52 | 169 |  73 |  73 | 169 |  94 |  21 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.00/0.04	c   0.0s|     1 |     0 |   215 |1314k|   0 |  60 | 169 |  73 |  73 | 169 | 102 |  29 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.00/0.04	c   0.0s|     1 |     0 |   232 |1363k|   0 |  62 | 169 |  73 |  73 | 169 | 107 |  34 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.04/0.05	c   0.0s|     1 |     0 |   262 |1404k|   0 |  62 | 169 |  73 |  73 | 169 | 112 |  39 |   0 |   0 | 1.300000e+01 |      --      |    Inf 
0.29/0.35	c   0.3s|     1 |     0 |   306 |1404k|   0 |  58 | 169 |  73 |  73 | 169 | 112 |  39 |   0 |  36 | 1.300000e+01 |      --      |    Inf 
0.39/0.46	c   0.5s|     1 |     0 |   342 |1404k|   0 |  58 | 169 |  73 |  73 | 169 | 112 |  39 |   0 |  49 | 1.300000e+01 |      --      |    Inf 
0.48/0.57	c   0.6s|     1 |     0 |   367 |1404k|   0 |  55 | 169 |  73 |  73 | 169 | 112 |  39 |   0 |  62 | 1.300000e+01 |      --      |    Inf 
0.59/0.65	c   0.6s|     1 |     0 |   393 |1404k|   0 |  56 | 169 |  73 |  73 | 169 | 112 |  39 |   0 |  74 | 1.300000e+01 |      --      |    Inf 
0.69/0.71	c   0.7s|     1 |     0 |   396 |1404k|   0 |  56 | 169 |  73 |  73 | 169 | 112 |  39 |   0 |  82 | 1.300000e+01 |      --      |    Inf 
0.69/0.73	c   0.7s|     1 |     0 |   400 |1404k|   0 |  56 | 169 |  73 |  73 | 169 | 111 |  39 |   0 |  85 | 1.300000e+01 |      --      |    Inf 
0.69/0.74	c   0.7s|     1 |     0 |   401 |1404k|   0 |  56 | 169 |  73 |  73 | 169 | 111 |  39 |   0 |  87 | 1.300000e+01 |      --      |    Inf 
0.69/0.75	c   0.7s|     1 |     0 |   403 |1404k|   0 |  56 | 169 |  73 |  73 | 169 | 111 |  39 |   0 |  88 | 1.300000e+01 |      --      |    Inf 
0.69/0.76	c   0.8s|     1 |     0 |   404 |1404k|   0 |  56 | 169 |  73 |  73 | 169 | 111 |  39 |   0 |  90 | 1.300000e+01 |      --      |    Inf 
0.69/0.77	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.69/0.77	c   0.8s|     1 |     0 |   406 |1404k|   0 |  55 | 169 |  73 |  73 | 169 | 111 |  39 |   0 |  91 | 1.300000e+01 |      --      |    Inf 
0.69/0.77	c   0.8s|     1 |     2 |   406 |1404k|   0 |  55 | 169 |  73 |  73 | 169 | 111 |  39 |   0 |  91 | 1.300000e+01 |      --      |    Inf 
0.69/0.77	c (run 1, node 1) restarting after 26 global fixings of integer variables
0.69/0.77	c 
0.69/0.77	(restart) converted 16 cuts from the global cut pool into linear constraints
0.69/0.77	c 
0.69/0.77	presolving:
0.69/0.77	c (round 1) 26 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 16 upgd conss, 8 impls, 79 clqs
0.69/0.77	c presolving (2 rounds):
0.69/0.77	c  26 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.69/0.77	c  8 implications, 79 cliques
0.69/0.77	c presolved problem has 143 variables (143 bin, 0 int, 0 impl, 0 cont) and 88 constraints
0.69/0.77	c       6 constraints of type <knapsack>
0.69/0.77	c      79 constraints of type <setppc>
0.69/0.77	c       3 constraints of type <logicor>
0.69/0.77	c transformed objective value is always integral (scale: 1)
0.69/0.77	c Presolving Time: 0.01
0.69/0.77	c 
0.69/0.77	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.69/0.77	c   0.8s|     1 |     0 |   496 | 686k|   0 |  43 | 143 |  88 |  88 | 143 |  88 |   0 |   0 |  91 | 1.300000e+01 |      --      |    Inf 
0.69/0.78	c   0.8s|     1 |     0 |   513 | 925k|   0 |  49 | 143 |  88 |  88 | 143 |  99 |  11 |   0 |  91 | 1.300000e+01 |      --      |    Inf 
0.89/0.92	c   0.9s|     1 |     0 |   521 | 925k|   0 |  49 | 143 |  88 |  88 | 143 |  99 |  11 |   0 | 140 | 1.300000e+01 |      --      |    Inf 
0.89/0.94	c   0.9s|     1 |     0 |   530 | 924k|   0 |  51 | 143 |  88 |  88 | 143 |  99 |  11 |   0 | 146 | 1.300000e+01 |      --      |    Inf 
0.89/0.97	c   0.9s|     1 |     0 |   542 | 924k|   0 |  49 | 143 |  88 |  88 | 143 |  99 |  11 |   0 | 154 | 1.300000e+01 |      --      |    Inf 
0.89/0.99	c   1.0s|     1 |     0 |   546 | 924k|   0 |  50 | 143 |  88 |  88 | 143 |  99 |  11 |   0 | 159 | 1.300000e+01 |      --      |    Inf 
0.89/1.00	c   1.0s|     1 |     0 |   550 | 924k|   0 |  50 | 143 |  88 |  88 | 143 |  99 |  11 |   0 | 163 | 1.300000e+01 |      --      |    Inf 
0.99/1.01	c   1.0s|     1 |     0 |   552 | 924k|   0 |  50 | 143 |  88 |  88 | 143 |  99 |  11 |   0 | 167 | 1.300000e+01 |      --      |    Inf 
0.99/1.02	c   1.0s|     1 |     2 |   552 | 925k|   0 |  50 | 143 |  88 |  88 | 143 |  99 |  11 |   0 | 168 | 1.300000e+01 |      --      |    Inf 
0.99/1.02	c (run 2, node 1) restarting after 18 global fixings of integer variables
0.99/1.02	c 
0.99/1.02	(restart) converted 8 cuts from the global cut pool into linear constraints
0.99/1.02	c 
0.99/1.02	presolving:
0.99/1.02	c (round 1) 18 del vars, 1 del conss, 0 chg bounds, 0 chg sides, 0 chg coeffs, 8 upgd conss, 10 impls, 81 clqs
0.99/1.02	c presolving (2 rounds):
0.99/1.02	c  18 deleted vars, 1 deleted constraints, 0 tightened bounds, 0 added holes, 0 changed sides, 0 changed coefficients
0.99/1.02	c  10 implications, 81 cliques
0.99/1.02	c presolved problem has 125 variables (125 bin, 0 int, 0 impl, 0 cont) and 95 constraints
0.99/1.02	c      11 constraints of type <knapsack>
0.99/1.02	c      82 constraints of type <setppc>
0.99/1.02	c       2 constraints of type <logicor>
0.99/1.02	c transformed objective value is always integral (scale: 1)
0.99/1.02	c Presolving Time: 0.01
0.99/1.02	c 
0.99/1.03	c  time | node  | left  |LP iter| mem |mdpt |frac |vars |cons |ccons|cols |rows |cuts |confs|strbr|  dualbound   | primalbound  |  gap   
0.99/1.03	c   1.0s|     1 |     0 |   655 | 744k|   0 |  44 | 125 |  95 |  95 | 125 |  95 |   0 |   0 | 168 | 1.300000e+01 |      --      |    Inf 
0.99/1.03	c   1.0s|     1 |     0 |   703 | 992k|   0 |  50 | 125 |  95 |  95 | 125 | 111 |  16 |   0 | 168 | 1.300000e+01 |      --      |    Inf 
1.19/1.24	c   1.2s|     1 |     0 |   711 | 992k|   0 |  50 | 125 |  95 |  95 | 125 | 111 |  16 |   0 | 211 | 1.300000e+01 |      --      |    Inf 
1.19/1.29	c   1.3s|     1 |     0 |   713 | 992k|   0 |  50 | 125 |  94 |  94 | 125 | 111 |  16 |   0 | 221 | 1.300000e+01 |      --      |    Inf 
1.29/1.30	c   1.3s|     1 |     2 |   713 | 992k|   0 |  50 | 125 |  94 |  94 | 125 | 111 |  16 |   0 | 223 | 1.300000e+01 |      --      |    Inf 
1.39/1.42	c * 1.4s|     3 |     0 |   993 |1026k|   2 |   - | 125 |  94 |  52 | 125 |  84 |  16 |   0 | 324 | 1.300000e+01 | 1.300000e+01 |   0.00%
1.39/1.42	c 
1.39/1.42	c SCIP Status        : problem is solved [optimal solution found]
1.39/1.42	c Solving Time (sec) : 1.39
1.39/1.42	c Solving Nodes      : 3 (total of 5 nodes in 3 runs)
1.39/1.42	c Primal Bound       : +1.30000000000000e+01 (1 solutions)
1.39/1.42	c Dual Bound         : +1.30000000000000e+01
1.39/1.42	c Gap                : 0.00 %
1.39/1.42	c NODE         3
1.39/1.42	c DUAL BOUND   13
1.39/1.42	c PRIMAL BOUND 13
1.39/1.42	c GAP          0
1.39/1.42	s SATISFIABLE
1.39/1.42	v -x169 -x168 -x167 -x166 -x165 -x164 x163 -x162 -x161 -x160 -x159 -x158 -x157 -x156 -x155 -x154 -x153 x152 -x151 -x150 -x149 -x148 
1.39/1.42	v -x147 -x146 -x145 -x144 -x143 -x142 -x141 -x140 -x139 -x138 -x137 -x136 -x135 -x134 -x133 -x132 x131 -x130 -x129 -x128 -x127 
1.39/1.42	v -x126 -x125 -x124 x123 -x122 -x121 -x120 -x119 -x118 -x117 -x116 -x115 -x114 -x113 -x112 -x111 -x110 -x109 -x108 -x107 x106 
1.39/1.42	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.39/1.42	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.39/1.42	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.39/1.42	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.39/1.42	v -x4 -x3 -x2 -x1 
1.39/1.42	c SCIP Status        : problem is solved [optimal solution found]
1.39/1.42	c Solving Time       :       1.39
1.39/1.42	c Original Problem   :
1.39/1.42	c   Problem name     : HOME/instance-3729123-1338679258.opb
1.39/1.42	c   Variables        : 169 (169 binary, 0 integer, 0 implicit integer, 0 continuous)
1.39/1.42	c   Constraints      : 101 initial, 101 maximal
1.39/1.42	c Presolved Problem  :
1.39/1.42	c   Problem name     : t_HOME/instance-3729123-1338679258.opb
1.39/1.42	c   Variables        : 125 (125 binary, 0 integer, 0 implicit integer, 0 continuous)
1.39/1.42	c   Constraints      : 95 initial, 95 maximal
1.39/1.42	c Presolvers         :       Time  FixedVars   AggrVars   ChgTypes  ChgBounds   AddHoles    DelCons   ChgSides   ChgCoefs
1.39/1.42	c   trivial          :       0.00         44          0          0          0          0          0          0          0
1.39/1.42	c   dualfix          :       0.00          0          0          0          0          0          0          0          0
1.39/1.42	c   boundshift       :       0.00          0          0          0          0          0          0          0          0
1.39/1.42	c   inttobinary      :       0.00          0          0          0          0          0          0          0          0
1.39/1.42	c   implics          :       0.00          0          0          0          0          0          0          0          0
1.39/1.42	c   probing          :       0.00          0          0          0          0          0          0          0          0
1.39/1.42	c   knapsack         :       0.00          0          0          0          0          0          0          0          0
1.39/1.42	c   setppc           :       0.01          0          0          0          0          0          0          0          0
1.39/1.42	c   linear           :       0.00          0          0          0          0          0         28          0          0
1.39/1.42	c   logicor          :       0.00          0          0          0          0          0          2          0          0
1.39/1.42	c   root node        :          -         47          -          -         47          -          -          -          -
1.39/1.42	c Constraints        :     Number  #Separate #Propagate    #EnfoLP    #EnfoPS    Cutoffs    DomReds       Cuts      Conss   Children
1.39/1.42	c   integral         :          0          0          0         38          0          0        108          0          0          8
1.39/1.42	c   knapsack         :         11          7         41          1          0          0          0          0          0          0
1.39/1.42	c   setppc           :         82          7         41          1          0          0         33          0          0          0
1.39/1.42	c   logicor          :          2          7          3          1          0          0          0          0          0          0
1.39/1.42	c   countsols        :          0          0          0          1          0          0          0          0          0          0
1.39/1.42	c Constraint Timings :  TotalTime   Separate  Propagate     EnfoLP     EnfoPS
1.39/1.42	c   integral         :       1.30       0.00       0.00       1.30       0.00
1.39/1.42	c   knapsack         :       0.00       0.00       0.00       0.00       0.00
1.39/1.42	c   setppc           :       0.00       0.00       0.00       0.00       0.00
1.39/1.42	c   logicor          :       0.00       0.00       0.00       0.00       0.00
1.39/1.42	c   countsols        :       0.00       0.00       0.00       0.00       0.00
1.39/1.42	c Propagators        :       Time      Calls    Cutoffs    DomReds
1.39/1.42	c   rootredcost      :       0.00          0          0          0
1.39/1.42	c   pseudoobj        :       0.00         44          0          0
1.39/1.42	c Conflict Analysis  :       Time      Calls    Success  Conflicts   Literals    Reconvs ReconvLits   LP Iters
1.39/1.42	c   propagation      :       0.00          0          0          0        0.0          0        0.0          -
1.39/1.42	c   infeasible LP    :       0.00          0          0          0        0.0          0        0.0          0
1.39/1.42	c   bound exceed. LP :       0.00          0          0          0        0.0          0        0.0          0
1.39/1.42	c   strong branching :       0.00          0          0          0        0.0          0        0.0          0
1.39/1.42	c   pseudo solution  :       0.00          0          0          0        0.0          0        0.0          -
1.39/1.42	c   applied globally :          -          -          -          0        0.0          -          -          -
1.39/1.42	c   applied locally  :          -          -          -          0        0.0          -          -          -
1.39/1.42	c Separators         :       Time      Calls    Cutoffs    DomReds       Cuts      Conss
1.39/1.42	c   cut pool         :       0.00          0          -          -          0          -    (maximal pool size: 81)
1.39/1.42	c   redcost          :       0.00          9          0          0          0          0
1.39/1.42	c   impliedbounds    :       0.00          7          0          0          0          0
1.39/1.42	c   intobj           :       0.00          0          0          0          0          0
1.39/1.42	c   gomory           :       0.01          7          0          0          5          0
1.39/1.42	c   strongcg         :       0.03          7          0          0        336          0
1.39/1.42	c   cmir             :       0.00          0          0          0          0          0
1.39/1.42	c   flowcover        :       0.00          0          0          0          0          0
1.39/1.42	c   clique           :       0.00          7          0          0         43          0
1.39/1.42	c   zerohalf         :       0.00          0          0          0          0          0
1.39/1.42	c   mcf              :       0.00          3          0          0          0          0
1.39/1.42	c Pricers            :       Time      Calls       Vars
1.39/1.42	c   problem variables:       0.00          0          0
1.39/1.42	c Branching Rules    :       Time      Calls    Cutoffs    DomReds       Cuts      Conss   Children
1.39/1.42	c   relpscost        :       1.30         37          0        108          0          0          8
1.39/1.42	c   pscost           :       0.00          0          0          0          0          0          0
1.39/1.42	c   inference        :       0.00          0          0          0          0          0          0
1.39/1.42	c   mostinf          :       0.00          0          0          0          0          0          0
1.39/1.42	c   leastinf         :       0.00          0          0          0          0          0          0
1.39/1.42	c   fullstrong       :       0.00          0          0          0          0          0          0
1.39/1.42	c   allfullstrong    :       0.00          0          0          0          0          0          0
1.39/1.42	c   random           :       0.00          0          0          0          0          0          0
1.39/1.42	c Primal Heuristics  :       Time      Calls      Found
1.39/1.42	c   LP solutions     :       0.00          -          1
1.39/1.42	c   pseudo solutions :       0.00          -          0
1.39/1.42	c   simplerounding   :       0.00          0          0
1.39/1.42	c   rounding         :       0.00          0          0
1.39/1.42	c   shifting         :       0.00          0          0
1.39/1.42	c   intshifting      :       0.00          0          0
1.39/1.42	c   oneopt           :       0.00          0          0
1.39/1.42	c   fixandinfer      :       0.00          0          0
1.39/1.42	c   feaspump         :       0.00          0          0
1.39/1.42	c   coefdiving       :       0.00          0          0
1.39/1.42	c   pscostdiving     :       0.00          0          0
1.39/1.42	c   fracdiving       :       0.00          0          0
1.39/1.42	c   veclendiving     :       0.00          0          0
1.39/1.42	c   intdiving        :       0.00          0          0
1.39/1.42	c   actconsdiving    :       0.00          0          0
1.39/1.42	c   objpscostdiving  :       0.00          0          0
1.39/1.42	c   rootsoldiving    :       0.00          0          0
1.39/1.42	c   linesearchdiving :       0.00          0          0
1.39/1.42	c   guideddiving     :       0.00          0          0
1.39/1.42	c   octane           :       0.00          0          0
1.39/1.42	c   rens             :       0.00          0          0
1.39/1.42	c   rins             :       0.00          0          0
1.39/1.42	c   localbranching   :       0.00          0          0
1.39/1.42	c   mutation         :       0.00          0          0
1.39/1.42	c   crossover        :       0.00          0          0
1.39/1.42	c   dins             :       0.00          0          0
1.39/1.42	c LP                 :       Time      Calls Iterations  Iter/call   Iter/sec
1.39/1.42	c   primal LP        :       0.00          0          0       0.00          -
1.39/1.42	c   dual LP          :       0.04         45        993      22.07   24825.00
1.39/1.42	c   barrier LP       :       0.00          0          0       0.00          -
1.39/1.42	c   diving/probing LP:       0.00          0          0       0.00          -
1.39/1.42	c   strong branching :       1.29        324      32299      99.69   25037.98
1.39/1.42	c     (at root node) :          -        223      28311     126.96          -
1.39/1.42	c   conflict analysis:       0.00          0          0       0.00          -
1.39/1.42	c B&B Tree           :
1.39/1.42	c   number of runs   :          3
1.39/1.42	c   nodes            :          3
1.39/1.42	c   nodes (total)    :          5
1.39/1.42	c   nodes left       :          0
1.39/1.42	c   max depth        :          2
1.39/1.42	c   max depth (total):          2
1.39/1.42	c   backtracks       :          0 (0.0%)
1.39/1.42	c   delayed cutoffs  :          0
1.39/1.42	c   repropagations   :          0 (0 domain reductions, 0 cutoffs)
1.39/1.42	c   avg switch length:       2.00
1.39/1.42	c   switching time   :       0.00
1.39/1.42	c Solution           :
1.39/1.42	c   Solutions found  :          1 (1 improvements)
1.39/1.42	c   Primal Bound     : +1.30000000000000e+01   (in run 3, after 3 nodes, 1.39 seconds, depth 2, found by <relaxation>)
1.39/1.42	c   Dual Bound       : +1.30000000000000e+01
1.39/1.42	c   Gap              :       0.00 %
1.39/1.42	c   Root Dual Bound  : +1.30000000000000e+01
1.39/1.42	c Time complete: 1.41.

Verifier Data 

OK	0

Watcher Data 

runsolver Copyright (C) 2010-2011 Olivier ROUSSEL

This is runsolver version 3.3.1 (svn: 989)

This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
GNU General Public License for more details.

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

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

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


[startup+0 s]
/proc/loadavg: 1.22 0.46 0.28 3/175 21799
/proc/meminfo: memFree=23863128/32873844 swapFree=7112/7112
[pid=21799] ppid=21797 vsize=8700 CPUtime=0 cores=1,3,5,7
/proc/21799/stat : 21799 (pbscip.linux.x8) R 21797 21799 13043 0 -1 4202496 1517 0 0 0 0 0 0 0 20 0 1 0 334054330 8908800 1469 33554432000 4194304 7823515 140735887390048 140736698395352 5878822 0 0 4096 0 0 0 0 17 5 0 0 0 0 0
/proc/21799/statm: 2175 1469 351 887 0 1285 0

[startup+0.04992 s]
/proc/loadavg: 1.22 0.46 0.28 3/175 21799
/proc/meminfo: memFree=23863128/32873844 swapFree=7112/7112
[pid=21799] ppid=21797 vsize=14424 CPUtime=0.04 cores=1,3,5,7
/proc/21799/stat : 21799 (pbscip.linux.x8) R 21797 21799 13043 0 -1 4202496 3212 0 0 0 4 0 0 0 20 0 1 0 334054330 14770176 2808 33554432000 4194304 7823515 140735887390048 140736698395352 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21799/statm: 3606 2808 547 887 0 2716 0
Current children cumulated CPU time (s) 0.04
Current children cumulated vsize (KiB) 14424

[startup+0.100294 s]
/proc/loadavg: 1.22 0.46 0.28 3/175 21799
/proc/meminfo: memFree=23863128/32873844 swapFree=7112/7112
[pid=21799] ppid=21797 vsize=14424 CPUtime=0.09 cores=1,3,5,7
/proc/21799/stat : 21799 (pbscip.linux.x8) R 21797 21799 13043 0 -1 4202496 3224 0 0 0 9 0 0 0 20 0 1 0 334054330 14770176 2820 33554432000 4194304 7823515 140735887390048 140736698395352 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21799/statm: 3606 2820 551 887 0 2716 0
Current children cumulated CPU time (s) 0.09
Current children cumulated vsize (KiB) 14424

[startup+0.300228 s]
/proc/loadavg: 1.22 0.46 0.28 3/175 21799
/proc/meminfo: memFree=23863128/32873844 swapFree=7112/7112
[pid=21799] ppid=21797 vsize=14424 CPUtime=0.29 cores=1,3,5,7
/proc/21799/stat : 21799 (pbscip.linux.x8) R 21797 21799 13043 0 -1 4202496 3225 0 0 0 29 0 0 0 20 0 1 0 334054330 14770176 2821 33554432000 4194304 7823515 140735887390048 140736698395352 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21799/statm: 3606 2821 551 887 0 2716 0
Current children cumulated CPU time (s) 0.29
Current children cumulated vsize (KiB) 14424

[startup+0.700226 s]
/proc/loadavg: 1.22 0.46 0.28 3/175 21799
/proc/meminfo: memFree=23863128/32873844 swapFree=7112/7112
[pid=21799] ppid=21797 vsize=14424 CPUtime=0.69 cores=1,3,5,7
/proc/21799/stat : 21799 (pbscip.linux.x8) R 21797 21799 13043 0 -1 4202496 3236 0 0 0 68 1 0 0 20 0 1 0 334054330 14770176 2832 33554432000 4194304 7823515 140735887390048 140735887385160 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21799/statm: 3606 2832 553 887 0 2716 0
Current children cumulated CPU time (s) 0.69
Current children cumulated vsize (KiB) 14424

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

[startup+1.10644 s]
/proc/loadavg: 1.22 0.46 0.28 3/176 21800
/proc/meminfo: memFree=23852704/32873844 swapFree=7112/7112
[pid=21799] ppid=21797 vsize=15028 CPUtime=1.1 cores=1,3,5,7
/proc/21799/stat : 21799 (pbscip.linux.x8) R 21797 21799 13043 0 -1 4202496 3424 0 0 0 108 2 0 0 20 0 1 0 334054330 15388672 2995 33554432000 4194304 7823515 140735887390048 140735887385160 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21799/statm: 3757 2995 559 887 0 2867 0
Current children cumulated CPU time (s) 1.1
Current children cumulated vsize (KiB) 15028

[startup+1.30023 s]
/proc/loadavg: 1.22 0.46 0.28 3/176 21800
/proc/meminfo: memFree=23852704/32873844 swapFree=7112/7112
[pid=21799] ppid=21797 vsize=15028 CPUtime=1.29 cores=1,3,5,7
/proc/21799/stat : 21799 (pbscip.linux.x8) R 21797 21799 13043 0 -1 4202496 3441 0 0 0 127 2 0 0 20 0 1 0 334054330 15388672 3012 33554432000 4194304 7823515 140735887390048 140735887385160 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21799/statm: 3757 3012 559 887 0 2867 0
Current children cumulated CPU time (s) 1.29
Current children cumulated vsize (KiB) 15028

[startup+1.40023 s]
/proc/loadavg: 1.22 0.46 0.28 3/176 21800
/proc/meminfo: memFree=23852704/32873844 swapFree=7112/7112
[pid=21799] ppid=21797 vsize=15028 CPUtime=1.39 cores=1,3,5,7
/proc/21799/stat : 21799 (pbscip.linux.x8) R 21797 21799 13043 0 -1 4202496 3441 0 0 0 137 2 0 0 20 0 1 0 334054330 15388672 3012 33554432000 4194304 7823515 140735887390048 140735887385160 6954986 0 0 4096 16384 0 0 0 17 5 0 0 0 0 0
/proc/21799/statm: 3757 3012 559 887 0 2867 0
Current children cumulated CPU time (s) 1.39
Current children cumulated vsize (KiB) 15028

Child status: 0
Real time (s): 1.42911
CPU time (s): 1.42778
CPU user time (s): 1.39979
CPU system time (s): 0.027995
CPU usage (%): 99.9071
Max. virtual memory (cumulated for all children) (KiB): 15028

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 1.39979
system time used= 0.027995
maximum resident set size= 12064
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 3450
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= 3

runsolver used 0.001999 second user time and 0.009998 second system time

The end

Launcher Data 

Begin job on node104 at 2012-06-03 01:20:58
IDJOB=3729123
IDBENCH=1171
IDSOLVER=2321
FILE ID=node104/3729123-1338679258
RUNJOBID= node104-1338679216-21696
PBS_JOBID= 14636709
Free space on /tmp= 66424 MiB

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

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

MD5SUM BENCH= 6be9a20fbf662ba035d4f80998506e8e
RANDOM SEED=1131415286

node104.alineos.net Linux 2.6.32-71.29.1.el6.x86_64 #1 SMP Mon Jun 27 19:49:27 BST 2011

/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.266
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 0
initial apicid	: 0
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5332.53
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.266
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 0
cpu cores	: 4
apicid		: 16
initial apicid	: 16
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.91
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 2
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.266
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 2
initial apicid	: 2
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.91
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 3
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.266
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 1
cpu cores	: 4
apicid		: 18
initial apicid	: 18
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.92
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 4
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.266
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 4
initial apicid	: 4
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.91
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 5
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.266
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 2
cpu cores	: 4
apicid		: 20
initial apicid	: 20
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.91
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 6
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.266
cache size	: 8192 KB
physical id	: 0
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 6
initial apicid	: 6
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.91
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:

processor	: 7
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
cpu MHz		: 2666.266
cache size	: 8192 KB
physical id	: 1
siblings	: 4
core id		: 3
cpu cores	: 4
apicid		: 22
initial apicid	: 22
fpu		: yes
fpu_exception	: yes
cpuid level	: 11
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic mtrr pge mca cmov pat pse36 clflush dts acpi mmx fxsr sse sse2 ss ht tm pbe syscall nx rdtscp lm constant_tsc arch_perfmon pebs bts rep_good xtopology nonstop_tsc aperfmperf pni dtes64 monitor ds_cpl vmx est tm2 ssse3 cx16 xtpr pdcm dca sse4_1 sse4_2 popcnt lahf_lm ida tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5331.92
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:       32873844 kB
MemFree:        23863872 kB
Buffers:          549316 kB
Cached:          7416564 kB
SwapCached:          780 kB
Active:          4800248 kB
Inactive:        3206548 kB
Active(anon):      32480 kB
Inactive(anon):     8072 kB
Active(file):    4767768 kB
Inactive(file):  3198476 kB
Unevictable:        7112 kB
Mlocked:            7112 kB
SwapTotal:      67108856 kB
SwapFree:       67105060 kB
Dirty:              9892 kB
Writeback:             0 kB
AnonPages:         67088 kB
Mapped:            16344 kB
Shmem:                 8 kB
Slab:             864248 kB
SReclaimable:     306312 kB
SUnreclaim:       557936 kB
KernelStack:        1472 kB
PageTables:         4176 kB
NFS_Unstable:          4 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83545776 kB
Committed_AS:     144596 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      346368 kB
VmallocChunk:   34341987984 kB
HardwareCorrupted:     0 kB
AnonHugePages:     38912 kB
HugePages_Total:       0
HugePages_Free:        0
HugePages_Rsvd:        0
HugePages_Surp:        0
Hugepagesize:       2048 kB
DirectMap4k:        7872 kB
DirectMap2M:    33538048 kB

Free space on /tmp at the end= 66416 MiB
End job on node104 at 2012-06-03 01:20:59