fix '-c -N' documentation for unlimited consecutive N-rule applications

Author: xamidi

README.html

@@ -420,7 +420,7 @@ <h4 id="usage">Usage</h4>
        -i: specify axioms by input file path (where a LF-separated string of axioms is stored), ignoring lines that are empty or starting with '%'
        -s: specify axioms by comma-separated string ; used only when '-i' unspecified ; default: "C0C1.0,CC0C1.2CC0.1C0.2,CCN0N1C1.0"
        -n: specify formulas in normal Polish notation (e.g. "CpCqp"), not with numeric variables (e.g. "C0C1.0")
-       -N: enable necessitation rule "N" for the given system with unlimited (-N 0) or limited (-N &lt;positive amount&gt;) consecutive necessitation steps allowed
+       -N: enable necessitation rule "N" for the given system with unlimited (-N -1) or limited (-N &lt;positive amount&gt;) consecutive necessitation steps allowed
        -l: disable lazy N-rule parsing ; parse proofs Nα:Lβ despite knowing α:β (requires more time but less memory)
        -e: specify extracted system with the given identifier
        -d: default system ; ignore all other arguments except '-e'

README.md

@@ -45,7 +45,7 @@ Some more – and very special – proof systems are illustrated [further down b
            -i: specify axioms by input file path (where a LF-separated string of axioms is stored), ignoring lines that are empty or starting with '%'
            -s: specify axioms by comma-separated string ; used only when '-i' unspecified ; default: "C0C1.0,CC0C1.2CC0.1C0.2,CCN0N1C1.0"
            -n: specify formulas in normal Polish notation (e.g. "CpCqp"), not with numeric variables (e.g. "C0C1.0")
-           -N: enable necessitation rule "N" for the given system with unlimited (-N 0) or limited (-N <positive amount>) consecutive necessitation steps allowed
+           -N: enable necessitation rule "N" for the given system with unlimited (-N -1) or limited (-N <positive amount>) consecutive necessitation steps allowed
            -l: disable lazy N-rule parsing ; parse proofs Nα:Lβ despite knowing α:β (requires more time but less memory)
            -e: specify extracted system with the given identifier
            -d: default system ; ignore all other arguments except '-e'

main.cpp

@@ -59,7 +59,7 @@ static const map<Task, string>& cmdInfo() {
 				"         -i: specify axioms by input file path (where a LF-separated string of axioms is stored), ignoring lines that are empty or starting with '%'\n"
 				"         -s: specify axioms by comma-separated string ; used only when '-i' unspecified ; default: \"C0C1.0,CC0C1.2CC0.1C0.2,CCN0N1C1.0\"\n"
 				"         -n: specify formulas in normal Polish notation (e.g. \"CpCqp\"), not with numeric variables (e.g. \"C0C1.0\")\n"
-				"         -N: enable necessitation rule \"N\" for the given system with unlimited (-N 0) or limited (-N <positive amount>) consecutive necessitation steps allowed\n"
+				"         -N: enable necessitation rule \"N\" for the given system with unlimited (-N -1) or limited (-N <positive amount>) consecutive necessitation steps allowed\n"
 				"         -l: disable lazy N-rule parsing ; parse proofs Nα:Lβ despite knowing α:β (requires more time but less memory)\n"
 				"         -e: specify extracted system with the given identifier\n"
 				"         -d: default system ; ignore all other arguments except '-e'\n";