Trace number 4389759

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 2OPT105 1.18885 1.18862

General information on the benchmark

NameTpp/Tpp-zinc-s1/
Tpp-7-5-20-1.xml
MD5SUMe35b04ec576605d811ffb09e6056798d
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark105
Best CPU time to get the best result obtained on this benchmark1.03722
Satisfiable
(Un)Satisfiability was proved
Number of variables110
Number of constraints757
Number of domains57
Minimum domain size2
Maximum domain size35
Distribution of domain sizes[{"size":2,"count":1},{"size":3,"count":6},{"size":4,"count":18},{"size":5,"count":10},{"size":15,"count":6},{"size":16,"count":4},{"size":17,"count":4},{"size":18,"count":5},{"size":19,"count":1},{"size":34,"count":20},{"size":35,"count":35}]
Minimum variable degree2
Maximum variable degree36
Distribution of variable degrees[{"degree":2,"count":55},{"degree":22,"count":34},{"degree":23,"count":1},{"degree":36,"count":20}]
Minimum constraint arity1
Maximum constraint arity35
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":755},{"arity":35,"count":1}]
Number of extensional constraints55
Number of intensional constraints701
Distribution of constraint types[{"type":"extension","count":55},{"type":"intension","count":701},{"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 -lc -model -restarts -stick HOME/instance-4389759-1568332355.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  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  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  imp(eq(s[3],3),ne(l[0],3)) -> extension (support ? 0) - 1tuples
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension -> extension : same as previous
0.00/0.06	c intension  imp(eq(s[4],4),ne(l[0],4)) -> 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[5],5),ne(l[0],5)) -> 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[6],6),ne(l[0],6)) -> 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[7],7),ne(l[0],7)) -> 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[8],8),ne(l[0],8)) -> 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[9],9),ne(l[0],9)) -> 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[10],10),ne(l[0],10)) -> 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[11],11),ne(l[0],11)) -> 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[12],12),ne(l[0],12)) -> 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[13],13),ne(l[0],13)) -> 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[14],14),ne(l[0],14)) -> extension (support ? 0) - 1tuples
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension  imp(eq(s[15],15),ne(l[0],15)) -> extension (support ? 0) - 1tuples
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension  imp(eq(s[16],16),ne(l[0],16)) -> extension (support ? 0) - 1tuples
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension -> extension : same as previous
0.10/0.18	c intension  imp(eq(s[17],17),ne(l[0],17)) -> extension (support ? 0) - 1tuples
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension -> extension : same as previous
0.10/0.19	c intension  imp(eq(s[18],18),ne(l[0],18)) -> extension (support ? 0) - 1tuples
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension  imp(eq(s[19],19),ne(l[0],19)) -> extension (support ? 0) - 1tuples
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension -> extension : same as previous
0.10/0.21	c intension  imp(eq(s[20],20),ne(l[0],20)) -> extension (support ? 0) - 1tuples
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension  imp(eq(s[21],21),ne(l[0],21)) -> extension (support ? 0) - 1tuples
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension -> extension : same as previous
0.21/0.23	c intension  imp(eq(s[22],22),ne(l[0],22)) -> extension (support ? 0) - 1tuples
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension -> extension : same as previous
0.21/0.24	c intension  imp(eq(s[23],23),ne(l[0],23)) -> extension (support ? 0) - 1tuples
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension  imp(eq(s[24],24),ne(l[0],24)) -> extension (support ? 0) - 1tuples
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension  imp(eq(s[25],25),ne(l[0],25)) -> extension (support ? 0) - 1tuples
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension -> extension : same as previous
0.21/0.27	c intension  imp(eq(s[26],26),ne(l[0],26)) -> extension (support ? 0) - 1tuples
0.21/0.28	c intension -> extension : same as previous
0.21/0.28	c intension -> extension : same as previous
0.21/0.28	c intension -> extension : same as previous
0.21/0.28	c intension -> extension : same as previous
0.21/0.28	c intension -> extension : same as previous
0.21/0.28	c intension -> extension : same as previous
0.21/0.28	c intension -> extension : same as previous
0.21/0.28	c intension -> extension : same as previous
0.21/0.28	c intension -> extension : same as previous
0.21/0.28	c intension -> extension : same as previous
0.21/0.28	c intension -> extension : same as previous
0.21/0.28	c intension -> extension : same as previous
0.21/0.28	c intension -> extension : same as previous
0.21/0.28	c intension -> extension : same as previous
0.21/0.28	c intension -> extension : same as previous
0.21/0.28	c intension -> extension : same as previous
0.21/0.28	c intension -> extension : same as previous
0.21/0.28	c intension -> extension : same as previous
0.21/0.28	c intension -> extension : same as previous
0.21/0.28	c intension  imp(eq(s[27],27),ne(l[0],27)) -> extension (support ? 0) - 1tuples
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension -> extension : same as previous
0.21/0.29	c intension  imp(eq(s[28],28),ne(l[0],28)) -> extension (support ? 0) - 1tuples
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension -> extension : same as previous
0.21/0.30	c intension  imp(eq(s[29],29),ne(l[0],29)) -> extension (support ? 0) - 1tuples
0.21/0.31	c intension -> extension : same as previous
0.21/0.31	c intension -> extension : same as previous
0.21/0.31	c intension -> extension : same as previous
0.21/0.31	c intension -> extension : same as previous
0.21/0.31	c intension -> extension : same as previous
0.21/0.31	c intension -> extension : same as previous
0.21/0.31	c intension -> extension : same as previous
0.21/0.31	c intension -> extension : same as previous
0.21/0.31	c intension -> extension : same as previous
0.21/0.31	c intension -> extension : same as previous
0.21/0.31	c intension -> extension : same as previous
0.21/0.31	c intension -> extension : same as previous
0.21/0.31	c intension -> extension : same as previous
0.21/0.31	c intension -> extension : same as previous
0.21/0.31	c intension -> extension : same as previous
0.21/0.31	c intension -> extension : same as previous
0.21/0.31	c intension -> extension : same as previous
0.21/0.31	c intension -> extension : same as previous
0.21/0.31	c intension -> extension : same as previous
0.21/0.31	c intension  imp(eq(s[30],30),ne(l[0],30)) -> extension (support ? 0) - 1tuples
0.31/0.32	c intension -> extension : same as previous
0.31/0.32	c intension -> extension : same as previous
0.31/0.32	c intension -> extension : same as previous
0.31/0.32	c intension -> extension : same as previous
0.31/0.32	c intension -> extension : same as previous
0.31/0.32	c intension -> extension : same as previous
0.31/0.32	c intension -> extension : same as previous
0.31/0.32	c intension -> extension : same as previous
0.31/0.32	c intension -> extension : same as previous
0.31/0.32	c intension -> extension : same as previous
0.31/0.32	c intension -> extension : same as previous
0.31/0.32	c intension -> extension : same as previous
0.31/0.32	c intension -> extension : same as previous
0.31/0.32	c intension -> extension : same as previous
0.31/0.32	c intension -> extension : same as previous
0.31/0.32	c intension -> extension : same as previous
0.31/0.32	c intension -> extension : same as previous
0.31/0.32	c intension -> extension : same as previous
0.31/0.32	c intension -> extension : same as previous
0.31/0.32	c intension  imp(eq(s[31],31),ne(l[0],31)) -> extension (support ? 0) - 1tuples
0.31/0.33	c intension -> extension : same as previous
0.31/0.33	c intension -> extension : same as previous
0.31/0.33	c intension -> extension : same as previous
0.31/0.33	c intension -> extension : same as previous
0.31/0.33	c intension -> extension : same as previous
0.31/0.33	c intension -> extension : same as previous
0.31/0.33	c intension -> extension : same as previous
0.31/0.33	c intension -> extension : same as previous
0.31/0.33	c intension -> extension : same as previous
0.31/0.33	c intension -> extension : same as previous
0.31/0.33	c intension -> extension : same as previous
0.31/0.33	c intension -> extension : same as previous
0.31/0.33	c intension -> extension : same as previous
0.31/0.33	c intension -> extension : same as previous
0.31/0.33	c intension -> extension : same as previous
0.31/0.33	c intension -> extension : same as previous
0.31/0.33	c intension -> extension : same as previous
0.31/0.33	c intension -> extension : same as previous
0.31/0.33	c intension -> extension : same as previous
0.31/0.33	c intension  imp(eq(s[32],32),ne(l[0],32)) -> extension (support ? 0) - 1tuples
0.31/0.34	c intension -> extension : same as previous
0.31/0.34	c intension -> extension : same as previous
0.31/0.34	c intension -> extension : same as previous
0.31/0.34	c intension -> extension : same as previous
0.31/0.34	c intension -> extension : same as previous
0.31/0.34	c intension -> extension : same as previous
0.31/0.34	c intension -> extension : same as previous
0.31/0.34	c intension -> extension : same as previous
0.31/0.34	c intension -> extension : same as previous
0.31/0.34	c intension -> extension : same as previous
0.31/0.34	c intension -> extension : same as previous
0.31/0.34	c intension -> extension : same as previous
0.31/0.34	c intension -> extension : same as previous
0.31/0.34	c intension -> extension : same as previous
0.31/0.34	c intension -> extension : same as previous
0.31/0.34	c intension -> extension : same as previous
0.31/0.34	c intension -> extension : same as previous
0.31/0.34	c intension -> extension : same as previous
0.31/0.34	c intension -> extension : same as previous
0.31/0.34	c intension  imp(eq(s[33],33),ne(l[0],33)) -> extension (support ? 0) - 1tuples
0.31/0.35	c intension -> extension : same as previous
0.31/0.35	c intension -> extension : same as previous
0.31/0.35	c intension -> extension : same as previous
0.31/0.35	c intension -> extension : same as previous
0.31/0.35	c intension -> extension : same as previous
0.31/0.35	c intension -> extension : same as previous
0.31/0.35	c intension -> extension : same as previous
0.31/0.35	c intension -> extension : same as previous
0.31/0.35	c intension -> extension : same as previous
0.31/0.35	c intension -> extension : same as previous
0.31/0.35	c intension -> extension : same as previous
0.31/0.35	c intension -> extension : same as previous
0.31/0.35	c intension -> extension : same as previous
0.31/0.35	c intension -> extension : same as previous
0.31/0.35	c intension -> extension : same as previous
0.31/0.35	c intension -> extension : same as previous
0.31/0.35	c intension -> extension : same as previous
0.31/0.35	c intension -> extension : same as previous
0.31/0.35	c intension -> extension : same as previous
0.31/0.35	c intension  imp(eq(s[34],34),ne(l[0],34)) -> extension (support ? 0) - 0tuples
0.31/0.38	c intension -> extension : same as previous
0.31/0.38	c intension -> extension : same as previous
0.31/0.38	c intension -> extension : same as previous
0.31/0.38	c intension -> extension : same as previous
0.31/0.38	c intension -> extension : same as previous
0.31/0.38	c intension -> extension : same as previous
0.31/0.38	c intension -> extension : same as previous
0.31/0.38	c intension -> extension : same as previous
0.31/0.38	c intension -> extension : same as previous
0.31/0.38	c intension -> extension : same as previous
0.31/0.38	c intension -> extension : same as previous
0.31/0.38	c intension -> extension : same as previous
0.31/0.38	c intension -> extension : same as previous
0.31/0.38	c intension -> extension : same as previous
0.31/0.38	c intension -> extension : same as previous
0.31/0.38	c intension -> extension : same as previous
0.31/0.38	c intension -> extension : same as previous
0.31/0.38	c intension -> extension : same as previous
0.31/0.38	c intension -> extension : same as previous
0.31/0.38	c enable optimization
0.31/0.38	c ========================================[ Problem Statistics ]===========================================
0.31/0.38	c |                                                                                                       
0.31/0.38	c |  Parse time        :         0.35 s 
0.31/0.38	c |
0.31/0.38	c |               Variables: 110
0.31/0.38	c |            Domain Sizes: 2..35
0.31/0.38	c |
0.31/0.38	c |             Constraints: 758
0.31/0.38	c |                   Arity: 1..55  -- Unary: 1  -- Binary: 755
0.31/0.38	c | 
0.31/0.38	c |                   Types: 
0.31/0.38	c |                          Circuit: 1
0.31/0.38	c |                          Extension: 755  (nb tuples: 0..34) -- (shared: 665)
0.31/0.38	c |                          Sum: 1
0.31/0.38	c |                          Unary: 1
0.31/0.38	c |                          
0.31/0.38	c |               Objective: Minimize Sum
0.31/0.38	
0.31/0.38	c =========================================================================================================
0.31/0.38	o 322
0.31/0.38	c    1 calls to solver(id=0): best=322 lower=23 upper=321 
0.31/0.38	o 288
0.31/0.39	o 266
0.31/0.39	c    3 calls to solver(id=0): best=266 lower=23 upper=265 
0.31/0.40	o 232
0.31/0.41	o 210
0.31/0.41	c    5 calls to solver(id=0): best=210 lower=23 upper=209 
0.31/0.41	o 204
0.41/0.42	o 199
0.41/0.42	c    7 calls to solver(id=0): best=199 lower=23 upper=198 
0.41/0.43	o 192
0.51/0.52	o 181
0.51/0.52	c    9 calls to solver(id=0): best=181 lower=23 upper=180 
0.51/0.54	o 176
0.51/0.56	o 173
0.51/0.56	c   11 calls to solver(id=0): best=173 lower=23 upper=172 
0.51/0.57	o 158
0.69/0.71	o 150
0.69/0.71	c   13 calls to solver(id=0): best=150 lower=23 upper=149 
0.69/0.74	o 148
0.69/0.76	o 147
0.69/0.76	c   15 calls to solver(id=0): best=147 lower=23 upper=146 
0.69/0.78	o 127
0.69/0.78	o 126
0.69/0.78	c   17 calls to solver(id=0): best=126 lower=23 upper=125 
0.69/0.79	o 123
0.79/0.89	o 121
0.79/0.89	c   19 calls to solver(id=0): best=121 lower=23 upper=120 
0.89/0.92	o 120
0.89/0.96	o 119
0.89/0.96	c   21 calls to solver(id=0): best=119 lower=23 upper=118 
0.89/0.97	o 114
1.00/1.02	o 113
1.00/1.02	c   23 calls to solver(id=0): best=113 lower=23 upper=112 
1.00/1.03	o 111
1.00/1.03	o 105
1.00/1.03	c   25 calls to solver(id=0): best=105 lower=23 upper=104 
1.10/1.18	s OPTIMUM FOUND
1.10/1.18	c call to solver        : 26
1.10/1.18	c
1.10/1.18	c restarts              : 82          
1.10/1.18	c conflicts             : 1398         (1186 /sec)
1.10/1.18	c decisions             : 8402         (7127 /sec)
1.10/1.18	c propagations          : 789554      (669760 /sec)
1.10/1.18	c root propagations     : 1076        
1.10/1.18	c filter calls          : 2267643        (1923588 /sec)
1.10/1.18	c useless filter calls  : 2018307        (89 %)
1.10/1.18	c Memory used           : 34.80 MB
1.10/1.18	c Best bound time (wc)  : 1.03287 s
1.10/1.18	c CPU time              : 1.17886 s
1.10/1.18	c real time             : 1.18393 s
1.10/1.18	
1.10/1.18	
1.10/1.18	v <instantiation type='solution' cost='105'>
1.10/1.18	v <list>c[0] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] c[1] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] d[0] d[10] d[11] d[12] d[13] d[14] d[15] d[16] d[17] d[18] d[19] d[1] d[20] d[21] d[22] d[23] d[24] d[25] d[26] d[27] d[28] d[29] d[2] d[30] d[31] d[32] d[33] d[34] d[3] d[4] d[5] d[6] d[7] d[8] d[9] l[0] l[10] l[11] l[12] l[13] l[14] l[15] l[16] l[17] l[18] l[19] l[1] l[2] l[3] l[4] l[5] l[6] l[7] l[8] l[9] s[0] s[10] s[11] s[12] s[13] s[14] s[15] s[16] s[17] s[18] s[19] s[1] s[20] s[21] s[22] s[23] s[24] s[25] s[26] s[27] s[28] s[29] s[2] s[30] s[31] s[32] s[33] s[34] s[3] s[4] s[5] s[6] s[7] s[8] s[9] </list>
1.10/1.18	v <values>4 3 5 2 4 1 1 2 1 1 5 4 4 1 2 2 2 1 4 1 0 0 0 0 0 0 0 0 5 4 9 0 0 0 0 0 2 0 1 2 0 0 0 0 5 8 12 7 0 0 0 0 0 0 0 19 17 24 26 18 27 26 33 24 17 18 24 26 18 27 24 17 33 31 17 0 10 11 12 13 14 15 16 18 19 26 1 20 21 22 23 17 25 27 34 28 29 2 30 24 31 32 33 3 4 5 6 7 8 9 </values>
1.10/1.18	v </instantiation>
1.10/1.18

Verifier Data 

OK	105

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

command line: BIN/runsolver --timestamp -w /tmp/evaluation-result-4389759-1568332355/watcher-4389759-1568332355 -o /tmp/evaluation-result-4389759-1568332355/solver-4389759-1568332355 -C 2520 -W 2520 -M 15500 --bin-var /tmp/runsolver-exch-node120-1323826654-9509 --watchdog 2580 cosoco -lc -model -restarts -stick HOME/instance-4389759-1568332355.xml 

running on 4 cores: 0-3

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


[startup+0.100157 s]*
/proc/loadavg: 2.08 2.03 2.05 3/200 13337
/proc/meminfo: memFree=27823768/32770688 swapFree=66919992/67108860
[pid=13336] ppid=13333 vsize=29724 memory=6096 CPUtime=0.1 cores=0-3
/proc/13336/stat : 13336 (cosoco) R 13333 13336 9478 0 -1 4202496 1708 0 0 0 10 0 0 0 20 0 1 0 409241792 30437376 1524 33554432000 4194304 6210612 140727646703728 140727646699128 5457098 0 0 4096 8405026 0 0 0 17 2 0 0 0 0 0 8308220 8313664 13639680 140727646712843 140727646712945 140727646712945 140727646715854 0
/proc/13336/statm: 7431 1524 825 493 0 736 0
Current children cumulated CPU time: 0.1 s
Current children cumulated vsize: 29724 KiB
Current children cumulated memory: 6096 KiB

[startup+0.2108 s]*
/proc/loadavg: 2.08 2.03 2.05 4/200 13337
/proc/meminfo: memFree=27821164/32770688 swapFree=66919992/67108860
[pid=13336] ppid=13333 vsize=32292 memory=8664 CPUtime=0.21 cores=0-3
/proc/13336/stat : 13336 (cosoco) R 13333 13336 9478 0 -1 4202496 2335 0 0 0 21 0 0 0 20 0 1 0 409241792 33067008 2166 33554432000 4194304 6210612 140727646703728 140727646699128 5283215 0 0 4096 8405026 0 0 0 17 2 0 0 0 0 0 8308220 8313664 13639680 140727646712843 140727646712945 140727646712945 140727646715854 0
/proc/13336/statm: 8073 2166 825 493 0 1378 0
Current children cumulated CPU time: 0.21 s
Current children cumulated vsize: 32292 KiB
Current children cumulated memory: 8664 KiB

[startup+0.310437 s]*
/proc/loadavg: 2.08 2.03 2.05 3/200 13337
/proc/meminfo: memFree=27818932/32770688 swapFree=66919992/67108860
[pid=13336] ppid=13333 vsize=34524 memory=10896 CPUtime=0.31 cores=0-3
/proc/13336/stat : 13336 (cosoco) R 13333 13336 9478 0 -1 4202496 2905 0 0 0 31 0 0 0 20 0 1 0 409241792 35352576 2724 33554432000 4194304 6210612 140727646703728 140727646699128 140580837465061 0 0 4096 8405026 0 0 0 17 2 0 0 0 0 0 8308220 8313664 13639680 140727646712843 140727646712945 140727646712945 140727646715854 0
/proc/13336/statm: 8631 2724 825 493 0 1936 0
Current children cumulated CPU time: 0.31 s
Current children cumulated vsize: 34524 KiB
Current children cumulated memory: 10896 KiB

[startup+0.700291 s]
/proc/loadavg: 2.08 2.03 2.05 3/200 13337
/proc/meminfo: memFree=27817444/32770688 swapFree=66919992/67108860
[pid=13336] ppid=13333 vsize=35632 memory=12132 CPUtime=0.69 cores=0-3
/proc/13336/stat : 13336 (cosoco) R 13333 13336 9478 0 -1 4202496 3239 0 0 0 69 0 0 0 20 0 1 0 409241792 36487168 3033 33554432000 4194304 6210612 140727646703728 140727646701864 5076008 0 0 4096 8405026 0 0 0 17 2 0 0 0 0 0 8308220 8313664 13639680 140727646712843 140727646712945 140727646712945 140727646715854 0
/proc/13336/statm: 8908 3033 837 493 0 2213 0
Current children cumulated CPU time: 0.69 s
Current children cumulated vsize: 35632 KiB
Current children cumulated memory: 12132 KiB

[startup+1.18858 s]
# the end of solver process 13336 was just reported to runsolver
# cumulated CPU time of all completed processes:  user=1.17886 s, system=0.009991 s

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

[startup+0.800308 s]
/proc/loadavg: 2.08 2.03 2.05 3/200 13337
/proc/meminfo: memFree=27817444/32770688 swapFree=66919992/67108860
[pid=13336] ppid=13333 vsize=35632 memory=12132 CPUtime=0.79 cores=0-3
/proc/13336/stat : 13336 (cosoco) R 13333 13336 9478 0 -1 4202496 3239 0 0 0 79 0 0 0 20 0 1 0 409241792 36487168 3033 33554432000 4194304 6210612 140727646703728 140727646691608 5016884 0 0 4096 8405026 0 0 0 17 2 0 0 0 0 0 8308220 8313664 13639680 140727646712843 140727646712945 140727646712945 140727646715854 0
/proc/13336/statm: 8908 3033 837 493 0 2213 0
Current children cumulated CPU time: 0.79 s
Current children cumulated vsize: 35632 KiB
Current children cumulated memory: 12132 KiB

[startup+1.00026 s]*
/proc/loadavg: 2.08 2.03 2.05 3/200 13337
/proc/meminfo: memFree=27816840/32770688 swapFree=66919992/67108860
[pid=13336] ppid=13333 vsize=35632 memory=12132 CPUtime=1 cores=0-3
/proc/13336/stat : 13336 (cosoco) R 13333 13336 9478 0 -1 4202496 3242 0 0 0 100 0 0 0 20 0 1 0 409241792 36487168 3033 33554432000 4194304 6210612 140727646703728 140727646701864 5397066 0 0 4096 8405026 0 0 0 17 2 0 0 0 0 0 8308220 8313664 13639680 140727646712843 140727646712945 140727646712945 140727646715854 0
/proc/13336/statm: 8908 3033 837 493 0 2213 0
Current children cumulated CPU time: 1 s
Current children cumulated vsize: 35632 KiB
Current children cumulated memory: 12132 KiB

[startup+1.11007 s]
/proc/loadavg: 2.08 2.03 2.05 3/200 13337
/proc/meminfo: memFree=27816840/32770688 swapFree=66919992/67108860
[pid=13336] ppid=13333 vsize=35632 memory=12132 CPUtime=1.1 cores=0-3
/proc/13336/stat : 13336 (cosoco) R 13333 13336 9478 0 -1 4202496 3242 0 0 0 110 0 0 0 20 0 1 0 409241792 36487168 3033 33554432000 4194304 6210612 140727646703728 140727646691608 5145125 0 0 4096 8405026 0 0 0 17 2 0 0 0 0 0 8308220 8313664 13639680 140727646712843 140727646712945 140727646712945 140727646715854 0
/proc/13336/statm: 8908 3033 837 493 0 2213 0
Current children cumulated CPU time: 1.1 s
Current children cumulated vsize: 35632 KiB
Current children cumulated memory: 12132 KiB

Child status: 0
Real time (s): 1.18862
CPU time (s): 1.18885
CPU user time (s): 1.17886
CPU system time (s): 0.009991
CPU usage (%): 100.02
Max. virtual memory (cumulated for all children) (KiB): 35632
Max. memory (cumulated for all children) (KiB): 12132

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 1.17886
system time used= 0.009991
maximum resident set size= 12388
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 3260
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= 6
involuntary context switches= 9


# summary of solver processes directly reported to runsolver:
#   pid: 13336
#   total CPU time (s): 1.18885
#   total CPU user time (s): 1.17886
#   total CPU system time (s): 0.009991

??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.027088 second user time and 0.066181 second system time

The end

Launcher Data 

Begin job on node120 at 2011-12-14 08:12:57
IDJOB=4389759
IDBENCH=126827
IDSOLVER=2829
FILE ID=node120/4389759-1568332355
RUNJOBID= node120-1323826654-9509
PBS_JOBID= 21701129
Free space on /tmp= 59152 MiB

SOLVER NAME= cosoco 2
BENCH NAME= XCSP17/Tpp/Tpp-zinc-s1/Tpp-7-5-20-1.xml
COMMAND LINE= cosoco -lc -model -restarts -stick BENCHNAME
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-4389759-1568332355/watcher-4389759-1568332355 -o /tmp/evaluation-result-4389759-1568332355/solver-4389759-1568332355 -C 2520 -W 2520 -M 15500 --bin-var /tmp/runsolver-exch-node120-1323826654-9509 --watchdog 2580  cosoco -lc -model -restarts -stick HOME/instance-4389759-1568332355.xml

TIME LIMIT= 2520 seconds
MEMORY LIMIT= 15500 MiB
NBCORE= 4

MD5SUM BENCH= e35b04ec576605d811ffb09e6056798d
RANDOM SEED=1965258794

node120.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		: 2667.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.49
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		: 2667.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.49
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		: 2667.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.49
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		: 2667.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.49
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		: 2667.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	: 5329.69
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		: 2667.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	: 5329.69
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		: 2667.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	: 5329.69
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		: 2667.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	: 5329.69
clflush size	: 64
cache_alignment	: 64
address sizes	: 40 bits physical, 48 bits virtual
power management:


/proc/meminfo:
MemTotal:       32770688 kB
MemFree:        27825224 kB
MemAvailable:   31796468 kB
Buffers:          149208 kB
Cached:          4115988 kB
SwapCached:        77548 kB
Active:          1238552 kB
Inactive:        3131192 kB
Active(anon):      25244 kB
Inactive(anon):   128800 kB
Active(file):    1213308 kB
Inactive(file):  3002392 kB
Unevictable:      108228 kB
Mlocked:          108228 kB
SwapTotal:      67108860 kB
SwapFree:       66919992 kB
Dirty:              2956 kB
Writeback:             0 kB
AnonPages:        189596 kB
Mapped:            49156 kB
Shmem:             41008 kB
Slab:             171656 kB
SReclaimable:     142756 kB
SUnreclaim:        28900 kB
KernelStack:        3824 kB
PageTables:         5844 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83494204 kB
Committed_AS:     567644 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      350212 kB
VmallocChunk:   34341910524 kB
HardwareCorrupted:     0 kB
AnonHugePages:    141312 kB
HugePages_Total:       0
HugePages_Free:        0
HugePages_Rsvd:        0
HugePages_Surp:        0
Hugepagesize:       2048 kB
DirectMap4k:      146880 kB
DirectMap2M:    33398784 kB

Free space on /tmp at the end= 59148 MiB
End job on node120 at 2011-12-14 08:12:59