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/mps-v2-13-7/MIPLIB/miplib/normalized-mps-v2-13-7-misc02.opb
MD5SUM	5128a094f3f47af1a66bc4eb5109f150
Bench Category	optimization, medium integers (OPTMEDINT)
Has Objective Function	YES
Satisfiable	YES
(Un)Satisfiability was proved	YES
Best value of the objective function	1264768
Optimality of the best value was proved	NO
Number of terms in the objective function	21
Biggest coefficient in the objective function	1048576
Number of bits for the biggest coefficient in the objective function	21
Sum of the numbers in the objective function	2097151
Number of bits of the sum of numbers in the objective function	21
Biggest number in a constraint	1048576
Number of bits of the biggest number in a constraint	21
Biggest sum of numbers in a constraint	4762239
Number of bits of the biggest sum of numbers	23
Best result obtained on this benchmark	SAT
Best CPU time to get the best result obtained on this benchmark	0.080987
Number of variables	79
Total number of constraints	97
Number of constraints which are clauses	7
Number of constraints which are cardinality constraints (but not clauses)	65
Number of constraints which are nor clauses,nor cardinality constraints	25
Minimum length of a constraint	1
Maximum length of a constraint	69

Trace number 19082

#### BEGIN LAUNCHER DATA ####
LAUNCH ON wulflinc19 THE 2005-04-21 18:07:14 (client local time)
PB2005-SCRIPT v4.0 
MARKUPS: idlaunch=16952 boxname=wulflinc19 idbench=1304 idsolver=13 numberseed=0
MD5SUM SOLVER: 
MD5SUM BENCH:  5128a094f3f47af1a66bc4eb5109f150  /oldhome/oroussel/tmp/wulflinc19/normalized-mps-v2-13-7-misc02.opb
REAL COMMAND:  minisat+ -w /oldhome/oroussel/tmp/wulflinc19/normalized-mps-v2-13-7-misc02.opb /oldhome/oroussel/tmp/wulflinc19/normalized-mps-v2-13-7-misc02.opb
IDLAUNCH: 16952
/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 6
model		: 7
model name	: Pentium III (Katmai)
stepping	: 3
cpu MHz		: 451.037
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	: 890.88

processor	: 1
vendor_id	: GenuineIntel
cpu family	: 6
model		: 7
model name	: Pentium III (Katmai)
stepping	: 3
cpu MHz		: 451.037
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:        682056 kB
Buffers:         26952 kB
Cached:         301544 kB
SwapCached:        556 kB
Active:          37864 kB
Inactive:       292640 kB
HighTotal:      131008 kB
HighFree:         1652 kB
LowTotal:       903652 kB
LowFree:        680404 kB
SwapTotal:     2097892 kB
SwapFree:      2096388 kB
Dirty:              28 kB
Writeback:           0 kB
Mapped:           5164 kB
Slab:            16344 kB
Committed_AS:    63820 kB
PageTables:        328 kB
VmallocTotal:   114680 kB
VmallocUsed:      1368 kB
VmallocChunk:   113252 kB
JOB ENDED THE 2005-04-21 18:07:15 (client local time) WITH STATUS 30 IN 1.70174 SECONDS
stats: 16952 0 1.70174 30
#### END LAUNCHER DATA ####
#### BEGIN SOLVER DATA ####
c Parsing PB file...
c Converting 53 PB-constraints to clauses...
c   -- Unit propagations: (none)
c   -- Detecting intervals from adjacent constraints: ##############
c   -- Clauses(.)/Splits(s): .......
c ---[  51]---> Adder-cost: 428   maxlim: 1048703   bits: 22/21
c ---[  49]---> BDD-cost:   17
c ---[  47]---> BDD-cost:   17
c ---[  45]---> BDD-cost:   17
c ---[  44]---> BDD-cost:   38
c ---[  43]---> BDD-cost:   38
c ---[  34]---> BDD-cost:   22
c ---[  32]---> BDD-cost:   22
c ---[  30]---> BDD-cost:   22
c ---[  28]---> BDD-cost:   22
c ---[  26]---> BDD-cost:   22
c ---[  24]---> BDD-cost:   22
c ---[  22]---> BDD-cost:   22
c ---[  20]---> BDD-cost:   22
c ---[  18]---> BDD-cost:   22
c ---[  16]---> BDD-cost:   22
c ---[  15]---> BDD-cost:    9
c ---[  14]---> BDD-cost:    9
c ---[  13]---> BDD-cost:    3
c ---[  12]---> BDD-cost:    3
c ---[  11]---> BDD-cost:   15
c ---[  10]---> BDD-cost:   15
c ---[   9]---> BDD-cost:   15
c ---[   8]---> BDD-cost:   15
c ---[   7]---> BDD-cost:   26
c ---[   6]---> BDD-cost:   26
c ---[   5]---> BDD-cost:   15
c ---[   4]---> BDD-cost:   15
c ---[   3]---> BDD-cost:   26
c ---[   2]---> BDD-cost:   26
c ---[   1]---> BDD-cost:   15
c ---[   0]---> BDD-cost:   15
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |         0 |    5758    18547 |    1919       0        0     nan |  0.000 % |
c ==============================================================================
c [1mFound solution: 1402368[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> BDD-cost:   11
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |        29 |    5780    18597 |    1926      23      213     9.3 |  0.000 % |
c ==============================================================================
c [1mFound solution: 1364608[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> BDD-cost:   13
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |        36 |    5811    18672 |    1937      30      333    11.1 |  0.000 % |
c ==============================================================================
c [1mFound solution: 1357568[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> BDD-cost:   12
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |        40 |    5839    18740 |    1946      34      448    13.2 |  0.000 % |
c ==============================================================================
c [1mFound solution: 1314688[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> BDD-cost:   13
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |        51 |    5860    18795 |    1953      45      617    13.7 |  0.000 % |
c |       153 |    5860    18795 |    2148     147     3108    21.1 |  6.846 % |
c |       303 |    5855    18780 |    2363     294     6698    22.8 |  6.932 % |
c ==============================================================================
c [1mFound solution: 1276288[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> BDD-cost:   12
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |       404 |    5880    18843 |    1960     395     9098    23.0 |  6.932 % |
c |       506 |    5880    18843 |    2156     497    12417    25.0 |  6.977 % |
c ==============================================================================
c [1mFound solution: 1264768[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> BDD-cost:   12
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |       630 |    5906    18907 |    1968     621    14998    24.2 |  6.977 % |
c |       730 |    5906    18907 |    2164     721    17297    24.0 |  7.015 % |
c |       880 |    5906    18907 |    2381     871    21571    24.8 |  7.015 % |
c |      1105 |    5906    18907 |    2619    1096    28746    26.2 |  7.015 % |
c |      1444 |    5906    18907 |    2881    1435    40237    28.0 |  7.015 % |
c |      1951 |    5906    18907 |    3169    1942    53642    27.6 |  7.015 % |
c |      2711 |    4607    14842 |    3486     738    15040    20.4 | 20.873 % |
c ==============================================================================
c [1mOptimal solution: 1264768[0m
s OPTIMUM FOUND
v -COL059_bit_7 -COL059_bit_6 -COL059_bit_5 -COL059_bit_4 -COL059_bit_3 -COL059_bit_2 -COL059_bit_1 COL059_bit0 -COL059_bit1 -COL059_bit2 COL059_bit3 COL059_bit4 -COL059_bit5 -COL059_bit6 COL059_bit7 -COL059_bit8 COL059_bit9 COL059_bit10 -COL059_bit11 -COL059_bit12 COL059_bit13 -COL001_bit0 -COL002_bit0 -COL003_bit0 -COL004_bit0 -COL005_bit0 -COL006_bit0 -COL007_bit0 -COL008_bit0 -COL009_bit0 COL010_bit0 -COL011_bit0 COL012_bit0 -COL013_bit0 -COL014_bit0 -COL015_bit0 -COL016_bit0 -COL017_bit0 -COL018_bit0 -COL019_bit0 -COL020_bit0 -COL021_bit0 -COL022_bit0 -COL023_bit0 -COL024_bit0 -COL025_bit0 -COL026_bit0 -COL027_bit0 -COL028_bit0 COL029_bit0 -COL030_bit0 -COL031_bit0 -COL032_bit0 -COL033_bit0 -COL034_bit0 -COL035_bit0 -COL036_bit0 -COL037_bit0 -COL038_bit0 -COL039_bit0 -COL040_bit0 -COL041_bit0 -COL042_bit0 -COL043_bit0 COL044_bit0 COL045_bit0 -COL046_bit0 -COL047_bit0 -COL048_bit0 -COL049_bit0 -COL050_bit0 -COL051_bit0 COL052_bit0 -COL053_bit0 COL054_bit0 -COL055_bit0 COL056_bit0 -COL057_bit0 COL058_bit0
c _______________________________________________________________________________
c 
c restarts              : 16
c conflicts             : 2820           (1680 /sec)
c decisions             : 5265           (3136 /sec)
c propagations          : 0              (0 /sec)
c inspects              : 0              (0 /sec)
c CPU time              : 1.67874 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.83 0.96 0.93 2/55 5952
Raw data (stat): 5952 (runsolver) R 5951 22929 22928 0 -1 64 4 0 0 0 0 0 0 0 19 0 1 0 547108938 1052672 99 4294967295 134512640 135381576 3221224448 3221219692 135158418 0 2147483391 7 90112 0 0 0 17 0 0 0
Raw data (statm): 257 99 215 215 0 42 0
vsize: 1028
[startup+1.7107 s]
Raw data (loadavg): 0.83 0.96 0.93 1/54 5952
Raw data (stat): 5952 (runsolver) R 5951 22929 22928 0 -1 64 4 0 0 0 0 0 0 0 19 0 1 0 547108938 1052672 99 4294967295 134512640 135381576 3221224448 3221219692 135158418 0 2147483391 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): 1.71047
CPU time (s): 1.70174
CPU user time (s): 1.68074
CPU system time (s): 0.020996
CPU usage (%): 99.4899
Max. virtual memory (Kb): 1028
#### END WATCHER DATA ####
#### BEGIN VERIFIER DATA ####
Verifier:	OK	1264768
#### END VERIFIER DATA ####