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

# links(entries0[str], dirs0) = m1 + 1, (ino = entries0[str] ⊃ mkfile(m0, md1, m1, content);mkfile(m4, md, m5, content0)) = mkfile(m6, md0, m7, content1), dirs0[m] = mkdir(m2 + 1, md2, # links(m, dirs0), m3, entries0), files0[entries0[str]] = mkfile(m0, md1, m1 + 1, content), files0[ino] = mkfile(m4, md, m5, content0), afs-cons(dirs0, files0), ROOT_INO ∈ dirs0, entries0[str] ∈ files0, str ∈ entries0, m ∈ dirs0, ino ∈ dirs0 ∧ name ∈ dirs0[ino].entries → dirs0[ino].entries[name] ∈ dirs0 ∨ dirs0[ino].entries[name] ∈ files0, ino ∈ files0 → ¬ ino ∈ dirs0 ∧ m5 = # links(ino, dirs0), ino ∈ dirs0 → dirs0[ino].nlink = # links(ino, dirs0) ∧ dirs0[ino].nlink ≤ 1 ∧ dirs0[ino].size = # dirs0[ino].entries ∧ dirs0[ino].nsubdirs = # subdirs(ino, dirs0), ino ∈ dirs0 ∧ ino ≠ ROOT_INO ∧ links(ino, dirs0) = ∅ → dirs0[ino].entries = ∅, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO ⊦ ( ino ∈ dirs0 ∧ ino ≠ ROOT_INO ∧ (entries0[str] = ino ⊃ links(entries0[str], dirs0) -- mklink(m, str);links(ino, dirs0)) = ∅ → (ino = m ⊃ mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str);dirs0[ino]).entries = ∅) ∧ ( ino ∈ dirs0 → (ino = m ⊃ mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str);dirs0[ino]).nlink = # (entries0[str] = ino ⊃ links(entries0[str], dirs0) -- mklink(m, str);links(ino, dirs0)) ∧ (ino = m ⊃ mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str);dirs0[ino]).nlink ≤ 1 ∧ (ino = m ⊃ mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str);dirs0[ino]).size = # (ino = m ⊃ mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str);dirs0[ino]).entries ∧ (ino = m ⊃ mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str);dirs0[ino]).nsubdirs = # subdirs(ino, dirs0[m, mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str)])) ∧ (ino ∈ files0 → ¬ ino ∈ dirs0 ∧ m7 = # (entries0[str] = ino ⊃ links(entries0[str], dirs0) -- mklink(m, str);links(ino, dirs0))) ∧ ( ino ∈ dirs0 ∧ name ∈ (ino = m ⊃ mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str);dirs0[ino]).entries → (ino = m ⊃ mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str);dirs0[ino]).entries[name] ∈ dirs0 ∨ (ino = m ⊃ mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str);dirs0[ino]).entries[name] ∈ files0) ∧ (ino ∈ files0 ∧ n ∈ content1 → # content1[n] = VFS_PAGE_SIZE)

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 41:
# links(entries0[str], dirs0) = m1 + 1, (ino = entries0[str] ⊃ mkfile(m0, md1, m1, content);mkfile(m4, md, m5, content0)) = mkfile(m6, md0, m7, content1), files0[ino] = mkfile(m4, md, m5, content0), files0[entries0[str]] = mkfile(m0, md1, m1 + 1, content), dirs0[m] = mkdir(m2 + 1, md2, # links(m, dirs0), m3, entries0), dirs0[ino] = mkdir(m8, md3, m9, m10, entries), afs-cons(dirs0, files0), m ∈ dirs0, str ∈ entries0, entries0[str] ∈ files0, ROOT_INO ∈ dirs0, ino ∈ dirs0 ∧ ino ≠ ROOT_INO ∧ links(ino, dirs0) = ∅ → entries = ∅, ino ∈ dirs0 → m9 = # links(ino, dirs0) ∧ m9 ≤ 1 ∧ m8 = # entries ∧ m10 = # subdirs(ino, dirs0), ino ∈ files0 → ¬ ino ∈ dirs0 ∧ m5 = # links(ino, dirs0), ino ∈ dirs0 ∧ name ∈ entries → entries[name] ∈ dirs0 ∨ entries[name] ∈ files0, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO ⊦ ( ino ∈ dirs0 ∧ ino ≠ ROOT_INO ∧ (entries0[str] = ino ⊃ links(entries0[str], dirs0) -- mklink(m, str);links(ino, dirs0)) = ∅ → (ino = m ⊃ mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str);dirs0[ino]).entries = ∅) ∧ ( ino ∈ dirs0 → (ino = m ⊃ mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str);dirs0[ino]).nlink = # (entries0[str] = ino ⊃ links(entries0[str], dirs0) -- mklink(m, str);links(ino, dirs0)) ∧ (ino = m ⊃ mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str);dirs0[ino]).nlink ≤ 1 ∧ (ino = m ⊃ mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str);dirs0[ino]).size = # (ino = m ⊃ mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str);dirs0[ino]).entries ∧ (ino = m ⊃ mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str);dirs0[ino]).nsubdirs = # subdirs(ino, dirs0[m, mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str)])) ∧ (ino ∈ files0 → ¬ ino ∈ dirs0 ∧ m7 = # (entries0[str] = ino ⊃ links(entries0[str], dirs0) -- mklink(m, str);links(ino, dirs0))) ∧ ( ino ∈ dirs0 ∧ name ∈ (ino = m ⊃ mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str);dirs0[ino]).entries → (ino = m ⊃ mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str);dirs0[ino]).entries[name] ∈ dirs0 ∨ (ino = m ⊃ mkdir(m2, md2, # links(m, dirs0), m3, entries0 -- str);dirs0[ino]).entries[name] ∈ files0) ∧ (ino ∈ files0 ∧ n ∈ content1 → # content1[n] = VFS_PAGE_SIZE)

Rule argument

spec: abstract-dir name: elim seq: ⊦ ( ((m = ad.size ∧ md = ad.meta) ∧ m0 = ad.nlink) ∧ m1 = ad.nsubdirs) ∧ entries = ad.entries ↔ ad = mkdir(m, md, m0, m1, entries) subst: [ad, m, md, m0, m1, entries] → [dirs0[ino], m8, md3, m9, m10, entries]

Additional information

Used simplifier rules: ⊦ ( ((m = ad.size ∧ md = ad.meta) ∧ m0 = ad.nlink) ∧ m1 = ad.nsubdirs) ∧ entries = ad.entries ↔ ad = mkdir(m, md, m0, m1, entries); (elim) Used terms: dirs0[ino], m8, md3, m9, m10, entries