[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 81 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[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), dirs = dirs0[m0, mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]])] [m, (m = m0 ⊃ mkdir(m1 + 1, md4, m4, m6, entries0[str0, entries1[str]]);mkdir(m2, md2, # links(m, dirs0), m5, entries1 -- str)).meta:= md0 ], ino = inode.ino, inode = mkinode(m0, md1, true, # links(m0, dirs0), m9, m7), afs-cons(dirs0, files), ino ∈ dirs, str ∈ entries1, entries1[str] ∈ files, m0 ∈ dirs0, m ∈ dirs0, m0 = m → md1 = md0, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO, links(m0, dirs0) ≠ ∅ ∨ m0 = ROOT_INO ⊦ afs-cons(dirs[ino, dirs[ino].meta:= inode.meta], files), ino ∈ files, entries1[str] ∈ dirs0, str0 ∈ entries2

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 82:
(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)

Rule argument

Additional information

Used simplifier rules: afs-cons-reduce: ⊦ afs-cons(dirs0, files0) → ( afs-cons(dirs1, files1) ↔ (∀ ino, name, n. ROOT_INO ∈ dirs0 ∧ ( ino ∈ dirs0 ∧ ino ≠ ROOT_INO ∧ links(ino, dirs0) = ∅ → dir-empty(ino, dirs0, files0)) ∧ ( ino ∈ dirs0 → ¬ ino ∈ files0 ∧ dirs0[ino].nlink = # links(ino, dirs0) ∧ dirs0[ino].nlink ≤ 1 ∧ dirs0[ino].size = # dirs0[ino].entries ∧ dirs0[ino].nsubdirs = # subdirs(ino, dirs0)) ∧ ( ino ∈ files0 → ¬ ino ∈ dirs0 ∧ files0[ino].nlink = # links(ino, dirs0)) ∧ ( ino ∈ dirs0 ∧ name ∈ dirs0[ino].entries → valid-ino(dirs0[ino].entries[name], dirs0, files0)) ∧ ( ino ∈ files0 ∧ n ∈ files0[ino].content → valid-pagesize(ino, n, files0)) → ROOT_INO ∈ dirs1 ∧ ( ino ∈ dirs1 ∧ ino ≠ ROOT_INO ∧ links(ino, dirs1) = ∅ → dir-empty(ino, dirs1, files1)) ∧ ( ino ∈ dirs1 → ¬ ino ∈ files1 ∧ dirs1[ino].nlink = # links(ino, dirs1) ∧ dirs1[ino].nlink ≤ 1 ∧ dirs1[ino].size = # dirs1[ino].entries ∧ dirs1[ino].nsubdirs = # subdirs(ino, dirs1)) ∧ ( ino ∈ files1 → ¬ ino ∈ dirs1 ∧ files1[ino].nlink = # links(ino, dirs1)) ∧ ( ino ∈ dirs1 ∧ name ∈ dirs1[ino].entries → valid-ino(dirs1[ino].entries[name], dirs1, files1)) ∧ ( ino ∈ files1 ∧ n ∈ files1[ino].content → valid-pagesize(ino, n, files1))));% ⊦ afs-cons(dirs, files) → ROOT_INO ∈ dirs; (ss)%⊦ valid-pagesize(ino, n, files) ↔ # files[ino].content[n] = VFS_PAGE_SIZE; (s)% ⊦ valid-ino(ino, dirs, files) ↔ ino ∈ dirs ∨ ino ∈ files; (s)% ⊦ dir-empty(ino, dirs, files) ↔ dirs[ino].entries = ∅; (s)% ⊦ dirs[ino, ad][ino0, ad0][ino, ad1] = dirs[ino0, ad0][ino, ad1]; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (s)%⊦ mkdir(m, md, m0, m1, entries).meta:= md0 = mkdir(m, md0, m0, m1, entries); (s)% ⊦ dirs[ino, ad][ino0] = (ino0 = ino ∧ ino ∈ dirs ⊃ ad;dirs[ino0]); (s)% ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs → ¬ ino ∈ files; (s)% ⊦ ino ∈ dirs[ino0, ad] ↔ ino ∈ dirs; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)