[Imprint][Data Privacy Statement][E-Mail]

View long theorem info. View the proof. Back to main index. View the specification. View theorem base summary, View theorem base listing, the used properties by spec, the dependency list, the symbol table,

Proof step 13 from proof abs-reduce0 (previous step)

# pebs = # apebs, apebs[n] = mkpeb(aehdr0, avhdr0, buf0, m0, boolvar0), pebs[n] = mkpeb(buf1, m1, boolvar1), n < # apebs, ubi-io-inv(apebs), (peb.bad ↔ boolvar0) ∧ ( ¬ peb.bad → peb.fill = (aehdr0 = empty ⊃ 0;(avhdr0 = empty ⊃ EB_PAGE_SIZE;m0 + 2 * EB_PAGE_SIZE)) ∧ (aehdr0 = empty → subarray(peb.data, 0, EB_PAGE_SIZE) = emptypage) ∧ (aehdr0.valid? → is-encoded(echdr(aehdr0.ec), subarray(peb.data, 0, EB_PAGE_SIZE))) ∧ (aehdr0 = garbage → is-garbage-ec(subarray(peb.data, 0, EB_PAGE_SIZE)) ∧ subarray(peb.data, 0, EB_PAGE_SIZE) ≠ emptypage) ∧ (avhdr0 = empty → subarray(peb.data, EB_PAGE_SIZE, EB_PAGE_SIZE) = emptypage) ∧ ( avhdr0.valid? → is-encoded(vidhdr(avhdr0.vol, avhdr0.leb, avhdr0.sqn, avhdr0.size, avhdr0.checksum), subarray(peb.data, EB_PAGE_SIZE, EB_PAGE_SIZE))) ∧ ( avhdr0 = garbage → is-garbage-vid(subarray(peb.data, EB_PAGE_SIZE, EB_PAGE_SIZE)) ∧ subarray(peb.data, EB_PAGE_SIZE, EB_PAGE_SIZE) ≠ emptypage) ∧ subarray(peb.data, 2 * EB_PAGE_SIZE, LEB_SIZE) = buf0) → (boolvar1 ↔ boolvar) ∧ ( ¬ boolvar → m1 = (aehdr = empty ⊃ 0;(avhdr = empty ⊃ EB_PAGE_SIZE;m + 2 * EB_PAGE_SIZE)) ∧ (aehdr = empty → subarray(buf1, 0, EB_PAGE_SIZE) = emptypage) ∧ (aehdr.valid? → is-encoded(echdr(aehdr.ec), subarray(buf1, 0, EB_PAGE_SIZE))) ∧ (aehdr = garbage → is-garbage-ec(subarray(buf1, 0, EB_PAGE_SIZE)) ∧ subarray(buf1, 0, EB_PAGE_SIZE) ≠ emptypage) ∧ (avhdr = empty → subarray(buf1, EB_PAGE_SIZE, EB_PAGE_SIZE) = emptypage) ∧ (avhdr.valid? → is-encoded(vidhdr(avhdr.vol, avhdr.leb, avhdr.sqn, avhdr.size, avhdr.checksum), subarray(buf1, EB_PAGE_SIZE, EB_PAGE_SIZE))) ∧ (avhdr = garbage → is-garbage-vid(subarray(buf1, EB_PAGE_SIZE, EB_PAGE_SIZE)) ∧ subarray(buf1, EB_PAGE_SIZE, EB_PAGE_SIZE) ≠ emptypage) ∧ subarray(buf1, 2 * EB_PAGE_SIZE, LEB_SIZE) = buf), ∀ n0. n0 < # apebs → (pebs[n, peb][n0].bad ↔ apebs[n0].bad) ∧ ( ¬ pebs[n, peb][n0].bad → pebs[n, peb][n0].fill = (apebs[n0].echdr = empty ⊃ 0;(apebs[n0].vidhdr = empty ⊃ EB_PAGE_SIZE;apebs[n0].fill + 2 * EB_PAGE_SIZE)) ∧ (apebs[n0].echdr = empty → subarray(pebs[n, peb][n0].data, 0, EB_PAGE_SIZE) = emptypage) ∧ (apebs[n0].echdr.valid? → is-encoded(echdr(apebs[n0].echdr.ec), subarray(pebs[n, peb][n0].data, 0, EB_PAGE_SIZE))) ∧ ( apebs[n0].echdr = garbage → is-garbage-ec(subarray(pebs[n, peb][n0].data, 0, EB_PAGE_SIZE)) ∧ subarray(pebs[n, peb][n0].data, 0, EB_PAGE_SIZE) ≠ emptypage) ∧ (apebs[n0].vidhdr = empty → subarray(pebs[n, peb][n0].data, EB_PAGE_SIZE, EB_PAGE_SIZE) = emptypage) ∧ ( apebs[n0].vidhdr.valid? → is-encoded (vidhdr(apebs[n0].vidhdr.vol, apebs[n0].vidhdr.leb, apebs[n0].vidhdr.sqn, apebs[n0].vidhdr.size, apebs[n0].vidhdr.checksum), subarray(pebs[n, peb][n0].data, EB_PAGE_SIZE, EB_PAGE_SIZE))) ∧ ( apebs[n0].vidhdr = garbage → is-garbage-vid(subarray(pebs[n, peb][n0].data, EB_PAGE_SIZE, EB_PAGE_SIZE)) ∧ subarray(pebs[n, peb][n0].data, EB_PAGE_SIZE, EB_PAGE_SIZE) ≠ emptypage) ∧ subarray(pebs[n, peb][n0].data, 2 * EB_PAGE_SIZE, LEB_SIZE) = apebs[n0].data) ⊦ ∀ n0. n0 < # apebs → (pebs[n0].bad ↔ apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].bad) ∧ ( ¬ pebs[n0].bad → pebs[n0].fill = (apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].echdr = empty ⊃ 0 ;(apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].vidhdr = empty ⊃ EB_PAGE_SIZE ;apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].fill + 2 * EB_PAGE_SIZE ) ) ∧ (apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].echdr = empty → subarray(pebs[n0].data, 0, EB_PAGE_SIZE) = emptypage) ∧ ( apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].echdr.valid? → is-encoded(echdr(apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].echdr.ec), subarray(pebs[n0].data, 0, EB_PAGE_SIZE))) ∧ ( apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].echdr = garbage → is-garbage-ec(subarray(pebs[n0].data, 0, EB_PAGE_SIZE)) ∧ subarray(pebs[n0].data, 0, EB_PAGE_SIZE) ≠ emptypage) ∧ (apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].vidhdr = empty → subarray(pebs[n0].data, EB_PAGE_SIZE, EB_PAGE_SIZE) = emptypage) ∧ ( apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].vidhdr.valid? → is-encoded (vidhdr (apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].vidhdr.vol, apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].vidhdr.leb, apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].vidhdr.sqn, apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].vidhdr.size, apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].vidhdr.checksum), subarray(pebs[n0].data, EB_PAGE_SIZE, EB_PAGE_SIZE))) ∧ ( apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].vidhdr = garbage → is-garbage-vid(subarray(pebs[n0].data, EB_PAGE_SIZE, EB_PAGE_SIZE)) ∧ subarray(pebs[n0].data, EB_PAGE_SIZE, EB_PAGE_SIZE) ≠ emptypage) ∧ subarray(pebs[n0].data, 2 * EB_PAGE_SIZE, LEB_SIZE) = apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].data)

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 14:
# pebs = # apebs, apebs[n] = mkpeb(aehdr0, avhdr0, buf0, m0, boolvar0), pebs[n] = mkpeb(buf1, m1, boolvar1), n < # apebs, n0 < # apebs, ubi-io-inv(apebs), (peb.bad ↔ boolvar0) ∧ ( ¬ peb.bad → peb.fill = (aehdr0 = empty ⊃ 0;(avhdr0 = empty ⊃ EB_PAGE_SIZE;m0 + 2 * EB_PAGE_SIZE)) ∧ (aehdr0 = empty → subarray(peb.data, 0, EB_PAGE_SIZE) = emptypage) ∧ (aehdr0.valid? → is-encoded(echdr(aehdr0.ec), subarray(peb.data, 0, EB_PAGE_SIZE))) ∧ (aehdr0 = garbage → is-garbage-ec(subarray(peb.data, 0, EB_PAGE_SIZE)) ∧ subarray(peb.data, 0, EB_PAGE_SIZE) ≠ emptypage) ∧ (avhdr0 = empty → subarray(peb.data, EB_PAGE_SIZE, EB_PAGE_SIZE) = emptypage) ∧ ( avhdr0.valid? → is-encoded(vidhdr(avhdr0.vol, avhdr0.leb, avhdr0.sqn, avhdr0.size, avhdr0.checksum), subarray(peb.data, EB_PAGE_SIZE, EB_PAGE_SIZE))) ∧ ( avhdr0 = garbage → is-garbage-vid(subarray(peb.data, EB_PAGE_SIZE, EB_PAGE_SIZE)) ∧ subarray(peb.data, EB_PAGE_SIZE, EB_PAGE_SIZE) ≠ emptypage) ∧ subarray(peb.data, 2 * EB_PAGE_SIZE, LEB_SIZE) = buf0) → (boolvar1 ↔ boolvar) ∧ ( ¬ boolvar → m1 = (aehdr = empty ⊃ 0;(avhdr = empty ⊃ EB_PAGE_SIZE;m + 2 * EB_PAGE_SIZE)) ∧ (aehdr = empty → subarray(buf1, 0, EB_PAGE_SIZE) = emptypage) ∧ (aehdr.valid? → is-encoded(echdr(aehdr.ec), subarray(buf1, 0, EB_PAGE_SIZE))) ∧ (aehdr = garbage → is-garbage-ec(subarray(buf1, 0, EB_PAGE_SIZE)) ∧ subarray(buf1, 0, EB_PAGE_SIZE) ≠ emptypage) ∧ (avhdr = empty → subarray(buf1, EB_PAGE_SIZE, EB_PAGE_SIZE) = emptypage) ∧ (avhdr.valid? → is-encoded(vidhdr(avhdr.vol, avhdr.leb, avhdr.sqn, avhdr.size, avhdr.checksum), subarray(buf1, EB_PAGE_SIZE, EB_PAGE_SIZE))) ∧ (avhdr = garbage → is-garbage-vid(subarray(buf1, EB_PAGE_SIZE, EB_PAGE_SIZE)) ∧ subarray(buf1, EB_PAGE_SIZE, EB_PAGE_SIZE) ≠ emptypage) ∧ subarray(buf1, 2 * EB_PAGE_SIZE, LEB_SIZE) = buf), ∀ n0. n0 < # apebs → (pebs[n, peb][n0].bad ↔ apebs[n0].bad) ∧ ( ¬ pebs[n, peb][n0].bad → pebs[n, peb][n0].fill = (apebs[n0].echdr = empty ⊃ 0;(apebs[n0].vidhdr = empty ⊃ EB_PAGE_SIZE;apebs[n0].fill + 2 * EB_PAGE_SIZE)) ∧ (apebs[n0].echdr = empty → subarray(pebs[n, peb][n0].data, 0, EB_PAGE_SIZE) = emptypage) ∧ (apebs[n0].echdr.valid? → is-encoded(echdr(apebs[n0].echdr.ec), subarray(pebs[n, peb][n0].data, 0, EB_PAGE_SIZE))) ∧ ( apebs[n0].echdr = garbage → is-garbage-ec(subarray(pebs[n, peb][n0].data, 0, EB_PAGE_SIZE)) ∧ subarray(pebs[n, peb][n0].data, 0, EB_PAGE_SIZE) ≠ emptypage) ∧ (apebs[n0].vidhdr = empty → subarray(pebs[n, peb][n0].data, EB_PAGE_SIZE, EB_PAGE_SIZE) = emptypage) ∧ ( apebs[n0].vidhdr.valid? → is-encoded (vidhdr(apebs[n0].vidhdr.vol, apebs[n0].vidhdr.leb, apebs[n0].vidhdr.sqn, apebs[n0].vidhdr.size, apebs[n0].vidhdr.checksum), subarray(pebs[n, peb][n0].data, EB_PAGE_SIZE, EB_PAGE_SIZE))) ∧ ( apebs[n0].vidhdr = garbage → is-garbage-vid(subarray(pebs[n, peb][n0].data, EB_PAGE_SIZE, EB_PAGE_SIZE)) ∧ subarray(pebs[n, peb][n0].data, EB_PAGE_SIZE, EB_PAGE_SIZE) ≠ emptypage) ∧ subarray(pebs[n, peb][n0].data, 2 * EB_PAGE_SIZE, LEB_SIZE) = apebs[n0].data) ⊦ (pebs[n0].bad ↔ apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].bad) ∧ ( ¬ pebs[n0].bad → pebs[n0].fill = (apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].echdr = empty ⊃ 0 ;(apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].vidhdr = empty ⊃ EB_PAGE_SIZE ;apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].fill + 2 * EB_PAGE_SIZE ) ) ∧ (apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].echdr = empty → subarray(pebs[n0].data, 0, EB_PAGE_SIZE) = emptypage) ∧ ( apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].echdr.valid? → is-encoded(echdr(apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].echdr.ec), subarray(pebs[n0].data, 0, EB_PAGE_SIZE))) ∧ ( apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].echdr = garbage → is-garbage-ec(subarray(pebs[n0].data, 0, EB_PAGE_SIZE)) ∧ subarray(pebs[n0].data, 0, EB_PAGE_SIZE) ≠ emptypage) ∧ (apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].vidhdr = empty → subarray(pebs[n0].data, EB_PAGE_SIZE, EB_PAGE_SIZE) = emptypage) ∧ ( apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].vidhdr.valid? → is-encoded (vidhdr (apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].vidhdr.vol, apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].vidhdr.leb, apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].vidhdr.sqn, apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].vidhdr.size, apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].vidhdr.checksum), subarray(pebs[n0].data, EB_PAGE_SIZE, EB_PAGE_SIZE))) ∧ ( apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].vidhdr = garbage → is-garbage-vid(subarray(pebs[n0].data, EB_PAGE_SIZE, EB_PAGE_SIZE)) ∧ subarray(pebs[n0].data, EB_PAGE_SIZE, EB_PAGE_SIZE) ≠ emptypage) ∧ subarray(pebs[n0].data, 2 * EB_PAGE_SIZE, LEB_SIZE) = apebs[n, mkpeb(aehdr, avhdr, buf, m, boolvar)][n0].data)

Rule argument

Additional information

Used simplifier rules: lf-01: ⊦ m < n ∧ n = n0 → m < n0; (forward) from specification nat-basic