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/sorensson/garden/normalized-g7x7.opb
MD5SUM	0cf87a0fcd2352953842751bd4aefa7f
Bench Category	optimization, small integers (OPTSMALLINT)
Has Objective Function	YES
Satisfiable	YES
(Un)Satisfiability was proved	YES
Best value of the objective function	12
Optimality of the best value was proved	NO
Number of terms in the objective function	49
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	49
Number of bits of the sum of numbers in the objective function	6
Biggest number in a constraint	1
Number of bits of the biggest number in a constraint	1
Biggest sum of numbers in a constraint	49
Number of bits of the biggest sum of numbers	6
Best result obtained on this benchmark	SAT
Best CPU time to get the best result obtained on this benchmark	0.083986
Number of variables	49
Total number of constraints	49
Number of constraints which are clauses	49
Number of constraints which are cardinality constraints (but not clauses)	0
Number of constraints which are nor clauses,nor cardinality constraints	0
Minimum length of a constraint	3
Maximum length of a constraint	5

Trace number 6403

#### BEGIN LAUNCHER DATA ####
LAUNCH ON wulflinc9 THE 2005-04-14 05:15:31 (client local time)
PB2005-SCRIPT v4.0 
MARKUPS: idlaunch=4899 boxname=wulflinc9 idbench=377 idsolver=11 numberseed=0
MD5SUM SOLVER: 
MD5SUM BENCH:  0cf87a0fcd2352953842751bd4aefa7f  /oldhome/oroussel/tmp/wulflinc9/normalized-g7x7.opb
REAL COMMAND:  minisat+ -S /oldhome/oroussel/tmp/wulflinc9/normalized-g7x7.opb /oldhome/oroussel/tmp/wulflinc9/normalized-g7x7.opb
IDLAUNCH: 4899
/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:        886608 kB
Buffers:         36656 kB
Cached:          91300 kB
SwapCached:        564 kB
Active:          54984 kB
Inactive:        76348 kB
HighTotal:      131008 kB
HighFree:        35840 kB
LowTotal:       903652 kB
LowFree:        850768 kB
SwapTotal:     2097136 kB
SwapFree:      2096572 kB
Dirty:              40 kB
Writeback:           0 kB
Mapped:           6928 kB
Slab:            11144 kB
Committed_AS:    63480 kB
PageTables:        316 kB
VmallocTotal:   114680 kB
VmallocUsed:      1364 kB
VmallocChunk:   113256 kB
JOB ENDED THE 2005-04-14 05:15:32 (client local time) WITH STATUS 30 IN 0.428934 SECONDS
stats: 4899 0 0.428934 30
#### END LAUNCHER DATA ####
#### BEGIN SOLVER DATA ####
c Parsing PB file...
c Converting 49 PB-constraints to clauses...
c   -- Unit propagations: (none)
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): .................................................
c =================================[SATELITE+]==================================
c |           |     ORIGINAL     |              LEARNT              |          |
c | Conflicts | Clauses Literals |   Limit Clauses Literals  Lit/Cl | Progress |
c ==============================================================================
c |         0 |      49      217 |      14       0        0     nan |  0.000 % |
c   -- subsuming                       
c |         0 |      49      217 |      19       0        0     nan |  0.000 % |
c ==============================================================================
c (current CPU-time: 0.006998 s)
c ==============================================================================
c [1mFound solution: 17[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Sorter-cost:  788     Base:
c =================================[SATELITE+]==================================
c |           |     ORIGINAL     |              LEARNT              |          |
c | Conflicts | Clauses Literals |   Limit Clauses Literals  Lit/Cl | Progress |
c ==============================================================================
c |         0 |     914     2239 |     274       0        0     nan |  0.000 % |
c   -- subsuming                       
c   -- var.elim.:  598/598          
c   -- var.elim.:  296/296          
c   -- subsuming                       
c   -- var.elim.:  213/213          
c |         0 |     622     2776 |      --       0       --      -- |     --   | -285/558
c |         0 |     622     2776 |     248       0        0     nan |  0.000 % |
c ==============================================================================
c (current CPU-time: 0.097985 s)
c ==============================================================================
c [1mFound solution: 15[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Sorter-cost:    0     Base:
c =================================[SATELITE+]==================================
c |           |     ORIGINAL     |              LEARNT              |          |
c | Conflicts | Clauses Literals |   Limit Clauses Literals  Lit/Cl | Progress |
c ==============================================================================
c |        66 |     630     2586 |     188      64     1091    17.0 |  0.000 % |
c   -- subsuming                       
c   -- var.elim.:  224/224          
c   -- var.elim.:  106/106          
c   -- var.elim.:  6/6          
c |        66 |     602     2546 |      --      64       --      -- |     --   | -21/-15
c |        66 |     602     2546 |     240      42      383     9.1 |  0.000 % |
c ==============================================================================
c (current CPU-time: 0.124981 s)
c ==============================================================================
c [1mFound solution: 14[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Sorter-cost:    0     Base:
c =================================[SATELITE+]==================================
c |           |     ORIGINAL     |              LEARNT              |          |
c | Conflicts | Clauses Literals |   Limit Clauses Literals  Lit/Cl | Progress |
c ==============================================================================
c |        86 |     697     2795 |     209      62      546     8.8 |  0.000 % |
c   -- subsuming                       
c   -- var.elim.:  147/147          
c   -- var.elim.:  81/81          
c   -- var.elim.:  47/47          
c |        86 |     616     2615 |      --      62       --      -- |     --   | -81/-179
c |        86 |     616     2615 |     246      62      546     8.8 |  0.000 % |
c |       187 |     598     2528 |     263     160     2082    13.0 | 10.005 % |
c |       337 |     593     2511 |     287     306     3956    12.9 | 10.328 % |
c ==============================================================================
c (current CPU-time: 0.177972 s)
c ==============================================================================
c [1mFound solution: 13[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Sorter-cost:    0     Base:
c =================================[SATELITE+]==================================
c |           |     ORIGINAL     |              LEARNT              |          |
c | Conflicts | Clauses Literals |   Limit Clauses Literals  Lit/Cl | Progress |
c ==============================================================================
c |       361 |     608     2546 |     182     330     4207    12.7 | 10.328 % |
c   -- subsuming                       
c   -- var.elim.:  195/195          
c   -- var.elim.:  133/133          
c |       361 |     545     2070 |      --     330       --      -- |     --   | -8/78
c |       361 |     545     2070 |     218     218     2019     9.3 | 10.328 % |
c |       462 |     545     2070 |     239     220     2038     9.3 | 15.137 % |
c |       613 |     545     2070 |     263     263     2409     9.2 | 15.133 % |
c |       838 |     545     2070 |     290     375     3597     9.6 | 15.137 % |
c ==============================================================================
c (current CPU-time: 0.290955 s)
c ==============================================================================
c [1mFound solution: 12[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Sorter-cost:    0     Base:
c =================================[SATELITE+]==================================
c |           |     ORIGINAL     |              LEARNT              |          |
c | Conflicts | Clauses Literals |   Limit Clauses Literals  Lit/Cl | Progress |
c ==============================================================================
c |      1141 |     629     2290 |     188     319     2829     8.9 | 15.137 % |
c   -- subsuming                       
c   -- var.elim.:  140/140          
c   -- var.elim.:  70/70          
c   -- var.elim.:  43/43          
c |      1141 |     557     2118 |      --     319       --      -- |     --   | -72/-171
c |      1141 |     557     2118 |     222     319     2829     8.9 | 15.137 % |
c |      1243 |     557     2118 |     245     221     1636     7.4 | 16.030 % |
c |      1394 |     557     2118 |     269     262     2013     7.7 | 16.034 % |
c |      1620 |     557     2118 |     296     259     1843     7.1 | 16.027 % |
c |      1958 |     545     2069 |     319     278     1859     6.7 | 16.996 % |
c ==============================================================================
c [1mOptimal solution: 12[0m
s OPTIMUM FOUND
v -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
c _______________________________________________________________________________
c 
c restarts              : 15
c conflicts             : 2046           (4907 /sec)
c decisions             : 3163           (7586 /sec)
c propagations          : 126937         (304452 /sec)
c inspects              : 357996         (858635 /sec)
c CPU time              : 0.416936 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 1.04 0.95 1/54 4742
Raw data (stat): 4742 (runsolver) R 4741 30854 30853 0 -1 64 4 0 0 0 0 0 0 0 19 0 1 0 423773722 1052672 99 4294967295 134512640 135381576 3221224480 3221219724 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.439297 s]
Raw data (loadavg): 0.99 1.04 0.95 1/53 4742
Raw data (stat): 4742 (runsolver) R 4741 30854 30853 0 -1 64 4 0 0 0 0 0 0 0 19 0 1 0 423773722 1052672 99 4294967295 134512640 135381576 3221224480 3221219724 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.438991
CPU time (s): 0.428934
CPU user time (s): 0.416936
CPU system time (s): 0.011998
CPU usage (%): 97.7091
Max. virtual memory (Kb): 1028
#### END WATCHER DATA ####
#### BEGIN VERIFIER DATA ####
Verifier:	OK	12
#### END VERIFIER DATA ####