Trace number 4389776

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 2OPT165 0.790078 0.790694

General information on the benchmark

NameTpp/Tpp-zinc-s1/
Tpp-5-5-30-1.xml
MD5SUMaf05408dbf994167098c19a92e91e627
Bench CategoryCOP (optimization problem)
Best result obtained on this benchmarkOPT
Best value of the objective obtained on this benchmark165
Best CPU time to get the best result obtained on this benchmark0.695643
Satisfiable
(Un)Satisfiability was proved
Number of variables110
Number of constraints807
Number of domains57
Minimum domain size3
Maximum domain size25
Distribution of domain sizes[{"size":3,"count":6},{"size":4,"count":14},{"size":5,"count":5},{"size":11,"count":1},{"size":12,"count":2},{"size":13,"count":8},{"size":14,"count":6},{"size":15,"count":9},{"size":16,"count":4},{"size":24,"count":30},{"size":25,"count":25}]
Minimum variable degree2
Maximum variable degree33
Distribution of variable degrees[{"degree":2,"count":55},{"degree":26,"count":30},{"degree":32,"count":24},{"degree":33,"count":1}]
Minimum constraint arity1
Maximum constraint arity25
Distribution of constraint arities[{"arity":1,"count":1},{"arity":2,"count":805},{"arity":25,"count":1}]
Number of extensional constraints55
Number of intensional constraints751
Distribution of constraint types[{"type":"extension","count":55},{"type":"intension","count":751},{"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-4389776-1568332372.xml 
0.00/0.02	c intension  imp(eq(s[0],0),ne(l[0],0)) -> extension (support ? 0) - 1tuples
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension -> extension : same as previous
0.00/0.03	c intension  imp(eq(s[1],1),ne(l[0],1)) -> extension (support ? 0) - 1tuples
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension -> extension : same as previous
0.00/0.05	c intension  imp(eq(s[2],2),ne(l[0],2)) -> 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 -> 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[3],3),ne(l[0],3)) -> extension (support ? 0) - 1tuples
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension -> extension : same as previous
0.00/0.07	c intension  imp(eq(s[4],4),ne(l[0],4)) -> extension (support ? 0) - 1tuples
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension -> extension : same as previous
0.00/0.09	c intension  imp(eq(s[5],5),ne(l[0],5)) -> 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 -> 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[6],6),ne(l[0],6)) -> extension (support ? 0) - 1tuples
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension -> extension : same as previous
0.10/0.12	c intension  imp(eq(s[7],7),ne(l[0],7)) -> extension (support ? 0) - 1tuples
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension -> extension : same as previous
0.10/0.13	c intension  imp(eq(s[8],8),ne(l[0],8)) -> 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 -> 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[9],9),ne(l[0],9)) -> extension (support ? 0) - 1tuples
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension -> extension : same as previous
0.10/0.16	c intension  imp(eq(s[10],10),ne(l[0],10)) -> extension (support ? 0) - 1tuples
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension -> extension : same as previous
0.10/0.17	c intension  imp(eq(s[11],11),ne(l[0],11)) -> 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 -> 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[12],12),ne(l[0],12)) -> extension (support ? 0) - 1tuples
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension -> extension : same as previous
0.10/0.20	c intension  imp(eq(s[13],13),ne(l[0],13)) -> extension (support ? 0) - 1tuples
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension -> extension : same as previous
0.21/0.22	c intension  imp(eq(s[14],14),ne(l[0],14)) -> 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 -> 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[15],15),ne(l[0],15)) -> extension (support ? 0) - 1tuples
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension -> extension : same as previous
0.21/0.25	c intension  imp(eq(s[16],16),ne(l[0],16)) -> extension (support ? 0) - 1tuples
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension -> extension : same as previous
0.21/0.26	c intension  imp(eq(s[17],17),ne(l[0],17)) -> 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 -> 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[18],18),ne(l[0],18)) -> 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 -> 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[19],19),ne(l[0],19)) -> 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 -> 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[20],20),ne(l[0],20)) -> 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 -> 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[21],21),ne(l[0],21)) -> 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 -> 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[22],22),ne(l[0],22)) -> 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 -> 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[23],23),ne(l[0],23)) -> extension (support ? 0) - 1tuples
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension -> extension : same as previous
0.31/0.36	c intension  imp(eq(s[24],24),ne(l[0],24)) -> 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 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.37 s 
0.31/0.38	c |
0.31/0.38	c |               Variables: 110
0.31/0.38	c |            Domain Sizes: 3..25
0.31/0.38	c |
0.31/0.38	c |             Constraints: 808
0.31/0.38	c |                   Arity: 1..55  -- Unary: 1  -- Binary: 805
0.31/0.38	c | 
0.31/0.38	c |                   Types: 
0.31/0.38	c |                          Circuit: 1
0.31/0.38	c |                          Extension: 805  (nb tuples: 0..24) -- (shared: 725)
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 199
0.31/0.38	c    1 calls to solver(id=0): best=199 lower=45 upper=198 
0.31/0.38	o 183
0.31/0.40	o 180
0.31/0.40	c    3 calls to solver(id=0): best=180 lower=45 upper=179 
0.31/0.40	o 177
0.31/0.41	o 175
0.31/0.41	c    5 calls to solver(id=0): best=175 lower=45 upper=174 
0.31/0.41	o 170
0.41/0.42	o 168
0.41/0.42	c    7 calls to solver(id=0): best=168 lower=45 upper=167 
0.41/0.50	o 166
0.69/0.72	o 165
0.69/0.72	c    9 calls to solver(id=0): best=165 lower=45 upper=164 
0.69/0.78	s OPTIMUM FOUND
0.69/0.78	c call to solver        : 10
0.69/0.78	c
0.69/0.78	c restarts              : 11          
0.69/0.78	c conflicts             : 770          (986 /sec)
0.69/0.78	c decisions             : 3842         (4920 /sec)
0.69/0.78	c propagations          : 399061      (510996 /sec)
0.69/0.78	c root propagations     : 522         
0.69/0.78	c filter calls          : 1242280        (1590733 /sec)
0.69/0.78	c useless filter calls  : 1103898        (88 %)
0.69/0.78	c Memory used           : 35.39 MB
0.69/0.78	c Best bound time (wc)  : 0.722399 s
0.69/0.78	c CPU time              : 0.780892 s
0.69/0.78	c real time             : 0.786177 s
0.69/0.78	
0.69/0.78	
0.69/0.78	v <instantiation type='solution' cost='165'>
0.69/0.78	v <list>c[0] c[10] c[11] c[12] c[13] c[14] c[15] c[16] c[17] c[18] c[19] c[1] c[20] c[21] c[22] c[23] c[24] c[25] c[26] c[27] c[28] c[29] c[2] c[3] c[4] c[5] c[6] c[7] c[8] c[9] d[0] d[10] d[11] d[12] d[13] d[14] d[15] d[16] d[17] d[18] d[19] d[1] d[20] d[21] d[22] d[23] d[24] d[2] d[3] d[4] d[5] d[6] d[7] d[8] d[9] l[0] l[10] l[11] l[12] l[13] l[14] l[15] l[16] l[17] l[18] l[19] l[1] l[20] l[21] l[22] l[23] l[24] l[25] l[26] l[27] l[28] l[29] l[2] l[3] l[4] l[5] l[6] l[7] l[8] l[9] s[0] s[10] s[11] s[12] s[13] s[14] s[15] s[16] s[17] s[18] s[19] s[1] s[20] s[21] s[22] s[23] s[24] s[2] s[3] s[4] s[5] s[6] s[7] s[8] s[9] </list>
0.69/0.78	v <values>4 2 1 4 1 6 5 5 6 4 4 1 1 7 2 2 6 2 4 1 2 6 5 1 1 5 7 11 8 1 0 0 0 0 13 1 0 0 0 1 9 0 0 0 0 8 18 0 0 0 0 0 0 0 0 18 14 14 13 23 13 14 23 13 18 13 19 19 19 23 19 23 14 13 14 18 18 14 18 13 18 14 23 14 13 0 10 11 12 14 19 15 16 17 13 24 1 20 21 22 18 23 2 3 4 5 6 7 8 9 </values>
0.69/0.78	v </instantiation>
0.69/0.78	

Verifier Data

OK	165

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

[startup+0.100156 s]*
/proc/loadavg: 2.06 2.03 2.05 3/200 13917
/proc/meminfo: memFree=27822016/32770688 swapFree=66919992/67108860
[pid=13916] ppid=13913 vsize=29804 memory=6172 CPUtime=0.1 cores=0-3
/proc/13916/stat : 13916 (cosoco) R 13913 13916 9478 0 -1 4202496 1707 0 0 0 10 0 0 0 20 0 1 0 409243500 30519296 1543 33554432000 4194304 6210612 140724614029296 140724614025832 140221138541541 0 0 4096 8405026 0 0 0 17 2 0 0 0 0 0 8308220 8313664 33947648 140724614030347 140724614030449 140724614030449 140724614033358 0
/proc/13916/statm: 7451 1543 825 493 0 756 0
Current children cumulated CPU time: 0.1 s
Current children cumulated vsize: 29804 KiB
Current children cumulated memory: 6172 KiB

[startup+0.210757 s]*
/proc/loadavg: 2.06 2.03 2.05 3/200 13917
/proc/meminfo: memFree=27819784/32770688 swapFree=66919992/67108860
[pid=13916] ppid=13913 vsize=32340 memory=8712 CPUtime=0.21 cores=0-3
/proc/13916/stat : 13916 (cosoco) R 13913 13916 9478 0 -1 4202496 2349 0 0 0 21 0 0 0 20 0 1 0 409243500 33116160 2178 33554432000 4194304 6210612 140724614029296 140724614024696 140221138541541 0 0 4096 8405026 0 0 0 17 2 0 0 0 0 0 8308220 8313664 33947648 140724614030347 140724614030449 140724614030449 140724614033358 0
/proc/13916/statm: 8085 2178 825 493 0 1390 0
Current children cumulated CPU time: 0.21 s
Current children cumulated vsize: 32340 KiB
Current children cumulated memory: 8712 KiB

[startup+0.310399 s]*
/proc/loadavg: 2.06 2.03 2.05 3/200 13917
/proc/meminfo: memFree=27817552/32770688 swapFree=66919992/67108860
[pid=13916] ppid=13913 vsize=34644 memory=11012 CPUtime=0.31 cores=0-3
/proc/13916/stat : 13916 (cosoco) R 13913 13916 9478 0 -1 4202496 2924 0 0 0 31 0 0 0 20 0 1 0 409243500 35475456 2753 33554432000 4194304 6210612 140724614029296 140724614024696 5283215 0 0 4096 8405026 0 0 0 17 2 0 0 0 0 0 8308220 8313664 33947648 140724614030347 140724614030449 140724614030449 140724614033358 0
/proc/13916/statm: 8661 2753 825 493 0 1966 0
Current children cumulated CPU time: 0.31 s
Current children cumulated vsize: 34644 KiB
Current children cumulated memory: 11012 KiB

[startup+0.700291 s]
/proc/loadavg: 2.06 2.03 2.05 3/200 13917
/proc/meminfo: memFree=27815692/32770688 swapFree=66919992/67108860
[pid=13916] ppid=13913 vsize=36240 memory=12600 CPUtime=0.69 cores=0-3
/proc/13916/stat : 13916 (cosoco) R 13913 13916 9478 0 -1 4202496 3363 0 0 0 69 0 0 0 20 0 1 0 409243500 37109760 3150 33554432000 4194304 6210612 140724614029296 140724614027432 5145024 0 0 4096 8405026 0 0 0 17 2 0 0 0 0 0 8308220 8313664 33947648 140724614030347 140724614030449 140724614030449 140724614033358 0
/proc/13916/statm: 9060 3150 837 493 0 2365 0
Current children cumulated CPU time: 0.69 s
Current children cumulated vsize: 36240 KiB
Current children cumulated memory: 12600 KiB

[startup+0.790664 s]
# the end of solver process 13916 was just reported to runsolver
# cumulated CPU time of all completed processes:  user=0.781078 s, system=0.009 s

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

[startup+0.700291 s]
/proc/loadavg: 2.06 2.03 2.05 3/200 13917
/proc/meminfo: memFree=27815692/32770688 swapFree=66919992/67108860
[pid=13916] ppid=13913 vsize=36240 memory=12600 CPUtime=0.69 cores=0-3
/proc/13916/stat : 13916 (cosoco) R 13913 13916 9478 0 -1 4202496 3363 0 0 0 69 0 0 0 20 0 1 0 409243500 37109760 3150 33554432000 4194304 6210612 140724614029296 140724614027432 5145024 0 0 4096 8405026 0 0 0 17 2 0 0 0 0 0 8308220 8313664 33947648 140724614030347 140724614030449 140724614030449 140724614033358 0
/proc/13916/statm: 9060 3150 837 493 0 2365 0
Current children cumulated CPU time: 0.69 s
Current children cumulated vsize: 36240 KiB
Current children cumulated memory: 12600 KiB

Child status: 0
Real time (s): 0.790694
CPU time (s): 0.790078
CPU user time (s): 0.781078
CPU system time (s): 0.009
CPU usage (%): 99.9221
Max. virtual memory (cumulated for all children) (KiB): 36240
Max. memory (cumulated for all children) (KiB): 12600

getrusage(RUSAGE_CHILDREN,...) data:
user time used= 0.781078
system time used= 0.009
maximum resident set size= 12868
integral shared memory size= 0
integral unshared data size= 0
integral unshared stack size= 0
page reclaims= 3381
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= 6


# summary of solver processes directly reported to runsolver:
#   pid: 13916
#   total CPU time (s): 0.790078
#   total CPU user time (s): 0.781078
#   total CPU system time (s): 0.009

??? join timestamper begins
??? join timestamper ends
??? end of timestamper thread
runsolver used 0.02838 second user time and 0.052427 second system time

The end

Launcher Data

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

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

MD5SUM BENCH= af05408dbf994167098c19a92e91e627
RANDOM SEED=1980501741

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:        27824668 kB
MemAvailable:   31796016 kB
Buffers:          149396 kB
Cached:          4115936 kB
SwapCached:        77548 kB
Active:          1239316 kB
Inactive:        3131404 kB
Active(anon):      26116 kB
Inactive(anon):   128800 kB
Active(file):    1213200 kB
Inactive(file):  3002604 kB
Unevictable:      108228 kB
Mlocked:          108228 kB
SwapTotal:      67108860 kB
SwapFree:       66919992 kB
Dirty:              2900 kB
Writeback:             0 kB
AnonPages:        183916 kB
Mapped:            49144 kB
Shmem:             41008 kB
Slab:             171812 kB
SReclaimable:     142756 kB
SUnreclaim:        29056 kB
KernelStack:        3824 kB
PageTables:         5812 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:    135168 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:15