Trace number 4398641

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 parallelOPT171 0.344778 0.23375

General information on the benchmark

NameTpp/Tpp-zinc-s1/
Tpp-3-5-30-1.xml
MD5SUMe91753cc37d5672b16b54feba0c5cd89
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark171
Best CPU time to get the best result obtained on this benchmark0.215432
Satisfiable
(Un)Satisfiability was proved
Number of variables90
Number of constraints497
Number of domains47
Minimum domain size2
Maximum domain size15
Distribution of domain sizes[{"size":2,"count":1},{"size":3,"count":3},{"size":4,"count":8},{"size":5,"count":4},{"size":8,"count":2},{"size":9,"count":5},{"size":10,"count":9},{"size":11,"count":11},{"size":12,"count":2},{"size":14,"count":30},{"size":15,"count":15}]
Minimum variable degree2
Maximum variable degree33
Distribution of variable degrees[{"degree":2,"count":45},{"degree":16,"count":30},{"degree":32,"count":14},{"degree":33,"count":1}]
Minimum constraint arity1
Maximum constraint arity15
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":495},{"arity":15,"count":1}]
Number of extensional constraints45
Number of intensional constraints451
Distribution of constraint types[{"type":"extension","count":45},{"type":"intension","count":451},{"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-4398641-1568608858.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 -> 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.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 -> 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[2],2),ne(l[0],2)) -> 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 -> 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[3],3),ne(l[0],3)) -> 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 -> 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[4],4),ne(l[0],4)) -> 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 -> 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[5],5),ne(l[0],5)) -> 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 -> 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[6],6),ne(l[0],6)) -> 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 -> 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[7],7),ne(l[0],7)) -> 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 -> 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[8],8),ne(l[0],8)) -> 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 -> 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[9],9),ne(l[0],9)) -> 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 -> 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[10],10),ne(l[0],10)) -> 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 -> 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[11],11),ne(l[0],11)) -> 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 -> 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[12],12),ne(l[0],12)) -> 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 -> 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[13],13),ne(l[0],13)) -> extension (support ? 0) - 1tuples
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 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  imp(eq(s[14],14),ne(l[0],14)) -> extension (support ? 0) - 0tuples
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c enable optimization
0.10/0.21	c ========================================[ Problem Statistics ]===========================================
0.10/0.21	c |                                                                                                       
0.10/0.21	c |  Parse time        :         0.21 s 
0.10/0.21	c |
0.10/0.21	c |               Variables: 90
0.10/0.21	c |            Domain Sizes: 2..15
0.10/0.21	c |
0.10/0.21	c |             Constraints: 498
0.10/0.21	c |                   Arity: 1..45  -- Unary: 1  -- Binary: 495
0.10/0.21	c | 
0.10/0.21	c |                   Types: 
0.10/0.21	c |                          Circuit: 1
0.10/0.21	c |                          Extension: 495  (nb tuples: 0..14) -- (shared: 3480)
0.10/0.21	c |                          Sum: 1
0.10/0.21	c |                          Unary: 1
0.10/0.21	c |                          
0.10/0.21	c |               Objective: Minimize Sum
0.10/0.21	
0.10/0.21	c =========================================================================================================
0.10/0.21	c Parallel mode: Portfolio
0.10/0.21	c [pFactory][Group N°0] created (threads:8).
0.10/0.21	c [pFactory][Group N°0] new task added (threads:8 - tasks:1).
0.10/0.21	c [pFactory][Group N°0] new task added (threads:8 - tasks:2).
0.10/0.21	c [pFactory][Group N°0] new task added (threads:8 - tasks:3).
0.10/0.21	c [pFactory][Group N°0] new task added (threads:8 - tasks:4).
0.10/0.21	c [pFactory][Group N°0] new task added (threads:8 - tasks:5).
0.10/0.21	c [pFactory][Group N°0] new task added (threads:8 - tasks:6).
0.10/0.21	c [pFactory][Group N°0] new task added (threads:8 - tasks:7).
0.10/0.21	c [pFactory][Group N°0] new task added (threads:8 - tasks:8).
0.10/0.21	c [pFactory][Group N°0] concurrent mode: enabled.
0.10/0.21	c [pFactory][Group N°0] computations in progress (threads:8 - tasks:8).
0.10/0.21	c [pFactory][Group N°0] task 7 launched on thread 3.
0.10/0.21	c [pFactory][Group N°0] task 6 launched on thread 0.
0.10/0.21	c [pFactory][Group N°0] task 5 launched on thread 1.
0.10/0.21	c [pFactory][Group N°0] task 4 launched on thread 4.
0.10/0.21	c [pFactory][Group N°0] task 3 launched on thread 2.
0.10/0.21	c [pFactory][Group N°0] task 2 launched on thread 6.
0.10/0.21	c [pFactory][Group N°0] task 1 launched on thread 7.
0.10/0.21	c [pFactory][Group N°0] task 0 launched on thread 5.
0.10/0.21	o 220
0.10/0.21	o 214
0.24/0.21	o 190
0.24/0.21	o 189
0.24/0.21	o 171
0.24/0.23	c [pFactory][Group N°0] concurent mode: thread 2 has won with the task 3.
0.24/0.23	c [pFactory][Group N°0] Thread N°0 is joined.
0.24/0.23	c [pFactory][Group N°0] Thread N°1 is joined.
0.24/0.23	c [pFactory][Group N°0] Thread N°2 is joined.
0.24/0.23	c [pFactory][Group N°0] Thread N°3 is joined.
0.24/0.23	c [pFactory][Group N°0] Thread N°4 is joined.
0.24/0.23	c [pFactory][Group N°0] Thread N°5 is joined.
0.24/0.23	c [pFactory][Group N°0] Thread N°6 is joined.
0.24/0.23	c [pFactory][Group N°0] Thread N°7 is joined.
0.24/0.23	c [pFactory][Group N°0] Return Code of the winner:3 (Thread N°2)
0.24/0.23	s OPTIMUM FOUND
0.24/0.23	c call to solver        : 6
0.24/0.23	c
0.24/0.23	c restarts              : 4           
0.24/0.23	c conflicts             : 56           (165 /sec)
0.24/0.23	c decisions             : 526          (1549 /sec)
0.24/0.23	c propagations          : 10944       (32224 /sec)
0.24/0.23	c root propagations     : 168         
0.24/0.23	c filter calls          : 56019          (164947 /sec)
0.24/0.23	c useless filter calls  : 51202          (91 %)
0.24/0.23	c Memory used           : 579.73 MB
0.24/0.23	c Best bound time (wc)  : 0.215868 s
0.24/0.23	c CPU time              : 0.339544 s
0.24/0.23	c real time             : 0.229362 s
0.24/0.23	
0.24/0.23	
0.24/0.23	v <instantiation type='solution' cost='171'>
0.24/0.23	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[20] c[21] c[22] c[23] c[24] c[25] c[26] c[27] c[28] c[29] 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[1] 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[20] l[21] l[22] l[23] l[24] l[25] l[26] l[27] l[28] l[29] 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[1] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] </list>
0.24/0.23	v <values>3 3 7 10 6 4 2 1 1 1 1 4 1 1 2 2 3 1 5 1 2 2 2 3 2 2 2 1 2 4 0 1 4 0 1 18 14 5 0 18 3 0 11 15 0 1 5 2 11 2 8 8 4 4 7 1 8 13 13 1 1 4 5 11 4 13 7 5 7 1 11 8 2 1 13 0 13 8 12 14 11 4 1 3 7 2 6 10 5 9 </values>
0.24/0.23	v </instantiation>
0.24/0.23

Verifier Data 

OK	171

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 (15381 MiB free)
  memory of node 1: 16384 MiB (13408 MiB free)
  node distances:
     10  21
     21  10

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-4398641-1568608858/watcher-4398641-1568608858 -o /tmp/evaluation-result-4398641-1568608858/solver-4398641-1568608858 -C 2016 -W 252 -M 31000 --bin-var /tmp/runsolver-exch-node145-1568597210-21314 --watchdog 312 cosoco -model -nbcores=8 HOME/instance-4398641-1568608858.xml 

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

Enforcing CPUTime limit (soft limit, will send SIGTERM then SIGKILL): 2016 seconds
Enforcing CPUTime limit (hard limit, will send SIGXCPU): 2046 seconds
Enforcing wall clock limit (soft limit, will send SIGTERM then SIGKILL): 252 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
Current StackSize limit: 8192 KiB

solver pid=23587, runsolver pid=23584

[startup+0.100153 s]*
/proc/loadavg: 7.65 7.48 7.23 3/194 23588
/proc/meminfo: memFree=29476576/32770624 swapFree=66958316/67108860
[pid=23587] ppid=23584 vsize=32024 memory=8228 CPUtime=0.1 cores=0-7
/proc/23587/stat : 23587 (cosoco) R 23584 23587 21287 0 -1 4202496 2269 0 0 0 10 0 0 0 20 0 1 0 436822259 32792576 2057 33554432000 4194304 6211092 140735418736992 140735418732168 140547134360549 0 0 4096 8405026 0 0 0 17 3 0 0 0 0 0 8312316 8317760 11190272 140735418745878 140735418745970 140735418745970 140735418748878 0
/proc/23587/statm: 8006 2057 827 493 0 1311 0
Current children cumulated CPU time: 0.1 s
Current children cumulated vsize: 32024 KiB
Current children cumulated memory: 8228 KiB

[startup+0.209536 s]*
/proc/loadavg: 7.65 7.48 7.23 2/194 23588
/proc/meminfo: memFree=29472876/32770624 swapFree=66958316/67108860
[pid=23587] ppid=23584 vsize=626420 memory=13244 CPUtime=0.24 cores=0-7
/proc/23587/stat : 23587 (cosoco) S 23584 23587 21287 0 -1 1077944320 3585 0 0 0 24 0 0 0 20 0 9 0 436822259 641454080 3311 33554432000 4194304 6211092 140735418736992 140735418735248 140547150401271 0 0 4096 8405026 18446744073709551615 0 0 17 3 0 0 0 0 0 8312316 8317760 11190272 140735418745878 140735418745970 140735418745970 140735418748878 0
/proc/23587/statm: 156605 3311 874 493 0 149910 0
[pid=23587/tid=23589] ppid=23584 vsize=626420 memory=8316850467074736180 CPUtime=0 cores=0-7
/proc/23587/task/23589/stat : 23589 (cosoco) R 23584 23587 21287 0 -1 4202560 16 0 0 0 0 0 0 0 20 0 9 0 436822280 641454080 3311 33554432000 4194304 6211092 140735418736992 140547127258048 5155812 0 0 4096 8405026 0 0 0 -1 6 0 0 0 0 0 8312316 8317760 11190272 140735418745878 140735418745970 140735418745970 140735418748878 0
[pid=23587/tid=23590] ppid=23584 vsize=626420 memory=9230 CPUtime=0 cores=0-7
/proc/23587/task/23590/stat : 23590 (cosoco) R 23584 23587 21287 0 -1 4202560 15 0 0 0 0 0 0 0 20 0 9 0 436822280 641454080 3311 33554432000 4194304 6211092 140735418736992 140547118865480 5155804 0 0 4096 8405026 0 0 0 -1 0 0 0 0 0 0 8312316 8317760 11190272 140735418745878 140735418745970 140735418745970 140735418748878 0
[pid=23587/tid=23591] ppid=23584 vsize=626420 memory=4051182190390056608 CPUtime=0 cores=0-7
/proc/23587/task/23591/stat : 23591 (cosoco) R 23584 23587 21287 0 -1 4202560 17 0 0 0 0 0 0 0 20 0 9 0 436822280 641454080 3311 33554432000 4194304 6211092 140735418736992 140547110472776 140547134798973 0 0 4096 8405026 0 0 0 -1 5 0 0 0 0 0 8312316 8317760 11190272 140735418745878 140735418745970 140735418745970 140735418748878 0
[pid=23587/tid=23592] ppid=23584 vsize=626420 memory=-1 CPUtime=0 cores=0-7
/proc/23587/task/23592/stat : 23592 (cosoco) R 23584 23587 21287 0 -1 1077944384 7 0 0 0 0 0 0 0 20 0 9 0 436822280 641454080 3311 33554432000 4194304 6211092 140735418736992 140547102079936 140547150422461 0 0 4096 8405026 0 0 0 -1 6 0 0 0 0 0 8312316 8317760 11190272 140735418745878 140735418745970 140735418745970 140735418748878 0
[pid=23587/tid=23593] ppid=23584 vsize=626420 memory=0 CPUtime=0 cores=0-7
/proc/23587/task/23593/stat : 23593 (cosoco) R 23584 23587 21287 0 -1 4202560 17 0 0 0 0 0 0 0 20 0 9 0 436822280 641454080 3311 33554432000 4194304 6211092 140735418736992 140547093687568 5390141 0 0 4096 8405026 0 0 0 -1 1 0 0 0 0 0 8312316 8317760 11190272 140735418745878 140735418745970 140735418745970 140735418748878 0
[pid=23587/tid=23594] ppid=23584 vsize=626420 memory=0 CPUtime=0 cores=0-7
/proc/23587/task/23594/stat : 23594 (cosoco) R 23584 23587 21287 0 -1 4202560 12 0 0 0 0 0 0 0 20 0 9 0 436822280 641454080 3311 33554432000 4194304 6211092 140735418736992 140547085294664 5250450 0 0 4096 8405026 0 0 0 -1 3 0 0 0 0 0 8312316 8317760 11190272 140735418745878 140735418745970 140735418745970 140735418748878 0
[pid=23587/tid=23595] ppid=23584 vsize=626420 memory=-1 CPUtime=0 cores=0-7
/proc/23587/task/23595/stat : 23595 (cosoco) R 23584 23587 21287 0 -1 4202560 15 0 0 0 0 0 0 0 20 0 9 0 436822280 641454080 3311 33554432000 4194304 6211092 140735418736992 140547076901904 5397375 0 0 4096 8405026 0 0 0 -1 4 0 0 0 0 0 8312316 8317760 11190272 140735418745878 140735418745970 140735418745970 140735418748878 0
[pid=23587/tid=23596] ppid=23584 vsize=626420 memory=0 CPUtime=0 cores=0-7
/proc/23587/task/23596/stat : 23596 (cosoco) R 23584 23587 21287 0 -1 4202560 14 0 0 0 0 0 0 0 20 0 9 0 436822280 641454080 3311 33554432000 4194304 6211092 140735418736992 140547068509256 5397375 0 0 4096 8405026 0 0 0 -1 2 0 0 0 0 0 8312316 8317760 11190272 140735418745878 140735418745970 140735418745970 140735418748878 0
Current children cumulated CPU time: 0.24 s
Current children cumulated vsize: 626420 KiB
Current children cumulated memory: 13244 KiB

[startup+0.233728 s]
# the end of solver process 23587 was just reported to runsolver
# cumulated CPU time of all completed processes:  user=0.339796 s, system=0.004982 s

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

Child status: 0
Real time (s): 0.23375
CPU time (s): 0.344778
CPU user time (s): 0.339796
CPU system time (s): 0.004982
CPU usage (%): 147.499
Max. virtual memory (cumulated for all children) (KiB): 626420
Max. memory (cumulated for all children) (KiB): 13244

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.339796
system time used= 0.004982
maximum resident set size= 13732
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 3611
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= 55
involuntary context switches= 9


# summary of solver processes directly reported to runsolver:
#   pid: 23587
#   total CPU time (s): 0.344778
#   total CPU user time (s): 0.339796
#   total CPU system time (s): 0.004982

??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.016688 second user time and 0.026505 second system time

The end

Launcher Data 

Begin job on node145 at 2019-09-16 06:40:16
IDJOB=4398641
IDBENCH=126835
IDSOLVER=2852
FILE ID=node145/4398641-1568608858
RUNJOBID= node145-1568597210-21314
PBS_JOBID= 21703405
Free space on /tmp= 59532 MiB

SOLVER NAME= cosoco 2.O parallel
BENCH NAME= XCSP17/Tpp/Tpp-zinc-s1/Tpp-3-5-30-1.xml
COMMAND LINE= cosoco -model -nbcores=NBCORE BENCHNAME
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-4398641-1568608858/watcher-4398641-1568608858 -o /tmp/evaluation-result-4398641-1568608858/solver-4398641-1568608858 -C 2016 -W 252 -M 31000 --bin-var /tmp/runsolver-exch-node145-1568597210-21314 --watchdog 312  cosoco -model -nbcores=8 HOME/instance-4398641-1568608858.xml

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

MD5SUM BENCH= e91753cc37d5672b16b54feba0c5cd89
RANDOM SEED=2085920969

node145.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.59
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.59
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.59
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.59
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:        29481740 kB
MemAvailable:   31848284 kB
Buffers:          164988 kB
Cached:          2493208 kB
SwapCached:        41076 kB
Active:          1271812 kB
Inactive:        1430648 kB
Active(anon):       8028 kB
Inactive(anon):    85464 kB
Active(file):    1263784 kB
Inactive(file):  1345184 kB
Unevictable:      110680 kB
Mlocked:          110680 kB
SwapTotal:      67108860 kB
SwapFree:       66958316 kB
Dirty:              2852 kB
Writeback:             0 kB
AnonPages:        117636 kB
Mapped:            46872 kB
Shmem:             40612 kB
Slab:             175116 kB
SReclaimable:     146820 kB
SUnreclaim:        28296 kB
KernelStack:        3744 kB
PageTables:         6236 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83494172 kB
Committed_AS:     506536 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      350232 kB
VmallocChunk:   34341910524 kB
HardwareCorrupted:     0 kB
AnonHugePages:     71680 kB
HugePages_Total:       0
HugePages_Free:        0
HugePages_Rsvd:        0
HugePages_Surp:        0
Hugepagesize:       2048 kB
DirectMap4k:      120192 kB
DirectMap2M:    33425408 kB

Free space on /tmp at the end= 59528 MiB
End job on node145 at 2019-09-16 06:40:16