Trace number 4398593

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 parallelOPT102 4.58194 0.824175

General information on the benchmark

NameTpp/Tpp-zinc-s1/
Tpp-6-5-20-1.xml
MD5SUM3ec6160036052286f30104bba84c59a2
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark102
Best CPU time to get the best result obtained on this benchmark0.555451
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints652
Number of domains52
Minimum domain size2
Maximum domain size30
Distribution of domain sizes[{"size":2,"count":1},{"size":3,"count":6},{"size":4,"count":14},{"size":5,"count":9},{"size":13,"count":3},{"size":14,"count":3},{"size":15,"count":4},{"size":16,"count":2},{"size":17,"count":5},{"size":18,"count":2},{"size":19,"count":1},{"size":29,"count":20},{"size":30,"count":30}]
Minimum variable degree2
Maximum variable degree31
Distribution of variable degrees[{"degree":2,"count":50},{"degree":22,"count":29},{"degree":23,"count":1},{"degree":31,"count":20}]
Minimum constraint arity1
Maximum constraint arity30
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":650},{"arity":30,"count":1}]
Number of extensional constraints50
Number of intensional constraints601
Distribution of constraint types[{"type":"extension","count":50},{"type":"intension","count":601},{"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-4398593-1568608859.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.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[5],5),ne(l[0],5)) -> 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[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.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[10],10),ne(l[0],10)) -> 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[11],11),ne(l[0],11)) -> 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[12],12),ne(l[0],12)) -> 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[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.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[16],16),ne(l[0],16)) -> 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[17],17),ne(l[0],17)) -> 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[18],18),ne(l[0],18)) -> 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[19],19),ne(l[0],19)) -> 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  imp(eq(s[20],20),ne(l[0],20)) -> 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  imp(eq(s[21],21),ne(l[0],21)) -> extension (support ? 0) - 1tuples
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension  imp(eq(s[22],22),ne(l[0],22)) -> extension (support ? 0) - 1tuples
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  imp(eq(s[23],23),ne(l[0],23)) -> extension (support ? 0) - 1tuples
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension  imp(eq(s[24],24),ne(l[0],24)) -> extension (support ? 0) - 1tuples
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension  imp(eq(s[25],25),ne(l[0],25)) -> extension (support ? 0) - 1tuples
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension  imp(eq(s[26],26),ne(l[0],26)) -> extension (support ? 0) - 1tuples
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension  imp(eq(s[27],27),ne(l[0],27)) -> extension (support ? 0) - 1tuples
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension  imp(eq(s[28],28),ne(l[0],28)) -> extension (support ? 0) - 1tuples
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension  imp(eq(s[29],29),ne(l[0],29)) -> extension (support ? 0) - 0tuples
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c enable optimization
0.21/0.29	c ========================================[ Problem Statistics ]===========================================
0.21/0.29	c |                                                                                                       
0.21/0.29	c |  Parse time        :         0.27 s 
0.21/0.29	c |
0.21/0.29	c |               Variables: 100
0.21/0.29	c |            Domain Sizes: 2..30
0.21/0.29	c |
0.21/0.29	c |             Constraints: 653
0.21/0.29	c |                   Arity: 1..50  -- Unary: 1  -- Binary: 650
0.21/0.29	c | 
0.21/0.29	c |                   Types: 
0.21/0.29	c |                          Circuit: 1
0.21/0.29	c |                          Extension: 650  (nb tuples: 0..29) -- (shared: 4560)
0.21/0.29	c |                          Sum: 1
0.21/0.29	c |                          Unary: 1
0.21/0.29	c |                          
0.21/0.29	c |               Objective: Minimize Sum
0.21/0.29	
0.21/0.29	c =========================================================================================================
0.21/0.29	c Parallel mode: Portfolio
0.21/0.29	c [pFactory][Group N°0] created (threads:8).
0.21/0.29	c [pFactory][Group N°0] new task added (threads:8 - tasks:1).
0.21/0.29	c [pFactory][Group N°0] new task added (threads:8 - tasks:2).
0.21/0.29	c [pFactory][Group N°0] new task added (threads:8 - tasks:3).
0.21/0.29	c [pFactory][Group N°0] new task added (threads:8 - tasks:4).
0.21/0.29	c [pFactory][Group N°0] new task added (threads:8 - tasks:5).
0.21/0.29	c [pFactory][Group N°0] new task added (threads:8 - tasks:6).
0.21/0.29	c [pFactory][Group N°0] new task added (threads:8 - tasks:7).
0.21/0.29	c [pFactory][Group N°0] new task added (threads:8 - tasks:8).
0.21/0.29	c [pFactory][Group N°0] concurrent mode: enabled.
0.21/0.29	c [pFactory][Group N°0] computations in progress (threads:8 - tasks:8).
0.21/0.29	c [pFactory][Group N°0] task 7 launched on thread 3.
0.21/0.29	c [pFactory][Group N°0] task 6 launched on thread 0.
0.21/0.29	c [pFactory][Group N°0] task 5 launched on thread 6.
0.21/0.29	c [pFactory][Group N°0] task 4 launched on thread 2.
0.21/0.29	c [pFactory][Group N°0] task 3 launched on thread 1.
0.21/0.29	c [pFactory][Group N°0] task 2 launched on thread 7.
0.21/0.29	c [pFactory][Group N°0] task 1 launched on thread 4.
0.21/0.29	c [pFactory][Group N°0] task 0 launched on thread 5.
0.21/0.29	o 351
0.21/0.29	o 345
0.21/0.29	o 300
0.21/0.29	o 234
0.21/0.29	o 229
0.21/0.30	o 222
0.57/0.33	o 204
0.57/0.34	o 200
0.57/0.34	o 185
0.57/0.35	o 172
1.36/0.44	o 167
1.36/0.45	o 166
1.36/0.47	o 146
1.36/0.47	o 144
1.36/0.49	o 143
2.16/0.59	o 142
2.16/0.60	o 141
2.88/0.62	o 137
2.88/0.68	o 126
3.60/0.70	o 104
3.60/0.71	o 103
3.60/0.72	o 102
4.40/0.82	c [pFactory][Group N°0] concurent mode: thread 0 has won with the task 6.
4.40/0.82	c [pFactory][Group N°0] Thread N°0 is joined.
4.40/0.82	c [pFactory][Group N°0] Thread N°1 is joined.
4.40/0.82	c [pFactory][Group N°0] Thread N°2 is joined.
4.40/0.82	c [pFactory][Group N°0] Thread N°3 is joined.
4.40/0.82	c [pFactory][Group N°0] Thread N°4 is joined.
4.40/0.82	c [pFactory][Group N°0] Thread N°5 is joined.
4.40/0.82	c [pFactory][Group N°0] Thread N°6 is joined.
4.40/0.82	c [pFactory][Group N°0] Thread N°7 is joined.
4.40/0.82	c [pFactory][Group N°0] Return Code of the winner:3 (Thread N°0)
4.40/0.82	s OPTIMUM FOUND
4.40/0.82	c call to solver        : 28
4.40/0.82	c
4.40/0.82	c restarts              : 420         
4.40/0.82	c conflicts             : 850          (186 /sec)
4.40/0.82	c decisions             : 12679        (2773 /sec)
4.40/0.82	c propagations          : 141185      (30881 /sec)
4.40/0.82	c root propagations     : 774         
4.40/0.82	c filter calls          : 1371389        (299957 /sec)
4.40/0.82	c useless filter calls  : 1303238        (95 %)
4.40/0.82	c Memory used           : 583.91 MB
4.40/0.82	c Best bound time (wc)  : 0.719158 s
4.40/0.82	c CPU time              : 4.57189 s
4.40/0.82	c real time             : 0.819071 s
4.40/0.82	
4.40/0.82	
4.40/0.82	v <instantiation type='solution' cost='102'>
4.40/0.82	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[21] d[22] d[23] d[24] d[25] d[26] d[27] d[28] d[29] 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[21] s[22] s[23] s[24] s[25] s[26] s[27] s[28] s[29] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] </list>
4.40/0.82	v <values>4 5 5 1 4 4 2 1 1 5 4 2 2 3 4 4 4 2 1 4 0 4 1 0 0 0 0 16 5 0 0 0 0 0 8 3 0 0 0 0 1 2 0 0 0 0 0 0 0 0 10 10 23 28 16 11 22 17 17 17 22 10 28 23 22 17 11 16 16 22 0 11 17 12 13 14 15 10 23 18 19 1 20 21 16 29 24 25 26 27 22 28 2 3 4 5 6 7 8 9 </values>
4.40/0.82	v </instantiation>
4.40/0.82	

Verifier Data

OK	102

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

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-4398593-1568608859/watcher-4398593-1568608859 -o /tmp/evaluation-result-4398593-1568608859/solver-4398593-1568608859 -C 2016 -W 252 -M 31000 --bin-var /tmp/runsolver-exch-node145-1568597210-21314 --watchdog 312 cosoco -model -nbcores=8 HOME/instance-4398593-1568608859.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
solver pid=23668, runsolver pid=23665
Current StackSize limit: 8192 KiB


[startup+0.10015 s]*
/proc/loadavg: 7.36 7.42 7.21 2/194 23669
/proc/meminfo: memFree=29477968/32770624 swapFree=66958316/67108860
[pid=23668] ppid=23665 vsize=32516 memory=8736 CPUtime=0.1 cores=0-7
/proc/23668/stat : 23668 (cosoco) R 23665 23668 21287 0 -1 4202496 2410 0 0 0 10 0 0 0 20 0 1 0 436822383 33296384 2184 33554432000 4194304 6211092 140733146020688 140733146017224 5283496 0 0 4096 8405026 0 0 0 17 3 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
/proc/23668/statm: 8129 2184 827 493 0 1434 0
Current children cumulated CPU time: 0.1 s
Current children cumulated vsize: 32516 KiB
Current children cumulated memory: 8736 KiB

[startup+0.209372 s]*
/proc/loadavg: 7.36 7.42 7.21 2/194 23669
/proc/meminfo: memFree=29473504/32770624 swapFree=66958316/67108860
[pid=23668] ppid=23665 vsize=37016 memory=13392 CPUtime=0.21 cores=0-7
/proc/23668/stat : 23668 (cosoco) R 23665 23668 21287 0 -1 4202496 3526 0 0 0 21 0 0 0 20 0 1 0 436822383 37904384 3348 33554432000 4194304 6211092 140733146020688 140733146017224 140074542898149 0 0 4096 8405026 0 0 0 17 3 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
/proc/23668/statm: 9254 3348 827 493 0 2559 0
Current children cumulated CPU time: 0.21 s
Current children cumulated vsize: 37016 KiB
Current children cumulated memory: 13392 KiB

[startup+0.309607 s]*
/proc/loadavg: 7.36 7.42 7.21 9/202 23677
/proc/meminfo: memFree=29468868/32770624 swapFree=66958316/67108860
[pid=23668] ppid=23665 vsize=630704 memory=17340 CPUtime=0.57 cores=0-7
/proc/23668/stat : 23668 (cosoco) S 23665 23668 21287 0 -1 1077944320 4805 0 0 0 57 0 0 0 20 0 9 0 436822383 645840896 4335 33554432000 4194304 6211092 140733146020688 140733146018944 140074558938871 0 0 4096 8405026 18446744073709551615 0 0 17 3 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
/proc/23668/statm: 157676 4335 859 493 0 150981 0
[pid=23668/tid=23670] ppid=23665 vsize=630704 memory=1398722017469774279 CPUtime=0.03 cores=0-7
/proc/23668/task/23670/stat : 23670 (cosoco) R 23665 23668 21287 0 -1 4202560 36 0 0 0 3 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074535795728 5145412 0 0 4096 8405026 0 0 0 -1 2 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
[pid=23668/tid=23671] ppid=23665 vsize=630704 memory=4872558044660077418 CPUtime=0.03 cores=0-7
/proc/23668/task/23671/stat : 23671 (cosoco) R 23665 23668 21287 0 -1 4202560 35 0 0 0 3 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074527403024 5075571 0 0 4096 8405026 0 0 0 -1 3 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
[pid=23668/tid=23672] ppid=23665 vsize=630704 memory=0 CPUtime=0.03 cores=0-7
/proc/23668/task/23672/stat : 23672 (cosoco) R 23665 23668 21287 0 -1 4202560 36 0 0 0 3 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074519010320 5397368 0 0 4096 8405026 0 0 0 -1 4 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
[pid=23668/tid=23673] ppid=23665 vsize=630704 memory=6944656592455097440 CPUtime=0.02 cores=0-7
/proc/23668/task/23673/stat : 23673 (cosoco) R 23665 23668 21287 0 -1 4202560 32 0 0 0 2 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074510617872 5075228 0 0 4096 8405026 0 0 0 -1 7 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
[pid=23668/tid=23674] ppid=23665 vsize=630704 memory=6656426216303648864 CPUtime=0.03 cores=0-7
/proc/23668/task/23674/stat : 23674 (cosoco) R 23665 23668 21287 0 -1 4202560 37 0 0 0 3 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074502225168 5155843 0 0 4096 8405026 0 0 0 -1 0 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
[pid=23668/tid=23675] ppid=23665 vsize=630704 memory=0 CPUtime=0.03 cores=0-7
/proc/23668/task/23675/stat : 23675 (cosoco) R 23665 23668 21287 0 -1 4202560 37 0 0 0 3 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074493832128 5145333 0 0 4096 8405026 0 0 0 -1 1 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
[pid=23668/tid=23676] ppid=23665 vsize=630704 memory=0 CPUtime=0.03 cores=0-7
/proc/23668/task/23676/stat : 23676 (cosoco) R 23665 23668 21287 0 -1 4202560 25 0 0 0 3 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074485439504 5156087 0 0 4096 8405026 0 0 0 -1 5 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
[pid=23668/tid=23677] ppid=23665 vsize=630704 memory=0 CPUtime=0.03 cores=0-7
/proc/23668/task/23677/stat : 23677 (cosoco) R 23665 23668 21287 0 -1 4202560 37 0 0 0 3 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074477047056 5017569 0 0 4096 8405026 0 0 0 -1 6 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
Current children cumulated CPU time: 0.57 s
Current children cumulated vsize: 630704 KiB
Current children cumulated memory: 17340 KiB

[startup+0.700606 s]
/proc/loadavg: 7.36 7.42 7.21 9/202 23677
/proc/meminfo: memFree=29468572/32770624 swapFree=66958316/67108860
[pid=23668] ppid=23665 vsize=630704 memory=17340 CPUtime=3.6 cores=0-7
/proc/23668/stat : 23668 (cosoco) S 23665 23668 21287 0 -1 1077944320 4806 0 0 0 360 0 0 0 20 0 9 0 436822383 645840896 4335 33554432000 4194304 6211092 140733146020688 140733146018944 140074558938871 0 0 4096 8405026 18446744073709551615 0 0 17 3 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
/proc/23668/statm: 157676 4335 859 493 0 150981 0
[pid=23668/tid=23670] ppid=23665 vsize=630704 memory=1760 CPUtime=0.42 cores=0-7
/proc/23668/task/23670/stat : 23670 (cosoco) R 23665 23668 21287 0 -1 4202560 36 0 0 0 42 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074535795984 5017728 0 0 4096 8405026 0 0 0 -1 2 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
[pid=23668/tid=23671] ppid=23665 vsize=630704 memory=111636 CPUtime=0.42 cores=0-7
/proc/23668/task/23671/stat : 23671 (cosoco) R 23665 23668 21287 0 -1 4202560 35 0 0 0 42 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074527403024 5157737 0 0 4096 8405026 0 0 0 -1 3 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
[pid=23668/tid=23672] ppid=23665 vsize=630704 memory=804 CPUtime=0.42 cores=0-7
/proc/23668/task/23672/stat : 23672 (cosoco) R 23665 23668 21287 0 -1 4202560 36 0 0 0 42 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074519010320 5250287 0 0 4096 8405026 0 0 0 -1 4 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
[pid=23668/tid=23673] ppid=23665 vsize=630704 memory=1804 CPUtime=0.39 cores=0-7
/proc/23668/task/23673/stat : 23673 (cosoco) R 23665 23668 21287 0 -1 4202560 33 0 0 0 39 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074510617872 5193744 0 0 4096 8405026 0 0 0 -1 7 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
[pid=23668/tid=23674] ppid=23665 vsize=630704 memory=916 CPUtime=0.42 cores=0-7
/proc/23668/task/23674/stat : 23674 (cosoco) R 23665 23668 21287 0 -1 4202560 37 0 0 0 42 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074502225168 5250289 0 0 4096 8405026 0 0 0 -1 0 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
[pid=23668/tid=23675] ppid=23665 vsize=630704 memory=-7175204567652784766 CPUtime=0.42 cores=0-7
/proc/23668/task/23675/stat : 23675 (cosoco) R 23665 23668 21287 0 -1 4202560 37 0 0 0 42 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074493832128 5250284 0 0 4096 8405026 0 0 0 -1 1 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
[pid=23668/tid=23676] ppid=23665 vsize=630704 memory=3054156605268465310 CPUtime=0.42 cores=0-7
/proc/23668/task/23676/stat : 23676 (cosoco) R 23665 23668 21287 0 -1 4202560 25 0 0 0 42 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074485439504 5250284 0 0 4096 8405026 0 0 0 -1 5 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
[pid=23668/tid=23677] ppid=23665 vsize=630704 memory=1408 CPUtime=0.41 cores=0-7
/proc/23668/task/23677/stat : 23677 (cosoco) R 23665 23668 21287 0 -1 4202560 37 0 0 0 41 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074477047056 5017277 0 0 4096 8405026 0 0 0 -1 6 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
Current children cumulated CPU time: 3.6 s
Current children cumulated vsize: 630704 KiB
Current children cumulated memory: 17340 KiB

[startup+0.824139 s]
# the end of solver process 23668 was just reported to runsolver
# cumulated CPU time of all completed processes:  user=4.57195 s, system=0.009986 s

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

[startup+0.800607 s]
/proc/loadavg: 7.36 7.42 7.21 9/202 23677
/proc/meminfo: memFree=29468572/32770624 swapFree=66958316/67108860
[pid=23668] ppid=23665 vsize=630704 memory=17340 CPUtime=4.4 cores=0-7
/proc/23668/stat : 23668 (cosoco) S 23665 23668 21287 0 -1 1077944320 4808 0 0 0 440 0 0 0 20 0 9 0 436822383 645840896 4335 33554432000 4194304 6211092 140733146020688 140733146018944 140074558938871 0 0 4096 8405026 18446744073709551615 0 0 17 3 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
/proc/23668/statm: 157676 4335 859 493 0 150981 0
[pid=23668/tid=23670] ppid=23665 vsize=630704 memory=17340 CPUtime=0.52 cores=0-7
/proc/23668/task/23670/stat : 23670 (cosoco) R 23665 23668 21287 0 -1 4202560 36 0 0 0 52 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074535795984 5397375 0 0 4096 8405026 0 0 0 -1 2 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
[pid=23668/tid=23671] ppid=23665 vsize=630704 memory=6935054825532540783 CPUtime=0.52 cores=0-7
/proc/23668/task/23671/stat : 23671 (cosoco) R 23665 23668 21287 0 -1 4202560 35 0 0 0 52 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074527403024 5396634 0 0 4096 8405026 0 0 0 -1 3 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
[pid=23668/tid=23672] ppid=23665 vsize=630704 memory=1729 CPUtime=0.52 cores=0-7
/proc/23668/task/23672/stat : 23672 (cosoco) R 23665 23668 21287 0 -1 4202560 36 0 0 0 52 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074519010320 5250284 0 0 4096 8405026 0 0 0 -1 4 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
[pid=23668/tid=23673] ppid=23665 vsize=630704 memory=-7161946572637038933 CPUtime=0.49 cores=0-7
/proc/23668/task/23673/stat : 23673 (cosoco) R 23665 23668 21287 0 -1 4202560 35 0 0 0 49 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074510617872 5017282 0 0 4096 8405026 0 0 0 -1 7 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
[pid=23668/tid=23674] ppid=23665 vsize=630704 memory=-6228314802501610070 CPUtime=0.52 cores=0-7
/proc/23668/task/23674/stat : 23674 (cosoco) R 23665 23668 21287 0 -1 4202560 37 0 0 0 52 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074502225168 5250463 0 0 4096 8405026 0 0 0 -1 0 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
[pid=23668/tid=23675] ppid=23665 vsize=630704 memory=-7519452636843432787 CPUtime=0.51 cores=0-7
/proc/23668/task/23675/stat : 23675 (cosoco) R 23665 23668 21287 0 -1 4202560 37 0 0 0 51 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074493831864 5017462 0 0 4096 8405026 0 0 0 -1 1 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
[pid=23668/tid=23676] ppid=23665 vsize=630704 memory=4856351934171879829 CPUtime=0.52 cores=0-7
/proc/23668/task/23676/stat : 23676 (cosoco) R 23665 23668 21287 0 -1 4202560 25 0 0 0 52 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074485439504 5017564 0 0 4096 8405026 0 0 0 -1 5 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
[pid=23668/tid=23677] ppid=23665 vsize=630704 memory=-7308610313020399446 CPUtime=0.51 cores=0-7
/proc/23668/task/23677/stat : 23677 (cosoco) R 23665 23668 21287 0 -1 4202560 37 0 0 0 51 0 0 0 20 0 9 0 436822411 645840896 4335 33554432000 4194304 6211092 140733146020688 140074477047056 5157540 0 0 4096 8405026 0 0 0 -1 6 0 0 0 0 0 8312316 8317760 23949312 140733146027030 140733146027122 140733146027122 140733146030030 0
Current children cumulated CPU time: 4.4 s
Current children cumulated vsize: 630704 KiB
Current children cumulated memory: 17340 KiB

Child status: 0
Real time (s): 0.824175
CPU time (s): 4.58194
CPU user time (s): 4.57195
CPU system time (s): 0.009986
CPU usage (%): 555.942
Max. virtual memory (cumulated for all children) (KiB): 630704
Max. memory (cumulated for all children) (KiB): 17340

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 4.57195
system time used= 0.009986
maximum resident set size= 18616
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 4825
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= 111
involuntary context switches= 73


# summary of solver processes directly reported to runsolver:
#   pid: 23668
#   total CPU time (s): 4.58194
#   total CPU user time (s): 4.57195
#   total CPU system time (s): 0.009986

??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.017411 second user time and 0.057517 second system time

The end

Launcher Data

Begin job on node145 at 2019-09-16 06:40:17
IDJOB=4398593
IDBENCH=126836
IDSOLVER=2852
FILE ID=node145/4398593-1568608859
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-6-5-20-1.xml
COMMAND LINE= cosoco -model -nbcores=NBCORE BENCHNAME
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-4398593-1568608859/watcher-4398593-1568608859 -o /tmp/evaluation-result-4398593-1568608859/solver-4398593-1568608859 -C 2016 -W 252 -M 31000 --bin-var /tmp/runsolver-exch-node145-1568597210-21314 --watchdog 312  cosoco -model -nbcores=8 HOME/instance-4398593-1568608859.xml

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

MD5SUM BENCH= 3ec6160036052286f30104bba84c59a2
RANDOM SEED=78801992

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:        29482892 kB
MemAvailable:   31849384 kB
Buffers:          165004 kB
Cached:          2493140 kB
SwapCached:        41076 kB
Active:          1270600 kB
Inactive:        1430632 kB
Active(anon):       6852 kB
Inactive(anon):    85464 kB
Active(file):    1263748 kB
Inactive(file):  1345168 kB
Unevictable:      110680 kB
Mlocked:          110680 kB
SwapTotal:      67108860 kB
SwapFree:       66958316 kB
Dirty:              3004 kB
Writeback:             4 kB
AnonPages:        113936 kB
Mapped:            46828 kB
Shmem:             40612 kB
Slab:             175124 kB
SReclaimable:     146820 kB
SUnreclaim:        28304 kB
KernelStack:        3488 kB
PageTables:         5632 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83494172 kB
Committed_AS:     506540 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:      120192 kB
DirectMap2M:    33425408 kB

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