Skip to content
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 8 additions & 4 deletions docs/status/PROOF-NEEDS.adoc
Original file line number Diff line number Diff line change
Expand Up @@ -42,7 +42,9 @@ missing input is missing, in every period after it too, and never zero. A
verdict is "no" on a known breach and otherwise missing when any value it
depends on is missing; it is never "yes" then
|Agda, re-checked in Rocq and Lean
|Proved in Agda, Rocq and Lean; the receipt derives `PWG-1` (WO 4.2)
|Proved in Agda, Rocq and Lean; the receipt derives `PWG-1` (WO 4.2). The
middle clause ("otherwise missing") is `verdict-missing`, proved 2026-11-17;
its receipt is still to be earned
|`verification/proofs/agda/Applied/Missing.agda`; Rocq and Lean: `Cohort.v`, `Cohort.lean`

|APP-2
Expand Down Expand Up @@ -98,9 +100,11 @@ re-anchoring plan. They were never Mathesis obligations.

No proof file may contain an unproven escape: `postulate` (Agda),
`Admitted` (Rocq), `sorry` (Lean), `believe_me` or `assert_total`
(Idris2). For Agda, Rocq and Lean, `scripts/check-proofs.sh` enforces this
in CI: it compiles each gated module, then audits its axioms, and
`tests/proofs/gate_controls_test.sh` shows that a planted escape fails.
(Idris2). Nor may a Rocq or Lean file declare an axiom of its own, used or
not. For Agda, Rocq and Lean, `scripts/check-proofs.sh` enforces this in
CI: it compiles each gated module, then audits its axioms (for Rocq, with
the kernel checker `coqchk -o` on the compiled library as well), and
`tests/proofs/gate_controls_test.sh` shows that each planted escape fails.

== Proof file locations

Expand Down
74 changes: 69 additions & 5 deletions docs/status/PROOF-STATUS.adoc
Original file line number Diff line number Diff line change
Expand Up @@ -135,6 +135,27 @@ missing crate as missing from every build.
* CI receipt (current): Lean 4.29.0 in the pinned Guix (`8edb9da`), same
invocation, at commit `336768958d01`, run 42896264290. The file SHA-256 is
unchanged, and no declared theorem depends on an axiom.
* Axiom evidence, corrected 2026-11-17. Every THY-1 result in this file is a
`def` (the leg is Type-valued, like the Agda), and until 2026-11-17 the
gate audited theorems only. So the empty `(axioms)` element of the Lean
receipts, and "no declared theorem depends on an axiom" above, were true
of an audit that inspected none of THY-1's results (proof audit
2026-11-16, finding 31). The gate now audits every definition with a
source range as well, and fails on an empty audit. Run locally on Lean
4.29.0 (`98dc76e3c0a9`), `scripts/check-proofs.sh lean4` reports "axioms:
none for 2 theorem(s) and 48 definition(s) with a source range" for this
file, before the propositional theorems below were added. Those are the
six results (`reachMono`, `absentBelow`, `onMono`, `onMonoAll`,
`edgeMono`, `absentUnderAllFeatures`), their helpers, and the
definitions Lean generates for the inductives. The two theorems are the
projections `Edge.src` and `Edge.dst`. With the propositional theorems
(owner ruling 2026-11-17: the gate fix and theorem wrappers), the report
is "axioms: none for 8 theorem(s) and 48 definition(s) with a source
range". `absent_under_all_features` and the other five carry each
definition in their own `#print axioms` cone as well. No axiom was found, so none had
to be removed. A CI receipt under the fixed gate is still to be earned:
until it is, the current receipt's axiom evidence for this leg stays the
vacuous one.

|Why neither leg is transported
|Lambdapi's Rocq and Lean exports translate before elaboration and drop
Expand Down Expand Up @@ -184,6 +205,15 @@ same hypotheses and conclusions. The differences are encoding only:
no proof inspects.
* `_⊑_` takes the feature implicitly in Agda and Lean, and explicitly
in Rocq.
* Lean only, added 2026-11-17: a `theorem` must be a proposition, and
each Lean result is a Type-valued `def`. So `reach_mono`, `absent_below`,
`on_mono`, `edge_mono` and `absent_under_all_features` restate the
results about inhabitation (`Nonempty`, and `¬ Nonempty` for absence),
each proved by the definition it names. `not'_iff` shows that `Not' A`
is inhabited exactly when `¬ Nonempty A`, so for the headline the two
readings coincide. The definitions are unchanged; these are additions,
and they play the part that `Theorem absent_under_all_features` plays
in the Rocq leg.

Residual assumptions: none in any leg.

Expand Down Expand Up @@ -227,19 +257,32 @@ each unit's graph.
|`verification/proofs/agda/Applied/`: `Cohort` (the model), `Status` and
`Missing` (APP-1, APP-4), `Cash` (APP-2, APP-3, for any ordered abelian
group), `IntNumber` and `IntLaws` (the integer instance and its laws).
APP-1's verdict sentence has one theorem per clause, in each prover:
"no" on a known breach (`breach-decides`); otherwise missing when any value
it depends on is missing (`verdict-missing`, added 2026-11-17, with the
invariant `verdict-not-false`); never "yes" then (`verdict-yes`, and
`verdict-not-yes` stated directly). Before 2026-11-17 the middle clause was
stated by no declaration (proof audit 2026-11-16, finding 33).
`--safe --without-K --cubical-compatible`; no postulate in any import cone.

|Rocq leg
|`PROVEN`, route `re-proved`. `verification/proofs/coq/Cohort.v`, Rocq
8.18.0. The gate's `Print Assumptions` finds all 82 theorems closed under
the global context. The standard library's `PeanoNat` and `Lia` prove the
natural-number arithmetic; `Unset Lia Cache` keeps `lia` from writing a
8.18.0. The gate's `Print Assumptions` finds all 89 theorems closed under
the global context, and since 2026-11-17 every definition and fixpoint as
Comment thread
coderabbitai[bot] marked this conversation as resolved.
Resolved
well: 134 declarations in all (82 theorems at the current receipt; the
seven added for APP-1's middle clause have no receipt yet). The kernel
checker `coqchk -o` finds no axiom, type-in-type, unsafe (co)fixpoint or
assumed positivity in the compiled library or its import cone, the
standard library included (gate, 2026-11-17). The standard library's
`PeanoNat` and `Lia` prove the natural-number arithmetic; `Unset Lia Cache` keeps `lia` from writing a
file.

|Lean leg
|`PROVEN`, route `re-proved`. `verification/proofs/lean4/Cohort.lean`,
Lean 4.29.0, core only. The gate's audit finds no axiom in any of the 95
theorems. No `simp`, `omega` or `ac_rfl`: each brings `propext` in.
Lean 4.29.0, core only. The gate's audit finds no axiom in any of the 102
theorems or in the 128 definitions with a source range (95 theorems at the
current receipt; the seven added for APP-1's middle clause have no receipt
yet), and the file declares no axiom of its own. No `simp`, `omega` or `ac_rfl`: each brings `propext` in.

|Statement correspondence (§2.2)
|Compared by reading, item by item. Each target restates every Agda
Expand Down Expand Up @@ -293,6 +336,27 @@ bash tests/proofs/gate_controls_test.sh agda
|===
|Date |Change

|2026-11-17
|APP-1's middle clause is proved in Agda, Rocq and Lean (`verdict-missing`,
`verdict-not-false`, `verdict-not-yes`; owner ruling: prove, not narrow).
The gate's axiom audit now covers definitions as well as theorems, and an
audit that inspects nothing fails. Before this, a Lean `def` built on
`sorry` and a Rocq `Admitted` Definition each passed, and THY-1's Lean
results were never inspected. Review then found that the Rocq audit took
its declaration names from the source text, so an unused
`Local Definition planted : False. Admitted.` passed the gate (reproduced).
The Rocq audit now also runs the kernel checker `coqchk -o` on the compiled
library, which lists every assumption in the library and its import cone
however the source spells it, and the name reader skips comments. The Lean
audit now fails on any axiom the source declares, used or not; an unused
`axiom planted : False` passed it before (reproduced). Seven planted escapes
that passed the old gate (Rocq: Local, `#[local]`, Program, Instance, an
unused Axiom and a guard bypass; Lean: an unused axiom) now fail it, and a
declaration inside a comment no longer fails it. All three gates and their
controls pass locally. No receipt is earned yet: the receipt and the claim pins still name
`a1388fc`/`034f215`, which predate these theorems, and they move only once
CI has run on this change.

|2026-11-14
|The claim pins of THY-1 and APP-1 to APP-4 name the receipt at main
`a1388fc`. APP-1 to APP-4 are on the applied shelf. The claims registry
Expand Down
128 changes: 101 additions & 27 deletions scripts/check-proofs.sh
Original file line number Diff line number Diff line change
Expand Up @@ -99,13 +99,40 @@
# names an axiom. PROOF-POLICY §8.4: axioms travel with the grade.
# agda : the first-party modules of the import cone that Agda itself reports
# go through scan-postulates.sh (the reference gate of januskey).
# coq : `Print Assumptions` for every Theorem, Lemma, Corollary, Proposition,
# Fact and Remark of the file must print "Closed under the global
# context".
# lean4: every theorem the source declares must depend on no axiom
# (Lean.collectAxioms, the function behind #print axioms). The
# lemmas Lean generates for an inductive are not witnesses.
# Each audit fails closed: if it cannot show that it ran, the module fails.
# coq : two checks, both required.
# (1) coqchk -o, Rocq's independent kernel checker, re-checks the
# compiled library and its whole import cone (the standard library
# included) and lists every assumption in it: axioms (an Admitted
# proof is one), type-in-type, unsafe (co)fixpoints and assumed
# positivity. Each list must be <none>, and Set predicative. This
# reads the compiled library, not the source text, so no spelling
# escapes it: Local, #[local], Program, Instance, a nested Module,
# an unused Axiom and a guard bypass were each caught (measured
# 2026-11-17; the text matcher alone passed an unused
# `Local Definition planted : False. Admitted.`).
# (2) `Print Assumptions` for every Theorem, Lemma, Corollary,
# Proposition, Fact, Remark, Example, Definition, Fixpoint and
# CoFixpoint that the comment-free source declares (Local, Global,
# Program, Polymorphic, Monomorphic and #[...] prefixes allowed) must
# print "Closed under the global context". It names what the receipt
# covers, and it refuses a file that declares nothing.
# lean4: every theorem and every definition that carries a source range
# must depend on no axiom (Lean.collectAxioms, the function behind
# #print axioms), and the source may declare no axiom of its own,
# used or not. That covers each declaration of the source, and
# the definitions Lean generates for an inductive with its range
# (casesOn, recOn, below, brecOn, ...), which are counted too. The
# lemmas Lean generates (injEq, inj, sizeOf_spec) carry no range.
# (Measured 2026-11-17: before the axiom rule, a module holding a
# clean theorem and an unused `axiom planted : False` passed.)
# Definitions are audited as well as theorems because a development can
# carry its results as definitions: THY-1's Lean leg is Type-valued, so every
# result there is a `def`, and an audit of theorems alone inspected none of
# them (proof audit 2026-11-16, finding 31). Measured before this fix: a Lean
# module whose only declaration was `def planted : 2 + 2 = 5 := sorry`, or a
# Rocq file whose only declaration was an Admitted Definition, PASSED.
# Each audit fails closed: if it cannot show that it ran, or if it inspected
# no declaration at all, the module fails. An empty audit is not a clean one.
# Both axiom reports are transitive: a theorem's report covers every Fixpoint,
# Definition or def it uses. A declaration that no audited theorem uses is not
# reported; Lean still warns on its sorry, and Rocq still compiles its Admitted.
Expand Down Expand Up @@ -137,28 +164,63 @@
AUDIT_NOTE="postulates: none in the ${#own[@]} first-party module(s) of the import cone: $(sed -n 's/.*label="\([^"]*\)".*/\1/p' "$dir/cone.dot" | LC_ALL=C sort -u | tr '\n' ' ')"
;;
coq)
if ! command -v coqchk >/dev/null 2>&1; then
rm -rf "$dir"; LAST_OUT="axiom audit: coqchk not on PATH (the kernel audit cannot run, so the module fails)"; return 1
fi
base="$(basename "$rel" .v)"; copy="GateAudit_${base}"
# Comments (nested, across lines) and string literals are blanked first,
# as Rocq's lexer reads them, so a declaration in a comment is not
# collected. Line breaks are kept, so the Module stack sees real lines.
names="$(awk '
{ out = ""; n = length($0)
for (i = 1; i <= n; i++) {
c = substr($0, i, 1); two = substr($0, i, 2)
if (instr) { if (c == "\"") { if (substr($0, i + 1, 1) == "\"") i++; else instr = 0 }; continue }
if (c == "\"") { instr = 1; continue }
if (two == "(*") { depth++; i++; continue }
if (two == "*)" && depth > 0) { depth--; i++; continue }
if (depth == 0) out = out c }
print out }' "$ROOT/$root/$rel" | awk '
/^[ \t]*Module[ \t]+Type[ \t]/ { split($0, w, /[ \t.]+/); stack[++d] = "T:" w[4]; next }
/^[ \t]*Module[ \t]+[A-Za-z_][A-Za-z0-9_'\'']*[ \t]*\.[ \t]*$/ ||
/^[ \t]*Module[ \t]+[A-Za-z_][A-Za-z0-9_'\'']*[ \t]*[:(<]/ && !/:=/ {
s = $0; sub(/^[ \t]*Module[ \t]+/, "", s); sub(/[^A-Za-z0-9_'\''].*/, "", s); stack[++d] = "M:" s; next }
/^[ \t]*Section[ \t]/ { stack[++d] = "S:"; next }
/^[ \t]*End[ \t]/ { if (d > 0) d--; next }
/^[ \t]*(Theorem|Lemma|Corollary|Proposition|Fact|Remark)[ \t]/ {
s = $0; sub(/^[ \t]*[A-Za-z]+[ \t]+/, "", s); sub(/[^A-Za-z0-9_'\''].*/, "", s)
/^[ \t]*((Local|Global|Program|Polymorphic|Monomorphic|#\[[^]]*\])[ \t]+)*(Theorem|Lemma|Corollary|Proposition|Fact|Remark|Example|Definition|Fixpoint|CoFixpoint)[ \t]/ {
s = $0; sub(/^[ \t]*((Local|Global|Program|Polymorphic|Monomorphic|#\[[^]]*\])[ \t]+)*[A-Za-z]+[ \t]+/, "", s); sub(/[^A-Za-z0-9_'\''].*/, "", s)
q = ""; for (i = 1; i <= d; i++) if (stack[i] ~ /^M:/) q = q substr(stack[i], 3) "."
print q s }' "$ROOT/$root/$rel")"
if [ -z "$names" ]; then rm -rf "$dir"; LAST_OUT=""; AUDIT_NOTE="no theorem declared"; return 0; fi
print q s }')"
if [ -z "$names" ]; then rm -rf "$dir"; LAST_OUT="axiom audit: no theorem or definition declared, so nothing was audited"; return 1; fi

Check failure on line 194 in scripts/check-proofs.sh

View check run for this annotation

SonarQubeCloud / SonarCloud Code Analysis

Use '[[' instead of '[' for conditional tests. The '[[' construct is safer and more feature-rich.

See more on https://sonarcloud.io/project/issues?id=hyperpolymath_mathesis&issues=AaHnyLGTOWA8igf46Nm8&open=AaHnyLGTOWA8igf46Nm8&pullRequest=107
{ cat "$ROOT/$root/$rel"; echo; while IFS= read -r n; do echo "Print Assumptions $n."; done <<<"$names"; } \
>"$ROOT/$root/$copy.v"
set +e; out="$(cd "$ROOT/$root" && coqc "$copy.v" 2>&1)"; rc=$?; set -e
set +e; out="$(cd "$ROOT/$root" && coqc "$copy.v" 2>&1)"; rc=$?
# The kernel audit reads the library that coqc has just written.
chk=""; chk_rc=1
[ "$rc" -eq 0 ] && { chk="$(cd "$ROOT/$root" && coqchk -silent -o -Q . "" "$copy" 2>&1)"; chk_rc=$?; }

Check failure on line 200 in scripts/check-proofs.sh

View check run for this annotation

SonarQubeCloud / SonarCloud Code Analysis

Use '[[' instead of '[' for conditional tests. The '[[' construct is safer and more feature-rich.

See more on https://sonarcloud.io/project/issues?id=hyperpolymath_mathesis&issues=AaHrhW83rlOGN8JZO3PP&open=AaHrhW83rlOGN8JZO3PP&pullRequest=107
set -e
rm -f "$ROOT/$root/$copy".{v,vo,vok,vos,glob} "$ROOT/$root/.$copy".aux
expect="$(grep -c . <<<"$names")"
got="$(grep -c '^Closed under the global context' <<<"$out" || true)"
if [ "$rc" -eq 0 ] && [ "$got" -eq "$expect" ]; then rc=0
AUDIT_NOTE="Print Assumptions: closed under the global context for $expect theorem(s): $(tr '\n' ' ' <<<"$names")"
else rc=1; out="axiom audit: $got of $expect theorem(s) closed under the global context"$'\n'"$out"; fi
# coqchk exits 0 when it finds an assumption; only its summary tells.
# A list that is not empty prints its header with no value and the
# names on the lines below, so every "* " line must be one of these.
summary="$(sed -n '/^CONTEXT SUMMARY/,$p' <<<"$chk" | sed 's/[[:space:]]*$//')"
kernel_ok=0
if [ "$chk_rc" -eq 0 ] && [ -n "$summary" ] &&

Check failure on line 210 in scripts/check-proofs.sh

View check run for this annotation

SonarQubeCloud / SonarCloud Code Analysis

Use '[[' instead of '[' for conditional tests. The '[[' construct is safer and more feature-rich.

See more on https://sonarcloud.io/project/issues?id=hyperpolymath_mathesis&issues=AaHrhW83rlOGN8JZO3PR&open=AaHrhW83rlOGN8JZO3PR&pullRequest=107

Check failure on line 210 in scripts/check-proofs.sh

View check run for this annotation

SonarQubeCloud / SonarCloud Code Analysis

Use '[[' instead of '[' for conditional tests. The '[[' construct is safer and more feature-rich.

See more on https://sonarcloud.io/project/issues?id=hyperpolymath_mathesis&issues=AaHrhW83rlOGN8JZO3PQ&open=AaHrhW83rlOGN8JZO3PQ&pullRequest=107
! grep -E '^\* ' <<<"$summary" | grep -qvxE '\* (Theory: Set is predicative|[^:]+: <none>)'; then
kernel_ok=1
for h in "Axioms" "Constants/Inductives relying on type-in-type" \
"Constants/Inductives relying on unsafe (co)fixpoints" "Inductives whose positivity is assumed"; do
grep -qxF "* $h: <none>" <<<"$summary" || kernel_ok=0
done
grep -qxF "* Theory: Set is predicative" <<<"$summary" || kernel_ok=0
fi
if [ "$rc" -eq 0 ] && [ "$got" -eq "$expect" ] && [ "$kernel_ok" -eq 1 ]; then rc=0

Check failure on line 219 in scripts/check-proofs.sh

View check run for this annotation

SonarQubeCloud / SonarCloud Code Analysis

Use '[[' instead of '[' for conditional tests. The '[[' construct is safer and more feature-rich.

See more on https://sonarcloud.io/project/issues?id=hyperpolymath_mathesis&issues=AaHrhW83rlOGN8JZO3PT&open=AaHrhW83rlOGN8JZO3PT&pullRequest=107

Check failure on line 219 in scripts/check-proofs.sh

View check run for this annotation

SonarQubeCloud / SonarCloud Code Analysis

Use '[[' instead of '[' for conditional tests. The '[[' construct is safer and more feature-rich.

See more on https://sonarcloud.io/project/issues?id=hyperpolymath_mathesis&issues=AaHrhW83rlOGN8JZO3PS&open=AaHrhW83rlOGN8JZO3PS&pullRequest=107

Check failure on line 219 in scripts/check-proofs.sh

View check run for this annotation

SonarQubeCloud / SonarCloud Code Analysis

Use '[[' instead of '[' for conditional tests. The '[[' construct is safer and more feature-rich.

See more on https://sonarcloud.io/project/issues?id=hyperpolymath_mathesis&issues=AaHrhW83rlOGN8JZO3PU&open=AaHrhW83rlOGN8JZO3PU&pullRequest=107
AUDIT_NOTE="coqchk -o: no axiom, type-in-type, unsafe (co)fixpoint or assumed positivity in the library or its import cone; Print Assumptions: closed under the global context for $expect declaration(s): $(tr '\n' ' ' <<<"$names")"
elif [ "$rc" -eq 0 ] && [ "$got" -eq "$expect" ]; then rc=1

Check failure on line 221 in scripts/check-proofs.sh

View check run for this annotation

SonarQubeCloud / SonarCloud Code Analysis

Use '[[' instead of '[' for conditional tests. The '[[' construct is safer and more feature-rich.

See more on https://sonarcloud.io/project/issues?id=hyperpolymath_mathesis&issues=AaHrhW83rlOGN8JZO3PV&open=AaHrhW83rlOGN8JZO3PV&pullRequest=107

Check failure on line 221 in scripts/check-proofs.sh

View check run for this annotation

SonarQubeCloud / SonarCloud Code Analysis

Use '[[' instead of '[' for conditional tests. The '[[' construct is safer and more feature-rich.

See more on https://sonarcloud.io/project/issues?id=hyperpolymath_mathesis&issues=AaHrhW83rlOGN8JZO3PW&open=AaHrhW83rlOGN8JZO3PW&pullRequest=107
out="axiom audit: the kernel checker (coqchk -o) reports an assumption, or did not run (exit $chk_rc)"$'\n'"${summary:-$chk}"
else rc=1; out="axiom audit: $got of $expect declaration(s) closed under the global context"$'\n'"$out"; fi
;;
lean4)
{ echo "import Lean"; cat "$ROOT/$root/$rel"; cat <<'LEAN'
Expand All @@ -167,23 +229,35 @@
#eval show CommandElabM Unit from do
let env ← getEnv
let mut n := 0
let mut m := 0
for (name, ci) in env.constants.map₂.toList do
-- Only theorems the source declares: the lemmas Lean generates for an
-- inductive (injEq, inj, sizeOf_spec) carry no declaration range.
if let .thmInfo _ := ci then
if (← liftCoreM (findDeclarationRanges? name)).isNone then continue
n := n + 1
let axs ← Lean.collectAxioms name
unless axs.isEmpty do
logInfo m!"GATE-AXIOMS {name}: {axs.toList}"
logInfo m!"GATE-AUDIT-DONE {n}"
-- An axiom the source declares fails the module even if nothing uses it.
if let .axiomInfo _ := ci then
if (← liftCoreM (findDeclarationRanges? name)).isSome then
logInfo m!"GATE-AXIOMS {name}: declared by the source"
continue
-- Theorems and definitions the source declares: the declarations Lean
-- generates (injEq, inj, sizeOf_spec, match_1, …) carry no range.
let isThm := match ci with | .thmInfo _ => true | _ => false
let isDef := match ci with | .defnInfo _ => true | .opaqueInfo _ => true | _ => false
unless isThm || isDef do continue
if (← liftCoreM (findDeclarationRanges? name)).isNone then continue
if isThm then n := n + 1 else m := m + 1
let axs ← Lean.collectAxioms name
unless axs.isEmpty do
logInfo m!"GATE-AXIOMS {name}: {axs.toList}"
logInfo m!"GATE-AUDIT-DONE {n} {m}"
LEAN
} >"$dir/Audit.lean"
set +e; out="$(cd "$ROOT/$root" && lean "$dir/Audit.lean" 2>&1)"; rc=$?; set -e
if [ "$rc" -ne 0 ] || ! grep -q 'GATE-AUDIT-DONE' <<<"$out" || grep -q 'GATE-AXIOMS' <<<"$out"; then
rc=1; out="axiom audit: a theorem depends on an axiom, or the audit did not run"$'\n'"$(grep -E 'GATE-|error' <<<"$out" || printf '%s' "$out")"
thms="$(sed -n 's/.*GATE-AUDIT-DONE \([0-9]*\) \([0-9]*\).*/\1/p' <<<"$out")"
defs="$(sed -n 's/.*GATE-AUDIT-DONE \([0-9]*\) \([0-9]*\).*/\2/p' <<<"$out")"
if [ "$rc" -ne 0 ] || [ -z "$thms" ] || grep -q 'GATE-AXIOMS' <<<"$out"; then

Check failure on line 255 in scripts/check-proofs.sh

View check run for this annotation

SonarQubeCloud / SonarCloud Code Analysis

Use '[[' instead of '[' for conditional tests. The '[[' construct is safer and more feature-rich.

See more on https://sonarcloud.io/project/issues?id=hyperpolymath_mathesis&issues=AaHnyLGTOWA8igf46Nm9&open=AaHnyLGTOWA8igf46Nm9&pullRequest=107

Check failure on line 255 in scripts/check-proofs.sh

View check run for this annotation

SonarQubeCloud / SonarCloud Code Analysis

Use '[[' instead of '[' for conditional tests. The '[[' construct is safer and more feature-rich.

See more on https://sonarcloud.io/project/issues?id=hyperpolymath_mathesis&issues=AaHnyLGTOWA8igf46Nm-&open=AaHnyLGTOWA8igf46Nm-&pullRequest=107
rc=1; out="axiom audit: a declaration depends on an axiom, or the audit did not run"$'\n'"$(grep -E 'GATE-|error' <<<"$out" || printf '%s' "$out")"
elif [ $((thms + defs)) -eq 0 ]; then

Check failure on line 257 in scripts/check-proofs.sh

View check run for this annotation

SonarQubeCloud / SonarCloud Code Analysis

Use '[[' instead of '[' for conditional tests. The '[[' construct is safer and more feature-rich.

See more on https://sonarcloud.io/project/issues?id=hyperpolymath_mathesis&issues=AaHnyLGTOWA8igf46Nm_&open=AaHnyLGTOWA8igf46Nm_&pullRequest=107
rc=1; out="axiom audit: no theorem or definition declared, so nothing was audited"
fi
[ "$rc" -eq 0 ] && AUDIT_NOTE="axioms: none for $(sed -n 's/.*GATE-AUDIT-DONE \([0-9]*\).*/\1/p' <<<"$out") declared theorem(s)"
[ "$rc" -eq 0 ] && AUDIT_NOTE="axioms: none for $thms theorem(s) and $defs definition(s) with a source range"

Check failure on line 260 in scripts/check-proofs.sh

View check run for this annotation

SonarQubeCloud / SonarCloud Code Analysis

Use '[[' instead of '[' for conditional tests. The '[[' construct is safer and more feature-rich.

See more on https://sonarcloud.io/project/issues?id=hyperpolymath_mathesis&issues=AaHnyLGTOWA8igf46NnA&open=AaHnyLGTOWA8igf46NnA&pullRequest=107
;;
*) rc=0; out="" ;;
esac
Expand Down
Loading
Loading