| # links(entries2[str], dirs0) = m22 + 1, dcache0[dentrykey(m18, str1)] = mkdentry(str1, entries2[str1]), dirs0[m18] = mkdir(m + 1, md3, # links(m18, dirs0), m20 + 1, entries2), dirs0[entries2[str0]] = mkdir(m3, md4, # links(entries2[str0], dirs0), m5, entries), dirs0[entries2[str]] = mkdir(m21, md5, m22 + 1, m23, ∅), afs-cons(dirs0, files), afs-cons (dirs0[m18, mkdir(m, md9, # links(m18, dirs0), m20, (entries2 -- str0)[str, entries2[str0]])][entries2[str], mkdir(m21, md, m22, m23, ∅)], files), synced(dirs0, icache0, pcache), str1 ∈ entries2, dentrykey(m18, str1) ∈ dcache0, str ∈ entries2, str0 ∈ entries2, entries2[str0] ∈ dirs0, entries2[str] ∈ dirs0, m18 ∈ dirs0, asynced2 → synced(files, icache0, pcache), ∀ key0. key0 ∈ dcache0 → key0.dentry? ∧ key0.name = dcache0[key0].name ∧ key0.ino ∈ dirs0 ∧ (links(key0.ino, dirs0) ≠ ∅ ∨ key0.ino = ROOT_INO) ∧ (dcache0[key0].ino ∈ dirs0 ∨ dcache0[key0].ino ∈ files) ∧ dcache0[key0].name ∈ dirs0[key0.ino].entries ∧ dcache0[key0].ino = dirs0[key0.ino].entries[dcache0[key0].name] ∧ dcache0[key0].dentry?, entries2[str1] ∈ dirs0 ∨ entries2[str1] ∈ files, links(m18, dirs0) ≠ ∅ ∨ m18 = ROOT_INO ⊦ entries2[str] = ROOT_INO, entries2[str1] = (entries2 -- str0)[str, entries2[str0]][str1], dentrykey(m18, str1) = dentrykey(m18, str0), dentrykey(m18, str1) = dentrykey(m18, str), m18 = entries2[str], mkdentry(str, entries2[str]) = mkdentry(str0, entries2[str0]) |
⊦ str ≠ str0 → entries[str0, ino][str] = entries[str]
Used simplifier rules: str ≠ str0 ⊦ (entries -- str0)[str] = entries[str]; (s) Used terms: str1, entries2[str0], str, entries2 -- str0