Trace number 4409885

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.0 parallelOPT140 1.29167 0.418707

General information on the benchmark

NameTpp/Tpp-zinc-s1/
Tpp-4-5-30-1.xml
MD5SUM1a3f146023047dfa4a3d56734d0c92f1
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark140
Best CPU time to get the best result obtained on this benchmark0.315281
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints652
Number of domains52
Minimum domain size3
Maximum domain size20
Distribution of domain sizes[{"size":3,"count":7},{"size":4,"count":10},{"size":5,"count":3},{"size":8,"count":1},{"size":10,"count":2},{"size":11,"count":4},{"size":12,"count":13},{"size":13,"count":5},{"size":14,"count":3},{"size":15,"count":2},{"size":19,"count":30},{"size":20,"count":20}]
Minimum variable degree2
Maximum variable degree33
Distribution of variable degrees[{"degree":2,"count":50},{"degree":21,"count":30},{"degree":32,"count":19},{"degree":33,"count":1}]
Minimum constraint arity1
Maximum constraint arity20
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":650},{"arity":20,"count":1}]
Number of extensional constraints50
Number of intensional constraints601
Distribution of constraint types[{"type":"extension","count":50},{"type":"intension","count":601},{"type":"circuit","count":1}]
Optimization problemYES
Type of objectivemin SUM

Quality of the solution as a function of time


Download the above graph as a PDF file / as an EPS file

Solver Data 

0.00/0.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-4409885-1569829131.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.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension -> extension : same as previous
0.20/0.22	c intension  imp(eq(s[16],16),ne(l[0],16)) -> extension (support ? 0) - 1tuples
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension -> extension : same as previous
0.20/0.23	c intension  imp(eq(s[17],17),ne(l[0],17)) -> extension (support ? 0) - 1tuples
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension -> extension : same as previous
0.20/0.25	c intension  imp(eq(s[18],18),ne(l[0],18)) -> extension (support ? 0) - 1tuples
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension -> extension : same as previous
0.20/0.26	c intension  imp(eq(s[19],19),ne(l[0],19)) -> extension (support ? 0) - 0tuples
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c intension -> extension : same as previous
0.20/0.29	c enable optimization
0.20/0.29	c ========================================[ Problem Statistics ]===========================================
0.20/0.29	c |                                                                                                       
0.20/0.29	c |  Parse time        :         0.27 s 
0.20/0.29	c |
0.20/0.29	c |               Variables: 100
0.20/0.29	c |            Domain Sizes: 3..20
0.20/0.29	c |
0.20/0.29	c |             Constraints: 653
0.20/0.29	c |                   Arity: 1..50  -- Unary: 1  -- Binary: 650
0.20/0.29	c | 
0.20/0.29	c |                   Types: 
0.20/0.29	c |                          Circuit: 1
0.20/0.29	c |                          Extension: 650  (nb tuples: 0..19) -- (shared: 4640)
0.20/0.29	c |                          Sum: 1
0.20/0.29	c |                          Unary: 1
0.20/0.29	c |                          
0.20/0.29	c |               Objective: Minimize Sum
0.20/0.29	
0.20/0.29	c =========================================================================================================
0.20/0.29	c Parallel mode: Portfolio
0.20/0.29	c [pFactory][Group N°0] created (threads:8).
0.20/0.29	c [pFactory][Group N°0] new task added (threads:8 - tasks:1).
0.20/0.29	c [pFactory][Group N°0] new task added (threads:8 - tasks:2).
0.20/0.29	c [pFactory][Group N°0] new task added (threads:8 - tasks:3).
0.20/0.29	c [pFactory][Group N°0] new task added (threads:8 - tasks:4).
0.20/0.29	c [pFactory][Group N°0] new task added (threads:8 - tasks:5).
0.20/0.29	c [pFactory][Group N°0] new task added (threads:8 - tasks:6).
0.20/0.29	c [pFactory][Group N°0] new task added (threads:8 - tasks:7).
0.20/0.29	c [pFactory][Group N°0] new task added (threads:8 - tasks:8).
0.20/0.29	c [pFactory][Group N°0] concurrent mode: enabled.
0.20/0.29	c [pFactory][Group N°0] computations in progress (threads:8 - tasks:8).
0.20/0.29	c [pFactory][Group N°0] task 7 launched on thread 3.
0.20/0.29	c [pFactory][Group N°0] task 6 launched on thread 0.
0.20/0.29	c [pFactory][Group N°0] task 5 launched on thread 1.
0.20/0.29	c [pFactory][Group N°0] task 4 launched on thread 2.
0.20/0.29	c [pFactory][Group N°0] task 3 launched on thread 6.
0.20/0.29	c [pFactory][Group N°0] task 2 launched on thread 7.
0.20/0.29	c [pFactory][Group N°0] task 1 launched on thread 4.
0.20/0.29	c [pFactory][Group N°0] task 0 launched on thread 5.
0.20/0.29	o 269
0.20/0.29	o 266
0.20/0.29	o 219
0.20/0.29	o 210
0.20/0.29	o 194
0.20/0.30	o 191
0.20/0.30	o 181
0.20/0.32	o 156
0.58/0.35	o 140
0.58/0.40	c [pFactory][Group N°0] concurent mode: thread 7 has won with the task 2.
0.58/0.40	c [pFactory][Group N°0] Thread N°0 is joined.
0.58/0.40	c [pFactory][Group N°0] Thread N°1 is joined.
0.58/0.40	c [pFactory][Group N°0] Thread N°2 is joined.
0.58/0.40	c [pFactory][Group N°0] Thread N°3 is joined.
0.58/0.40	c [pFactory][Group N°0] Thread N°4 is joined.
0.58/0.40	c [pFactory][Group N°0] Thread N°5 is joined.
0.58/0.40	c [pFactory][Group N°0] Thread N°6 is joined.
0.58/0.40	c [pFactory][Group N°0] Thread N°7 is joined.
0.58/0.40	c [pFactory][Group N°0] Return Code of the winner:3 (Thread N°7)
0.58/0.40	s OPTIMUM FOUND
0.58/0.40	c call to solver        : 25
0.58/0.40	c
0.58/0.40	c restarts              : 118         
0.58/0.40	c conflicts             : 280          (218 /sec)
0.58/0.40	c decisions             : 3918         (3057 /sec)
0.58/0.40	c propagations          : 50065       (39062 /sec)
0.58/0.40	c root propagations     : 320         
0.58/0.40	c filter calls          : 426717         (332938 /sec)
0.58/0.40	c useless filter calls  : 403718         (94 %)
0.58/0.40	c Memory used           : 583.10 MB
0.58/0.40	c Best bound time (wc)  : 0.343888 s
0.58/0.40	c CPU time              : 1.2816 s
0.58/0.40	c real time             : 0.403314 s
0.58/0.40	
0.58/0.40	
0.58/0.40	v <instantiation type='solution' cost='140'>
0.58/0.40	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[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[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] </list>
0.58/0.40	v <values>4 2 1 3 1 2 1 5 2 2 5 8 4 1 1 1 7 6 8 1 2 1 1 1 5 5 1 4 5 1 0 4 1 0 1 1 14 0 0 10 12 0 0 0 0 0 0 0 0 6 9 13 18 18 11 11 15 13 10 10 11 11 9 18 13 11 14 15 10 13 14 14 13 13 13 18 9 11 11 10 0 11 15 12 9 13 19 16 17 14 18 1 2 3 4 5 6 7 8 10 </values>
0.58/0.40	v </instantiation>
0.58/0.40

Verifier Data 

OK	140

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

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-4409885-1569829131/watcher-4409885-1569829131 -o /tmp/evaluation-result-4409885-1569829131/solver-4409885-1569829131 -C 2016 -W 252 -M 31000 --bin-var /tmp/runsolver-exch-node125-1569817883-23708 --watchdog 312 cosoco -model -nbcores=8 HOME/instance-4409885-1569829131.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=25313, runsolver pid=25310
Current StackSize limit: 8192 KiB


[startup+0.100149 s]*
/proc/loadavg: 7.54 7.33 7.22 2/193 25314
/proc/meminfo: memFree=31681764/32770624 swapFree=66975632/67108860
[pid=25313] ppid=25310 vsize=32208 memory=8440 CPUtime=0.1 cores=0-7
/proc/25313/stat : 25313 (cosoco) R 25310 25313 23681 0 -1 4202496 2329 0 0 0 10 0 0 0 20 0 1 0 559179869 32980992 2110 33554432000 4194304 6211132 140735226520960 140735226517496 5456018 0 0 4096 8405026 0 0 0 17 2 0 0 0 0 0 8312316 8317760 32464896 140735226528790 140735226528882 140735226528882 140735226531790 0
/proc/25313/statm: 8052 2110 827 493 0 1357 0
Current children cumulated CPU time: 0.1 s
Current children cumulated vsize: 32208 KiB
Current children cumulated memory: 8440 KiB

[startup+0.209259 s]*
/proc/loadavg: 7.54 7.33 7.22 2/193 25314
/proc/meminfo: memFree=31677548/32770624 swapFree=66975632/67108860
[pid=25313] ppid=25310 vsize=36556 memory=12880 CPUtime=0.2 cores=0-7
/proc/25313/stat : 25313 (cosoco) R 25310 25313 23681 0 -1 4202496 3420 0 0 0 20 0 0 0 20 0 1 0 559179869 37433344 3220 33554432000 4194304 6211132 140735226520960 140735226517496 139918336121829 0 0 4096 8405026 0 0 0 17 2 0 0 0 0 0 8312316 8317760 32464896 140735226528790 140735226528882 140735226528882 140735226531790 0
/proc/25313/statm: 9139 3220 827 493 0 2444 0
Current children cumulated CPU time: 0.2 s
Current children cumulated vsize: 36556 KiB
Current children cumulated memory: 12880 KiB

[startup+0.311898 s]*
/proc/loadavg: 7.54 7.33 7.22 10/201 25322
/proc/meminfo: memFree=31673456/32770624 swapFree=66975632/67108860
[pid=25313] ppid=25310 vsize=629872 memory=16500 CPUtime=0.58 cores=0-7
/proc/25313/stat : 25313 (cosoco) S 25310 25313 23681 0 -1 1077944320 4511 0 0 0 58 0 0 0 20 0 9 0 559179869 644988928 4125 33554432000 4194304 6211132 140735226520960 140735226519216 139918352162551 0 0 4096 8405026 18446744073709551615 0 0 17 2 0 0 0 0 0 8312316 8317760 32464896 140735226528790 140735226528882 140735226528882 140735226531790 0
/proc/25313/statm: 157468 4125 838 493 0 150773 0
[pid=25313/tid=25315] ppid=25310 vsize=629872 memory=1398722017469774279 CPUtime=0.04 cores=0-7
/proc/25313/task/25315/stat : 25315 (cosoco) R 25310 25313 23681 0 -1 4202560 20 0 0 0 4 0 0 0 20 0 9 0 559179897 644988928 4125 33554432000 4194304 6211132 140735226520960 139918329019408 5397407 0 0 4096 8405026 0 0 0 -1 3 0 0 0 0 0 8312316 8317760 32464896 140735226528790 140735226528882 140735226528882 140735226531790 0
[pid=25313/tid=25316] ppid=25310 vsize=629872 memory=4872558044660077418 CPUtime=0.04 cores=0-7
/proc/25313/task/25316/stat : 25316 (cosoco) R 25310 25313 23681 0 -1 4202560 19 0 0 0 4 0 0 0 20 0 9 0 559179897 644988928 4125 33554432000 4194304 6211132 140735226520960 139918320626960 5157572 0 0 4096 8405026 0 0 0 -1 4 0 0 0 0 0 8312316 8317760 32464896 140735226528790 140735226528882 140735226528882 140735226531790 0
[pid=25313/tid=25317] ppid=25310 vsize=629872 memory=0 CPUtime=0.04 cores=0-7
/proc/25313/task/25317/stat : 25317 (cosoco) R 25310 25313 23681 0 -1 4202560 18 0 0 0 4 0 0 0 20 0 9 0 559179897 644988928 4125 33554432000 4194304 6211132 140735226520960 139918312234000 5389476 0 0 4096 8405026 0 0 0 -1 5 0 0 0 0 0 8312316 8317760 32464896 140735226528790 140735226528882 140735226528882 140735226531790 0
[pid=25313/tid=25318] ppid=25310 vsize=629872 memory=6944656592455359580 CPUtime=0.04 cores=0-7
/proc/25313/task/25318/stat : 25318 (cosoco) R 25310 25313 23681 0 -1 4202560 26 0 0 0 4 0 0 0 20 0 9 0 559179897 644988928 4125 33554432000 4194304 6211132 140735226520960 139918303841296 5017569 0 0 4096 8405026 0 0 0 -1 0 0 0 0 0 0 8312316 8317760 32464896 140735226528790 140735226528882 140735226528882 140735226531790 0
[pid=25313/tid=25319] ppid=25310 vsize=629872 memory=6656426216303648864 CPUtime=0.04 cores=0-7
/proc/25313/task/25319/stat : 25319 (cosoco) R 25310 25313 23681 0 -1 4202560 20 0 0 0 4 0 0 0 20 0 9 0 559179897 644988928 4125 33554432000 4194304 6211132 140735226520960 139918295448512 5081194 0 0 4096 8405026 0 0 0 -1 1 0 0 0 0 0 8312316 8317760 32464896 140735226528790 140735226528882 140735226528882 140735226531790 0
[pid=25313/tid=25320] ppid=25310 vsize=629872 memory=0 CPUtime=0.03 cores=0-7
/proc/25313/task/25320/stat : 25320 (cosoco) R 25310 25313 23681 0 -1 4202560 19 0 0 0 3 0 0 0 20 0 9 0 559179897 644988928 4125 33554432000 4194304 6211132 140735226520960 139918287055808 5079076 0 0 4096 8405026 0 0 0 -1 6 0 0 0 0 0 8312316 8317760 32464896 140735226528790 140735226528882 140735226528882 140735226531790 0
[pid=25313/tid=25321] ppid=25310 vsize=629872 memory=0 CPUtime=0.04 cores=0-7
/proc/25313/task/25321/stat : 25321 (cosoco) R 25310 25313 23681 0 -1 4202560 18 0 0 0 4 0 0 0 20 0 9 0 559179897 644988928 4125 33554432000 4194304 6211132 140735226520960 139918278663184 5156256 0 0 4096 8405026 0 0 0 -1 2 0 0 0 0 0 8312316 8317760 32464896 140735226528790 140735226528882 140735226528882 140735226531790 0
[pid=25313/tid=25322] ppid=25310 vsize=629872 memory=0 CPUtime=0.03 cores=0-7
/proc/25313/task/25322/stat : 25322 (cosoco) R 25310 25313 23681 0 -1 4202560 21 0 0 0 3 0 0 0 20 0 9 0 559179897 644988928 4125 33554432000 4194304 6211132 140735226520960 139918270270736 5008971 0 0 4096 8405026 0 0 0 -1 7 0 0 0 0 0 8312316 8317760 32464896 140735226528790 140735226528882 140735226528882 140735226531790 0
Current children cumulated CPU time: 0.58 s
Current children cumulated vsize: 629872 KiB
Current children cumulated memory: 16500 KiB

[startup+0.418684 s]
# the end of solver process 25313 was just reported to runsolver
# cumulated CPU time of all completed processes:  user=1.28167 s, system=0.010001 s

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

[startup+0.409687 s]*
/proc/loadavg: 7.54 7.33 7.22 2/193 25322
/proc/meminfo: memFree=31680480/32770624 swapFree=66975632/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.418707
CPU time (s): 1.29167
CPU user time (s): 1.28167
CPU system time (s): 0.010001
CPU usage (%): 308.491
Max. virtual memory (cumulated for all children) (KiB): 629872
Max. memory (cumulated for all children) (KiB): 16500

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 1.28167
system time used= 0.010001
maximum resident set size= 17472
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 4540
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= 95
involuntary context switches= 15


# summary of solver processes directly reported to runsolver:
#   pid: 25313
#   total CPU time (s): 1.29167
#   total CPU user time (s): 1.28167
#   total CPU system time (s): 0.010001

??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.01686 second user time and 0.04385 second system time

The end

Launcher Data 

Begin job on node125 at 2019-09-30 09:38:08
IDJOB=4409885
IDBENCH=126828
IDSOLVER=2878
FILE ID=node125/4409885-1569829131
RUNJOBID= node125-1569817883-23708
PBS_JOBID= 21705920
Free space on /tmp= 62032 MiB

SOLVER NAME= cosoco 2.0 parallel
BENCH NAME= XCSP17/Tpp/Tpp-zinc-s1/Tpp-4-5-30-1.xml
COMMAND LINE= cosoco -model -nbcores=NBCORE BENCHNAME
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-4409885-1569829131/watcher-4409885-1569829131 -o /tmp/evaluation-result-4409885-1569829131/solver-4409885-1569829131 -C 2016 -W 252 -M 31000 --bin-var /tmp/runsolver-exch-node125-1569817883-23708 --watchdog 312  cosoco -model -nbcores=8 HOME/instance-4409885-1569829131.xml

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

MD5SUM BENCH= 1a3f146023047dfa4a3d56734d0c92f1
RANDOM SEED=481637864

node125.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.29
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.29
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.29
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.29
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:        31685984 kB
MemAvailable:   31845504 kB
Buffers:          108016 kB
Cached:           391016 kB
SwapCached:        29876 kB
Active:           365416 kB
Inactive:         169244 kB
Active(anon):       5060 kB
Inactive(anon):   111328 kB
Active(file):     360356 kB
Inactive(file):    57916 kB
Unevictable:      106456 kB
Mlocked:          106456 kB
SwapTotal:      67108860 kB
SwapFree:       66975632 kB
Dirty:              2780 kB
Writeback:             0 kB
AnonPages:        112980 kB
Mapped:            26496 kB
Shmem:             72012 kB
Slab:             143152 kB
SReclaimable:     114168 kB
SUnreclaim:        28984 kB
KernelStack:        3376 kB
PageTables:         4976 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83494172 kB
Committed_AS:     539216 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      350232 kB
VmallocChunk:   34341910524 kB
HardwareCorrupted:     0 kB
AnonHugePages:     67584 kB
HugePages_Total:       0
HugePages_Free:        0
HugePages_Rsvd:        0
HugePages_Surp:        0
Hugepagesize:       2048 kB
DirectMap4k:      114048 kB
DirectMap2M:    33431552 kB

Free space on /tmp at the end= 62028 MiB
End job on node125 at 2019-09-30 09:38:09