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-3pb.opb
MD5SUM	48618eada6b30d46752e2fb9d68384b8
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	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.075987
Number of variables	240
Total number of constraints	648
Number of constraints which are clauses	636
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 6248

#### BEGIN LAUNCHER DATA ####
LAUNCH ON wulflinc17 THE 2005-04-14 04:16:03 (client local time)
PB2005-SCRIPT v4.0 
MARKUPS: idlaunch=4745 boxname=wulflinc17 idbench=233 idsolver=13 numberseed=0
MD5SUM SOLVER: 
MD5SUM BENCH:  48618eada6b30d46752e2fb9d68384b8  /oldhome/oroussel/tmp/wulflinc17/normalized-s3-3-3-3pb.opb
REAL COMMAND:  minisat+ -w /oldhome/oroussel/tmp/wulflinc17/normalized-s3-3-3-3pb.opb /oldhome/oroussel/tmp/wulflinc17/normalized-s3-3-3-3pb.opb
IDLAUNCH: 4745
/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:        818704 kB
Buffers:         36312 kB
Cached:         144980 kB
SwapCached:       2376 kB
Active:          59460 kB
Inactive:       127112 kB
HighTotal:      131008 kB
HighFree:          252 kB
LowTotal:       903652 kB
LowFree:        818452 kB
SwapTotal:     2097892 kB
SwapFree:      2095516 kB
Dirty:              28 kB
Writeback:           0 kB
Mapped:           7036 kB
Slab:            23692 kB
Committed_AS:    63700 kB
PageTables:        328 kB
VmallocTotal:   114680 kB
VmallocUsed:      1368 kB
VmallocChunk:   113252 kB
JOB ENDED THE 2005-04-14 04:16:04 (client local time) WITH STATUS 30 IN 0.674897 SECONDS
stats: 4745 0 0.674897 30
#### END LAUNCHER DATA ####
#### BEGIN SOLVER DATA ####
c Parsing PB file...
c Converting 648 PB-constraints to clauses...
c   -- Unit propagations: (none)
c   -- Detecting intervals from adjacent constraints: ################################################################################
c   -- Clauses(.)/Splits(s): ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
c ---[ 634]---> BDD-cost:    1
c ---[ 632]---> BDD-cost:    1
c ---[ 618]---> BDD-cost:    1
c ---[ 616]---> BDD-cost:    1
c ---[ 602]---> BDD-cost:    1
c ---[ 600]---> BDD-cost:    1
c ---[ 586]---> BDD-cost:    1
c ---[ 584]---> BDD-cost:    1
c ---[ 578]---> BDD-cost:    1
c ---[ 576]---> BDD-cost:    1
c ---[ 554]---> BDD-cost:    1
c ---[ 552]---> BDD-cost:    1
c ---[ 546]---> BDD-cost:    1
c ---[ 544]---> BDD-cost:    1
c ---[ 522]---> BDD-cost:    1
c ---[ 520]---> BDD-cost:    1
c ---[ 518]---> BDD-cost:    1
c ---[ 508]---> BDD-cost:    1
c ---[ 498]---> BDD-cost:    1
c ---[ 488]---> BDD-cost:    1
c ---[ 482]---> BDD-cost:    1
c ---[ 480]---> BDD-cost:    1
c ---[ 458]---> BDD-cost:    1
c ---[ 456]---> BDD-cost:    1
c ---[ 454]---> BDD-cost:    1
c ---[ 444]---> BDD-cost:    1
c ---[ 435]---> BDD-cost:    1
c ---[ 425]---> BDD-cost:    1
c ---[ 419]---> BDD-cost:    1
c ---[ 417]---> BDD-cost:    1
c ---[ 395]---> BDD-cost:    1
c ---[ 393]---> BDD-cost:    1
c ---[ 391]---> BDD-cost:    1
c ---[ 381]---> BDD-cost:    1
c ---[ 371]---> BDD-cost:    1
c ---[ 361]---> BDD-cost:    1
c ---[ 359]---> BDD-cost:    1
c ---[ 349]---> BDD-cost:    1
c ---[ 339]---> BDD-cost:    1
c ---[ 329]---> BDD-cost:    1
c ---[ 327]---> BDD-cost:    1
c ---[ 317]---> BDD-cost:    1
c ---[ 308]---> BDD-cost:    1
c ---[ 298]---> BDD-cost:    1
c ---[ 296]---> BDD-cost:    1
c ---[ 286]---> BDD-cost:    1
c ---[ 276]---> BDD-cost:    1
c ---[ 266]---> BDD-cost:    1
c ---[ 253]---> BDD-cost:    1
c ---[ 251]---> 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 ---[ 201]---> BDD-cost:    1
c ---[ 191]---> BDD-cost:    1
c ---[ 181]---> BDD-cost:    1
c ---[ 171]---> BDD-cost:    1
c ---[ 169]---> BDD-cost:    1
c ---[ 159]---> BDD-cost:    1
c ---[ 149]---> BDD-cost:    1
c ---[ 139]---> BDD-cost:    1
c ---[ 133]---> BDD-cost:    1
c ---[ 131]---> BDD-cost:    1
c ---[ 109]---> BDD-cost:    1
c ---[ 107]---> BDD-cost:    1
c ---[  94]---> BDD-cost:    1
c ---[  92]---> BDD-cost:    1
c ---[  78]---> BDD-cost:    1
c ---[  76]---> BDD-cost:    1
c ---[  62]---> BDD-cost:    1
c ---[  60]---> BDD-cost:    1
c ---[  46]---> 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 |    4740    13754 |    1580       0        0     nan |  0.000 % |
c |       102 |    4716    13692 |    1738     100     1326    13.3 |  8.630 % |
c |       252 |    4716    13692 |    1911     250     3036    12.1 |  8.630 % |
c |       477 |    4716    13692 |    2102     475     6084    12.8 |  8.630 % |
c ==============================================================================
c [1mFound solution: 36[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 |       643 |   19841    49148 |    6613     641    10196    15.9 |  8.630 % |
c |       744 |   19841    49148 |    7274     742    12170    16.4 |  2.597 % |
c |       896 |   19841    49148 |    8001     894    15975    17.9 |  2.597 % |
c |      1123 |   19703    48800 |    8801    1095    21465    19.6 |  3.052 % |
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
c _______________________________________________________________________________
c 
c restarts              : 8
c conflicts             : 1212           (1856 /sec)
c decisions             : 1938           (2968 /sec)
c propagations          : 0              (0 /sec)
c inspects              : 0              (0 /sec)
c CPU time              : 0.6529 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.79 0.95 0.91 2/55 28778
Raw data (stat): 28778 (runsolver) R 28777 20838 20837 0 -1 64 4 0 0 0 0 0 0 0 19 0 1 0 481645474 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+0.682671 s]
Raw data (loadavg): 0.79 0.95 0.91 1/54 28778
Raw data (stat): 28778 (runsolver) R 28777 20838 20837 0 -1 64 4 0 0 0 0 0 0 0 19 0 1 0 481645474 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): 0.682383
CPU time (s): 0.674897
CPU user time (s): 0.6559
CPU system time (s): 0.018997
CPU usage (%): 98.903
Max. virtual memory (Kb): 1028
#### END WATCHER DATA ####
#### BEGIN VERIFIER DATA ####
Verifier:	OK	36
#### END VERIFIER DATA ####