[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 82 from proof afs-cons-rename-file-negdentry (previous step)

(m0 = m ⊃ mkdir(m2, md2, # links(m, dirs0), m5, entries1 -- str);mkdir(m7, md5, # links(m0, dirs0), m9, entries2)) = mkdir(m1, md4, m4, m6, entries0), dirs0[m0] = mkdir(m7, md5, # links(m0, dirs0), m9, entries2), files[entries1[str]] = mkfile(m3, md, # links(entries1[str], dirs0), content0), dirs0[m] = mkdir(m2 + 1, md2, # links(m, dirs0), m5, entries1), afs-cons(dirs0, files), m ∈ dirs0, entries1[str] ∈ files, str ∈ entries1, m0 ∈ dirs0, ROOT_INO ∈ dirs0, m0 = m → md1 = md0, ino ∈ dirs0 ∧ ino ≠ ROOT_INO ∧ links(ino, dirs0) = ∅ → dirs0[ino].entries = ∅, 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 ∈ files → ¬ ino ∈ dirs0 ∧ files[ino].nlink = # links(ino, dirs0), ino ∈ dirs0 ∧ name ∈ dirs0[ino].entries → dirs0[ino].entries[name] ∈ dirs0 ∨ dirs0[ino].entries[name] ∈ files, ino ∈ files ∧ n ∈ files[ino].content → # files[ino].content[n] = VFS_PAGE_SIZE, links(m0, dirs0) ≠ ∅ ∨ m0 = ROOT_INO, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO ⊦ str0 ∈ entries2, entries1[str] ∈ dirs0, ( ino ∈ dirs0 ∧ ino ≠ ROOT_INO ∧ links (ino, dirs0 [m, (m = m0 ⊃ mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]]);mkdir(m2, md2, # links(m, dirs0), m5, entries1 -- str)) .meta:= md0 ] [m0, (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ]) = ∅ → (ino = m0 ⊃ (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ;(ino = m ⊃ mkdir(m2, md0, # links(m, dirs0), m5, entries1 -- str);dirs0[ino]) ) .entries = ∅) ∧ ( ino ∈ dirs0 → (ino = m0 ⊃ (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ;(ino = m ⊃ mkdir(m2, md0, # links(m, dirs0), m5, entries1 -- str);dirs0[ino]) ) .nlink = # links (ino, dirs0 [m, (m = m0 ⊃ mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]]);mkdir(m2, md2, # links(m, dirs0), m5, entries1 -- str)) .meta:= md0 ] [m0, (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ]) ∧ (ino = m0 ⊃ (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ;(ino = m ⊃ mkdir(m2, md0, # links(m, dirs0), m5, entries1 -- str);dirs0[ino]) ) .nlink ≤ 1 ∧ (ino = m0 ⊃ (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ;(ino = m ⊃ mkdir(m2, md0, # links(m, dirs0), m5, entries1 -- str);dirs0[ino]) ) .size = # (ino = m0 ⊃ (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ;(ino = m ⊃ mkdir(m2, md0, # links(m, dirs0), m5, entries1 -- str);dirs0[ino]) ) .entries ∧ (ino = m0 ⊃ (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ;(ino = m ⊃ mkdir(m2, md0, # links(m, dirs0), m5, entries1 -- str);dirs0[ino]) ) .nsubdirs = # subdirs (ino, dirs0 [m, (m = m0 ⊃ mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]]);mkdir(m2, md2, # links(m, dirs0), m5, entries1 -- str)) .meta:= md0 ] [m0, (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ])) ∧ ( ino ∈ files → ¬ ino ∈ dirs0 ∧ files[ino].nlink = # links (ino, dirs0 [m, (m = m0 ⊃ mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]]);mkdir(m2, md2, # links(m, dirs0), m5, entries1 -- str)) .meta:= md0 ] [m0, (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ])) ∧ ( ino ∈ dirs0 ∧ name ∈ (ino = m0 ⊃ (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ;(ino = m ⊃ mkdir(m2, md0, # links(m, dirs0), m5, entries1 -- str);dirs0[ino]) ) .entries → (ino = m0 ⊃ (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ;(ino = m ⊃ mkdir(m2, md0, # links(m, dirs0), m5, entries1 -- str);dirs0[ino]) ) .entries [name ] ∈ dirs0 ∨ (ino = m0 ⊃ (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ;(ino = m ⊃ mkdir(m2, md0, # links(m, dirs0), m5, entries1 -- str);dirs0[ino]) ) .entries [name ] ∈ files)

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 83:
(m0 = m ⊃ mkdir(m2, md2, # links(m, dirs0), m5, entries1 -- str);mkdir(m7, md5, # links(m0, dirs0), m9, entries2)) = mkdir(m1, md4, m4, m6, entries0), dirs0[m] = mkdir(m2 + 1, md2, # links(m, dirs0), m5, entries1), files[entries1[str]] = mkfile(m3, md, # links(entries1[str], dirs0), content0), dirs0[m0] = mkdir(m7, md5, # links(m0, dirs0), m9, entries2), files[ino] = mkfile(m8, md3, m10, content), afs-cons(dirs0, files), ROOT_INO ∈ dirs0, m0 ∈ dirs0, str ∈ entries1, entries1[str] ∈ files, m ∈ dirs0, ino ∈ files ∧ n ∈ content → # content[n] = VFS_PAGE_SIZE, ino ∈ dirs0 ∧ name ∈ dirs0[ino].entries → dirs0[ino].entries[name] ∈ dirs0 ∨ dirs0[ino].entries[name] ∈ files, ino ∈ files → ¬ ino ∈ dirs0 ∧ m10 = # 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 = ∅, m0 = m → md1 = md0, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO, links(m0, dirs0) ≠ ∅ ∨ m0 = ROOT_INO ⊦ entries1[str] ∈ dirs0, str0 ∈ entries2, ( ino ∈ dirs0 ∧ ino ≠ ROOT_INO ∧ links (ino, dirs0 [m, (m = m0 ⊃ mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]]);mkdir(m2, md2, # links(m, dirs0), m5, entries1 -- str)) .meta:= md0 ] [m0, (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ]) = ∅ → (ino = m0 ⊃ (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ;(ino = m ⊃ mkdir(m2, md0, # links(m, dirs0), m5, entries1 -- str);dirs0[ino]) ) .entries = ∅) ∧ ( ino ∈ dirs0 → (ino = m0 ⊃ (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ;(ino = m ⊃ mkdir(m2, md0, # links(m, dirs0), m5, entries1 -- str);dirs0[ino]) ) .nlink = # links (ino, dirs0 [m, (m = m0 ⊃ mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]]);mkdir(m2, md2, # links(m, dirs0), m5, entries1 -- str)) .meta:= md0 ] [m0, (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ]) ∧ (ino = m0 ⊃ (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ;(ino = m ⊃ mkdir(m2, md0, # links(m, dirs0), m5, entries1 -- str);dirs0[ino]) ) .nlink ≤ 1 ∧ (ino = m0 ⊃ (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ;(ino = m ⊃ mkdir(m2, md0, # links(m, dirs0), m5, entries1 -- str);dirs0[ino]) ) .size = # (ino = m0 ⊃ (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ;(ino = m ⊃ mkdir(m2, md0, # links(m, dirs0), m5, entries1 -- str);dirs0[ino]) ) .entries ∧ (ino = m0 ⊃ (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ;(ino = m ⊃ mkdir(m2, md0, # links(m, dirs0), m5, entries1 -- str);dirs0[ino]) ) .nsubdirs = # subdirs (ino, dirs0 [m, (m = m0 ⊃ mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]]);mkdir(m2, md2, # links(m, dirs0), m5, entries1 -- str)) .meta:= md0 ] [m0, (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ])) ∧ ( ino ∈ files → ¬ ino ∈ dirs0 ∧ m10 = # links (ino, dirs0 [m, (m = m0 ⊃ mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]]);mkdir(m2, md2, # links(m, dirs0), m5, entries1 -- str)) .meta:= md0 ] [m0, (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ])) ∧ ( ino ∈ dirs0 ∧ name ∈ (ino = m0 ⊃ (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ;(ino = m ⊃ mkdir(m2, md0, # links(m, dirs0), m5, entries1 -- str);dirs0[ino]) ) .entries → (ino = m0 ⊃ (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ;(ino = m ⊃ mkdir(m2, md0, # links(m, dirs0), m5, entries1 -- str);dirs0[ino]) ) .entries [name ] ∈ dirs0 ∨ (ino = m0 ⊃ (m0 = m ⊃ mkdir(m1 + 1, md0, m4, m6, entries0[str0, entries1[str]]);mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])).meta:= md1 ;(ino = m ⊃ mkdir(m2, md0, # links(m, dirs0), m5, entries1 -- str);dirs0[ino]) ) .entries [name ] ∈ files)

Rule argument

spec: abstract-file name: elim seq: ⊦ ((m = af.size ∧ md = af.meta) ∧ m0 = af.nlink) ∧ content = af.content ↔ af = mkfile(m, md, m0, content) subst: [af, m, md, m0, content] → [files[ino], m8, md3, m10, content]

Additional information

Used simplifier rules: ⊦ ((m = af.size ∧ md = af.meta) ∧ m0 = af.nlink) ∧ content = af.content ↔ af = mkfile(m, md, m0, content); (elim) Used terms: files[ino], m8, md3, m10, content