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

ginval = ginval1, ginval0 = ginval2, gstore = gstore1, gstore0 = gstore2, istore = istore1, istore0 = istore2, remove-refsize0(istore1) = istore1, remove-refsize0(gstore1) = gstore1, elems nx ∩ ginval2 = ∅, dom gstore1 ∪ elems nx = dom gstore2 ∪ ginval2, inv(istore1), inv(istore2), inv(gstore1), inv(gstore2 \ ginval2), istore1 ⊑ istore2, pstate = unbuffered → syn, pstate.index? → pstate.lnum ∈ istore2, pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore2 ⊦ ⟪if pstate = readonly then err := EROFS else if pstate = unbuffered then err := ESUCCESS else {fail_or_success#(; ; err); syn := err = ESUCCESS; skip or pstate := readonly}⟫ ( (pstate.journal? → nx ≠ [] ∧ pstate.lnum = nx.last ∧ pstate.lnum ∈ gstore2) ∧ (pstate.index? → pstate.lnum ∈ istore2) ∧ (pstate = unbuffered → syn)), dups(nx)

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information