Trace number 4398286

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 NameAnswerobjective functionCPU timeWall clock time
cosoco 2.O parallelOPT125 0.665288 0.255283

General information on the benchmark

NameTpp/Tpp-zinc-s1/
Tpp-7-3-20-1.xml
MD5SUM38f06f34c6c373f6142c39e9ab89bcc1
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark125
Best CPU time to get the best result obtained on this benchmark0.25021
Satisfiable
(Un)Satisfiability was proved
Number of variables82
Number of constraints463
Number of domains43
Minimum domain size2
Maximum domain size21
Distribution of domain sizes[{"size":2,"count":1},{"size":3,"count":4},{"size":4,"count":13},{"size":5,"count":3},{"size":11,"count":3},{"size":12,"count":3},{"size":13,"count":5},{"size":14,"count":4},{"size":15,"count":5},{"size":20,"count":20},{"size":21,"count":21}]
Minimum variable degree2
Maximum variable degree23
Distribution of variable degrees[{"degree":2,"count":41},{"degree":22,"count":40},{"degree":23,"count":1}]
Minimum constraint arity1
Maximum constraint arity21
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":461},{"arity":21,"count":1}]
Number of extensional constraints41
Number of intensional constraints421
Distribution of constraint types[{"type":"extension","count":41},{"type":"intension","count":421},{"type":"circuit","count":1}]
Optimization problemYES
Type of objectivemin SUM

Quality of the solution as a function of time


Download the above graph as a PDF file / as an EPS file

Solver Data 

0.00/0.01	c
0.00/0.01	c This is cosoco 2.00 --  
0.00/0.01	c
0.00/0.01	c command line: cosoco -model -nbcores=8 HOME/instance-4398286-1568603610.xml 
0.00/0.01	c intension  imp(eq(s[0],0),ne(l[0],0)) -> extension (support ? 0) - 1tuples
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension  imp(eq(s[1],1),ne(l[0],1)) -> extension (support ? 0) - 1tuples
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension  imp(eq(s[2],2),ne(l[0],2)) -> extension (support ? 0) - 1tuples
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension  imp(eq(s[3],3),ne(l[0],3)) -> extension (support ? 0) - 1tuples
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension  imp(eq(s[4],4),ne(l[0],4)) -> extension (support ? 0) - 1tuples
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension  imp(eq(s[5],5),ne(l[0],5)) -> extension (support ? 0) - 1tuples
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension  imp(eq(s[6],6),ne(l[0],6)) -> extension (support ? 0) - 1tuples
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension  imp(eq(s[7],7),ne(l[0],7)) -> extension (support ? 0) - 1tuples
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension  imp(eq(s[8],8),ne(l[0],8)) -> extension (support ? 0) - 1tuples
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension  imp(eq(s[9],9),ne(l[0],9)) -> extension (support ? 0) - 1tuples
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension  imp(eq(s[10],10),ne(l[0],10)) -> extension (support ? 0) - 1tuples
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension  imp(eq(s[11],11),ne(l[0],11)) -> extension (support ? 0) - 1tuples
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension  imp(eq(s[12],12),ne(l[0],12)) -> extension (support ? 0) - 1tuples
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension  imp(eq(s[13],13),ne(l[0],13)) -> extension (support ? 0) - 1tuples
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension  imp(eq(s[14],14),ne(l[0],14)) -> extension (support ? 0) - 1tuples
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension  imp(eq(s[15],15),ne(l[0],15)) -> extension (support ? 0) - 1tuples
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension  imp(eq(s[16],16),ne(l[0],16)) -> extension (support ? 0) - 1tuples
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension  imp(eq(s[17],17),ne(l[0],17)) -> extension (support ? 0) - 1tuples
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension  imp(eq(s[18],18),ne(l[0],18)) -> extension (support ? 0) - 1tuples
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension  imp(eq(s[19],19),ne(l[0],19)) -> extension (support ? 0) - 1tuples
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension  imp(eq(s[20],20),ne(l[0],20)) -> extension (support ? 0) - 0tuples
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c enable optimization
0.10/0.19	c ========================================[ Problem Statistics ]===========================================
0.10/0.19	c |                                                                                                       
0.10/0.19	c |  Parse time        :         0.18 s 
0.10/0.19	c |
0.10/0.19	c |               Variables: 82
0.10/0.19	c |            Domain Sizes: 2..21
0.10/0.19	c |
0.10/0.19	c |             Constraints: 464
0.10/0.19	c |                   Arity: 1..41  -- Unary: 1  -- Binary: 461
0.10/0.19	c | 
0.10/0.19	c |                   Types: 
0.10/0.19	c |                          Circuit: 1
0.10/0.19	c |                          Extension: 461  (nb tuples: 0..20) -- (shared: 3192)
0.10/0.19	c |                          Sum: 1
0.10/0.19	c |                          Unary: 1
0.10/0.19	c |                          
0.10/0.19	c |               Objective: Minimize Sum
0.10/0.19	
0.10/0.19	c =========================================================================================================
0.10/0.19	c Parallel mode: Portfolio
0.10/0.19	c [pFactory][Group N°0] created (threads:8).
0.10/0.19	c [pFactory][Group N°0] new task added (threads:8 - tasks:1).
0.10/0.19	c [pFactory][Group N°0] new task added (threads:8 - tasks:2).
0.10/0.19	c [pFactory][Group N°0] new task added (threads:8 - tasks:3).
0.10/0.19	c [pFactory][Group N°0] new task added (threads:8 - tasks:4).
0.10/0.19	c [pFactory][Group N°0] new task added (threads:8 - tasks:5).
0.10/0.19	c [pFactory][Group N°0] new task added (threads:8 - tasks:6).
0.10/0.19	c [pFactory][Group N°0] new task added (threads:8 - tasks:7).
0.10/0.19	c [pFactory][Group N°0] new task added (threads:8 - tasks:8).
0.10/0.19	c [pFactory][Group N°0] concurrent mode: enabled.
0.10/0.19	c [pFactory][Group N°0] computations in progress (threads:8 - tasks:8).
0.10/0.19	c [pFactory][Group N°0] task 7 launched on thread 1.
0.10/0.19	c [pFactory][Group N°0] task 6 launched on thread 0.
0.10/0.19	c [pFactory][Group N°0] task 5 launched on thread 2.
0.10/0.19	c [pFactory][Group N°0] task 4 launched on thread 6.
0.10/0.19	c [pFactory][Group N°0] task 3 launched on thread 7.
0.10/0.19	c [pFactory][Group N°0] task 2 launched on thread 5.
0.10/0.19	c [pFactory][Group N°0] task 1 launched on thread 3.
0.10/0.19	c [pFactory][Group N°0] task 0 launched on thread 4.
0.10/0.19	o 191
0.10/0.19	o 190
0.10/0.19	o 189
0.10/0.20	o 188
0.10/0.20	o 187
0.10/0.20	o 181
0.10/0.20	o 180
0.10/0.20	o 176
0.10/0.20	o 175
0.10/0.20	o 165
0.10/0.20	o 148
0.10/0.21	o 142
0.10/0.21	o 141
0.37/0.22	o 138
0.37/0.22	o 137
0.37/0.22	o 136
0.37/0.22	o 134
0.37/0.22	o 129
0.37/0.22	o 128
0.37/0.23	o 126
0.37/0.24	o 125
0.37/0.25	c [pFactory][Group N°0] concurent mode: thread 5 has won with the task 2.
0.37/0.25	c [pFactory][Group N°0] Thread N°0 is joined.
0.37/0.25	c [pFactory][Group N°0] Thread N°1 is joined.
0.37/0.25	c [pFactory][Group N°0] Thread N°2 is joined.
0.37/0.25	c [pFactory][Group N°0] Thread N°3 is joined.
0.37/0.25	c [pFactory][Group N°0] Thread N°4 is joined.
0.37/0.25	c [pFactory][Group N°0] Thread N°5 is joined.
0.37/0.25	c [pFactory][Group N°0] Thread N°6 is joined.
0.37/0.25	c [pFactory][Group N°0] Thread N°7 is joined.
0.37/0.25	c [pFactory][Group N°0] Return Code of the winner:3 (Thread N°5)
0.37/0.25	s OPTIMUM FOUND
0.37/0.25	c call to solver        : 9
0.37/0.25	c
0.37/0.25	c restarts              : 67          
0.37/0.25	c conflicts             : 203          (309 /sec)
0.37/0.25	c decisions             : 1681         (2562 /sec)
0.37/0.25	c propagations          : 36215       (55206 /sec)
0.37/0.25	c root propagations     : 358         
0.37/0.25	c filter calls          : 181582         (276801 /sec)
0.37/0.25	c useless filter calls  : 168233         (92 %)
0.37/0.25	c Memory used           : 579.31 MB
0.37/0.25	c Best bound time (wc)  : 0.234051 s
0.37/0.25	c CPU time              : 0.655919 s
0.37/0.25	c real time             : 0.249168 s
0.37/0.25	
0.37/0.25	
0.37/0.25	v <instantiation type='solution' cost='125'>
0.37/0.25	v <list>c[0] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] d[0] d[10] d[11] d[12] d[13] d[14] d[15] d[16] d[17] d[18] d[19] d[1] d[20] d[2] d[3] d[4] d[5] d[6] d[7] d[8] d[9] l[0] l[10] l[11] l[12] l[13] l[14] l[15] l[16] l[17] l[18] l[19] l[1] l[2] l[3] l[4] l[5] l[6] l[7] l[8] l[9] s[0] s[10] s[11] s[12] s[13] s[14] s[15] s[16] s[17] s[18] s[19] s[1] s[20] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] </list>
0.37/0.25	v <values>4 1 1 5 4 1 2 4 5 2 2 1 1 9 5 5 2 3 1 9 0 7 1 1 18 0 0 0 16 10 1 0 4 0 0 0 0 0 0 0 0 13 19 19 19 10 13 11 18 18 19 10 17 18 19 12 17 11 10 10 11 0 11 12 13 20 14 15 16 10 17 18 1 19 2 3 4 5 6 7 8 9 </values>
0.37/0.25	v </instantiation>
0.37/0.25

Verifier Data 

OK	125

Watcher Data 

runsolver version 3.4.0 (svn: 3012) Copyright (C) 2010-2013 Olivier ROUSSEL

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.

NUMA information:
  number of nodes: 2
  memory of node 0: 16374 MiB (14703 MiB free)
  memory of node 1: 16384 MiB (14756 MiB free)
  node distances:
     10  21
     21  10

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-4398286-1568603610/watcher-4398286-1568603610 -o /tmp/evaluation-result-4398286-1568603610/solver-4398286-1568603610 -C 20160 -W 2520 -M 31000 --bin-var /tmp/runsolver-exch-node139-1568596036-1355 --watchdog 2580 cosoco -model -nbcores=8 HOME/instance-4398286-1568603610.xml 

running on 8 cores: 0,2,4,6,1,3,5,7

Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 20160 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 20190 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 2520 seconds
Enforcing VSIZE limit (soft limit, will send SIGTERM then SIGKILL): 31744000 KiB
Enforcing VSIZE limit (hard limit, stack expansion will fail with SIGSEGV, brk() and mmap() will return ENOMEM): 31795200 KiB
Linux 3.10.0-514.16.1.el7.x86_64
Starting watchdog thread
solver pid=2429, runsolver pid=2426
Current StackSize limit: 8192 KiB


[startup+0.100157 s]*
/proc/loadavg: 1.00 1.01 1.48 2/190 2430
/proc/meminfo: memFree=30162240/32770624 swapFree=66921460/67108860
[pid=2429] ppid=2426 vsize=32140 memory=8436 CPUtime=0.1 cores=0-7
/proc/2429/stat : 2429 (cosoco) R 2426 2429 1328 0 -1 4202496 2290 0 0 0 10 0 0 0 20 0 1 0 436629584 32911360 2109 33554432000 4194304 6211092 140735762976576 140735762973112 5443872 0 0 4096 8405026 0 0 0 17 3 0 0 0 0 0 8312316 8317760 39591936 140735762977809 140735762977901 140735762977901 140735762980814 0
/proc/2429/statm: 8035 2109 826 493 0 1340 0
Current children cumulated CPU time: 0.1 s
Current children cumulated vsize: 32140 KiB
Current children cumulated memory: 8436 KiB

[startup+0.210081 s]*
/proc/loadavg: 1.00 1.01 1.48 9/198 2438
/proc/meminfo: memFree=30157244/32770624 swapFree=66921460/67108860
[pid=2429] ppid=2426 vsize=625996 memory=12660 CPUtime=0.37 cores=0-7
/proc/2429/stat : 2429 (cosoco) S 2426 2429 1328 0 -1 1077944320 3518 0 0 0 37 0 0 0 20 0 9 0 436629584 641019904 3165 33554432000 4194304 6211092 140735762976576 140735762974832 140703667068663 0 0 4096 8405026 18446744073709551615 0 0 17 3 0 0 0 0 0 8312316 8317760 39591936 140735762977809 140735762977901 140735762977901 140735762980814 0
/proc/2429/statm: 156499 3165 851 493 0 149804 0
[pid=2429/tid=2431] ppid=2426 vsize=625996 memory=8316850467074736180 CPUtime=0.02 cores=0-7
/proc/2429/task/2431/stat : 2431 (cosoco) R 2426 2429 1328 0 -1 4202560 18 0 0 0 2 0 0 0 20 0 9 0 436629603 641019904 3165 33554432000 4194304 6211092 140735762976576 140703643925776 5397375 0 0 4096 8405026 0 0 0 -1 2 0 0 0 0 0 8312316 8317760 39591936 140735762977809 140735762977901 140735762977901 140735762980814 0
[pid=2429/tid=2432] ppid=2426 vsize=625996 memory=12974 CPUtime=0.02 cores=0-7
/proc/2429/task/2432/stat : 2432 (cosoco) R 2426 2429 1328 0 -1 4202560 25 0 0 0 2 0 0 0 20 0 9 0 436629603 641019904 3165 33554432000 4194304 6211092 140735762976576 140703635533072 5017569 0 0 4096 8405026 0 0 0 -1 5 0 0 0 0 0 8312316 8317760 39591936 140735762977809 140735762977901 140735762977901 140735762980814 0
[pid=2429/tid=2433] ppid=2426 vsize=625996 memory=288370918113158784 CPUtime=0.02 cores=0-7
/proc/2429/task/2433/stat : 2433 (cosoco) R 2426 2429 1328 0 -1 4202560 14 0 0 0 2 0 0 0 20 0 9 0 436629603 641019904 3165 33554432000 4194304 6211092 140735762976576 140703627140112 5017277 0 0 4096 8405026 0 0 0 -1 4 0 0 0 0 0 8312316 8317760 39591936 140735762977809 140735762977901 140735762977901 140735762980814 0
[pid=2429/tid=2434] ppid=2426 vsize=625996 memory=-1 CPUtime=0.01 cores=0-7
/proc/2429/task/2434/stat : 2434 (cosoco) R 2426 2429 1328 0 -1 4202560 18 0 0 0 1 0 0 0 20 0 9 0 436629603 641019904 3165 33554432000 4194304 6211092 140735762976576 140703618747408 5017573 0 0 4096 8405026 0 0 0 -1 7 0 0 0 0 0 8312316 8317760 39591936 140735762977809 140735762977901 140735762977901 140735762980814 0
[pid=2429/tid=2435] ppid=2426 vsize=625996 memory=0 CPUtime=0.02 cores=0-7
/proc/2429/task/2435/stat : 2435 (cosoco) R 2426 2429 1328 0 -1 4202560 19 0 0 0 2 0 0 0 20 0 9 0 436629603 641019904 3165 33554432000 4194304 6211092 140735762976576 140703610354624 5390463 0 0 4096 8405026 0 0 0 -1 6 0 0 0 0 0 8312316 8317760 39591936 140735762977809 140735762977901 140735762977901 140735762980814 0
[pid=2429/tid=2436] ppid=2426 vsize=625996 memory=0 CPUtime=0.02 cores=0-7
/proc/2429/task/2436/stat : 2436 (cosoco) R 2426 2429 1328 0 -1 4202560 18 0 0 0 2 0 0 0 20 0 9 0 436629603 641019904 3165 33554432000 4194304 6211092 140735762976576 140703601962256 5009314 0 0 4096 8405026 0 0 0 -1 1 0 0 0 0 0 8312316 8317760 39591936 140735762977809 140735762977901 140735762977901 140735762980814 0
[pid=2429/tid=2437] ppid=2426 vsize=625996 memory=-1 CPUtime=0.02 cores=0-7
/proc/2429/task/2437/stat : 2437 (cosoco) R 2426 2429 1328 0 -1 4202560 19 0 0 0 2 0 0 0 20 0 9 0 436629603 641019904 3165 33554432000 4194304 6211092 140735762976576 140703593569296 5409364 0 0 4096 8405026 0 0 0 -1 3 0 0 0 0 0 8312316 8317760 39591936 140735762977809 140735762977901 140735762977901 140735762980814 0
[pid=2429/tid=2438] ppid=2426 vsize=625996 memory=0 CPUtime=0.02 cores=0-7
/proc/2429/task/2438/stat : 2438 (cosoco) R 2426 2429 1328 0 -1 4202560 19 0 0 0 2 0 0 0 20 0 9 0 436629603 641019904 3165 33554432000 4194304 6211092 140735762976576 140703585176608 5207585 0 0 4096 8405026 0 0 0 -1 0 0 0 0 0 0 8312316 8317760 39591936 140735762977809 140735762977901 140735762977901 140735762980814 0
Current children cumulated CPU time: 0.37 s
Current children cumulated vsize: 625996 KiB
Current children cumulated memory: 12660 KiB

[startup+0.25526 s]
# the end of solver process 2429 was just reported to runsolver
# cumulated CPU time of all completed processes:  user=0.656257 s, system=0.009031 s

Solver just ended.
??? end of watcher thread
Dumping a history of the last processes samples

Child status: 0
Real time (s): 0.255283
CPU time (s): 0.665288
CPU user time (s): 0.656257
CPU system time (s): 0.009031
CPU usage (%): 260.608
Max. virtual memory (cumulated for all children) (KiB): 625996
Max. memory (cumulated for all children) (KiB): 12660

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.656257
system time used= 0.009031
maximum resident set size= 13472
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 3540
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= 77
involuntary context switches= 16


# summary of solver processes directly reported to runsolver:
#   pid: 2429
#   total CPU time (s): 0.665288
#   total CPU user time (s): 0.656257
#   total CPU system time (s): 0.009031

??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.024478 second user time and 0.018092 second system time

The end

Launcher Data 

Begin job on node139 at 2019-09-16 05:15:21
IDJOB=4398286
IDBENCH=126818
IDSOLVER=2851
FILE ID=node139/4398286-1568603610
RUNJOBID= node139-1568596036-1355
PBS_JOBID= 21703395
Free space on /tmp= 59036 MiB

SOLVER NAME= cosoco 2.O parallel
BENCH NAME= XCSP17/Tpp/Tpp-zinc-s1/Tpp-7-3-20-1.xml
COMMAND LINE= cosoco -model -nbcores=NBCORE BENCHNAME
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-4398286-1568603610/watcher-4398286-1568603610 -o /tmp/evaluation-result-4398286-1568603610/solver-4398286-1568603610 -C 20160 -W 2520 -M 31000 --bin-var /tmp/runsolver-exch-node139-1568596036-1355 --watchdog 2580  cosoco -model -nbcores=8 HOME/instance-4398286-1568603610.xml

TIME LIMIT= 20160 seconds
MEMORY LIMIT= 31000 MiB
NBCORE= 8

MD5SUM BENCH= 38f06f34c6c373f6142c39e9ab89bcc1
RANDOM SEED=1760501161

node139.alineos.net Linux 3.10.0-514.16.1.el7.x86_64 #1 SMP Wed Apr 12 15:04:24 UTC 2017

/sys/devices/system/cpu/cpu0/cpufreq/scaling_governor:
performance

/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 6
model		: 26
model name	: Intel(R) Xeon(R) CPU           X5550  @ 2.67GHz
stepping	: 5
microcode	: 0x19
cpu MHz		: 2668.000
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 sep 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 nopl 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 dtherm tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5333.57
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
microcode	: 0x19
cpu MHz		: 2668.000
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 sep 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 nopl 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 dtherm tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5332.55
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
microcode	: 0x19
cpu MHz		: 2668.000
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 sep 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 nopl 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 dtherm tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5333.57
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
microcode	: 0x19
cpu MHz		: 2668.000
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 sep 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 nopl 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 dtherm tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5332.55
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
microcode	: 0x19
cpu MHz		: 2668.000
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 sep 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 nopl 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 dtherm tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5333.57
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
microcode	: 0x19
cpu MHz		: 2668.000
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 sep 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 nopl 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 dtherm tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5332.55
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
microcode	: 0x19
cpu MHz		: 2668.000
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 sep 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 nopl 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 dtherm tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5333.57
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
microcode	: 0x19
cpu MHz		: 2668.000
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 sep 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 nopl 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 dtherm tpr_shadow vnmi flexpriority ept vpid
bogomips	: 5332.55
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:       32770624 kB
MemFree:        30167008 kB
MemAvailable:   31817276 kB
Buffers:           91920 kB
Cached:          1839168 kB
SwapCached:        78068 kB
Active:           516548 kB
Inactive:        1496924 kB
Active(anon):       7572 kB
Inactive(anon):   116968 kB
Active(file):     508976 kB
Inactive(file):  1379956 kB
Unevictable:      107864 kB
Mlocked:          107864 kB
SwapTotal:      67108860 kB
SwapFree:       66921460 kB
Dirty:            904592 kB
Writeback:         80124 kB
AnonPages:        113796 kB
Mapped:            47460 kB
Shmem:             33416 kB
Slab:             182904 kB
SReclaimable:     154340 kB
SUnreclaim:        28564 kB
KernelStack:        3344 kB
PageTables:         5248 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83494172 kB
Committed_AS:     498960 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      350232 kB
VmallocChunk:   34341910524 kB
HardwareCorrupted:     0 kB
AnonHugePages:     67584 kB
HugePages_Total:       0
HugePages_Free:        0
HugePages_Rsvd:        0
HugePages_Surp:        0
Hugepagesize:       2048 kB
DirectMap4k:      107904 kB
DirectMap2M:    33437696 kB

Free space on /tmp at the end= 59036 MiB
End job on node139 at 2019-09-16 05:15:22