Trace number 4389733

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 2OPT102 0.63624 0.64065

General information on the benchmark

NameTpp/Tpp-zinc-s1/
Tpp-6-5-20-1.xml
MD5SUM3ec6160036052286f30104bba84c59a2
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark102
Best CPU time to get the best result obtained on this benchmark0.55339
Satisfiable
(Un)Satisfiability was proved
Number of variables100
Number of constraints652
Number of domains52
Minimum domain size2
Maximum domain size30
Distribution of domain sizes[{"size":2,"count":1},{"size":3,"count":6},{"size":4,"count":14},{"size":5,"count":9},{"size":13,"count":3},{"size":14,"count":3},{"size":15,"count":4},{"size":16,"count":2},{"size":17,"count":5},{"size":18,"count":2},{"size":19,"count":1},{"size":29,"count":20},{"size":30,"count":30}]
Minimum variable degree2
Maximum variable degree31
Distribution of variable degrees[{"degree":2,"count":50},{"degree":22,"count":29},{"degree":23,"count":1},{"degree":31,"count":20}]
Minimum constraint arity1
Maximum constraint arity30
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":650},{"arity":30,"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.01	c
0.00/0.01	c This is cosoco 2.00 --  
0.00/0.01	c
0.00/0.01	c command line: cosoco -lc -model -restarts -stick HOME/instance-4389733-1568332370.xml 
0.00/0.01	c intension  imp(eq(s[0],0),ne(l[0],0)) -> extension (support ? 0) - 1tuples
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension -> extension : same as previous
0.00/0.02	c intension  imp(eq(s[1],1),ne(l[0],1)) -> extension (support ? 0) - 1tuples
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension  imp(eq(s[2],2),ne(l[0],2)) -> extension (support ? 0) - 1tuples
0.00/0.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[3],3),ne(l[0],3)) -> 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[4],4),ne(l[0],4)) -> 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[5],5),ne(l[0],5)) -> 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[6],6),ne(l[0],6)) -> 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[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.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[28],28),ne(l[0],28)) -> 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[29],29),ne(l[0],29)) -> extension (support ? 0) - 0tuples
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 enable optimization
0.21/0.31	c ========================================[ Problem Statistics ]===========================================
0.21/0.31	c |                                                                                                       
0.21/0.31	c |  Parse time        :         0.29 s 
0.21/0.31	c |
0.21/0.31	c |               Variables: 100
0.21/0.31	c |            Domain Sizes: 2..30
0.21/0.31	c |
0.21/0.31	c |             Constraints: 653
0.21/0.31	c |                   Arity: 1..50  -- Unary: 1  -- Binary: 650
0.21/0.31	c | 
0.21/0.31	c |                   Types: 
0.21/0.31	c |                          Circuit: 1
0.21/0.31	c |                          Extension: 650  (nb tuples: 0..29) -- (shared: 570)
0.21/0.31	c |                          Sum: 1
0.21/0.31	c |                          Unary: 1
0.21/0.31	c |                          
0.21/0.31	c |               Objective: Minimize Sum
0.21/0.31	
0.21/0.31	c =========================================================================================================
0.21/0.31	o 169
0.21/0.31	c    1 calls to solver(id=0): best=169 lower=27 upper=168 
0.21/0.31	o 166
0.30/0.32	o 165
0.30/0.32	c    3 calls to solver(id=0): best=165 lower=27 upper=164 
0.30/0.33	o 164
0.30/0.33	o 159
0.30/0.33	c    5 calls to solver(id=0): best=159 lower=27 upper=158 
0.30/0.34	o 156
0.30/0.34	o 153
0.30/0.34	c    7 calls to solver(id=0): best=153 lower=27 upper=152 
0.30/0.34	o 151
0.30/0.35	o 149
0.30/0.35	c    9 calls to solver(id=0): best=149 lower=27 upper=148 
0.30/0.35	o 148
0.40/0.46	o 147
0.40/0.46	c   11 calls to solver(id=0): best=147 lower=27 upper=146 
0.40/0.47	o 146
0.40/0.47	o 144
0.40/0.47	c   13 calls to solver(id=0): best=144 lower=27 upper=143 
0.40/0.48	o 143
0.40/0.49	o 140
0.40/0.49	c   15 calls to solver(id=0): best=140 lower=27 upper=139 
0.40/0.50	o 139
0.50/0.52	o 138
0.50/0.52	c   17 calls to solver(id=0): best=138 lower=27 upper=137 
0.50/0.53	o 137
0.50/0.55	o 103
0.50/0.55	c   19 calls to solver(id=0): best=103 lower=27 upper=102 
0.50/0.55	o 102
0.59/0.63	s OPTIMUM FOUND
0.59/0.63	c call to solver        : 21
0.59/0.63	c
0.59/0.63	c restarts              : 23          
0.59/0.63	c conflicts             : 610          (973 /sec)
0.59/0.63	c decisions             : 4282         (6827 /sec)
0.59/0.63	c propagations          : 307606      (490449 /sec)
0.59/0.63	c root propagations     : 774         
0.59/0.63	c filter calls          : 965846         (1539953 /sec)
0.59/0.63	c useless filter calls  : 869898         (90 %)
0.59/0.63	c Memory used           : 33.59 MB
0.59/0.63	c Best bound time (wc)  : 0.551999 s
0.59/0.63	c CPU time              : 0.62712 s
0.59/0.63	c real time             : 0.636159 s
0.59/0.63	
0.59/0.63	
0.59/0.63	v <instantiation type='solution' cost='102'>
0.59/0.63	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[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[3] s[4] s[5] s[6] s[7] s[8] s[9] </list>
0.59/0.63	v <values>4 5 5 1 4 4 2 1 1 5 4 2 2 3 4 4 4 2 1 4 0 4 1 0 0 0 0 16 5 0 0 0 0 0 8 3 0 0 0 0 1 2 0 0 0 0 0 0 0 0 11 10 23 28 16 11 28 17 17 17 22 10 28 23 22 17 11 16 16 22 0 11 17 12 13 14 15 10 23 18 19 1 20 21 16 29 24 25 26 27 22 28 2 3 4 5 6 7 8 9 </values>
0.59/0.63	v </instantiation>
0.59/0.63

Verifier Data 

OK	102

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 (13584 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-4389733-1568332370/watcher-4389733-1568332370 -o /tmp/evaluation-result-4389733-1568332370/solver-4389733-1568332370 -C 2520 -W 2520 -M 15500 --bin-var /tmp/runsolver-exch-node120-1323826654-9509 --watchdog 2580 cosoco -lc -model -restarts -stick HOME/instance-4389733-1568332370.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=13852, runsolver pid=13849


[startup+0.100617 s]*
/proc/loadavg: 2.06 2.03 2.05 3/201 13853
/proc/meminfo: memFree=27821264/32770688 swapFree=66919992/67108860
[pid=13852] ppid=13849 vsize=29696 memory=6056 CPUtime=0.1 cores=0-3
/proc/13852/stat : 13852 (cosoco) R 13849 13852 9478 0 -1 4202496 1693 0 0 0 10 0 0 0 20 0 1 0 409243326 30408704 1514 33554432000 4194304 6210612 140727242229712 140727242225112 5283215 0 0 4096 8405026 0 0 0 17 0 0 0 0 0 0 8308220 8313664 10223616 140727242236939 140727242237041 140727242237041 140727242239950 0
/proc/13852/statm: 7424 1514 825 493 0 729 0
Current children cumulated CPU time: 0.1 s
Current children cumulated vsize: 29696 KiB
Current children cumulated memory: 6056 KiB

[startup+0.211084 s]*
/proc/loadavg: 2.06 2.03 2.05 3/201 13853
/proc/meminfo: memFree=27819472/32770688 swapFree=66919992/67108860
[pid=13852] ppid=13849 vsize=32284 memory=8648 CPUtime=0.21 cores=0-3
/proc/13852/stat : 13852 (cosoco) R 13849 13852 9478 0 -1 4202496 2331 0 0 0 21 0 0 0 20 0 1 0 409243326 33058816 2162 33554432000 4194304 6210612 140727242229712 140727242225112 5231635 0 0 4096 8405026 0 0 0 17 0 0 0 0 0 0 8308220 8313664 10223616 140727242236939 140727242237041 140727242237041 140727242239950 0
/proc/13852/statm: 8071 2162 825 493 0 1376 0
Current children cumulated CPU time: 0.21 s
Current children cumulated vsize: 32284 KiB
Current children cumulated memory: 8648 KiB

[startup+0.310635 s]*
/proc/loadavg: 2.06 2.03 2.05 3/201 13853
/proc/meminfo: memFree=27816900/32770688 swapFree=66919992/67108860
[pid=13852] ppid=13849 vsize=34388 memory=10880 CPUtime=0.3 cores=0-3
/proc/13852/stat : 13852 (cosoco) R 13849 13852 9478 0 -1 4202496 2921 0 0 0 30 0 0 0 20 0 1 0 409243326 35213312 2720 33554432000 4194304 6210612 140727242229712 140727242225112 5249727 0 0 4096 8405026 0 0 0 17 0 0 0 0 0 0 8308220 8313664 10223616 140727242236939 140727242237041 140727242237041 140727242239950 0
/proc/13852/statm: 8597 2720 837 493 0 1902 0
Current children cumulated CPU time: 0.3 s
Current children cumulated vsize: 34388 KiB
Current children cumulated memory: 10880 KiB

[startup+0.640615 s]
# the end of solver process 13852 was just reported to runsolver
# cumulated CPU time of all completed processes:  user=0.628234 s, system=0.008006 s

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

[startup+0.410651 s]*
/proc/loadavg: 2.06 2.03 2.05 3/201 13853
/proc/meminfo: memFree=27816900/32770688 swapFree=66919992/67108860
[pid=13852] ppid=13849 vsize=34388 memory=10880 CPUtime=0.4 cores=0-3
/proc/13852/stat : 13852 (cosoco) R 13849 13852 9478 0 -1 4202496 2921 0 0 0 40 0 0 0 20 0 1 0 409243326 35213312 2720 33554432000 4194304 6210612 140727242229712 140727242225112 5017108 0 0 4096 8405026 0 0 0 17 0 0 0 0 0 0 8308220 8313664 10223616 140727242236939 140727242237041 140727242237041 140727242239950 0
/proc/13852/statm: 8597 2720 837 493 0 1902 0
Current children cumulated CPU time: 0.4 s
Current children cumulated vsize: 34388 KiB
Current children cumulated memory: 10880 KiB

[startup+0.610378 s]
/proc/loadavg: 2.06 2.03 2.05 3/201 13853
/proc/meminfo: memFree=27816384/32770688 swapFree=66919992/67108860
[pid=13852] ppid=13849 vsize=34388 memory=10880 CPUtime=0.59 cores=0-3
/proc/13852/stat : 13852 (cosoco) R 13849 13852 9478 0 -1 4202496 2921 0 0 0 59 0 0 0 20 0 1 0 409243326 35213312 2720 33554432000 4194304 6210612 140727242229712 140727242227848 5192938 0 0 4096 8405026 0 0 0 17 0 0 0 0 0 0 8308220 8313664 10223616 140727242236939 140727242237041 140727242237041 140727242239950 0
/proc/13852/statm: 8597 2720 837 493 0 1902 0
Current children cumulated CPU time: 0.59 s
Current children cumulated vsize: 34388 KiB
Current children cumulated memory: 10880 KiB

Child status: 0
Real time (s): 0.64065
CPU time (s): 0.63624
CPU user time (s): 0.628234
CPU system time (s): 0.008006
CPU usage (%): 99.3116
Max. virtual memory (cumulated for all children) (KiB): 34388
Max. memory (cumulated for all children) (KiB): 10880

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.628234
system time used= 0.008006
maximum resident set size= 11108
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 2939
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= 3


# summary of solver processes directly reported to runsolver:
#   pid: 13852
#   total CPU time (s): 0.63624
#   total CPU user time (s): 0.628234
#   total CPU system time (s): 0.008006

??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.020535 second user time and 0.063568 second system time

The end

Launcher Data 

Begin job on node120 at 2011-12-14 08:13:13
IDJOB=4389733
IDBENCH=126836
IDSOLVER=2829
FILE ID=node120/4389733-1568332370
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-6-5-20-1.xml
COMMAND LINE= cosoco -lc -model -restarts -stick BENCHNAME
RUNSOLVER COMMAND LINE= BIN/runsolver --timestamp -w /tmp/evaluation-result-4389733-1568332370/watcher-4389733-1568332370 -o /tmp/evaluation-result-4389733-1568332370/solver-4389733-1568332370 -C 2520 -W 2520 -M 15500 --bin-var /tmp/runsolver-exch-node120-1323826654-9509 --watchdog 2580  cosoco -lc -model -restarts -stick HOME/instance-4389733-1568332370.xml

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

MD5SUM BENCH= 3ec6160036052286f30104bba84c59a2
RANDOM SEED=515656824

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:        27824328 kB
MemAvailable:   31795300 kB
Buffers:          149368 kB
Cached:          4115816 kB
SwapCached:        77548 kB
Active:          1238684 kB
Inactive:        3131388 kB
Active(anon):      25844 kB
Inactive(anon):   128800 kB
Active(file):    1212840 kB
Inactive(file):  3002588 kB
Unevictable:      108228 kB
Mlocked:          108228 kB
SwapTotal:      67108860 kB
SwapFree:       66919992 kB
Dirty:              2736 kB
Writeback:             0 kB
AnonPages:        152916 kB
Mapped:            49016 kB
Shmem:             41008 kB
Slab:             171808 kB
SReclaimable:     142756 kB
SUnreclaim:        29052 kB
KernelStack:        3792 kB
PageTables:         6100 kB
NFS_Unstable:          0 kB
Bounce:                0 kB
WritebackTmp:          0 kB
CommitLimit:    83494204 kB
Committed_AS:     567860 kB
VmallocTotal:   34359738367 kB
VmallocUsed:      350212 kB
VmallocChunk:   34341910524 kB
HardwareCorrupted:     0 kB
AnonHugePages:    104448 kB
HugePages_Total:       0
HugePages_Free:        0
HugePages_Rsvd:        0
HugePages_Surp:        0
Hugepagesize:       2048 kB
DirectMap4k:      146880 kB
DirectMap2M:    33398784 kB

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