Trace number 4398331

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 parallelOPT164 1.0032 0.343073

General information on the benchmark

NameTpp/Tpp-zinc-s1/
Tpp-6-3-30-1.xml
MD5SUMf61e90724cd8b66989ec046e8a3ea41c
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark164
Best CPU time to get the best result obtained on this benchmark0.325758
Satisfiable
(Un)Satisfiability was proved
Number of variables96
Number of constraints590
Number of domains50
Minimum domain size3
Maximum domain size18
Distribution of domain sizes[{"size":3,"count":6},{"size":4,"count":9},{"size":5,"count":3},{"size":7,"count":1},{"size":9,"count":2},{"size":10,"count":3},{"size":11,"count":9},{"size":12,"count":9},{"size":13,"count":5},{"size":14,"count":1},{"size":17,"count":30},{"size":18,"count":18}]
Minimum variable degree2
Maximum variable degree33
Distribution of variable degrees[{"degree":2,"count":48},{"degree":19,"count":30},{"degree":32,"count":17},{"degree":33,"count":1}]
Minimum constraint arity1
Maximum constraint arity18
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":588},{"arity":18,"count":1}]
Number of extensional constraints48
Number of intensional constraints541
Distribution of constraint types[{"type":"extension","count":48},{"type":"intension","count":541},{"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-4398331-1568603623.xml 
0.00/0.01	c intension  imp(eq(s[0],0),ne(l[0],0)) -> 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 -> 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[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.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 -> 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[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.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 -> 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[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) - 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 -> 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[15],15),ne(l[0],15)) -> 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 -> 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[16],16),ne(l[0],16)) -> 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 -> 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[17],17),ne(l[0],17)) -> extension (support ? 0) - 0tuples
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 -> 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 enable optimization
0.21/0.25	c ========================================[ Problem Statistics ]===========================================
0.21/0.25	c |                                                                                                       
0.21/0.25	c |  Parse time        :         0.24 s 
0.21/0.25	c |
0.21/0.25	c |               Variables: 96
0.21/0.25	c |            Domain Sizes: 3..18
0.21/0.25	c |
0.21/0.25	c |             Constraints: 591
0.21/0.25	c |                   Arity: 1..48  -- Unary: 1  -- Binary: 588
0.21/0.25	c | 
0.21/0.25	c |                   Types: 
0.21/0.25	c |                          Circuit: 1
0.21/0.25	c |                          Extension: 588  (nb tuples: 0..17) -- (shared: 4176)
0.21/0.25	c |                          Sum: 1
0.21/0.25	c |                          Unary: 1
0.21/0.25	c |                          
0.21/0.25	c |               Objective: Minimize Sum
0.21/0.25	
0.21/0.25	c =========================================================================================================
0.21/0.25	c Parallel mode: Portfolio
0.21/0.25	c [pFactory][Group N°0] created (threads:8).
0.21/0.25	c [pFactory][Group N°0] new task added (threads:8 - tasks:1).
0.21/0.25	c [pFactory][Group N°0] new task added (threads:8 - tasks:2).
0.21/0.25	c [pFactory][Group N°0] new task added (threads:8 - tasks:3).
0.21/0.25	c [pFactory][Group N°0] new task added (threads:8 - tasks:4).
0.21/0.25	c [pFactory][Group N°0] new task added (threads:8 - tasks:5).
0.21/0.25	c [pFactory][Group N°0] new task added (threads:8 - tasks:6).
0.21/0.25	c [pFactory][Group N°0] new task added (threads:8 - tasks:7).
0.21/0.25	c [pFactory][Group N°0] new task added (threads:8 - tasks:8).
0.21/0.25	c [pFactory][Group N°0] concurrent mode: enabled.
0.21/0.25	c [pFactory][Group N°0] computations in progress (threads:8 - tasks:8).
0.21/0.25	c [pFactory][Group N°0] task 7 launched on thread 0.
0.21/0.25	c [pFactory][Group N°0] task 6 launched on thread 2.
0.21/0.25	c [pFactory][Group N°0] task 5 launched on thread 1.
0.21/0.25	c [pFactory][Group N°0] task 4 launched on thread 6.
0.21/0.25	c [pFactory][Group N°0] task 3 launched on thread 7.
0.21/0.25	c [pFactory][Group N°0] task 2 launched on thread 4.
0.21/0.25	c [pFactory][Group N°0] task 1 launched on thread 5.
0.21/0.25	c [pFactory][Group N°0] task 0 launched on thread 3.
0.21/0.25	o 248
0.21/0.25	o 243
0.21/0.25	o 242
0.21/0.25	o 231
0.21/0.25	o 224
0.21/0.26	o 223
0.21/0.26	o 221
0.21/0.26	o 220
0.21/0.26	o 202
0.21/0.26	o 170
0.21/0.29	o 169
0.81/0.31	o 164
0.81/0.34	c [pFactory][Group N°0] concurent mode: thread 0 has won with the task 7.
0.81/0.34	c [pFactory][Group N°0] Thread N°0 is joined.
0.81/0.34	c [pFactory][Group N°0] Thread N°1 is joined.
0.81/0.34	c [pFactory][Group N°0] Thread N°2 is joined.
0.81/0.34	c [pFactory][Group N°0] Thread N°3 is joined.
0.81/0.34	c [pFactory][Group N°0] Thread N°4 is joined.
0.81/0.34	c [pFactory][Group N°0] Thread N°5 is joined.
0.81/0.34	c [pFactory][Group N°0] Thread N°6 is joined.
0.81/0.34	c [pFactory][Group N°0] Thread N°7 is joined.
0.81/0.34	c [pFactory][Group N°0] Return Code of the winner:3 (Thread N°0)
0.81/0.34	s OPTIMUM FOUND
0.81/0.34	c call to solver        : 28
0.81/0.34	c
0.81/0.34	c restarts              : 81          
0.81/0.34	c conflicts             : 160          (161 /sec)
0.81/0.34	c decisions             : 3559         (3580 /sec)
0.81/0.34	c propagations          : 40561       (40797 /sec)
0.81/0.34	c root propagations     : 254         
0.81/0.34	c filter calls          : 313830         (315656 /sec)
0.81/0.34	c useless filter calls  : 295242         (94 %)
0.81/0.34	c Memory used           : 581.74 MB
0.81/0.34	c Best bound time (wc)  : 0.315736 s
0.81/0.34	c CPU time              : 0.994135 s
0.81/0.34	c real time             : 0.337943 s
0.81/0.34	
0.81/0.34	
0.81/0.34	v <instantiation type='solution' cost='164'>
0.81/0.34	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[15] d[16] d[17] 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[15] s[16] s[17] s[1] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] </list>
0.81/0.34	v <values>4 3 3 7 4 1 4 5 1 4 2 4 9 1 2 1 7 2 2 3 4 10 7 6 8 4 2 1 4 8 0 4 1 0 0 0 1 13 16 0 0 0 0 0 0 0 0 6 9 10 10 9 16 9 11 11 10 9 16 9 16 11 11 15 15 10 10 16 9 16 15 16 11 16 15 15 9 11 0 11 17 12 13 14 9 15 16 1 2 3 4 5 6 7 8 10 </values>
0.81/0.34	v </instantiation>
0.81/0.34

Verifier Data 

OK	164

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

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-4398331-1568603623/watcher-4398331-1568603623 -o /tmp/evaluation-result-4398331-1568603623/solver-4398331-1568603623 -C 20160 -W 2520 -M 31000 --bin-var /tmp/runsolver-exch-node103-1568595988-23581 --watchdog 2580 cosoco -model -nbcores=8 HOME/instance-4398331-1568603623.xml 

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

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


[startup+0.100155 s]*
/proc/loadavg: 1.14 1.05 1.50 2/196 24635
/proc/meminfo: memFree=31734508/32770624 swapFree=66997340/67108860
[pid=24634] ppid=24631 vsize=32312 memory=8624 CPUtime=0.1 cores=0-7
/proc/24634/stat : 24634 (cosoco) R 24631 24634 23554 0 -1 4202496 2343 0 0 0 10 0 0 0 20 0 1 0 436615398 33087488 2156 33554432000 4194304 6211092 140733625707712 140733625704248 139746159692773 0 0 4096 8405026 0 0 0 17 2 0 0 0 0 0 8312316 8317760 20566016 140733625709585 140733625709677 140733625709677 140733625712590 0
/proc/24634/statm: 8078 2156 827 493 0 1383 0
Current children cumulated CPU time: 0.1 s
Current children cumulated vsize: 32312 KiB
Current children cumulated memory: 8624 KiB

[startup+0.209211 s]*
/proc/loadavg: 1.14 1.05 1.50 2/196 24635
/proc/meminfo: memFree=31730044/32770624 swapFree=66997340/67108860
[pid=24634] ppid=24631 vsize=36764 memory=12960 CPUtime=0.21 cores=0-7
/proc/24634/stat : 24634 (cosoco) R 24631 24634 23554 0 -1 4202496 3451 0 0 0 21 0 0 0 20 0 1 0 436615398 37646336 3240 33554432000 4194304 6211092 140733625707712 140733625704248 139746159692773 0 0 4096 8405026 0 0 0 17 2 0 0 0 0 0 8312316 8317760 20566016 140733625709585 140733625709677 140733625709677 140733625712590 0
/proc/24634/statm: 9191 3240 827 493 0 2496 0
Current children cumulated CPU time: 0.21 s
Current children cumulated vsize: 36764 KiB
Current children cumulated memory: 12960 KiB

[startup+0.30954 s]*
/proc/loadavg: 1.14 1.05 1.50 9/204 24643
/proc/meminfo: memFree=31727284/32770624 swapFree=66997340/67108860
[pid=24634] ppid=24631 vsize=628480 memory=15072 CPUtime=0.81 cores=0-7
/proc/24634/stat : 24634 (cosoco) S 24631 24634 23554 0 -1 1077944320 4128 0 0 0 81 0 0 0 20 0 9 0 436615398 643563520 3768 33554432000 4194304 6211092 140733625707712 140733625705968 139746175733495 0 0 4096 8405026 18446744073709551615 0 0 17 2 0 0 0 0 0 8312316 8317760 20566016 140733625709585 140733625709677 140733625709677 140733625712590 0
/proc/24634/statm: 157120 3768 847 493 0 150425 0
[pid=24634/tid=24636] ppid=24631 vsize=628480 memory=8317482817917895235 CPUtime=0.07 cores=0-7
/proc/24634/task/24636/stat : 24636 (cosoco) R 24631 24634 23554 0 -1 4202560 25 0 0 0 7 0 0 0 20 0 9 0 436615423 643563520 3768 33554432000 4194304 6211092 140733625707712 139746152590352 5397375 0 0 4096 8405026 0 0 0 -1 3 0 0 0 0 0 8312316 8317760 20566016 140733625709585 140733625709677 140733625709677 140733625712590 0
[pid=24634/tid=24637] ppid=24631 vsize=628480 memory=0 CPUtime=0.07 cores=0-7
/proc/24634/task/24637/stat : 24637 (cosoco) R 24631 24634 23554 0 -1 4202560 20 0 0 0 7 0 0 0 20 0 9 0 436615423 643563520 3768 33554432000 4194304 6211092 140733625707712 139746144197904 5250287 0 0 4096 8405026 0 0 0 -1 4 0 0 0 0 0 8312316 8317760 20566016 140733625709585 140733625709677 140733625709677 140733625712590 0
[pid=24634/tid=24638] ppid=24631 vsize=628480 memory=0 CPUtime=0.07 cores=0-7
/proc/24634/task/24638/stat : 24638 (cosoco) R 24631 24634 23554 0 -1 4202560 20 0 0 0 7 0 0 0 20 0 9 0 436615423 643563520 3768 33554432000 4194304 6211092 140733625707712 139746135804944 5082376 0 0 4096 8405026 0 0 0 -1 5 0 0 0 0 0 8312316 8317760 20566016 140733625709585 140733625709677 140733625709677 140733625712590 0
[pid=24634/tid=24639] ppid=24631 vsize=628480 memory=6944656592455097440 CPUtime=0.07 cores=0-7
/proc/24634/task/24639/stat : 24639 (cosoco) R 24631 24634 23554 0 -1 4202560 16 0 0 0 7 0 0 0 20 0 9 0 436615423 643563520 3768 33554432000 4194304 6211092 140733625707712 139746127412160 5017569 0 0 4096 8405026 0 0 0 -1 2 0 0 0 0 0 8312316 8317760 20566016 140733625709585 140733625709677 140733625709677 140733625712590 0
[pid=24634/tid=24640] ppid=24631 vsize=628480 memory=0 CPUtime=0.07 cores=0-7
/proc/24634/task/24640/stat : 24640 (cosoco) R 24631 24634 23554 0 -1 4202560 19 0 0 0 7 0 0 0 20 0 9 0 436615423 643563520 3768 33554432000 4194304 6211092 140733625707712 139746119019792 5017569 0 0 4096 8405026 0 0 0 -1 1 0 0 0 0 0 8312316 8317760 20566016 140733625709585 140733625709677 140733625709677 140733625712590 0
[pid=24634/tid=24641] ppid=24631 vsize=628480 memory=0 CPUtime=0.07 cores=0-7
/proc/24634/task/24641/stat : 24641 (cosoco) R 24631 24634 23554 0 -1 4202560 17 0 0 0 7 0 0 0 20 0 9 0 436615423 643563520 3768 33554432000 4194304 6211092 140733625707712 139746110626752 5397375 0 0 4096 8405026 0 0 0 -1 0 0 0 0 0 0 8312316 8317760 20566016 140733625709585 140733625709677 140733625709677 140733625712590 0
[pid=24634/tid=24642] ppid=24631 vsize=628480 memory=0 CPUtime=0.07 cores=0-7
/proc/24634/task/24642/stat : 24642 (cosoco) R 24631 24634 23554 0 -1 4202560 17 0 0 0 7 0 0 0 20 0 9 0 436615423 643563520 3768 33554432000 4194304 6211092 140733625707712 139746102234384 5193754 0 0 4096 8405026 0 0 0 -1 6 0 0 0 0 0 8312316 8317760 20566016 140733625709585 140733625709677 140733625709677 140733625712590 0
[pid=24634/tid=24643] ppid=24631 vsize=628480 memory=0 CPUtime=0.06 cores=0-7
/proc/24634/task/24643/stat : 24643 (cosoco) R 24631 24634 23554 0 -1 4202560 18 0 0 0 6 0 0 0 20 0 9 0 436615423 643563520 3768 33554432000 4194304 6211092 140733625707712 139746093841424 5250241 0 0 4096 8405026 0 0 0 -1 7 0 0 0 0 0 8312316 8317760 20566016 140733625709585 140733625709677 140733625709677 140733625712590 0
Current children cumulated CPU time: 0.81 s
Current children cumulated vsize: 628480 KiB
Current children cumulated memory: 15072 KiB

[startup+0.343031 s]
# the end of solver process 24634 was just reported to runsolver
# cumulated CPU time of all completed processes:  user=0.994215 s, system=0.008989 s

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

[startup+0.30954 s]*
/proc/loadavg: 1.14 1.05 1.50 9/204 24643
/proc/meminfo: memFree=31727284/32770624 swapFree=66997340/67108860
[pid=24634] ppid=24631 vsize=628480 memory=15072 CPUtime=0.81 cores=0-7
/proc/24634/stat : 24634 (cosoco) S 24631 24634 23554 0 -1 1077944320 4128 0 0 0 81 0 0 0 20 0 9 0 436615398 643563520 3768 33554432000 4194304 6211092 140733625707712 140733625705968 139746175733495 0 0 4096 8405026 18446744073709551615 0 0 17 2 0 0 0 0 0 8312316 8317760 20566016 140733625709585 140733625709677 140733625709677 140733625712590 0
/proc/24634/statm: 157120 3768 847 493 0 150425 0
[pid=24634/tid=24636] ppid=24631 vsize=628480 memory=8317482817917895235 CPUtime=0.07 cores=0-7
/proc/24634/task/24636/stat : 24636 (cosoco) R 24631 24634 23554 0 -1 4202560 25 0 0 0 7 0 0 0 20 0 9 0 436615423 643563520 3768 33554432000 4194304 6211092 140733625707712 139746152590352 5397375 0 0 4096 8405026 0 0 0 -1 3 0 0 0 0 0 8312316 8317760 20566016 140733625709585 140733625709677 140733625709677 140733625712590 0
[pid=24634/tid=24637] ppid=24631 vsize=628480 memory=0 CPUtime=0.07 cores=0-7
/proc/24634/task/24637/stat : 24637 (cosoco) R 24631 24634 23554 0 -1 4202560 20 0 0 0 7 0 0 0 20 0 9 0 436615423 643563520 3768 33554432000 4194304 6211092 140733625707712 139746144197904 5250287 0 0 4096 8405026 0 0 0 -1 4 0 0 0 0 0 8312316 8317760 20566016 140733625709585 140733625709677 140733625709677 140733625712590 0
[pid=24634/tid=24638] ppid=24631 vsize=628480 memory=0 CPUtime=0.07 cores=0-7
/proc/24634/task/24638/stat : 24638 (cosoco) R 24631 24634 23554 0 -1 4202560 20 0 0 0 7 0 0 0 20 0 9 0 436615423 643563520 3768 33554432000 4194304 6211092 140733625707712 139746135804944 5082376 0 0 4096 8405026 0 0 0 -1 5 0 0 0 0 0 8312316 8317760 20566016 140733625709585 140733625709677 140733625709677 140733625712590 0
[pid=24634/tid=24639] ppid=24631 vsize=628480 memory=6944656592455097440 CPUtime=0.07 cores=0-7
/proc/24634/task/24639/stat : 24639 (cosoco) R 24631 24634 23554 0 -1 4202560 16 0 0 0 7 0 0 0 20 0 9 0 436615423 643563520 3768 33554432000 4194304 6211092 140733625707712 139746127412160 5017569 0 0 4096 8405026 0 0 0 -1 2 0 0 0 0 0 8312316 8317760 20566016 140733625709585 140733625709677 140733625709677 140733625712590 0
[pid=24634/tid=24640] ppid=24631 vsize=628480 memory=0 CPUtime=0.07 cores=0-7
/proc/24634/task/24640/stat : 24640 (cosoco) R 24631 24634 23554 0 -1 4202560 19 0 0 0 7 0 0 0 20 0 9 0 436615423 643563520 3768 33554432000 4194304 6211092 140733625707712 139746119019792 5017569 0 0 4096 8405026 0 0 0 -1 1 0 0 0 0 0 8312316 8317760 20566016 140733625709585 140733625709677 140733625709677 140733625712590 0
[pid=24634/tid=24641] ppid=24631 vsize=628480 memory=0 CPUtime=0.07 cores=0-7
/proc/24634/task/24641/stat : 24641 (cosoco) R 24631 24634 23554 0 -1 4202560 17 0 0 0 7 0 0 0 20 0 9 0 436615423 643563520 3768 33554432000 4194304 6211092 140733625707712 139746110626752 5397375 0 0 4096 8405026 0 0 0 -1 0 0 0 0 0 0 8312316 8317760 20566016 140733625709585 140733625709677 140733625709677 140733625712590 0
[pid=24634/tid=24642] ppid=24631 vsize=628480 memory=0 CPUtime=0.07 cores=0-7
/proc/24634/task/24642/stat : 24642 (cosoco) R 24631 24634 23554 0 -1 4202560 17 0 0 0 7 0 0 0 20 0 9 0 436615423 643563520 3768 33554432000 4194304 6211092 140733625707712 139746102234384 5193754 0 0 4096 8405026 0 0 0 -1 6 0 0 0 0 0 8312316 8317760 20566016 140733625709585 140733625709677 140733625709677 140733625712590 0
[pid=24634/tid=24643] ppid=24631 vsize=628480 memory=0 CPUtime=0.06 cores=0-7
/proc/24634/task/24643/stat : 24643 (cosoco) R 24631 24634 23554 0 -1 4202560 18 0 0 0 6 0 0 0 20 0 9 0 436615423 643563520 3768 33554432000 4194304 6211092 140733625707712 139746093841424 5250241 0 0 4096 8405026 0 0 0 -1 7 0 0 0 0 0 8312316 8317760 20566016 140733625709585 140733625709677 140733625709677 140733625712590 0
Current children cumulated CPU time: 0.81 s
Current children cumulated vsize: 628480 KiB
Current children cumulated memory: 15072 KiB

Child status: 0
Real time (s): 0.343073
CPU time (s): 1.0032
CPU user time (s): 0.994215
CPU system time (s): 0.008989
CPU usage (%): 292.417
Max. virtual memory (cumulated for all children) (KiB): 628480
Max. memory (cumulated for all children) (KiB): 15072

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.994215
system time used= 0.008989
maximum resident set size= 15892
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 4145
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= 80
involuntary context switches= 11


# summary of solver processes directly reported to runsolver:
#   pid: 24634
#   total CPU time (s): 1.0032
#   total CPU user time (s): 0.994215
#   total CPU system time (s): 0.008989

??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.01806 second user time and 0.034022 second system time

The end

Launcher Data 

Begin job on node103 at 2019-09-16 05:12:44
IDJOB=4398331
IDBENCH=126825
IDSOLVER=2851
FILE ID=node103/4398331-1568603623
RUNJOBID= node103-1568595988-23581
PBS_JOBID= 21703397
Free space on /tmp= 61720 MiB

SOLVER NAME= cosoco 2.O parallel
BENCH NAME= XCSP17/Tpp/Tpp-zinc-s1/Tpp-6-3-30-1.xml
COMMAND LINE= cosoco -model -nbcores=NBCORE BENCHNAME
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-4398331-1568603623/watcher-4398331-1568603623 -o /tmp/evaluation-result-4398331-1568603623/solver-4398331-1568603623 -C 20160 -W 2520 -M 31000 --bin-var /tmp/runsolver-exch-node103-1568595988-23581 --watchdog 2580  cosoco -model -nbcores=8 HOME/instance-4398331-1568603623.xml

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

MD5SUM BENCH= f61e90724cd8b66989ec046e8a3ea41c
RANDOM SEED=1149537143

node103.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.74
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.74
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.74
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.74
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:        31739792 kB
MemAvailable:   31884480 kB
Buffers:           28000 kB
Cached:           413084 kB
SwapCached:         8840 kB
Active:           333840 kB
Inactive:         119464 kB
Active(anon):       2160 kB
Inactive(anon):    59304 kB
Active(file):     331680 kB
Inactive(file):    60160 kB
Unevictable:      111164 kB
Mlocked:          111164 kB
SwapTotal:      67108860 kB
SwapFree:       66997340 kB
Dirty:              3380 kB
Writeback:           132 kB
AnonPages:        158040 kB
Mapped:            47020 kB
Shmem:             40848 kB
Slab:             166728 kB
SReclaimable:     137368 kB
SUnreclaim:        29360 kB
KernelStack:        3904 kB
PageTables:         5816 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83494172 kB
Committed_AS:     505656 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      350232 kB
VmallocChunk:   34341910524 kB
HardwareCorrupted:     0 kB
AnonHugePages:    114688 kB
HugePages_Total:       0
HugePages_Free:        0
HugePages_Rsvd:        0
HugePages_Surp:        0
Hugepagesize:       2048 kB
DirectMap4k:      105856 kB
DirectMap2M:    33439744 kB

Free space on /tmp at the end= 61716 MiB
End job on node103 at 2019-09-16 05:12:45