Trace number 4398365

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 parallelOPT131 0.581461 0.21922

General information on the benchmark

NameTpp/Tpp-zinc-s1/
Tpp-6-3-20-1.xml
MD5SUMb4cf0cb08a05c1b083ee2f2000733b36
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark131
Best CPU time to get the best result obtained on this benchmark0.191809
Satisfiable
(Un)Satisfiability was proved
Number of variables76
Number of constraints400
Number of domains40
Minimum domain size3
Maximum domain size18
Distribution of domain sizes[{"size":3,"count":6},{"size":4,"count":9},{"size":5,"count":3},{"size":8,"count":1},{"size":10,"count":2},{"size":11,"count":4},{"size":12,"count":6},{"size":13,"count":5},{"size":14,"count":1},{"size":15,"count":1},{"size":17,"count":20},{"size":18,"count":18}]
Minimum variable degree2
Maximum variable degree23
Distribution of variable degrees[{"degree":2,"count":38},{"degree":19,"count":20},{"degree":22,"count":17},{"degree":23,"count":1}]
Minimum constraint arity1
Maximum constraint arity18
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":398},{"arity":18,"count":1}]
Number of extensional constraints38
Number of intensional constraints361
Distribution of constraint types[{"type":"extension","count":38},{"type":"intension","count":361},{"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-4398365-1568603629.xml 
0.00/0.01	c intension  imp(eq(s[0],0),ne(l[0],0)) -> extension (support ? 0) - 1tuples
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension  imp(eq(s[1],1),ne(l[0],1)) -> extension (support ? 0) - 1tuples
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension  imp(eq(s[2],2),ne(l[0],2)) -> extension (support ? 0) - 1tuples
0.00/0.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[3],3),ne(l[0],3)) -> extension (support ? 0) - 1tuples
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension -> extension : same as previous
0.00/0.04	c intension  imp(eq(s[4],4),ne(l[0],4)) -> extension (support ? 0) - 1tuples
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension  imp(eq(s[5],5),ne(l[0],5)) -> extension (support ? 0) - 1tuples
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension  imp(eq(s[6],6),ne(l[0],6)) -> extension (support ? 0) - 1tuples
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension  imp(eq(s[7],7),ne(l[0],7)) -> extension (support ? 0) - 1tuples
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension -> extension : same as previous
0.00/0.08	c intension  imp(eq(s[8],8),ne(l[0],8)) -> extension (support ? 0) - 1tuples
0.00/0.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[9],9),ne(l[0],9)) -> extension (support ? 0) - 1tuples
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension  imp(eq(s[10],10),ne(l[0],10)) -> extension (support ? 0) - 1tuples
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension -> extension : same as previous
0.00/0.10	c intension  imp(eq(s[11],11),ne(l[0],11)) -> extension (support ? 0) - 1tuples
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension -> extension : same as previous
0.10/0.11	c intension  imp(eq(s[12],12),ne(l[0],12)) -> extension (support ? 0) - 1tuples
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension  imp(eq(s[13],13),ne(l[0],13)) -> extension (support ? 0) - 1tuples
0.10/0.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[14],14),ne(l[0],14)) -> extension (support ? 0) - 1tuples
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension  imp(eq(s[15],15),ne(l[0],15)) -> extension (support ? 0) - 1tuples
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension -> extension : same as previous
0.10/0.14	c intension  imp(eq(s[16],16),ne(l[0],16)) -> extension (support ? 0) - 1tuples
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension -> extension : same as previous
0.10/0.15	c intension  imp(eq(s[17],17),ne(l[0],17)) -> extension (support ? 0) - 0tuples
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 enable optimization
0.10/0.17	c ========================================[ Problem Statistics ]===========================================
0.10/0.17	c |                                                                                                       
0.10/0.17	c |  Parse time        :         0.16 s 
0.10/0.17	c |
0.10/0.17	c |               Variables: 76
0.10/0.17	c |            Domain Sizes: 3..18
0.10/0.17	c |
0.10/0.17	c |             Constraints: 401
0.10/0.17	c |                   Arity: 1..38  -- Unary: 1  -- Binary: 398
0.10/0.17	c | 
0.10/0.17	c |                   Types: 
0.10/0.17	c |                          Circuit: 1
0.10/0.17	c |                          Extension: 398  (nb tuples: 0..17) -- (shared: 2736)
0.10/0.17	c |                          Sum: 1
0.10/0.17	c |                          Unary: 1
0.10/0.17	c |                          
0.10/0.17	c |               Objective: Minimize Sum
0.10/0.17	
0.10/0.17	c =========================================================================================================
0.10/0.17	c Parallel mode: Portfolio
0.10/0.17	c [pFactory][Group N°0] created (threads:8).
0.10/0.17	c [pFactory][Group N°0] new task added (threads:8 - tasks:1).
0.10/0.17	c [pFactory][Group N°0] new task added (threads:8 - tasks:2).
0.10/0.17	c [pFactory][Group N°0] new task added (threads:8 - tasks:3).
0.10/0.17	c [pFactory][Group N°0] new task added (threads:8 - tasks:4).
0.10/0.17	c [pFactory][Group N°0] new task added (threads:8 - tasks:5).
0.10/0.17	c [pFactory][Group N°0] new task added (threads:8 - tasks:6).
0.10/0.17	c [pFactory][Group N°0] new task added (threads:8 - tasks:7).
0.10/0.17	c [pFactory][Group N°0] new task added (threads:8 - tasks:8).
0.10/0.17	c [pFactory][Group N°0] concurrent mode: enabled.
0.10/0.17	c [pFactory][Group N°0] computations in progress (threads:8 - tasks:8).
0.10/0.17	c [pFactory][Group N°0] task 7 launched on thread 5.
0.10/0.17	c [pFactory][Group N°0] task 6 launched on thread 0.
0.10/0.17	c [pFactory][Group N°0] task 5 launched on thread 1.
0.10/0.17	c [pFactory][Group N°0] task 4 launched on thread 2.
0.10/0.17	c [pFactory][Group N°0] task 3 launched on thread 6.
0.10/0.17	c [pFactory][Group N°0] task 2 launched on thread 7.
0.10/0.17	c [pFactory][Group N°0] task 1 launched on thread 4.
0.10/0.17	c [pFactory][Group N°0] task 0 launched on thread 3.
0.10/0.17	o 204
0.10/0.17	o 198
0.10/0.17	o 197
0.10/0.17	o 184
0.10/0.17	o 180
0.10/0.17	o 152
0.10/0.18	o 151
0.10/0.18	o 149
0.10/0.19	o 136
0.10/0.21	o 131
0.10/0.21	c [pFactory][Group N°0] concurent mode: thread 5 has won with the task 7.
0.10/0.21	c [pFactory][Group N°0] Thread N°0 is joined.
0.10/0.21	c [pFactory][Group N°0] Thread N°1 is joined.
0.10/0.21	c [pFactory][Group N°0] Thread N°2 is joined.
0.10/0.21	c [pFactory][Group N°0] Thread N°3 is joined.
0.10/0.21	c [pFactory][Group N°0] Thread N°4 is joined.
0.10/0.21	c [pFactory][Group N°0] Thread N°5 is joined.
0.10/0.21	c [pFactory][Group N°0] Thread N°6 is joined.
0.10/0.21	c [pFactory][Group N°0] Thread N°7 is joined.
0.10/0.21	c [pFactory][Group N°0] Return Code of the winner:3 (Thread N°5)
0.10/0.21	s OPTIMUM FOUND
0.10/0.21	c call to solver        : 23
0.10/0.21	c
0.10/0.21	c restarts              : 85          
0.10/0.21	c conflicts             : 157          (274 /sec)
0.10/0.21	c decisions             : 2636         (4597 /sec)
0.10/0.21	c propagations          : 27215       (47464 /sec)
0.10/0.21	c root propagations     : 254         
0.10/0.21	c filter calls          : 187299         (326654 /sec)
0.10/0.21	c useless filter calls  : 175287         (93 %)
0.10/0.21	c Memory used           : 577.96 MB
0.10/0.21	c Best bound time (wc)  : 0.198361 s
0.10/0.21	c CPU time              : 0.573329 s
0.10/0.21	c real time             : 0.214522 s
0.10/0.21	
0.10/0.21	
0.10/0.21	v <instantiation type='solution' cost='131'>
0.10/0.21	v <list>c[0] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] d[0] d[10] d[11] d[12] d[13] d[14] d[15] d[16] d[17] d[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[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.10/0.21	v <values>7 3 3 6 3 6 8 2 1 1 8 5 2 3 5 2 2 14 7 2 0 4 1 0 0 0 1 13 16 0 0 0 0 0 0 0 0 6 9 15 15 11 9 15 9 11 15 10 16 10 10 10 9 16 9 11 10 11 0 11 17 12 13 14 9 15 16 1 2 3 4 5 6 7 8 10 </values>
0.10/0.21	v </instantiation>
0.10/0.21

Verifier Data 

OK	131

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

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-4398365-1568603629/watcher-4398365-1568603629 -o /tmp/evaluation-result-4398365-1568603629/solver-4398365-1568603629 -C 20160 -W 2520 -M 31000 --bin-var /tmp/runsolver-exch-node103-1568595988-23581 --watchdog 2580 cosoco -model -nbcores=8 HOME/instance-4398365-1568603629.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=24960, runsolver pid=24957
Current StackSize limit: 8192 KiB


[startup+0.100154 s]*
/proc/loadavg: 1.13 1.05 1.49 2/196 24961
/proc/meminfo: memFree=31733104/32770624 swapFree=66997340/67108860
[pid=24960] ppid=24957 vsize=31984 memory=8220 CPUtime=0.1 cores=0-7
/proc/24960/stat : 24960 (cosoco) R 24957 24960 23554 0 -1 4202496 2274 0 0 0 10 0 0 0 20 0 1 0 436615919 32751616 2055 33554432000 4194304 6211092 140724277905088 140724277901624 140500773850085 0 0 4096 8405026 0 0 0 17 2 0 0 0 0 0 8312316 8317760 32518144 140724277912593 140724277912685 140724277912685 140724277915598 0
/proc/24960/statm: 7996 2055 827 493 0 1301 0
Current children cumulated CPU time: 0.1 s
Current children cumulated vsize: 31984 KiB
Current children cumulated memory: 8220 KiB

[startup+0.209251 s]*
/proc/loadavg: 1.13 1.05 1.49 10/204 24969
/proc/meminfo: memFree=31729516/32770624 swapFree=66997340/67108860
[pid=24960] ppid=24957 vsize=600020 memory=11844 CPUtime=0.57 cores=0-7
/proc/24960/stat : 24960 (cosoco) S 24957 24960 23554 0 -1 1077944320 3148 0 0 0 57 0 0 0 20 0 2 0 436615919 614420480 2961 33554432000 4194304 6211092 140724277905088 140724277903344 140500789890807 0 0 4096 8405026 18446744073709551615 0 0 17 2 0 0 0 0 0 8312316 8317760 32518144 140724277912593 140724277912685 140724277912685 140724277915598 0
/proc/24960/statm: 150005 2961 884 493 0 143310 0
Current children cumulated CPU time: 0.57 s
Current children cumulated vsize: 600020 KiB
Current children cumulated memory: 11844 KiB

[startup+0.219199 s]
# the end of solver process 24960 was just reported to runsolver
# cumulated CPU time of all completed processes:  user=0.573386 s, system=0.008075 s

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

Child status: 0
Real time (s): 0.21922
CPU time (s): 0.581461
CPU user time (s): 0.573386
CPU system time (s): 0.008075
CPU usage (%): 265.241
Max. virtual memory (cumulated for all children) (KiB): 600020
Max. memory (cumulated for all children) (KiB): 11844

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.573386
system time used= 0.008075
maximum resident set size= 11968
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 3164
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= 87
involuntary context switches= 10


# summary of solver processes directly reported to runsolver:
#   pid: 24960
#   total CPU time (s): 0.581461
#   total CPU user time (s): 0.573386
#   total CPU system time (s): 0.008075

??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.01707 second user time and 0.025978 second system time

The end

Launcher Data 

Begin job on node103 at 2019-09-16 05:12:50
IDJOB=4398365
IDBENCH=126833
IDSOLVER=2851
FILE ID=node103/4398365-1568603629
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-20-1.xml
COMMAND LINE= cosoco -model -nbcores=NBCORE BENCHNAME
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-4398365-1568603629/watcher-4398365-1568603629 -o /tmp/evaluation-result-4398365-1568603629/solver-4398365-1568603629 -C 20160 -W 2520 -M 31000 --bin-var /tmp/runsolver-exch-node103-1568595988-23581 --watchdog 2580  cosoco -model -nbcores=8 HOME/instance-4398365-1568603629.xml

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

MD5SUM BENCH= b4cf0cb08a05c1b083ee2f2000733b36
RANDOM SEED=579931723

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:        31738144 kB
MemAvailable:   31883332 kB
Buffers:           28104 kB
Cached:           414116 kB
SwapCached:         8840 kB
Active:           334400 kB
Inactive:         119652 kB
Active(anon):       2316 kB
Inactive(anon):    59304 kB
Active(file):     332084 kB
Inactive(file):    60348 kB
Unevictable:      111164 kB
Mlocked:          111164 kB
SwapTotal:      67108860 kB
SwapFree:       66997340 kB
Dirty:              4228 kB
Writeback:             0 kB
AnonPages:        148000 kB
Mapped:            46948 kB
Shmem:             40848 kB
Slab:             166896 kB
SReclaimable:     137180 kB
SUnreclaim:        29716 kB
KernelStack:        3904 kB
PageTables:         6180 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:    104448 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:50