[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 268 from proof inv-commit (previous step)

istore2[m0] = indexblock(indx, lax, m3), zh[rp] = mkznode(r, zbrar, boolvar, true, m), zh0[rp] = mkznode(r0, zbrar0, boolvar0, false, m4), remove-refsize0(istore4) = istore4, remove-refsize0(gstore3) = gstore3, elems nx0 ∩ ginval0 = ∅, dom remove-refsize0(gstore4) ∩ ginval0 = ∅, dom gstore3 ∪ elems nx0 = dom gstore4 ∪ ginval0, btree-inv(rp, adr, istore3[n, indexblock([], [], 0)], istore4, zh, ri, fi), btree-inv(rp, adr, istore3, istore4, zh, ri, fi), btree-inv(rp, @(m0, m1, m2), istore2, istore2, zh0, ri, ri), btree-inv(rp, adr, istore2[m0, indexblock(indx, lax, m3 - m2)], istore4, zh0[rp, mkznode(r0, zbrar0, boolvar0, true, m4)], ri, fi), inv(remove-refsize0(istore2)), inv(istore3[n, indexblock([], [], 0)]), inv(istore4), inv(istore3), inv(gstore3), inv(gstore4 \ ginval0), inv(istore2), inv(remove-refsize0(gstore4)), rp ∈ zh, istore4 ⊑ istore3[n, indexblock([], [], 0)], istore4 ⊑ istore3, istore3[n, indexblock([], [], 0)] ⊑ istore2, istore4 ⊑ istore2, pstate1.index? → pstate1.lnum ∈ istore2, pstate1.journal? → nx0 ≠ [] ∧ pstate1.lnum = nx0.last ∧ pstate1.lnum ∈ gstore4 ⊦ pstate1 = unbuffered, pstate1 = readonly, dups(nx0), n ∈ istore3, ∃ ri, fi. btree-inv(rp, @(m0, m1, m2), remove-refsize0(istore2), remove-refsize0(istore2), zh0, ri, fi)

User applied rule exists right

And obtained the following new goals

Proof step 269:
zh0[rp] = mkznode(r0, zbrar0, boolvar0, false, m4), zh[rp] = mkznode(r, zbrar, boolvar, true, m), istore2[m0] = indexblock(indx, lax, m3), remove-refsize0(gstore3) = gstore3, remove-refsize0(istore4) = istore4, dom remove-refsize0(gstore4) ∩ ginval0 = ∅, elems nx0 ∩ ginval0 = ∅, dom gstore3 ∪ elems nx0 = dom gstore4 ∪ ginval0, btree-inv(rp, adr, istore2[m0, indexblock(indx, lax, m3 - m2)], istore4, zh0[rp, mkznode(r0, zbrar0, boolvar0, true, m4)], ri, fi), btree-inv(rp, @(m0, m1, m2), istore2, istore2, zh0, ri, ri), btree-inv(rp, adr, istore3, istore4, zh, ri, fi), btree-inv(rp, adr, istore3[n, indexblock([], [], 0)], istore4, zh, ri, fi), inv(remove-refsize0(gstore4)), inv(istore2), inv(gstore4 \ ginval0), inv(gstore3), inv(istore3), inv(istore4), inv(istore3[n, indexblock([], [], 0)]), inv(remove-refsize0(istore2)), rp ∈ zh, istore4 ⊑ istore2, istore3[n, indexblock([], [], 0)] ⊑ istore2, istore4 ⊑ istore3, istore4 ⊑ istore3[n, indexblock([], [], 0)], pstate1.journal? → nx0 ≠ [] ∧ pstate1.lnum = nx0.last ∧ pstate1.lnum ∈ gstore4, pstate1.index? → pstate1.lnum ∈ istore2 ⊦ pstate1 = readonly, pstate1 = unbuffered, btree-inv(rp, @(m0, m1, m2), remove-refsize0(istore2), remove-refsize0(istore2), zh0, ri, ri), dups(nx0), n ∈ istore3

Rule argument

pos: right 5 terms: ri, ri abort: F discard: T computed: F

Additional information

Used terms: ri, ri