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/ttp/normalized-circ4_3.opb
MD5SUM	4a7e7b149407cd13657a201380066d1b
Bench Category	optimization, small integers (OPTSMALLINT)
Has Objective Function	YES
Satisfiable	YES
(Un)Satisfiability was proved	YES
Best value of the objective function	20
Optimality of the best value was proved	NO
Number of terms in the objective function	48
Biggest coefficient in the objective function	2
Number of bits for the biggest coefficient in the objective function	2
Sum of the numbers in the objective function	64
Number of bits of the sum of numbers in the objective function	7
Biggest number in a constraint	8
Number of bits of the biggest number in a constraint	4
Biggest sum of numbers in a constraint	64
Number of bits of the biggest sum of numbers	7
Best result obtained on this benchmark	SAT
Best CPU time to get the best result obtained on this benchmark	0.626903
Number of variables	144
Total number of constraints	704
Number of constraints which are clauses	464
Number of constraints which are cardinality constraints (but not clauses)	96
Number of constraints which are nor clauses,nor cardinality constraints	144
Minimum length of a constraint	2
Maximum length of a constraint	12

Trace number 4935

#### BEGIN LAUNCHER DATA ####
LAUNCH ON wulflinc26 THE 2005-04-13 21:14:04 (client local time)
PB2005-SCRIPT v4.0 
MARKUPS: idlaunch=2309 boxname=wulflinc26 idbench=257 idsolver=5 numberseed=0
MD5SUM SOLVER: 1d62365061f6d70b1a242542b016b2e4  /oldhome/oroussel/solvers/minisat+
MD5SUM BENCH:  4a7e7b149407cd13657a201380066d1b  /oldhome/oroussel/tmp/wulflinc26/normalized-circ4_3.opb
REAL COMMAND:  minisat+ /oldhome/oroussel/tmp/wulflinc26/normalized-circ4_3.opb
IDLAUNCH: 2309
/proc/cpuinfo:
processor	: 0
vendor_id	: GenuineIntel
cpu family	: 6
model		: 7
model name	: Pentium III (Katmai)
stepping	: 3
cpu MHz		: 451.061
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.061
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	: 901.12

/proc/meminfo:
MemTotal:      1034660 kB
MemFree:        858532 kB
Buffers:         33660 kB
Cached:         102516 kB
SwapCached:       2476 kB
Active:          50220 kB
Inactive:        91288 kB
HighTotal:      131008 kB
HighFree:        25396 kB
LowTotal:       903652 kB
LowFree:        833136 kB
SwapTotal:     2097892 kB
SwapFree:      2095416 kB
Dirty:              28 kB
Writeback:           0 kB
Mapped:           6948 kB
Slab:            29004 kB
Committed_AS:    63616 kB
PageTables:        320 kB
VmallocTotal:   114680 kB
VmallocUsed:      1368 kB
VmallocChunk:   113252 kB
JOB ENDED THE 2005-04-13 21:14:05 (client local time) WITH STATUS 30 IN 0.904862 SECONDS
stats: 2309 0 0.904862 30
#### END LAUNCHER DATA ####
#### BEGIN SOLVER DATA ####
c Parsing PB file...
c Converting 764 PB-constraints to clauses...
c   -- Unit propagations: (none)
c   -- Detecting intervals from adjacent constraints: ############################################################
c   -- Clauses(.)/Splits(s): ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
c ---[ 762]---> BDD-cost:    9
c ---[ 760]---> BDD-cost:    9
c ---[ 758]---> BDD-cost:    9
c ---[ 756]---> BDD-cost:    9
c ---[ 754]---> BDD-cost:    9
c ---[ 752]---> BDD-cost:    9
c ---[ 750]---> BDD-cost:    9
c ---[ 748]---> BDD-cost:    9
c ---[ 746]---> BDD-cost:    9
c ---[ 744]---> BDD-cost:    9
c ---[ 742]---> BDD-cost:    9
c ---[ 740]---> BDD-cost:    9
c ---[ 667]---> BDD-cost:    3
c ---[ 666]---> BDD-cost:    3
c ---[ 665]---> BDD-cost:    3
c ---[ 664]---> BDD-cost:    3
c ---[ 663]---> BDD-cost:    3
c ---[ 662]---> BDD-cost:    3
c ---[ 661]---> BDD-cost:    3
c ---[ 660]---> BDD-cost:    3
c ---[ 659]---> BDD-cost:    3
c ---[ 658]---> BDD-cost:    3
c ---[ 657]---> BDD-cost:    3
c ---[ 656]---> BDD-cost:    3
c ---[ 655]---> BDD-cost:    3
c ---[ 654]---> BDD-cost:    3
c ---[ 653]---> BDD-cost:    3
c ---[ 652]---> BDD-cost:    3
c ---[ 651]---> BDD-cost:    3
c ---[ 650]---> BDD-cost:    3
c ---[ 649]---> BDD-cost:    3
c ---[ 648]---> BDD-cost:    3
c ---[ 647]---> BDD-cost:    3
c ---[ 646]---> BDD-cost:    3
c ---[ 645]---> BDD-cost:    3
c ---[ 644]---> BDD-cost:    3
c ---[ 642]---> BDD-cost:    5
c ---[ 640]---> BDD-cost:    5
c ---[ 638]---> BDD-cost:    5
c ---[ 636]---> BDD-cost:    5
c ---[ 634]---> BDD-cost:    5
c ---[ 632]---> BDD-cost:    5
c ---[ 630]---> BDD-cost:    5
c ---[ 628]---> BDD-cost:    5
c ---[ 626]---> BDD-cost:    5
c ---[ 624]---> BDD-cost:    5
c ---[ 622]---> BDD-cost:    5
c ---[ 620]---> BDD-cost:    5
c ---[ 618]---> BDD-cost:    5
c ---[ 616]---> BDD-cost:    5
c ---[ 614]---> BDD-cost:    5
c ---[ 612]---> BDD-cost:    5
c ---[ 610]---> BDD-cost:    5
c ---[ 608]---> BDD-cost:    5
c ---[ 606]---> BDD-cost:    5
c ---[ 604]---> BDD-cost:    5
c ---[ 602]---> BDD-cost:    5
c ---[ 600]---> BDD-cost:    5
c ---[ 598]---> BDD-cost:    5
c ---[ 596]---> BDD-cost:    5
c ---[ 591]---> BDD-cost:   32
c ---[ 590]---> BDD-cost:   32
c ---[ 589]---> BDD-cost:   32
c ---[ 588]---> BDD-cost:   32
c ---[ 583]---> BDD-cost:   35
c ---[ 582]---> BDD-cost:   35
c ---[ 581]---> BDD-cost:   35
c ---[ 580]---> BDD-cost:   35
c ---[ 575]---> BDD-cost:   35
c ---[ 574]---> BDD-cost:   35
c ---[ 573]---> BDD-cost:   35
c ---[ 572]---> BDD-cost:   35
c ---[ 246]---> BDD-cost:    3
c ---[ 244]---> BDD-cost:    3
c ---[ 242]---> BDD-cost:    3
c ---[ 240]---> BDD-cost:    3
c ---[ 238]---> BDD-cost:    3
c ---[ 236]---> BDD-cost:    3
c ---[ 234]---> BDD-cost:    3
c ---[ 232]---> BDD-cost:    3
c ---[ 230]---> BDD-cost:    3
c ---[ 228]---> BDD-cost:    3
c ---[ 226]---> BDD-cost:    3
c ---[ 224]---> BDD-cost:    3
c ---[ 222]---> BDD-cost:    3
c ---[ 220]---> BDD-cost:    3
c ---[ 218]---> BDD-cost:    3
c ---[ 216]---> BDD-cost:    3
c ---[ 214]---> BDD-cost:    3
c ---[ 212]---> BDD-cost:    3
c ---[ 210]---> BDD-cost:    3
c ---[ 208]---> BDD-cost:    3
c ---[ 206]---> BDD-cost:    3
c ---[ 204]---> BDD-cost:    3
c ---[ 202]---> BDD-cost:    3
c ---[ 200]---> BDD-cost:    3
c ---[ 191]---> BDD-cost:    5
c ---[ 190]---> BDD-cost:    2
c ---[ 189]---> BDD-cost:    5
c ---[ 188]---> BDD-cost:    2
c ---[ 187]---> BDD-cost:    4
c ---[ 186]---> BDD-cost:    2
c ---[ 185]---> BDD-cost:    4
c ---[ 184]---> BDD-cost:    2
c ---[ 183]---> BDD-cost:    3
c ---[ 182]---> BDD-cost:    2
c ---[ 181]---> BDD-cost:    3
c ---[ 180]---> BDD-cost:    2
c ---[ 175]---> BDD-cost:    2
c ---[ 174]---> BDD-cost:    2
c ---[ 173]---> BDD-cost:    2
c ---[ 172]---> BDD-cost:    2
c ---[ 171]---> BDD-cost:    4
c ---[ 170]---> BDD-cost:    2
c ---[ 169]---> BDD-cost:    2
c ---[ 168]---> BDD-cost:    2
c ---[ 167]---> BDD-cost:    3
c ---[ 166]---> BDD-cost:    2
c ---[ 165]---> BDD-cost:    2
c ---[ 164]---> BDD-cost:    2
c ---[ 159]---> BDD-cost:    2
c ---[ 158]---> BDD-cost:    2
c ---[ 157]---> BDD-cost:    2
c ---[ 156]---> BDD-cost:    2
c ---[ 155]---> BDD-cost:    2
c ---[ 154]---> BDD-cost:    2
c ---[ 153]---> BDD-cost:    2
c ---[ 152]---> BDD-cost:    2
c ---[ 151]---> BDD-cost:    2
c ---[ 150]---> BDD-cost:    2
c ---[ 149]---> BDD-cost:    2
c ---[ 148]---> BDD-cost:    2
c ---[ 143]---> BDD-cost:    5
c ---[ 142]---> BDD-cost:    2
c ---[ 141]---> BDD-cost:    5
c ---[ 140]---> BDD-cost:    2
c ---[ 139]---> BDD-cost:    4
c ---[ 138]---> BDD-cost:    2
c ---[ 137]---> BDD-cost:    4
c ---[ 136]---> BDD-cost:    2
c ---[ 135]---> BDD-cost:    3
c ---[ 134]---> BDD-cost:    2
c ---[ 133]---> BDD-cost:    3
c ---[ 132]---> BDD-cost:    2
c ---[ 127]---> BDD-cost:    2
c ---[ 126]---> BDD-cost:    2
c ---[ 125]---> BDD-cost:    2
c ---[ 124]---> BDD-cost:    2
c ---[ 123]---> BDD-cost:    4
c ---[ 122]---> BDD-cost:    2
c ---[ 121]---> BDD-cost:    2
c ---[ 120]---> BDD-cost:    2
c ---[ 119]---> BDD-cost:    3
c ---[ 118]---> BDD-cost:    2
c ---[ 117]---> BDD-cost:    2
c ---[ 116]---> BDD-cost:    2
c ---[ 111]---> BDD-cost:    2
c ---[ 110]---> BDD-cost:    2
c ---[ 109]---> BDD-cost:    2
c ---[ 108]---> BDD-cost:    2
c ---[ 107]---> BDD-cost:    2
c ---[ 106]---> BDD-cost:    2
c ---[ 105]---> BDD-cost:    2
c ---[ 104]---> BDD-cost:    2
c ---[ 103]---> BDD-cost:    2
c ---[ 102]---> BDD-cost:    2
c ---[ 101]---> BDD-cost:    2
c ---[ 100]---> BDD-cost:    2
c ---[  95]---> BDD-cost:    5
c ---[  94]---> BDD-cost:    2
c ---[  93]---> BDD-cost:    5
c ---[  92]---> BDD-cost:    2
c ---[  91]---> BDD-cost:    4
c ---[  90]---> BDD-cost:    2
c ---[  89]---> BDD-cost:    4
c ---[  88]---> BDD-cost:    2
c ---[  87]---> BDD-cost:    3
c ---[  86]---> BDD-cost:    2
c ---[  85]---> BDD-cost:    3
c ---[  84]---> BDD-cost:    2
c ---[  79]---> BDD-cost:    2
c ---[  78]---> BDD-cost:    2
c ---[  77]---> BDD-cost:    2
c ---[  76]---> BDD-cost:    2
c ---[  75]---> BDD-cost:    4
c ---[  74]---> BDD-cost:    2
c ---[  73]---> BDD-cost:    2
c ---[  72]---> BDD-cost:    2
c ---[  71]---> BDD-cost:    3
c ---[  70]---> BDD-cost:    2
c ---[  69]---> BDD-cost:    2
c ---[  68]---> BDD-cost:    2
c ---[  63]---> BDD-cost:    2
c ---[  62]---> BDD-cost:    2
c ---[  61]---> BDD-cost:    2
c ---[  60]---> BDD-cost:    2
c ---[  59]---> BDD-cost:    2
c ---[  58]---> BDD-cost:    2
c ---[  57]---> BDD-cost:    2
c ---[  56]---> BDD-cost:    2
c ---[  55]---> BDD-cost:    2
c ---[  54]---> BDD-cost:    2
c ---[  53]---> BDD-cost:    2
c ---[  52]---> BDD-cost:    2
c ---[  47]---> BDD-cost:    5
c ---[  46]---> BDD-cost:    2
c ---[  45]---> BDD-cost:    5
c ---[  44]---> BDD-cost:    2
c ---[  43]---> BDD-cost:    4
c ---[  42]---> BDD-cost:    2
c ---[  41]---> BDD-cost:    4
c ---[  40]---> BDD-cost:    2
c ---[  39]---> BDD-cost:    3
c ---[  38]---> BDD-cost:    2
c ---[  37]---> BDD-cost:    3
c ---[  36]---> BDD-cost:    2
c ---[  31]---> BDD-cost:    2
c ---[  30]---> BDD-cost:    2
c ---[  29]---> BDD-cost:    2
c ---[  28]---> BDD-cost:    2
c ---[  27]---> BDD-cost:    4
c ---[  26]---> BDD-cost:    2
c ---[  25]---> BDD-cost:    2
c ---[  24]---> BDD-cost:    2
c ---[  23]---> BDD-cost:    3
c ---[  22]---> BDD-cost:    2
c ---[  21]---> BDD-cost:    2
c ---[  20]---> BDD-cost:    2
c ---[  15]---> BDD-cost:    2
c ---[  14]---> BDD-cost:    2
c ---[  13]---> BDD-cost:    2
c ---[  12]---> BDD-cost:    2
c ---[  11]---> BDD-cost:    2
c ---[  10]---> BDD-cost:    2
c ---[   9]---> BDD-cost:    2
c ---[   8]---> BDD-cost:    2
c ---[   7]---> BDD-cost:    2
c ---[   6]---> BDD-cost:    2
c ---[   5]---> BDD-cost:    2
c ---[   4]---> BDD-cost:    2
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |         0 |    2632     7348 |     877       0        0     nan |  0.000 % |
c |       101 |    2632     7348 |     964     101      844     8.4 | 21.818 % |
c ==============================================================================
c [1mFound solution: 26[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Sorter-cost:  794     Base: 2
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |       105 |    4182    10971 |    1394     105      858     8.2 | 21.818 % |
c ==============================================================================
c [1mFound solution: 24[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Sorter-cost:    2     Base: 2
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |       106 |    4189    10989 |    1396     106      904     8.5 | 21.818 % |
c ==============================================================================
c [1mFound solution: 20[0m
c   -- Detecting intervals from adjacent constraints: (none)
c   -- Clauses(.)/Splits(s): (none)
c ---[   0]---> Sorter-cost:    2     Base: 2
c ==================================[MINISAT+]==================================
c | Conflicts | Original         | Learnt                           | Progress |
c |           | Clauses Literals |     Max Clauses Literals     LPC |          |
c ==============================================================================
c |       119 |    4206    11029 |    1402     119     1143     9.6 | 21.818 % |
c |       220 |    4078    10741 |    1542     205     2503    12.2 | 15.919 % |
c |       370 |    4078    10741 |    1696     355     4025    11.3 | 15.919 % |
c |       595 |    4033    10638 |    1866     579     7096    12.3 | 16.714 % |
c |       932 |    3948    10445 |    2052     913    11961    13.1 | 18.193 % |
c |      1438 |    3948    10445 |    2257    1419    18758    13.2 | 18.192 % |
c |      2197 |    3787    10087 |    2483    2122    26417    12.4 | 21.267 % |
c ==============================================================================
c [1mOptimal solution: 20[0m
s OPTIMUM FOUND
v -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 -v2 -v18 -v34 -v50 -v66 v82 -v3 -v19 -v35 v51 -v67 -v83 -v4 -v20 -v36 -v52 v68 -v84 -v5 -v21 v37 -v53 -v69 -v85 -v7 -v23 -v39 -v55 v71 -v87 -v8 -v24 -v40 v56 -v72 -v88 -v9 v25 -v41 -v57 -v73 -v89 v10 -v26 -v42 -v58 -v74 -v90 -v12 -v28 v44 -v60 -v76 -v92 v13 -v29 -v45 -v61 -v77 -v93 -v14 v30 -v46 -v62 -v78 -v94 -v15 -v31 -v47 -v63 -v79 v95 v6 v22 -v38 -v54 -v70 v86 -v11 -v27 -v43 v59 v75 v91 -v16 -v32 v48 v64 v80 -v96 v1 v17 v33 -v49 -v65 -v81
c _______________________________________________________________________________
c 
c restarts              : 11
c conflicts             : 2213           (2479 /sec)
c decisions             : 4328           (4847 /sec)
c propagations          : 0              (0 /sec)
c inspects              : 0              (0 /sec)
c CPU time              : 0.892864 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.92 0.97 0.91 2/54 25705
Raw data (stat): 25705 (runsolver) R 25704 22612 22611 0 -1 64 4 0 0 0 0 0 0 0 19 0 1 0 479110614 1052672 99 4294967295 134512640 135381576 3221224528 3221219772 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.915134 s]
Raw data (loadavg): 0.93 0.97 0.91 1/53 25705
Raw data (stat): 25705 (runsolver) R 25704 22612 22611 0 -1 64 4 0 0 0 0 0 0 0 19 0 1 0 479110614 1052672 99 4294967295 134512640 135381576 3221224528 3221219772 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.914541
CPU time (s): 0.904862
CPU user time (s): 0.893864
CPU system time (s): 0.010998
CPU usage (%): 98.9417
Max. virtual memory (Kb): 1028
#### END WATCHER DATA ####
#### BEGIN VERIFIER DATA ####
Verifier:	OK	20
#### END VERIFIER DATA ####