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/www.csit.fsu.edu/~burkardt/datasets/mps/normalized-mps-v2-13-7-testprob.opb
MD5SUM	3911b50f214e8d499e3836f4f58df69b
Bench Category	optimization, medium integers (OPTMEDINT)
Has Objective Function	YES
Satisfiable	YES
(Un)Satisfiability was proved	YES
Best value of the objective function	9443456
Optimality of the best value was proved	NO
Number of terms in the objective function	40
Biggest coefficient in the objective function	9437184
Number of bits for the biggest coefficient in the objective function	24
Sum of the numbers in the objective function	18877426
Number of bits of the sum of numbers in the objective function	25
Biggest number in a constraint	9437184
Number of bits of the biggest number in a constraint	24
Biggest sum of numbers in a constraint	18877426
Number of bits of the biggest sum of numbers	25
Best result obtained on this benchmark	SAT
Best CPU time to get the best result obtained on this benchmark	0.004998
Number of variables	40
Total number of constraints	5
Number of constraints which are clauses	0
Number of constraints which are cardinality constraints (but not clauses)	0
Number of constraints which are nor clauses,nor cardinality constraints	5
Minimum length of a constraint	9
Maximum length of a constraint	31

Trace number 13745

#### BEGIN LAUNCHER DATA ####
LAUNCH ON wulflinc19 THE 2005-04-20 21:55:50 (client local time)
PB2005-SCRIPT v4.0 
MARKUPS: idlaunch=20407 boxname=wulflinc19 idbench=1570 idsolver=10 numberseed=0
MD5SUM SOLVER: 
MD5SUM BENCH:  3911b50f214e8d499e3836f4f58df69b  /oldhome/oroussel/tmp/wulflinc19/normalized-mps-v2-13-7-testprob.opb
REAL COMMAND:  minisat+ -ca /oldhome/oroussel/tmp/wulflinc19/normalized-mps-v2-13-7-testprob.opb /oldhome/oroussel/tmp/wulflinc19/normalized-mps-v2-13-7-testprob.opb
IDLAUNCH: 20407
/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:        781984 kB
Buffers:         34248 kB
Cached:         184936 kB
SwapCached:        660 kB
Active:          89116 kB
Inactive:       132176 kB
HighTotal:      131008 kB
HighFree:          252 kB
LowTotal:       903652 kB
LowFree:        781732 kB
SwapTotal:     2097892 kB
SwapFree:      2096432 kB
Dirty:              28 kB
Writeback:           0 kB
Mapped:           5200 kB
Slab:            25528 kB
Committed_AS:    63848 kB
PageTables:        328 kB
VmallocTotal:   114680 kB
VmallocUsed:      1368 kB
VmallocChunk:   113252 kB
JOB ENDED THE 2005-04-20 21:55:50 (client local time) WITH STATUS 30 IN 0.027995 SECONDS
stats: 20407 0 0.027995 30
#### END LAUNCHER DATA ####
#### BEGIN SOLVER DATA ####
c Parsing PB file...
c Converting 6 PB-constraints to clauses...
c   -- Unit propagations: (none)
c   -- Detecting intervals from adjacent constraints: #
c   -- Clauses(.)/Splits(s): (none)
c ---[   5]---> Adder-cost: 18   maxlim: 510   bits: 10/9
c ---[   4]---> Adder-cost: 16   maxlim: 254   bits: 9/8
c ---[   2]---> Adder-cost: 22   maxlim: 1407   bits: 12/11
c ---[   1]---> Adder-cost: 20   maxlim: 765   bits: 11/10
c ---[   0]---> Adder-cost: 22   maxlim: 1151   bits: 12/11
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |         0 |     522     1872 |     174       0        0     nan |  0.000 % |
c ==============================================================================
c [1mFound solution: 9443650[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Adder-cost: 55   maxlim: 3504   bits: 13/12
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |         7 |     769     2764 |     256       5       35     7.0 |  0.000 % |
c ==============================================================================
c [1mFound solution: 9443468[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Adder-cost: 6   maxlim: 2662   bits: 13/12
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |         8 |     813     2951 |     271       6       43     7.2 |  0.000 % |
c ==============================================================================
c [1mFound solution: 9443456[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Adder-cost: 0   maxlim: 2674   bits: 13/12
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |        10 |     816     2988 |     272       8       65     8.1 |  0.000 % |
c ==============================================================================
c [1mOptimal solution: 9443456[0m
s OPTIMUM FOUND
v -X1_bit_7 -X1_bit_6 -X1_bit_5 -X1_bit_4 -X1_bit_3 -X1_bit_2 -X1_bit_1 -X1_bit0 -X1_bit1 X1_bit2 -X2_bit_7 -X2_bit_6 -X2_bit_5 -X2_bit_4 -X2_bit_3 -X2_bit_2 -X2_bit_1 -X2_bit0 -X2_bit1 -X3_bit_7 -X3_bit_6 -X3_bit_5 -X3_bit_4 -X3_bit_3 -X3_bit_2 -X3_bit_1 X3_bit0 -X3_bit1 X3_bit2 -X3_bit3 -X3_bit4 -X3_bit5 -X3_bit6 -X3_bit7 -X3_bit8 -X3_bit9 -X3_bit10 -X3_bit11 -X3_bit12 X3_bit13
c _______________________________________________________________________________
c 
c restarts              : 4
c conflicts             : 63             (2864 /sec)
c decisions             : 148            (6728 /sec)
c propagations          : 0              (0 /sec)
c inspects              : 0              (0 /sec)
c CPU time              : 0.021996 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.99 0.97 0.91 2/55 14433
Raw data (stat): 14433 (runsolver) R 14432 22929 22928 0 -1 64 4 0 0 0 0 0 0 0 19 0 1 0 539839639 1052672 99 4294967295 134512640 135381576 3221224432 3221219676 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.037662 s]
Raw data (loadavg): 0.99 0.97 0.91 1/54 14433
Raw data (stat): 14433 (runsolver) R 14432 22929 22928 0 -1 64 4 0 0 0 0 0 0 0 19 0 1 0 539839639 1052672 99 4294967295 134512640 135381576 3221224432 3221219676 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.037403
CPU time (s): 0.027995
CPU user time (s): 0.022996
CPU system time (s): 0.004999
CPU usage (%): 74.8469
Max. virtual memory (Kb): 1028
#### END WATCHER DATA ####
#### BEGIN VERIFIER DATA ####
Verifier:	OK	9443456
#### END VERIFIER DATA ####