[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 15 from proof eq-io-readdir (previous step)

⟨{strings0 := dom dirs[inode.ino].entries; err := ESUCCESS} or {choose strings with true in strings0 := strings; fail#(; ; err)}⟩ (strings0 = strings1 ∧ err = err0), asynced ↔ asynced0, dirs1[m] = mkdir(m3, md0, m4, m5, entries), dirs = dirs1, files = files1, inode = mkinode(m, md, boolvar, m0, m1, m2), strings0 = strings2, m ∈ dirs1 ⊦ ∃ strings. ⟨strings2 := strings; fail#(; ; err)⟩ (strings2 = strings1 ∧ err = err0), dom entries = strings1 ∧ ESUCCESS = err0

Heuristic conditional left split applied rule or split left

And obtained the following new goals

Proof step 16:
⟨strings0 := dom dirs[inode.ino].entries; err := ESUCCESS⟩ (strings0 = strings1 ∧ err = err0), asynced ↔ asynced0, dirs1[m] = mkdir(m3, md0, m4, m5, entries), dirs = dirs1, files = files1, inode = mkinode(m, md, boolvar, m0, m1, m2), strings0 = strings2, m ∈ dirs1 ⊦ ∃ strings. ⟨strings2 := strings; fail#(; ; err)⟩ (strings2 = strings1 ∧ err = err0), dom entries = strings1 ∧ ESUCCESS = err0
Proof step 18:
⟨choose strings with true in strings0 := strings; fail#(; ; err)⟩ (strings0 = strings1 ∧ err = err0), asynced ↔ asynced0, dirs1[m] = mkdir(m3, md0, m4, m5, entries), dirs = dirs1, files = files1, inode = mkinode(m, md, boolvar, m0, m1, m2), strings0 = strings2, m ∈ dirs1 ⊦ ∃ strings. ⟨strings2 := strings; fail#(; ; err)⟩ (strings2 = strings1 ∧ err = err0), dom entries = strings1 ∧ ESUCCESS = err0

Proof step 15 from proof eq-io-readdir (previous step)

Heuristic conditional left split applied rule or split left

And obtained the following new goals

Rule argument

Additional information