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/routing/normalized-s3-3-3-5pb.opb
MD5SUM	1f2ea0bfe66b5e24f2472dc653822ec1
Bench Category	optimization, small integers (OPTSMALLINT)
Has Objective Function	YES
Satisfiable	YES
(Un)Satisfiability was proved	YES
Best value of the objective function	34
Optimality of the best value was proved	NO
Number of terms in the objective function	240
Biggest coefficient in the objective function	1
Number of bits for the biggest coefficient in the objective function	1
Sum of the numbers in the objective function	240
Number of bits of the sum of numbers in the objective function	8
Biggest number in a constraint	3
Number of bits of the biggest number in a constraint	2
Biggest sum of numbers in a constraint	240
Number of bits of the biggest sum of numbers	8
Best result obtained on this benchmark	SAT
Best CPU time to get the best result obtained on this benchmark	0.214967
Number of variables	240
Total number of constraints	646
Number of constraints which are clauses	634
Number of constraints which are cardinality constraints (but not clauses)	12
Number of constraints which are nor clauses,nor cardinality constraints	0
Minimum length of a constraint	2
Maximum length of a constraint	20

Trace number 6250

#### BEGIN LAUNCHER DATA ####
LAUNCH ON wulflinc17 THE 2005-04-14 04:16:19 (client local time)
PB2005-SCRIPT v4.0 
MARKUPS: idlaunch=4747 boxname=wulflinc17 idbench=235 idsolver=13 numberseed=0
MD5SUM SOLVER: 
MD5SUM BENCH:  1f2ea0bfe66b5e24f2472dc653822ec1  /oldhome/oroussel/tmp/wulflinc17/normalized-s3-3-3-5pb.opb
REAL COMMAND:  minisat+ -w /oldhome/oroussel/tmp/wulflinc17/normalized-s3-3-3-5pb.opb /oldhome/oroussel/tmp/wulflinc17/normalized-s3-3-3-5pb.opb
IDLAUNCH: 4747
/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	: 899.07

/proc/meminfo:
MemTotal:      1034660 kB
MemFree:        818480 kB
Buffers:         36328 kB
Cached:         144964 kB
SwapCached:       2376 kB
Active:          59492 kB
Inactive:       127136 kB
HighTotal:      131008 kB
HighFree:          252 kB
LowTotal:       903652 kB
LowFree:        818228 kB
SwapTotal:     2097892 kB
SwapFree:      2095516 kB
Dirty:              20 kB
Writeback:           0 kB
Mapped:           7036 kB
Slab:            23828 kB
Committed_AS:    63708 kB
PageTables:        328 kB
VmallocTotal:   114680 kB
VmallocUsed:      1368 kB
VmallocChunk:   113252 kB
JOB ENDED THE 2005-04-14 04:16:21 (client local time) WITH STATUS 30 IN 1.51177 SECONDS
stats: 4747 0 1.51177 30
#### END LAUNCHER DATA ####
#### BEGIN SOLVER DATA ####
c Parsing PB file...
c Converting 646 PB-constraints to clauses...
c   -- Unit propagations: (none)
c   -- Detecting intervals from adjacent constraints: ################################################################################
c   -- Clauses(.)/Splits(s): ..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
c ---[ 644]---> BDD-cost:    1
c ---[ 634]---> BDD-cost:    1
c ---[ 625]---> BDD-cost:    1
c ---[ 615]---> BDD-cost:    1
c ---[ 613]---> BDD-cost:    1
c ---[ 603]---> BDD-cost:    1
c ---[ 593]---> BDD-cost:    1
c ---[ 583]---> BDD-cost:    1
c ---[ 569]---> BDD-cost:    1
c ---[ 567]---> BDD-cost:    1
c ---[ 553]---> BDD-cost:    1
c ---[ 551]---> BDD-cost:    1
c ---[ 549]---> BDD-cost:    1
c ---[ 539]---> BDD-cost:    1
c ---[ 529]---> BDD-cost:    1
c ---[ 519]---> BDD-cost:    1
c ---[ 517]---> BDD-cost:    1
c ---[ 507]---> BDD-cost:    1
c ---[ 497]---> BDD-cost:    1
c ---[ 487]---> BDD-cost:    1
c ---[ 485]---> BDD-cost:    1
c ---[ 475]---> BDD-cost:    1
c ---[ 465]---> BDD-cost:    1
c ---[ 455]---> BDD-cost:    1
c ---[ 430]---> BDD-cost:    1
c ---[ 428]---> BDD-cost:    1
c ---[ 426]---> BDD-cost:    1
c ---[ 424]---> BDD-cost:    1
c ---[ 410]---> BDD-cost:    1
c ---[ 408]---> BDD-cost:    1
c ---[ 394]---> BDD-cost:    1
c ---[ 392]---> BDD-cost:    1
c ---[ 390]---> BDD-cost:    1
c ---[ 380]---> BDD-cost:    1
c ---[ 371]---> BDD-cost:    1
c ---[ 361]---> BDD-cost:    1
c ---[ 336]---> BDD-cost:    1
c ---[ 334]---> BDD-cost:    1
c ---[ 332]---> BDD-cost:    1
c ---[ 330]---> BDD-cost:    1
c ---[ 328]---> BDD-cost:    1
c ---[ 318]---> BDD-cost:    1
c ---[ 309]---> BDD-cost:    1
c ---[ 299]---> BDD-cost:    1
c ---[ 297]---> BDD-cost:    1
c ---[ 287]---> BDD-cost:    1
c ---[ 277]---> BDD-cost:    1
c ---[ 267]---> BDD-cost:    1
c ---[ 261]---> BDD-cost:    1
c ---[ 259]---> BDD-cost:    1
c ---[ 237]---> BDD-cost:    1
c ---[ 235]---> BDD-cost:    1
c ---[ 229]---> BDD-cost:    1
c ---[ 227]---> BDD-cost:    1
c ---[ 205]---> BDD-cost:    1
c ---[ 203]---> BDD-cost:    1
c ---[ 189]---> BDD-cost:    1
c ---[ 187]---> BDD-cost:    1
c ---[ 173]---> BDD-cost:    1
c ---[ 171]---> BDD-cost:    1
c ---[ 157]---> BDD-cost:    1
c ---[ 155]---> BDD-cost:    1
c ---[ 141]---> BDD-cost:    1
c ---[ 139]---> BDD-cost:    1
c ---[ 125]---> BDD-cost:    1
c ---[ 123]---> BDD-cost:    1
c ---[ 109]---> BDD-cost:    1
c ---[ 107]---> BDD-cost:    1
c ---[ 101]---> BDD-cost:    1
c ---[  99]---> BDD-cost:    1
c ---[  78]---> BDD-cost:    1
c ---[  76]---> BDD-cost:    1
c ---[  74]---> BDD-cost:    1
c ---[  64]---> BDD-cost:    1
c ---[  54]---> BDD-cost:    1
c ---[  44]---> BDD-cost:    1
c ---[  42]---> BDD-cost:    1
c ---[  32]---> BDD-cost:    1
c ---[  22]---> BDD-cost:    1
c ---[  12]---> BDD-cost:    1
c ---[  11]---> BDD-cost:   67
c ---[  10]---> BDD-cost:   67
c ---[   9]---> BDD-cost:   67
c ---[   8]---> BDD-cost:   67
c ---[   7]---> BDD-cost:   67
c ---[   6]---> BDD-cost:   67
c ---[   5]---> BDD-cost:   67
c ---[   4]---> BDD-cost:   67
c ---[   3]---> BDD-cost:   67
c ---[   2]---> BDD-cost:   67
c ---[   1]---> BDD-cost:   67
c ---[   0]---> BDD-cost:   67
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |         0 |    4738    13736 |    1579       0        0     nan |  0.000 % |
c |       100 |    4738    13736 |    1736     100     2668    26.7 |  8.186 % |
c ==============================================================================
c [1mFound solution: 34[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Sorter-cost: 7168     Base:
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |       139 |   19931    49342 |    6643     139     3759    27.0 |  8.186 % |
c |       239 |   19931    49342 |    7307     239     5129    21.5 |  1.681 % |
c |       391 |   19931    49342 |    8038     391     9162    23.4 |  1.681 % |
c |       618 |   19931    49342 |    8841     618    13580    22.0 |  1.681 % |
c |       955 |   19866    49192 |    9726     953    21200    22.2 |  1.943 % |
c |      1463 |   18940    47025 |   10698     632     9575    15.2 |  5.763 % |
c ==============================================================================
c [1mOptimal solution: 34[0m
s OPTIMUM FOUND
v -v1 -v2 -v3 -v4 -v5 v6 -v7 -v8 -v9 -v10 v11 -v12 -v13 -v14 -v15 -v16 -v17 -v18 -v19 -v20 -v21 v22 -v23 -v24 -v25 -v26 -v27 -v28 -v29 v30 -v31 -v32 -v33 -v34 -v35 -v36 -v37 -v38 -v39 -v40 -v41 -v42 -v43 -v44 v45 -v46 -v47 v48 -v49 -v50 -v51 -v52 -v53 v54 -v55 -v56 v57 -v58 -v59 v60 -v61 -v62 -v63 -v64 v65 -v66 -v67 -v68 -v69 -v70 -v71 -v72 -v73 -v74 -v75 v76 -v77 -v78 -v79 -v80 -v81 -v82 -v83 -v84 -v85 -v86 -v87 v88 -v89 -v90 -v91 v92 -v93 -v94 -v95 v96 -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 -v145 -v146 v147 -v148 -v149 -v150 -v151 v152 -v153 -v154 -v155 -v156 v157 v158 -v159 -v160 -v161 -v162 -v163 -v164 v165 -v166 -v167 -v168 -v169 -v170 -v171 -v172 v173 -v174 v175 -v176 -v177 v178 -v179 -v180 -v181 -v182 -v183 -v184 v185 -v186 -v187 -v188 -v189 -v190 -v191 -v192 v193 -v194 -v195 -v196 -v197 -v198 -v199 -v200 -v201 -v202 -v203 -v204 -v205 -v206 -v207 v208 -v209 -v210 -v211 -v212 -v213 -v214 -v215 -v216 -v217 v218 -v219 -v220 -v221 -v222 -v223 -v224 -v225 -v226 -v227 -v228 -v229 v230 -v231 -v232 -v233 -v234 -v235 -v236 -v237 -v238 -v239 -v240
c _______________________________________________________________________________
c 
c restarts              : 8
c conflicts             : 1498           (1005 /sec)
c decisions             : 2969           (1992 /sec)
c propagations          : 0              (0 /sec)
c inspects              : 0              (0 /sec)
c CPU time              : 1.49077 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.69 0.92 0.90 2/55 28960
Raw data (stat): 28960 (runsolver) R 28959 20838 20837 0 -1 64 4 0 0 0 0 0 0 0 19 0 1 0 481647099 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+1.52322 s]
Raw data (loadavg): 0.69 0.92 0.90 1/54 28960
Raw data (stat): 28960 (runsolver) R 28959 20838 20837 0 -1 64 4 0 0 0 0 0 0 0 19 0 1 0 481647099 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): 1.52299
CPU time (s): 1.51177
CPU user time (s): 1.49377
CPU system time (s): 0.017997
CPU usage (%): 99.263
Max. virtual memory (Kb): 1028
#### END WATCHER DATA ####
#### BEGIN VERIFIER DATA ####
Verifier:	OK	34
#### END VERIFIER DATA ####