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-2pb.opb
MD5SUM	403e00059390cf58db4a40d0c72aa686
Bench Category	optimization, small integers (OPTSMALLINT)
Has Objective Function	YES
Satisfiable	YES
(Un)Satisfiability was proved	YES
Best value of the objective function	36
Optimality of the best value was proved	NO
Number of terms in the objective function	264
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	264
Number of bits of the sum of numbers in the objective function	9
Biggest number in a constraint	3
Number of bits of the biggest number in a constraint	2
Biggest sum of numbers in a constraint	264
Number of bits of the biggest sum of numbers	9
Best result obtained on this benchmark	SAT
Best CPU time to get the best result obtained on this benchmark	0.076987
Number of variables	264
Total number of constraints	712
Number of constraints which are clauses	700
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	22

Trace number 5121

#### BEGIN LAUNCHER DATA ####
LAUNCH ON wulflinc27 THE 2005-04-13 22:20:13 (client local time)
PB2005-SCRIPT v4.0 
MARKUPS: idlaunch=3616 boxname=wulflinc27 idbench=232 idsolver=10 numberseed=0
MD5SUM SOLVER: 
MD5SUM BENCH:  403e00059390cf58db4a40d0c72aa686  /oldhome/oroussel/tmp/wulflinc27/normalized-s3-3-3-2pb.opb
REAL COMMAND:  minisat+ -ca /oldhome/oroussel/tmp/wulflinc27/normalized-s3-3-3-2pb.opb /oldhome/oroussel/tmp/wulflinc27/normalized-s3-3-3-2pb.opb
IDLAUNCH: 3616
/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 6
model		: 7
model name	: Pentium III (Katmai)
stepping	: 3
cpu MHz		: 451.169
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.169
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:        873296 kB
Buffers:         33464 kB
Cached:          91080 kB
SwapCached:       3160 kB
Active:          49204 kB
Inactive:        81308 kB
HighTotal:      131008 kB
HighFree:        36540 kB
LowTotal:       903652 kB
LowFree:        836756 kB
SwapTotal:     2097892 kB
SwapFree:      2094732 kB
Dirty:              28 kB
Writeback:           0 kB
Mapped:           6924 kB
Slab:            25340 kB
Committed_AS:    63480 kB
PageTables:        316 kB
VmallocTotal:   114680 kB
VmallocUsed:      1368 kB
VmallocChunk:   113252 kB
JOB ENDED THE 2005-04-13 22:20:14 (client local time) WITH STATUS 30 IN 0.669897 SECONDS
stats: 3616 0 0.669897 30
#### END LAUNCHER DATA ####
#### BEGIN SOLVER DATA ####
c Parsing PB file...
c Converting 712 PB-constraints to clauses...
c   -- Unit propagations: (none)
c   -- Detecting intervals from adjacent constraints: ########################################################################################
c   -- Clauses(.)/Splits(s): ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
c ---[ 710]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 700]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 690]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 680]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 666]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 664]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 650]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 648]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 646]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 636]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 626]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 616]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 591]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 589]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 587]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 585]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 560]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 558]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 556]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 554]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 552]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 542]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 532]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 522]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 520]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 510]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 500]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 490]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 476]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 474]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 460]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 458]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 444]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 442]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 428]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 426]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 413]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 411]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 397]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 395]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 393]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 383]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 373]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 363]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 361]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 351]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 341]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 331]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 329]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 319]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 309]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 299]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 286]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 284]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 270]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 268]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 266]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 256]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 246]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 236]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 230]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 228]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 206]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 204]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 190]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 188]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 174]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 172]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 158]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 156]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 142]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 140]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 138]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 128]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 118]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 108]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[ 106]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  96]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  86]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  76]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  62]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  60]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  46]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  44]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  38]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  36]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  14]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  12]---> Adder-cost: 2   maxlim: 1   bits: 2/1
c ---[  11]---> Adder-cost: 38   maxlim: 18   bits: 5/5
c ---[  10]---> Adder-cost: 38   maxlim: 18   bits: 5/5
c ---[   9]---> Adder-cost: 38   maxlim: 18   bits: 5/5
c ---[   8]---> Adder-cost: 38   maxlim: 18   bits: 5/5
c ---[   7]---> Adder-cost: 38   maxlim: 18   bits: 5/5
c ---[   6]---> Adder-cost: 38   maxlim: 18   bits: 5/5
c ---[   5]---> Adder-cost: 38   maxlim: 18   bits: 5/5
c ---[   4]---> Adder-cost: 38   maxlim: 18   bits: 5/5
c ---[   3]---> Adder-cost: 38   maxlim: 18   bits: 5/5
c ---[   2]---> Adder-cost: 38   maxlim: 18   bits: 5/5
c ---[   1]---> Adder-cost: 38   maxlim: 18   bits: 5/5
c ---[   0]---> Adder-cost: 38   maxlim: 18   bits: 5/5
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |         0 |    3608    12442 |    1202       0        0     nan |  0.000 % |
c |       101 |    3608    12442 |    1322     101      456     4.5 | 33.334 % |
c |       252 |    3608    12442 |    1454     252     1350     5.4 | 33.333 % |
c |       479 |    3608    12442 |    1599     479     3617     7.6 | 33.333 % |
c |       817 |    3536    12196 |    1759     804     5769     7.2 | 34.524 % |
c |      1323 |    3536    12196 |    1935    1310    11072     8.5 | 34.524 % |
c |      2082 |    3536    12196 |    2129    2069    18651     9.0 | 34.526 % |
c ==============================================================================
c [1mFound solution: 36[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Adder-cost: 524   maxlim: 228   bits: 9/8
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |      2424 |    7101    24908 |    2367    2399    21721     9.1 | 34.526 % |
c |      2525 |    6940    24347 |    2603    2426    22402     9.2 | 24.658 % |
c |      2677 |    6865    24084 |    2864    2482    23124     9.3 | 24.984 % |
c |      2902 |    6833    23970 |    3150    2679    24893     9.3 | 25.244 % |
c |      3239 |    6683    23452 |    3465    2976    27698     9.3 | 26.220 % |
c ==============================================================================
c [1mOptimal solution: 36[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 -v241 -v242 -v243 -v244 -v245 v246 -v247 -v248 -v249 -v250 -v251 -v252 -v253 -v254 -v255 -v256 -v257 -v258 -v259 -v260 -v261 -v262 -v263 v264
c _______________________________________________________________________________
c 
c restarts              : 12
c conflicts             : 3406           (5233 /sec)
c decisions             : 8747           (13438 /sec)
c propagations          : 0              (0 /sec)
c inspects              : 0              (0 /sec)
c CPU time              : 0.650901 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.92 0.97 0.91 1/54 21792
Raw data (stat): 21792 (runsolver) R 21791 18865 18864 0 -1 64 4 0 0 0 0 0 0 0 19 0 1 0 479500566 1052672 99 4294967295 134512640 135381576 3221224464 3221219708 135158418 0 0 7 90112 0 0 0 17 0 0 0
Raw data (statm): 257 99 215 215 0 42 0
vsize: 1028
[startup+0.678348 s]
Raw data (loadavg): 0.93 0.97 0.91 1/53 21792
Raw data (stat): 21792 (runsolver) R 21791 18865 18864 0 -1 64 4 0 0 0 0 0 0 0 19 0 1 0 479500566 1052672 99 4294967295 134512640 135381576 3221224464 3221219708 135158418 0 0 7 90112 0 0 0 17 0 0 0
Raw data (statm): 257 99 215 215 0 42 0
vsize: 0

Child status: 30
Real time (s): 0.678063
CPU time (s): 0.669897
CPU user time (s): 0.6519
CPU system time (s): 0.017997
CPU usage (%): 98.7957
Max. virtual memory (Kb): 1028
#### END WATCHER DATA ####
#### BEGIN VERIFIER DATA ####
Verifier:	OK	36
#### END VERIFIER DATA ####