link to mirror repository at codeberg.org/xamidi/pmGenerator in readme

+ remove helper tools' code
+ remove unused variable

README.html

@@ -576,8 +576,9 @@ <h4 id="usage">Usage</h4>
 </code></pre><p>You may have a look at the <a href="log/dProofs31_6node_288cpu.log">log file</a> generated by that computation.</p>
 <h4 id="navigation">Navigation</h4>
 <ul>
+<li><a href="https://github.com/xamidi/pmGenerator/tree/master">C++20 branch</a> (master)</li>
 <li><a href="https://github.com/xamidi/pmGenerator/tree/c++11">C++11 branch</a> (version 1.2.0, discontinued)</li>
-<li><a href="https://github.com/xamidi/pmGenerator/tree/master">C++20 branch</a></li>
+<li><a href="https://codeberg.org/xamidi/pmGenerator">Mirror repository</a> (on Codeberg.org)</li>
 </ul>
 <h4 id="custom-proof-systems">Custom Proof Systems</h4>
 <p>There are illustrated seven proof systems in the following which according to <a href="http://fitelson.org/walsh.pdf">M. Walsh and B. Fitelson</a> are minimal 1-bases (i.e. generators consisting of shortest single axioms) for propositional logic.

README.md

@@ -135,7 +135,7 @@ Some more – and very special – proof systems are illustrated [further down b
          Print proof file cardinalities, numbers of proof candidates for all generation steps up to the next one, and all stored and estimated next removal amounts (to assess generation expenditures)
            -u: use unfiltered proof files
            -s: use proof files without conclusions
-           -d: print debug information 
+           -d: print debug information
       --iterate [-u] [-s]
          Iterate proof candidates currently next up for generation and print their amount (for resource consumption measurements)
            -u: use unfiltered proof files
@@ -208,8 +208,9 @@ A subsequent query with [squeue](https://slurm.schedmd.com/squeue.html) would th
 You may have a look at the [log file](log/dProofs31_6node_288cpu.log) generated by that computation.
 
 #### Navigation
+- [C++20 branch](https://github.com/xamidi/pmGenerator/tree/master) (master)
 - [C++11 branch](https://github.com/xamidi/pmGenerator/tree/c++11) (version 1.2.0, discontinued)
-- [C++20 branch](https://github.com/xamidi/pmGenerator/tree/master)
+- [Mirror repository](https://codeberg.org/xamidi/pmGenerator) (on Codeberg.org)
 
 #### Custom Proof Systems
 There are illustrated seven proof systems in the following which according to [M. Walsh and B. Fitelson](http://fitelson.org/walsh.pdf) are minimal 1-bases (i.e. generators consisting of shortest single axioms) for propositional logic.