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/een/normalized-enigma.opb
MD5SUM	5e9580fe545ab388653fc9b4ad4fa7c7
Bench Category	optimization, medium integers (OPTMEDINT)
Has Objective Function	YES
Satisfiable	YES
(Un)Satisfiability was proved	YES
Best value of the objective function	0
Optimality of the best value was proved	NO
Number of terms in the objective function	9
Biggest coefficient in the objective function	9
Number of bits for the biggest coefficient in the objective function	4
Sum of the numbers in the objective function	45
Number of bits of the sum of numbers in the objective function	6
Biggest number in a constraint	900207
Number of bits of the biggest number in a constraint	20
Biggest sum of numbers in a constraint	9782371
Number of bits of the biggest sum of numbers	24
Best result obtained on this benchmark	SAT
Best CPU time to get the best result obtained on this benchmark	0.009997
Number of variables	100
Total number of constraints	42
Number of constraints which are clauses	20
Number of constraints which are cardinality constraints (but not clauses)	20
Number of constraints which are nor clauses,nor cardinality constraints	2
Minimum length of a constraint	9
Maximum length of a constraint	90

Trace number 7094

#### BEGIN LAUNCHER DATA ####
LAUNCH ON wulflinc9 THE 2005-04-14 21:32:10 (client local time)
PB2005-SCRIPT v4.0 
MARKUPS: idlaunch=5200 boxname=wulflinc9 idbench=400 idsolver=13 numberseed=0
MD5SUM SOLVER: 
MD5SUM BENCH:  5e9580fe545ab388653fc9b4ad4fa7c7  /oldhome/oroussel/tmp/wulflinc9/normalized-enigma.opb
REAL COMMAND:  minisat+ -w /oldhome/oroussel/tmp/wulflinc9/normalized-enigma.opb /oldhome/oroussel/tmp/wulflinc9/normalized-enigma.opb
IDLAUNCH: 5200
/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 6
model		: 7
model name	: Pentium III (Katmai)
stepping	: 2
cpu MHz		: 451.242
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	: 2
cpu MHz		: 451.242
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:        861368 kB
Buffers:         37152 kB
Cached:         115692 kB
SwapCached:        564 kB
Active:          61768 kB
Inactive:        94508 kB
HighTotal:      131008 kB
HighFree:        11368 kB
LowTotal:       903652 kB
LowFree:        850000 kB
SwapTotal:     2097136 kB
SwapFree:      2096572 kB
Dirty:              28 kB
Writeback:           0 kB
Mapped:           6932 kB
Slab:            11388 kB
Committed_AS:    63484 kB
PageTables:        316 kB
VmallocTotal:   114680 kB
VmallocUsed:      1364 kB
VmallocChunk:   113256 kB
JOB ENDED THE 2005-04-14 21:32:12 (client local time) WITH STATUS 30 IN 2.27865 SECONDS
stats: 5200 0 2.27865 30
#### END LAUNCHER DATA ####
#### BEGIN SOLVER DATA ####
c Parsing PB file...
c Converting 42 PB-constraints to clauses...
c   -- Unit propagations: (none)
c   -- Detecting intervals from adjacent constraints: ===================
c   -- Clauses(.)/Splits(s): .
c ---[  40]---> BDD-cost:   15
c ---[  37]---> BDD-cost:   17
c ---[  35]---> BDD-cost:   17
c ---[  33]---> BDD-cost:   17
c ---[  31]---> BDD-cost:   17
c ---[  29]---> BDD-cost:   17
c ---[  27]---> BDD-cost:   17
c ---[  25]---> BDD-cost:   17
c ---[  23]---> BDD-cost:   17
c ---[  21]---> BDD-cost:   17
c ---[  19]---> BDD-cost:   17
c ---[  17]---> BDD-cost:   17
c ---[  15]---> BDD-cost:   17
c ---[  13]---> BDD-cost:   17
c ---[  11]---> BDD-cost:   17
c ---[   9]---> BDD-cost:   17
c ---[   7]---> BDD-cost:   17
c ---[   5]---> BDD-cost:   17
c ---[   3]---> BDD-cost:   17
c ---[   2]---> BDD-cost:   17
c ---[   1]---> Adder-cost: 1034   maxlim: 4494149   bits: 24/23
c ---[   0]---> Adder-cost: 1000   maxlim: 5014124   bits: 24/23
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |         0 |   15499    54240 |    5166       0        0     nan |  0.000 % |
c |       100 |   15494    54225 |    5682      99     1769    17.9 |  1.606 % |
c |       250 |   15494    54225 |    6250     249     4577    18.4 |  1.606 % |
c |       476 |   15479    54172 |    6875     473     9320    19.7 |  1.647 % |
c |       813 |   15479    54172 |    7563     810    17745    21.9 |  1.647 % |
c ==============================================================================
c [1mFound solution: 7[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> BDD-cost:    6
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |       876 |   15225    53261 |    5075     868    18231    21.0 |  1.647 % |
c ==============================================================================
c [1mFound solution: 2[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |       884 |   14650    51270 |    4883     858    16894    19.7 |  1.647 % |
c ==============================================================================
c [1mFound solution: 0[0m
c [1mOptimal solution: 0[0m
s OPTIMUM FOUND
v -x0 -x1 -x2 -x3 -x4 -x5 -x6 -x7 -x8 -x9 x10 -x11 -x12 -x13 -x14 -x15 -x16 -x17 -x18 -x19 -x20 -x21 x22 -x23 -x24 -x25 -x26 -x27 -x28 x29 -x30 -x31 -x32 -x33 -x34 -x35 -x36 -x37 -x38 -x39 -x40 -x41 -x42 -x43 -x44 x45 -x46 -x47 -x48 -x49 -x50 -x51 -x52 -x53 -x54 -x55 -x56 x57 -x58 -x59 -x60 -x61 -x62 -x63 -x64 -x65 -x66 -x67 -x68 -x69 -x70 x71 -x72 -x73 -x74 -x75 -x76 -x77 -x78 -x79 -x80 -x81 -x82 -x83 -x84 -x85 -x86 -x87 x88 -x89 -x90 -x91 -x92 -x93 -x94 x95 -x96 -x97 -x98 -x99
c _______________________________________________________________________________
c 
c restarts              : 7
c conflicts             : 886            (394 /sec)
c decisions             : 3307           (1471 /sec)
c propagations          : 0              (0 /sec)
c inspects              : 0              (0 /sec)
c CPU time              : 2.24766 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.77 0.94 0.90 2/54 11737
Raw data (stat): 11737 (runsolver) R 11736 30854 30853 0 -1 64 4 0 0 0 0 0 0 0 19 0 1 0 429634376 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+2.28462 s]
Raw data (loadavg): 0.77 0.94 0.90 1/53 11737
Raw data (stat): 11737 (runsolver) R 11736 30854 30853 0 -1 64 4 0 0 0 0 0 0 0 19 0 1 0 429634376 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): 2.28433
CPU time (s): 2.27865
CPU user time (s): 2.25066
CPU system time (s): 0.027995
CPU usage (%): 99.7512
Max. virtual memory (Kb): 1028
#### END WATCHER DATA ####
#### BEGIN VERIFIER DATA ####
Verifier:	OK	0
#### END VERIFIER DATA ####