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

dirs[ino0] = mkdir(m, md, # links(ino0, dirs), m1, entries), err = ESUCCESS, inode = mkinode(ino0, md, true, # links(ino0, dirs), m1, m), strings0 = strings, afs-cons(dirs, files), ispath(p0, ROOT_INO, ino0, dirs, files), of-cons(of, dirs, files), pr(user, md), px-parent(user, p0, ROOT_INO, dirs, files), ino0 ∈ dirs ⊦ ⟪{strings0 := dom dirs[inode.ino].entries; err := ESUCCESS} or {choose strings with true in strings0 := strings; fail#(; ; err)}⟫ true

Heuristic conditional right split applied rule or split right

And obtained the following new goals

Proof step 40:
dirs[ino0] = mkdir(m, md, # links(ino0, dirs), m1, entries), err = ESUCCESS, inode = mkinode(ino0, md, true, # links(ino0, dirs), m1, m), strings0 = strings, afs-cons(dirs, files), ispath(p0, ROOT_INO, ino0, dirs, files), of-cons(of, dirs, files), pr(user, md), px-parent(user, p0, ROOT_INO, dirs, files), ino0 ∈ dirs ⊦ ⟪strings0 := dom dirs[inode.ino].entries; err := ESUCCESS⟫ true
Proof step 42:
dirs[ino0] = mkdir(m, md, # links(ino0, dirs), m1, entries), err = ESUCCESS, inode = mkinode(ino0, md, true, # links(ino0, dirs), m1, m), strings0 = strings, afs-cons(dirs, files), ispath(p0, ROOT_INO, ino0, dirs, files), of-cons(of, dirs, files), pr(user, md), px-parent(user, p0, ROOT_INO, dirs, files), ino0 ∈ dirs ⊦ ⟪choose strings with true in strings0 := strings; fail#(; ; err)⟫ true

Proof step 39 from proof inv-readdir (previous step)

Heuristic conditional right split applied rule or split right

And obtained the following new goals

Rule argument

Additional information