PB'05 competition: run trace

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 in four parts:

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 provide some useful information on the computer.
SOLVER DATA
This is the output of the solver (stdout and stderr).
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 1200 seconds. 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 1230 seconds which will send a SIGXPU to the solver. The last limit is on the virtual memory used by the process (900Mb).
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.
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.

General information on the benchmark

Name	normalized-opb/submitted/manquinho/ttp/normalized-data4_3.opb
MD5SUM	c35974bed5d553709b7d7ce92d35093a
Bench Category	optimization, small integers (OPTSMALLINT)
Has Objective Function	YES
Satisfiable	YES
(Un)Satisfiability was proved	YES
Best value of the objective function	8276
Optimality of the best value was proved	NO
Number of terms in the objective function	48
Biggest coefficient in the objective function	929
Number of bits for the biggest coefficient in the objective function	10
Sum of the numbers in the objective function	25088
Number of bits of the sum of numbers in the objective function	15
Biggest number in a constraint	929
Number of bits of the biggest number in a constraint	10
Biggest sum of numbers in a constraint	25088
Number of bits of the biggest sum of numbers	15
Best result obtained on this benchmark	SAT
Best CPU time to get the best result obtained on this benchmark	0.784879
Number of variables	144
Total number of constraints	704
Number of constraints which are clauses	464
Number of constraints which are cardinality constraints (but not clauses)	96
Number of constraints which are nor clauses,nor cardinality constraints	144
Minimum length of a constraint	2
Maximum length of a constraint	12

Trace number 6276

#### BEGIN LAUNCHER DATA ####
LAUNCH ON wulflinc30 THE 2005-04-14 04:27:19 (client local time)
PB2005-SCRIPT v4.0 
MARKUPS: idlaunch=4773 boxname=wulflinc30 idbench=261 idsolver=13 numberseed=0
MD5SUM SOLVER: 
MD5SUM BENCH:  c35974bed5d553709b7d7ce92d35093a  /oldhome/oroussel/tmp/wulflinc30/normalized-data4_3.opb
REAL COMMAND:  minisat+ -w /oldhome/oroussel/tmp/wulflinc30/normalized-data4_3.opb /oldhome/oroussel/tmp/wulflinc30/normalized-data4_3.opb
IDLAUNCH: 4773
/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 6
model		: 7
model name	: Pentium III (Katmai)
stepping	: 3
cpu MHz		: 451.072
cache size	: 512 KB
fdiv_bug	: no
hlt_bug		: no
f00f_bug	: no
coma_bug	: no
fpu		: yes
fpu_exception	: yes
cpuid level	: 2
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 mmx fxsr sse
bogomips	: 888.83

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 6
model		: 7
model name	: Pentium III (Katmai)
stepping	: 3
cpu MHz		: 451.072
cache size	: 512 KB
fdiv_bug	: no
hlt_bug		: no
f00f_bug	: no
coma_bug	: no
fpu		: yes
fpu_exception	: yes
cpuid level	: 2
wp		: yes
flags		: fpu vme de pse tsc msr pae mce cx8 apic sep mtrr pge mca cmov pat pse36 mmx fxsr sse
bogomips	: 901.12

/proc/meminfo:
MemTotal:      1034660 kB
MemFree:        720320 kB
Buffers:         38308 kB
Cached:         235596 kB
SwapCached:          0 kB
Active:          84580 kB
Inactive:       192164 kB
HighTotal:      131008 kB
HighFree:          252 kB
LowTotal:       903652 kB
LowFree:        720068 kB
SwapTotal:     2097892 kB
SwapFree:      2097892 kB
Dirty:              28 kB
Writeback:           0 kB
Mapped:           6928 kB
Slab:            32028 kB
Committed_AS:    63488 kB
PageTables:        316 kB
VmallocTotal:   114680 kB
VmallocUsed:      1368 kB
VmallocChunk:   113252 kB
JOB ENDED THE 2005-04-14 04:27:28 (client local time) WITH STATUS 30 IN 8.82766 SECONDS
stats: 4773 0 8.82766 30
#### END LAUNCHER DATA ####
#### BEGIN SOLVER DATA ####
c Parsing PB file...
c Converting 764 PB-constraints to clauses...
c   -- Unit propagations: (none)
c   -- Detecting intervals from adjacent constraints: ############################################################
c   -- Clauses(.)/Splits(s): ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
c ---[ 762]---> BDD-cost:    9
c ---[ 760]---> BDD-cost:    9
c ---[ 758]---> BDD-cost:    9
c ---[ 756]---> BDD-cost:    9
c ---[ 754]---> BDD-cost:    9
c ---[ 752]---> BDD-cost:    9
c ---[ 750]---> BDD-cost:    9
c ---[ 748]---> BDD-cost:    9
c ---[ 746]---> BDD-cost:    9
c ---[ 744]---> BDD-cost:    9
c ---[ 742]---> BDD-cost:    9
c ---[ 740]---> BDD-cost:    9
c ---[ 667]---> BDD-cost:    3
c ---[ 666]---> BDD-cost:    3
c ---[ 665]---> BDD-cost:    3
c ---[ 664]---> BDD-cost:    3
c ---[ 663]---> BDD-cost:    3
c ---[ 662]---> BDD-cost:    3
c ---[ 661]---> BDD-cost:    3
c ---[ 660]---> BDD-cost:    3
c ---[ 659]---> BDD-cost:    3
c ---[ 658]---> BDD-cost:    3
c ---[ 657]---> BDD-cost:    3
c ---[ 656]---> BDD-cost:    3
c ---[ 655]---> BDD-cost:    3
c ---[ 654]---> BDD-cost:    3
c ---[ 653]---> BDD-cost:    3
c ---[ 652]---> BDD-cost:    3
c ---[ 651]---> BDD-cost:    3
c ---[ 650]---> BDD-cost:    3
c ---[ 649]---> BDD-cost:    3
c ---[ 648]---> BDD-cost:    3
c ---[ 647]---> BDD-cost:    3
c ---[ 646]---> BDD-cost:    3
c ---[ 645]---> BDD-cost:    3
c ---[ 644]---> BDD-cost:    3
c ---[ 642]---> BDD-cost:    5
c ---[ 640]---> BDD-cost:    5
c ---[ 638]---> BDD-cost:    5
c ---[ 636]---> BDD-cost:    5
c ---[ 634]---> BDD-cost:    5
c ---[ 632]---> BDD-cost:    5
c ---[ 630]---> BDD-cost:    5
c ---[ 628]---> BDD-cost:    5
c ---[ 626]---> BDD-cost:    5
c ---[ 624]---> BDD-cost:    5
c ---[ 622]---> BDD-cost:    5
c ---[ 620]---> BDD-cost:    5
c ---[ 618]---> BDD-cost:    5
c ---[ 616]---> BDD-cost:    5
c ---[ 614]---> BDD-cost:    5
c ---[ 612]---> BDD-cost:    5
c ---[ 610]---> BDD-cost:    5
c ---[ 608]---> BDD-cost:    5
c ---[ 606]---> BDD-cost:    5
c ---[ 604]---> BDD-cost:    5
c ---[ 602]---> BDD-cost:    5
c ---[ 600]---> BDD-cost:    5
c ---[ 598]---> BDD-cost:    5
c ---[ 596]---> BDD-cost:    5
c ---[ 591]---> BDD-cost:   32
c ---[ 590]---> BDD-cost:   32
c ---[ 589]---> BDD-cost:   32
c ---[ 588]---> BDD-cost:   32
c ---[ 583]---> BDD-cost:   35
c ---[ 582]---> BDD-cost:   35
c ---[ 581]---> BDD-cost:   35
c ---[ 580]---> BDD-cost:   35
c ---[ 575]---> BDD-cost:   35
c ---[ 574]---> BDD-cost:   35
c ---[ 573]---> BDD-cost:   35
c ---[ 572]---> BDD-cost:   35
c ---[ 246]---> BDD-cost:    3
c ---[ 244]---> BDD-cost:    3
c ---[ 242]---> BDD-cost:    3
c ---[ 240]---> BDD-cost:    3
c ---[ 238]---> BDD-cost:    3
c ---[ 236]---> BDD-cost:    3
c ---[ 234]---> BDD-cost:    3
c ---[ 232]---> BDD-cost:    3
c ---[ 230]---> BDD-cost:    3
c ---[ 228]---> BDD-cost:    3
c ---[ 226]---> BDD-cost:    3
c ---[ 224]---> BDD-cost:    3
c ---[ 222]---> BDD-cost:    3
c ---[ 220]---> BDD-cost:    3
c ---[ 218]---> BDD-cost:    3
c ---[ 216]---> BDD-cost:    3
c ---[ 214]---> BDD-cost:    3
c ---[ 212]---> BDD-cost:    3
c ---[ 210]---> BDD-cost:    3
c ---[ 208]---> BDD-cost:    3
c ---[ 206]---> BDD-cost:    3
c ---[ 204]---> BDD-cost:    3
c ---[ 202]---> BDD-cost:    3
c ---[ 200]---> BDD-cost:    3
c ---[ 191]---> BDD-cost:    5
c ---[ 190]---> BDD-cost:    2
c ---[ 189]---> BDD-cost:    5
c ---[ 188]---> BDD-cost:    2
c ---[ 187]---> BDD-cost:    4
c ---[ 186]---> BDD-cost:    2
c ---[ 185]---> BDD-cost:    4
c ---[ 184]---> BDD-cost:    2
c ---[ 183]---> BDD-cost:    3
c ---[ 182]---> BDD-cost:    2
c ---[ 181]---> BDD-cost:    3
c ---[ 180]---> BDD-cost:    2
c ---[ 175]---> BDD-cost:    2
c ---[ 174]---> BDD-cost:    2
c ---[ 173]---> BDD-cost:    2
c ---[ 172]---> BDD-cost:    2
c ---[ 171]---> BDD-cost:    4
c ---[ 170]---> BDD-cost:    2
c ---[ 169]---> BDD-cost:    2
c ---[ 168]---> BDD-cost:    2
c ---[ 167]---> BDD-cost:    3
c ---[ 166]---> BDD-cost:    2
c ---[ 165]---> BDD-cost:    2
c ---[ 164]---> BDD-cost:    2
c ---[ 159]---> BDD-cost:    2
c ---[ 158]---> BDD-cost:    2
c ---[ 157]---> BDD-cost:    2
c ---[ 156]---> BDD-cost:    2
c ---[ 155]---> BDD-cost:    2
c ---[ 154]---> BDD-cost:    2
c ---[ 153]---> BDD-cost:    2
c ---[ 152]---> BDD-cost:    2
c ---[ 151]---> BDD-cost:    2
c ---[ 150]---> BDD-cost:    2
c ---[ 149]---> BDD-cost:    2
c ---[ 148]---> BDD-cost:    2
c ---[ 143]---> BDD-cost:    5
c ---[ 142]---> BDD-cost:    2
c ---[ 141]---> BDD-cost:    5
c ---[ 140]---> BDD-cost:    2
c ---[ 139]---> BDD-cost:    4
c ---[ 138]---> BDD-cost:    2
c ---[ 137]---> BDD-cost:    4
c ---[ 136]---> BDD-cost:    2
c ---[ 135]---> BDD-cost:    3
c ---[ 134]---> BDD-cost:    2
c ---[ 133]---> BDD-cost:    3
c ---[ 132]---> BDD-cost:    2
c ---[ 127]---> BDD-cost:    2
c ---[ 126]---> BDD-cost:    2
c ---[ 125]---> BDD-cost:    2
c ---[ 124]---> BDD-cost:    2
c ---[ 123]---> BDD-cost:    4
c ---[ 122]---> BDD-cost:    2
c ---[ 121]---> BDD-cost:    2
c ---[ 120]---> BDD-cost:    2
c ---[ 119]---> BDD-cost:    3
c ---[ 118]---> BDD-cost:    2
c ---[ 117]---> BDD-cost:    2
c ---[ 116]---> BDD-cost:    2
c ---[ 111]---> BDD-cost:    2
c ---[ 110]---> BDD-cost:    2
c ---[ 109]---> BDD-cost:    2
c ---[ 108]---> BDD-cost:    2
c ---[ 107]---> BDD-cost:    2
c ---[ 106]---> BDD-cost:    2
c ---[ 105]---> BDD-cost:    2
c ---[ 104]---> BDD-cost:    2
c ---[ 103]---> BDD-cost:    2
c ---[ 102]---> BDD-cost:    2
c ---[ 101]---> BDD-cost:    2
c ---[ 100]---> BDD-cost:    2
c ---[  95]---> BDD-cost:    5
c ---[  94]---> BDD-cost:    2
c ---[  93]---> BDD-cost:    5
c ---[  92]---> BDD-cost:    2
c ---[  91]---> BDD-cost:    4
c ---[  90]---> BDD-cost:    2
c ---[  89]---> BDD-cost:    4
c ---[  88]---> BDD-cost:    2
c ---[  87]---> BDD-cost:    3
c ---[  86]---> BDD-cost:    2
c ---[  85]---> BDD-cost:    3
c ---[  84]---> BDD-cost:    2
c ---[  79]---> BDD-cost:    2
c ---[  78]---> BDD-cost:    2
c ---[  77]---> BDD-cost:    2
c ---[  76]---> BDD-cost:    2
c ---[  75]---> BDD-cost:    4
c ---[  74]---> BDD-cost:    2
c ---[  73]---> BDD-cost:    2
c ---[  72]---> BDD-cost:    2
c ---[  71]---> BDD-cost:    3
c ---[  70]---> BDD-cost:    2
c ---[  69]---> BDD-cost:    2
c ---[  68]---> BDD-cost:    2
c ---[  63]---> BDD-cost:    2
c ---[  62]---> BDD-cost:    2
c ---[  61]---> BDD-cost:    2
c ---[  60]---> BDD-cost:    2
c ---[  59]---> BDD-cost:    2
c ---[  58]---> BDD-cost:    2
c ---[  57]---> BDD-cost:    2
c ---[  56]---> BDD-cost:    2
c ---[  55]---> BDD-cost:    2
c ---[  54]---> BDD-cost:    2
c ---[  53]---> BDD-cost:    2
c ---[  52]---> BDD-cost:    2
c ---[  47]---> BDD-cost:    5
c ---[  46]---> BDD-cost:    2
c ---[  45]---> BDD-cost:    5
c ---[  44]---> BDD-cost:    2
c ---[  43]---> BDD-cost:    4
c ---[  42]---> BDD-cost:    2
c ---[  41]---> BDD-cost:    4
c ---[  40]---> BDD-cost:    2
c ---[  39]---> BDD-cost:    3
c ---[  38]---> BDD-cost:    2
c ---[  37]---> BDD-cost:    3
c ---[  36]---> BDD-cost:    2
c ---[  31]---> BDD-cost:    2
c ---[  30]---> BDD-cost:    2
c ---[  29]---> BDD-cost:    2
c ---[  28]---> BDD-cost:    2
c ---[  27]---> BDD-cost:    4
c ---[  26]---> BDD-cost:    2
c ---[  25]---> BDD-cost:    2
c ---[  24]---> BDD-cost:    2
c ---[  23]---> BDD-cost:    3
c ---[  22]---> BDD-cost:    2
c ---[  21]---> BDD-cost:    2
c ---[  20]---> BDD-cost:    2
c ---[  15]---> BDD-cost:    2
c ---[  14]---> BDD-cost:    2
c ---[  13]---> BDD-cost:    2
c ---[  12]---> BDD-cost:    2
c ---[  11]---> BDD-cost:    2
c ---[  10]---> BDD-cost:    2
c ---[   9]---> BDD-cost:    2
c ---[   8]---> BDD-cost:    2
c ---[   7]---> BDD-cost:    2
c ---[   6]---> BDD-cost:    2
c ---[   5]---> BDD-cost:    2
c ---[   4]---> BDD-cost:    2
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |         0 |    4140    11780 |    1380       0        0     nan |  0.000 % |
c ==============================================================================
c [1mFound solution: 9080[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Sorter-cost: 4379     Base: 5 2 2 3 5 2
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |         3 |   15563    38611 |    5187       3        6     2.0 |  0.000 % |
c ==============================================================================
c [1mFound solution: 8811[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Sorter-cost:    8     Base: 5 2 2 3 5 2
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |         5 |   15924    39507 |    5308       5       19     3.8 |  0.000 % |
c |       105 |   15924    39507 |    5838     105     1664    15.8 |  4.922 % |
c ==============================================================================
c [1mFound solution: 8712[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Sorter-cost:    8     Base: 5 2 2 3 5 2
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |       183 |   16201    40186 |    5400     183     3162    17.3 |  4.922 % |
c ==============================================================================
c [1mFound solution: 8559[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Sorter-cost:    6     Base: 5 2 2 3 5 2
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |       231 |   16232    40271 |    5410     231     3723    16.1 |  4.922 % |
c ==============================================================================
c [1mFound solution: 8429[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Sorter-cost:    5     Base: 5 2 2 3 5 2
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |       232 |   16256    40335 |    5418     232     3730    16.1 |  4.922 % |
c |       333 |   16256    40335 |    5959     333     6211    18.7 |  4.896 % |
c |       485 |   16256    40335 |    6555     485     7659    15.8 |  4.896 % |
c ==============================================================================
c [1mFound solution: 8290[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Sorter-cost:    6     Base: 5 2 2 3 5 2
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |       536 |   16365    40602 |    5455     536     8641    16.1 |  4.896 % |
c |       637 |   16365    40602 |    6000     637    10699    16.8 |  4.886 % |
c |       787 |   16365    40602 |    6600     787    13602    17.3 |  4.886 % |
c |      1012 |   16365    40602 |    7260    1012    16643    16.4 |  4.886 % |
c ==============================================================================
c [1mFound solution: 8276[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Sorter-cost:    7     Base: 5 2 2 3 5 2
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |      1187 |   16389    40662 |    5463    1187    19773    16.7 |  4.886 % |
c |      1287 |   16389    40662 |    6009    1287    21396    16.6 |  4.899 % |
c |      1437 |   16378    40636 |    6610    1436    23229    16.2 |  4.919 % |
c |      1662 |   16378    40636 |    7271    1661    26196    15.8 |  4.919 % |
c |      2000 |   16378    40636 |    7998    1999    30239    15.1 |  4.919 % |
c |      2506 |   16378    40636 |    8798    2505    36056    14.4 |  4.919 % |
c |      3265 |   16378    40636 |    9678    3264    45026    13.8 |  4.919 % |
c |      4404 |   16366    40604 |   10645    3702    50641    13.7 |  4.978 % |
c ==============================================================================
c [1mOptimal solution: 8276[0m
s OPTIMUM FOUND
v -v97 -v98 v99 -v100 v101 -v102 v103 -v104 -v105 -v106 v107 -v108 -v109 v110 -v111 v112 -v113 -v114 -v115 -v116 v117 -v118 v119 -v120 -v121 v122 -v123 -v124 -v125 v126 v127 v128 -v129 -v130 -v131 v132 -v133 -v134 v135 -v136 v137 -v138 v139 -v140 -v141 -v142 v143 -v144 -v2 v18 -v34 -v50 -v66 -v82 -v3 -v19 v35 -v51 -v67 -v83 v4 -v20 -v36 -v52 -v68 -v84 -v5 -v21 -v37 v53 -v69 -v85 -v7 -v23 -v39 -v55 v71 -v87 -v8 -v24 -v40 -v56 -v72 v88 -v9 -v25 -v41 -v57 -v73 v89 v10 -v26 -v42 -v58 -v74 -v90 -v12 v28 -v44 -v60 -v76 -v92 -v13 -v29 -v45 -v61 v77 -v93 -v14 -v30 v46 -v62 -v78 -v94 -v15 -v31 -v47 v63 -v79 -v95 v6 v22 v38 -v54 -v70 -v86 -v11 -v27 v43 v59 v75 -v91 v16 v32 -v48 -v64 -v80 v96 -v1 -v17 -v33 v49 v65 v81
c _______________________________________________________________________________
c 
c restarts              : 21
c conflicts             : 5681           (646 /sec)
c decisions             : 8171           (929 /sec)
c propagations          : 0              (0 /sec)
c inspects              : 0              (0 /sec)
c CPU time              : 8.79566 s
c _______________________________________________________________________________
#### END SOLVER DATA ####
#### BEGIN WATCHER DATA ####
Enforcing CPU limit (will send SIGTERM then SIGKILL): 1200 seconds
Enforcing CPUTime (will send SIGXCPU) limit: 1230 seconds
Enforcing VSIZE limit: 943718400 bytes
Raw data (loadavg): 0.91 0.98 0.91 2/54 19176
Raw data (stat): 19176 (runsolver) R 19175 11931 11930 0 -1 64 4 0 0 0 0 0 0 0 19 0 1 0 481703127 1052672 99 4294967295 134512640 135381576 3221224464 3221219708 135158418 0 2147483391 7 90112 0 0 0 17 1 0 0
Raw data (statm): 257 99 215 215 0 42 0
vsize: 1028
[startup+8.84712 s]
Raw data (loadavg): 0.93 0.98 0.91 1/53 19176
Raw data (stat): 19176 (runsolver) R 19175 11931 11930 0 -1 64 4 0 0 0 0 0 0 0 19 0 1 0 481703127 1052672 99 4294967295 134512640 135381576 3221224464 3221219708 135158418 0 2147483391 7 90112 0 0 0 17 1 0 0
Raw data (statm): 257 99 215 215 0 42 0
vsize: 0

Child status: 30
Real time (s): 8.84682
CPU time (s): 8.82766
CPU user time (s): 8.80066
CPU system time (s): 0.026995
CPU usage (%): 99.7834
Max. virtual memory (Kb): 1028
#### END WATCHER DATA ####
#### BEGIN VERIFIER DATA ####
Verifier:	OK	8276
#### END VERIFIER DATA ####