[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 287 from proof inv-rename-dir-dentry (previous step)

# links(entries2[str], dirs0) = m22 + 1, (m0 = m18 ⊃ mkdir(m8, md2, m10, m11, entries1[str, entries0[str0]]);mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]])).meta:= md1 = mkdir(m, md9, m19, m20, entries5), (m6 = m0 ⊃ mkdir(m, md9, m19, m20, entries5) ;(m6 = m18 ⊃ mkdir(m1, md2, # links(m18, dirs0), m2, entries0 -- str0);mkdir(m27, md12, # links(m6, dirs0), m29, entries8)) ) = mkdir(m24, md11, m25, m26, entries7), (m18 = m0 ⊃ mkdir(m8, md1, m10, m11, entries1[str, entries0[str0]]);mkdir(m1, md2, # links(m18, dirs0), m2, entries0 -- str0)) = mkdir(m14, md8, m16, m17, entries4), (m0 = m18 ⊃ mkdir(m1, md0, # links(m18, dirs0), m2, entries0 -- str0);mkdir(m4, md3, # links(m0, dirs0), m7, entries2)) = mkdir(m8, md6, m10, m11, entries1), dcache0[dentrykey(m6, str1)] = mkdentry(str1, entries8[str1]), dirs0[m6] = mkdir(m27, md12, # links(m6, dirs0), m29, entries8), dirs0[entries0[str0]] = mkdir(m3, md4, # links(entries0[str0], dirs0), m5, entries), dirs0[entries2[str]] = mkdir(m21, md5, m22 + 1, m23, ∅), dirs0[m0] = mkdir(m4, md3, # links(m0, dirs0), m7, entries2), dirs0[m18] = mkdir(m1 + 1, md0, # links(m18, dirs0), m2 + 1, entries0), links (m6, dirs0 [m18, (m18 = m0 ⊃ mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]]);mkdir(m1, md0, # links(m18, dirs0), m2, entries0 -- str0)).meta:= md2 ] [m0, mkdir(m, md9, m19, m20, entries5) ]) = ∅, afs-cons(dirs0, files), afs-cons (dirs0 [m18, (m18 = m0 ⊃ mkdir(m8, md6, m10, m11, entries1[str, entries0[str0]]);mkdir(m1, md0, # links(m18, dirs0), m2, entries0 -- str0)).meta:= md2 ] [m0, mkdir(m, md9, m19, m20, entries5) ] [entries2[str], mkdir(m21, md, m22, m23, ∅) ], files), synced(dirs0, icache0, pcache), str1 ∈ entries8, m6 ∈ dirs0, dentrykey(m6, str1) ∈ dcache0, str ∈ entries2, m18 ∈ dirs0, str0 ∈ entries0, entries0[str0] ∈ dirs0, entries2[str] ∈ dirs0, m0 ∈ dirs0, asynced2 → synced(files, icache0, pcache), m0 = m18 → md1 = md2, ∀ 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?, links(m0, dirs0) ≠ ∅ ∨ m0 = ROOT_INO, links(m18, dirs0) ≠ ∅ ∨ m18 = ROOT_INO, entries8[str1] ∈ dirs0 ∨ entries8[str1] ∈ files ⊦ # links(m6, dirs0) = 0, entries2[str] = ROOT_INO, dentrykey(m6, str1) = dentrykey(m18, str0), dentrykey(m6, str1) = dentrykey(m0, str), links(m6, dirs0) = ∅, m0 = entries2[str], m18 = entries2[str], m6 = entries2[str], m6 = ROOT_INO, m18 = m0 ∧ mkdentry(str, entries2[str]) = mkdentry(str0, entries0[str0])

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Rule argument

fma: mkdentry(str, entries2[str]) = mkdentry(str0, entries0[str0])

Additional information

Used simplifier rules: ⊦ mkdentry(str, m) = mkdentry(str0, m0) ↔ str = str0 ∧ m = m0; (ws)%⊦ mkdir(m, md, m0, m1, entries).meta:= md0 = mkdir(m, md0, m0, m1, entries); (s)%⊦ mkdir(m, md, m0, m1, entries) = mkdir(m2, md0, m3, m4, entries0) ↔ m = m2 ∧ md = md0 ∧ m0 = m3 ∧ m1 = m4 ∧ entries = entries0; (ws)%afs-cons-dir-nlink: ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs ∧ dirs[ino] = mkdir(n0, md, n, n1, entries) → # links(ino, dirs) = n; (forward) from specification afs-base% ⊦ entries[str] = ino ∧ str ∈ entries → entries[str, ino] = entries; (s)%⊦ ino ∈ dirs ∧ dirs[ino] = mkdir(m0, md0, n1, n2, entries) ∧ ino ≠ ino1 → links(ino0, dirs[ino1, ad][ino, mkdir(m, md, n, n0, entries)]) = links(ino0, dirs[ino1, ad]); (s)%⊦ ino0 ∈ dirs → links(ino, dirs[ino0, mkdir(m, md, n0, n1, entries -- str)]) = (str ∈ entries ∧ entries[str] = ino ⊃ links(ino, dirs[ino0, mkdir(m, md, n0, n1, entries)]) -- mklink(ino0, str) ;links(ino, dirs[ino0, mkdir(m, md, n0, n1, entries)]) ); (s)%⊦ ino ∈ dirs ∧ dirs[ino] = mkdir(m0, md0, n1, n2, entries) → links(ino0, dirs[ino, mkdir(m, md, n, n0, entries)]) = links(ino0, dirs); (s)%⊦ afs-cons(dirs, files) → ( links(ino, dirs) = ∅ ↔ (ino ∈ dirs → dirs[ino].nlink = 0) ∧ (ino ∈ files → files[ino].nlink = 0)); (ws)% ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs → ¬ ino ∈ files; (s)% ⊦ mkdir(m, md, m0, m1, entries).nlink = m0; (s) Used formulas: mkdentry(str, entries2[str]) = mkdentry(str0, entries0[str0])