| # entries1 = m1 + 1, files[m] = mkfile(m8, md3, m10, content), dirs0[m] = mkdir(m1 + 1, md2, # links(m, dirs0), # subdirs(m, dirs0), entries1), files[entries1[str]] = mkfile(m3, md, # links(entries1[str], dirs0), content0), afs-cons(dirs0, files), name ∈ (entries1 -- str)[str0, entries1[str]], ROOT_INO ∈ dirs0, str ∈ entries1, entries1[str] ∈ files, m ∈ dirs0, # links(m, dirs0) ≤ 1, name ∈ entries1 → entries1[name] ∈ dirs0 ∨ entries1[name] ∈ files, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO ⊦ entries1 = ∅, entries1[str] ∈ dirs0, str0 ∈ entries1, (entries1 -- str)[str0, entries1[str]][name] ∈ dirs0, (entries1 -- str)[str0, entries1[str]][name] ∈ files, m ≠ ROOT_INO ∧ links(m, dirs0) = ∅ |
# entries1 = m1 + 1, files[entries1[str]] = mkfile(m3, md, # links(entries1[str], dirs0), content0), dirs0[m] = mkdir(m1 + 1, md2, # links(m, dirs0), # subdirs(m, dirs0), entries1), files[m] = mkfile(m8, md3, m10, content), afs-cons(dirs0, files), m ∈ dirs0, entries1[str] ∈ files, str ∈ entries1, ROOT_INO ∈ dirs0, name ∈ (entries1 -- str)[str0, entries1[str]], # links(m, dirs0) ≤ 1, name ∈ entries1 → entries1[name] ∈ dirs0 ∨ entries1[name] ∈ files, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO ⊦ entries1 = ∅, name = str0, (entries1 -- str)[str0, entries1[str]][name] ∈ files, (entries1 -- str)[str0, entries1[str]][name] ∈ dirs0, str0 ∈ entries1, entries1[str] ∈ dirs0, m ≠ ROOT_INO ∧ links(m, dirs0) = ∅
Used simplifier rules: ⊦ str ∈ entries[str, ino]; (s)% ⊦ entries[str, ino][str] = ino; (s)%⊦ ino ∈ dirs ∧ dirs[ino] = mkdir(n0, md, n, n1, entries) ∧ str ∈ entries ∧ afs-cons(dirs, files) → (entries[str] ∈ files ↔ ¬ entries[str] ∈ dirs); (ss) Used formulas: name = str0