Trace number 4398669

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 parallelOPT147 1.23061 0.419537

General information on the benchmark

NameTpp/Tpp-zinc-s1/
Tpp-7-3-30-1.xml
MD5SUM0f4bef4b37e838bc5603a3a9d9caf103
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark147
Best CPU time to get the best result obtained on this benchmark0.35928
Satisfiable
(Un)Satisfiability was proved
Number of variables102
Number of constraints683
Number of domains53
Minimum domain size2
Maximum domain size21
Distribution of domain sizes[{"size":2,"count":1},{"size":3,"count":4},{"size":4,"count":13},{"size":5,"count":3},{"size":9,"count":1},{"size":10,"count":1},{"size":11,"count":4},{"size":12,"count":9},{"size":13,"count":8},{"size":14,"count":3},{"size":15,"count":3},{"size":16,"count":1},{"size":20,"count":30},{"size":21,"count":21}]
Minimum variable degree2
Maximum variable degree33
Distribution of variable degrees[{"degree":2,"count":51},{"degree":22,"count":30},{"degree":32,"count":20},{"degree":33,"count":1}]
Minimum constraint arity1
Maximum constraint arity21
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":681},{"arity":21,"count":1}]
Number of extensional constraints51
Number of intensional constraints631
Distribution of constraint types[{"type":"extension","count":51},{"type":"intension","count":631},{"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.02	c
0.00/0.02	c This is cosoco 2.00 --  
0.00/0.02	c
0.00/0.02	c command line: cosoco -model -nbcores=8 HOME/instance-4398669-1568608847.xml 
0.00/0.02	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.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 -> 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[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.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[7],7),ne(l[0],7)) -> extension (support ? 0) - 1tuples
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension  imp(eq(s[8],8),ne(l[0],8)) -> extension (support ? 0) - 1tuples
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension  imp(eq(s[9],9),ne(l[0],9)) -> extension (support ? 0) - 1tuples
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension  imp(eq(s[10],10),ne(l[0],10)) -> extension (support ? 0) - 1tuples
0.10/0.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[11],11),ne(l[0],11)) -> extension (support ? 0) - 1tuples
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension  imp(eq(s[12],12),ne(l[0],12)) -> extension (support ? 0) - 1tuples
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension  imp(eq(s[13],13),ne(l[0],13)) -> extension (support ? 0) - 1tuples
0.10/0.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[14],14),ne(l[0],14)) -> 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[15],15),ne(l[0],15)) -> 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 -> 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[16],16),ne(l[0],16)) -> 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 -> 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[17],17),ne(l[0],17)) -> 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 -> 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[18],18),ne(l[0],18)) -> 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 -> 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[19],19),ne(l[0],19)) -> extension (support ? 0) - 1tuples
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension  imp(eq(s[20],20),ne(l[0],20)) -> extension (support ? 0) - 0tuples
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c enable optimization
0.21/0.30	c ========================================[ Problem Statistics ]===========================================
0.21/0.30	c |                                                                                                       
0.21/0.30	c |  Parse time        :         0.28 s 
0.21/0.30	c |
0.21/0.30	c |               Variables: 102
0.21/0.30	c |            Domain Sizes: 2..21
0.21/0.30	c |
0.21/0.30	c |             Constraints: 684
0.21/0.30	c |                   Arity: 1..51  -- Unary: 1  -- Binary: 681
0.21/0.30	c | 
0.21/0.30	c |                   Types: 
0.21/0.30	c |                          Circuit: 1
0.21/0.30	c |                          Extension: 681  (nb tuples: 0..20) -- (shared: 4872)
0.21/0.30	c |                          Sum: 1
0.21/0.30	c |                          Unary: 1
0.21/0.30	c |                          
0.21/0.30	c |               Objective: Minimize Sum
0.21/0.30	
0.21/0.30	c =========================================================================================================
0.21/0.30	c Parallel mode: Portfolio
0.21/0.30	c [pFactory][Group N°0] created (threads:8).
0.21/0.30	c [pFactory][Group N°0] new task added (threads:8 - tasks:1).
0.21/0.30	c [pFactory][Group N°0] new task added (threads:8 - tasks:2).
0.21/0.30	c [pFactory][Group N°0] new task added (threads:8 - tasks:3).
0.21/0.30	c [pFactory][Group N°0] new task added (threads:8 - tasks:4).
0.21/0.30	c [pFactory][Group N°0] new task added (threads:8 - tasks:5).
0.21/0.30	c [pFactory][Group N°0] new task added (threads:8 - tasks:6).
0.21/0.30	c [pFactory][Group N°0] new task added (threads:8 - tasks:7).
0.21/0.30	c [pFactory][Group N°0] new task added (threads:8 - tasks:8).
0.21/0.30	c [pFactory][Group N°0] concurrent mode: enabled.
0.21/0.30	c [pFactory][Group N°0] computations in progress (threads:8 - tasks:8).
0.21/0.30	c [pFactory][Group N°0] task 7 launched on thread 0.
0.21/0.30	c [pFactory][Group N°0] task 6 launched on thread 2.
0.21/0.30	c [pFactory][Group N°0] task 5 launched on thread 1.
0.21/0.30	c [pFactory][Group N°0] task 4 launched on thread 4.
0.21/0.30	c [pFactory][Group N°0] task 3 launched on thread 6.
0.21/0.30	o 552
0.21/0.30	o 248
0.21/0.30	o 247
0.21/0.30	o 211
0.21/0.30	o 210
0.21/0.30	c [pFactory][Group N°0] task 2 launched on thread 7.
0.21/0.30	c [pFactory][Group N°0] task 1 launched on thread 3.
0.21/0.30	c [pFactory][Group N°0] task 0 launched on thread 5.
0.21/0.30	o 209
0.21/0.30	o 208
0.21/0.31	o 207
0.21/0.31	o 199
0.21/0.31	o 194
0.21/0.31	o 190
0.21/0.32	o 189
0.46/0.33	o 184
0.46/0.33	o 178
0.46/0.33	o 173
0.46/0.33	o 164
0.46/0.33	o 160
0.46/0.35	o 149
0.46/0.36	o 147
0.46/0.41	c [pFactory][Group N°0] concurent mode: thread 7 has won with the task 2.
0.46/0.41	c [pFactory][Group N°0] Thread N°0 is joined.
0.46/0.41	c [pFactory][Group N°0] Thread N°1 is joined.
0.46/0.41	c [pFactory][Group N°0] Thread N°2 is joined.
0.46/0.41	c [pFactory][Group N°0] Thread N°3 is joined.
0.46/0.41	c [pFactory][Group N°0] Thread N°4 is joined.
0.46/0.41	c [pFactory][Group N°0] Thread N°5 is joined.
0.46/0.41	c [pFactory][Group N°0] Thread N°6 is joined.
0.46/0.41	c [pFactory][Group N°0] Thread N°7 is joined.
0.46/0.41	c [pFactory][Group N°0] Return Code of the winner:3 (Thread N°7)
0.46/0.41	s OPTIMUM FOUND
0.46/0.41	c call to solver        : 12
0.46/0.41	c
0.46/0.41	c restarts              : 85          
0.46/0.41	c conflicts             : 267          (219 /sec)
0.46/0.41	c decisions             : 2321         (1907 /sec)
0.46/0.41	c propagations          : 82109       (67473 /sec)
0.46/0.41	c root propagations     : 358         
0.46/0.41	c filter calls          : 345628         (284021 /sec)
0.46/0.41	c useless filter calls  : 320230         (92 %)
0.46/0.41	c Memory used           : 583.75 MB
0.46/0.41	c Best bound time (wc)  : 0.360307 s
0.46/0.41	c CPU time              : 1.21685 s
0.46/0.41	c real time             : 0.413933 s
0.46/0.41	
0.46/0.41	
0.46/0.41	v <instantiation type='solution' cost='147'>
0.46/0.41	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[18] d[19] d[1] d[20] d[2] d[3] d[4] d[5] d[6] d[7] d[8] d[9] l[0] l[10] l[11] l[12] l[13] l[14] l[15] l[16] l[17] l[18] l[19] l[1] l[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[18] s[19] s[1] s[20] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] </list>
0.46/0.41	v <values>1 3 1 2 6 2 2 2 1 9 1 1 1 1 7 4 7 1 2 2 4 8 1 5 4 4 3 1 2 1 0 7 1 1 18 0 0 0 16 10 1 0 4 0 0 0 0 0 0 0 0 13 18 13 11 13 19 10 10 19 12 18 13 13 11 19 17 17 13 19 17 13 10 12 18 19 11 19 10 13 18 0 11 12 13 20 14 15 16 10 17 18 1 19 2 3 4 5 6 7 8 9 </values>
0.46/0.41	v </instantiation>
0.46/0.41

Verifier Data 

OK	147

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

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-4398669-1568608847/watcher-4398669-1568608847 -o /tmp/evaluation-result-4398669-1568608847/solver-4398669-1568608847 -C 2016 -W 252 -M 31000 --bin-var /tmp/runsolver-exch-node139-1568596036-1355 --watchdog 312 cosoco -model -nbcores=8 HOME/instance-4398669-1568608847.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=4538, runsolver pid=4535
Current StackSize limit: 8192 KiB


[startup+0.100154 s]*
/proc/loadavg: 8.02 6.77 5.74 2/190 4539
/proc/meminfo: memFree=31239168/32770624 swapFree=66921592/67108860
[pid=4538] ppid=4535 vsize=32316 memory=8592 CPUtime=0.1 cores=0-7
/proc/4538/stat : 4538 (cosoco) R 4535 4538 1328 0 -1 4202496 2340 0 0 0 10 0 0 0 20 0 1 0 437153236 33091584 2148 33554432000 4194304 6211092 140729738286592 140729738283864 5283496 0 0 4096 8405026 0 0 0 17 2 0 0 0 0 0 8312316 8317760 9363456 140729738294294 140729738294386 140729738294386 140729738297294 0
/proc/4538/statm: 8079 2148 827 493 0 1384 0
Current children cumulated CPU time: 0.1 s
Current children cumulated vsize: 32316 KiB
Current children cumulated memory: 8592 KiB

[startup+0.209336 s]*
/proc/loadavg: 8.02 6.77 5.74 2/190 4539
/proc/meminfo: memFree=31235076/32770624 swapFree=66921592/67108860
[pid=4538] ppid=4535 vsize=36640 memory=12816 CPUtime=0.21 cores=0-7
/proc/4538/stat : 4538 (cosoco) R 4535 4538 1328 0 -1 4202496 3420 0 0 0 21 0 0 0 20 0 1 0 437153236 37519360 3204 33554432000 4194304 6211092 140729738286592 140729738283864 5283503 0 0 4096 8405026 0 0 0 17 2 0 0 0 0 0 8312316 8317760 9363456 140729738294294 140729738294386 140729738294386 140729738297294 0
/proc/4538/statm: 9160 3204 827 493 0 2465 0
Current children cumulated CPU time: 0.21 s
Current children cumulated vsize: 36640 KiB
Current children cumulated memory: 12816 KiB

[startup+0.312103 s]*
/proc/loadavg: 8.02 6.77 5.74 10/198 4547
/proc/meminfo: memFree=31229980/32770624 swapFree=66921592/67108860
[pid=4538] ppid=4535 vsize=630536 memory=17376 CPUtime=0.46 cores=0-7
/proc/4538/stat : 4538 (cosoco) S 4535 4538 1328 0 -1 1077944320 4694 0 0 0 45 1 0 0 20 0 9 0 437153236 645668864 4344 33554432000 4194304 6211092 140729738286592 140729738284848 140334610788087 0 0 4096 8405026 18446744073709551615 0 0 17 2 0 0 0 0 0 8312316 8317760 9363456 140729738294294 140729738294386 140729738294386 140729738297294 0
/proc/4538/statm: 157634 4344 875 493 0 150939 0
[pid=4538/tid=4540] ppid=4535 vsize=630536 memory=-7035114785800479027 CPUtime=0.02 cores=0-7
/proc/4538/task/4540/stat : 4540 (cosoco) R 4535 4538 1328 0 -1 4202560 33 0 0 0 2 0 0 0 20 0 9 0 437153266 645668864 4344 33554432000 4194304 6211092 140729738286592 140334587645200 5017182 0 0 4096 8405026 0 0 0 -1 3 0 0 0 0 0 8312316 8317760 9363456 140729738294294 140729738294386 140729738294386 140729738297294 0
[pid=4538/tid=4541] ppid=4535 vsize=630536 memory=4872558044660077418 CPUtime=0.02 cores=0-7
/proc/4538/task/4541/stat : 4541 (cosoco) R 4535 4538 1328 0 -1 4202560 27 0 0 0 2 0 0 0 20 0 9 0 437153266 645668864 4344 33554432000 4194304 6211092 140729738286592 140334579252240 5017569 0 0 4096 8405026 0 0 0 -1 4 0 0 0 0 0 8312316 8317760 9363456 140729738294294 140729738294386 140729738294386 140729738297294 0
[pid=4538/tid=4542] ppid=4535 vsize=630536 memory=0 CPUtime=0.02 cores=0-7
/proc/4538/task/4542/stat : 4542 (cosoco) R 4535 4538 1328 0 -1 4202560 19 0 0 0 2 0 0 0 20 0 9 0 437153266 645668864 4344 33554432000 4194304 6211092 140729738286592 140334570860128 5017440 0 0 4096 8405026 0 0 0 -1 5 0 0 0 0 0 8312316 8317760 9363456 140729738294294 140729738294386 140729738294386 140729738297294 0
[pid=4538/tid=4543] ppid=4535 vsize=630536 memory=0 CPUtime=0.01 cores=0-7
/proc/4538/task/4543/stat : 4543 (cosoco) R 4535 4538 1328 0 -1 4202560 19 0 0 0 1 0 0 0 20 0 9 0 437153266 645668864 4344 33554432000 4194304 6211092 140729738286592 140334562467424 5017564 0 0 4096 8405026 0 0 0 -1 6 0 0 0 0 0 8312316 8317760 9363456 140729738294294 140729738294386 140729738294386 140729738297294 0
[pid=4538/tid=4544] ppid=4535 vsize=630536 memory=6656426216303648864 CPUtime=0.01 cores=0-7
/proc/4538/task/4544/stat : 4544 (cosoco) R 4535 4538 1328 0 -1 4202560 24 0 0 0 1 0 0 0 20 0 9 0 437153266 645668864 4344 33554432000 4194304 6211092 140729738286592 140334554074384 5250234 0 0 4096 8405026 0 0 0 -1 7 0 0 0 0 0 8312316 8317760 9363456 140729738294294 140729738294386 140729738294386 140729738297294 0
[pid=4538/tid=4545] ppid=4535 vsize=630536 memory=0 CPUtime=0.01 cores=0-7
/proc/4538/task/4545/stat : 4545 (cosoco) R 4535 4538 1328 0 -1 4202560 19 0 0 0 1 0 0 0 20 0 9 0 437153266 645668864 4344 33554432000 4194304 6211092 140729738286592 140334545681424 5250272 0 0 4096 8405026 0 0 0 -1 2 0 0 0 0 0 8312316 8317760 9363456 140729738294294 140729738294386 140729738294386 140729738297294 0
[pid=4538/tid=4546] ppid=4535 vsize=630536 memory=0 CPUtime=0.02 cores=0-7
/proc/4538/task/4546/stat : 4546 (cosoco) R 4535 4538 1328 0 -1 4202560 24 0 0 0 2 0 0 0 20 0 9 0 437153266 645668864 4344 33554432000 4194304 6211092 140729738286592 140334537289312 5155800 0 0 4096 8405026 0 0 0 -1 1 0 0 0 0 0 8312316 8317760 9363456 140729738294294 140729738294386 140729738294386 140729738297294 0
[pid=4538/tid=4547] ppid=4535 vsize=630536 memory=0 CPUtime=0.01 cores=0-7
/proc/4538/task/4547/stat : 4547 (cosoco) R 4535 4538 1328 0 -1 4202560 22 0 0 0 1 0 0 0 20 0 9 0 437153266 645668864 4344 33554432000 4194304 6211092 140729738286592 140334528896272 5157976 0 0 4096 8405026 0 0 0 -1 0 0 0 0 0 0 8312316 8317760 9363456 140729738294294 140729738294386 140729738294386 140729738297294 0
Current children cumulated CPU time: 0.46 s
Current children cumulated vsize: 630536 KiB
Current children cumulated memory: 17376 KiB

[startup+0.419491 s]
# the end of solver process 4538 was just reported to runsolver
# cumulated CPU time of all completed processes:  user=1.21761 s, system=0.012998 s

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

[startup+0.410101 s]*
/proc/loadavg: 8.02 6.77 5.74 9/198 4547
/proc/meminfo: memFree=31230312/32770624 swapFree=66921592/67108860
Current children cumulated CPU time: 0 s
Current children cumulated vsize: 0 KiB
Current children cumulated memory: 0 KiB

Child status: 0
Real time (s): 0.419537
CPU time (s): 1.23061
CPU user time (s): 1.21761
CPU system time (s): 0.012998
CPU usage (%): 293.324
Max. virtual memory (cumulated for all children) (KiB): 630536
Max. memory (cumulated for all children) (KiB): 17376

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 1.21761
system time used= 0.012998
maximum resident set size= 18176
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 4716
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= 23
involuntary context switches= 21


# summary of solver processes directly reported to runsolver:
#   pid: 4538
#   total CPU time (s): 1.23061
#   total CPU user time (s): 1.21761
#   total CPU system time (s): 0.012998

??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.02122 second user time and 0.039409 second system time

The end

Launcher Data 

Begin job on node139 at 2019-09-16 06:42:38
IDJOB=4398669
IDBENCH=126822
IDSOLVER=2852
FILE ID=node139/4398669-1568608847
RUNJOBID= node139-1568596036-1355
PBS_JOBID= 21703395
Free space on /tmp= 59556 MiB

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

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

MD5SUM BENCH= 0f4bef4b37e838bc5603a3a9d9caf103
RANDOM SEED=449008545

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

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

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

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

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

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

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

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

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

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


/proc/meminfo:
MemTotal:       32770624 kB
MemFree:        31243468 kB
MemAvailable:   31825636 kB
Buffers:           94796 kB
Cached:           777396 kB
SwapCached:        78072 kB
Active:           518732 kB
Inactive:         434764 kB
Active(anon):       6596 kB
Inactive(anon):   116832 kB
Active(file):     512136 kB
Inactive(file):   317932 kB
Unevictable:      107864 kB
Mlocked:          107864 kB
SwapTotal:      67108860 kB
SwapFree:       66921592 kB
Dirty:              2868 kB
Writeback:             0 kB
AnonPages:        123784 kB
Mapped:            46700 kB
Shmem:             33508 kB
Slab:             164692 kB
SReclaimable:     135872 kB
SUnreclaim:        28820 kB
KernelStack:        3696 kB
PageTables:         5516 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83494172 kB
Committed_AS:     496540 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      350232 kB
VmallocChunk:   34341910524 kB
HardwareCorrupted:     0 kB
AnonHugePages:     77824 kB
HugePages_Total:       0
HugePages_Free:        0
HugePages_Rsvd:        0
HugePages_Surp:        0
Hugepagesize:       2048 kB
DirectMap4k:      107904 kB
DirectMap2M:    33437696 kB

Free space on /tmp at the end= 59556 MiB
End job on node139 at 2019-09-16 06:42:38