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

isdir ↔ old_ino = new_ino ∧ new_dent = old_dent, isdir0 ↔ new_dent.dentry?, dirs0[entries[str]] = mkdir(m0, md2, # links(entries[str], dirs0), m4, entries2), dirs0[ino1] = mkdir(m3, md, # links(ino1, dirs0), m6, entries), dirs0[ino0] = mkdir(m, md1, # links(ino0, dirs0), m2, entries1), dirs0[entries1[str0]] = mkdir(0, md3, # links(entries1[str0], dirs0), m1, ∅), dirs = dirs1[new_ino, dirs1[new_ino].entries:= dirs1[new_ino].entries[new_dent.name, old_dent.ino]], dirs1 = dirs0[old_ino, dirs0[old_ino].entries:= (dirs0[old_ino].entries -- old_dent.name)], err = ESUCCESS, isdir, isdir0, new_child_inode = p_inode, new_dent = mkdentry(str0, entries1[str0]), new_ino = new_parent_inode.ino, new_inode = mkinode(ino0, md1, true, # links(ino0, dirs0), m2, m), new_parent_inode = new_inode, old_child_inode = old_dent_inode, old_dent = mkdentry(str, entries[str]), old_dent_inode = mkinode(entries[str], md2, true, # links(entries[str], dirs0), m4, m0), old_ino = old_parent_inode.ino, old_inode = mkinode(ino1, md, true, # links(ino1, dirs0), m6, m3), old_parent_inode = old_inode, p_inode = mkinode(entries1[str0], md3, true, # links(entries1[str0], dirs0), m1, 0), old_dent.dentry?, dom of < ino2, afs-cons(dirs0, files), ispath(q, ROOT_INO, ino1, dirs0, files), ispath(q0, ROOT_INO, ino0, dirs0, files), of-cons(of, dirs0, files), pre-rename(old_parent_inode, old_dent, old_child_inode, new_parent_inode, new_dent, new_child_inode, dirs0, files), pw(user, md), pw(user, md2), pw(user, md1), px(user, md1), px(user, md), px-parent(user, q, ROOT_INO, dirs0, files), px-parent(user, q0, ROOT_INO, dirs0, files), str ∈ entries, entries1[str0] ∈ dirs0, ino0 ∈ dirs0, ino1 ∈ dirs0, entries[str] ∈ dirs0, str0 ∈ entries1, ino0 = ino1 → md1 = md, links(ino1, dirs0) ≠ ∅ ∨ ino1 = ROOT_INO, links(ino0, dirs0) ≠ ∅ ∨ ino0 = ROOT_INO ⊦ [afs_inode_sync#(old_parent_inode; dirs, files); afs_inode_sync#(new_parent_inode; dirs, files); if isdir0 then {afs_inode_sync#(new_child_inode; dirs, files); new_child_inode := getinode(new_child_inode.ino, dirs, files)}; old_parent_inode := getinode(old_parent_inode.ino, dirs, files); new_parent_inode := getinode(new_parent_inode.ino, dirs, files); err := ESUCCESS; asynced := ?] (afs-cons(dirs, files) → ⟪vfs_put_inode#(new_child_inode, of, asynced; err, dirs, files)⟫ (of-cons(of, dirs, files) ∧ afs-cons(dirs, files))), entries1[str0] = ROOT_INO, entries[str] = ROOT_INO, q + str ' ⊑ q0 + str0 '

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ dirs[ino, ad][ino, ad0] = dirs[ino, ad0]; (s)% ⊦ entries[str] = ino ∧ str ∈ entries → entries[str, ino] = entries; (s)% ⊦ (entries -- str)[str, ino] = entries[str, ino]; (s)%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%⊦ getinode(ino, dirs, files) = (ino ∈ dirs ⊃ mkinode (ino, dirs[ino].meta, true, dirs[ino].nlink, dirs[ino].nsubdirs, dirs[ino].size) ;mkinode (ino, files[ino].meta, false, files[ino].nlink, 0, files[ino].size) ); (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (s)% ⊦ dir-empty(ino, dirs, files) ↔ dirs[ino].entries = ∅; (s)% ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs → ¬ ino ∈ files; (s)% ⊦ valid-file-ino(ino, dirs, files) ↔ ino ∈ files; (s)%⊦ valid-file-inode(inode, dirs, files) ↔ valid-file-ino(inode.ino, dirs, files) ∧ inode.nlink = files[inode.ino].nlink ∧ inode.nsubdirs = 0 ∧ ¬ inode.directory; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).directory ↔ boolvar; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nsubdirs = m1; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nlink = m0; (s)% ⊦ valid-dir-ino(ino, dirs, files) ↔ ino ∈ dirs; (s)%⊦ valid-dir-inode(inode, dirs, files) ↔ valid-dir-ino(inode.ino, dirs, files) ∧ inode.nlink = dirs[inode.ino].nlink ∧ inode.size = dirs[inode.ino].size ∧ inode.nsubdirs = dirs[inode.ino].nsubdirs ∧ inode.directory; (s)%⊦ valid-wb-inode(inode, dirs, files) ↔ valid-dir-inode(inode, dirs, files) ∨ valid-file-inode(inode, dirs, files); (s)% ⊦ valid-ino(ino, dirs, files) ↔ ino ∈ dirs ∨ ino ∈ files; (s)%⊦ valid-dentry(ino, dent, dirs, files) ↔ valid-parent-ino(ino, dirs, files) ∧ valid-ino(dent.ino, dirs, files) ∧ dent.name ∈ dirs[ino].entries ∧ dent.ino = dirs[ino].entries[dent.name] ∧ dent.dentry?; (s)% ⊦ ¬ mkdentry(str, m).negdentry?; (s)%⊦ valid-parent-ino(ino, dirs, files) ↔ ino ∈ dirs ∧ (links(ino, dirs) ≠ ∅ ∨ ino = ROOT_INO); (s)%⊦ valid-negdentry(ino, dent, dirs, files) ↔ valid-parent-ino(ino, dirs, files) ∧ ¬ dent.name ∈ dirs[ino].entries ∧ dent.negdentry?; (s)%⊦ pre-rename (old_parent_inode, old_dent, old_child_inode, new_parent_inode, new_dent, new_child_inode, dirs, files) ↔ ( valid-negdentry(new_parent_inode.ino, new_dent, dirs, files) ∨ valid-dentry(new_parent_inode.ino, new_dent, dirs, files) ∧ valid-wb-inode(new_child_inode, dirs, files) ∧ new_child_inode.ino = new_dent.ino ∧ ( valid-file-ino(new_dent.ino, dirs, files) ↔ valid-file-ino(old_dent.ino, dirs, files)) ∧ ( valid-dir-ino(new_dent.ino, dirs, files) → new_dent.ino ≠ ROOT_INO ∧ dir-empty(new_dent.ino, dirs, files))) ∧ valid-dentry(old_parent_inode.ino, old_dent, dirs, files) ∧ valid-dir-inode(old_parent_inode, dirs, files) ∧ valid-dir-inode(new_parent_inode, dirs, files) ∧ ( new_parent_inode.ino = old_parent_inode.ino → new_parent_inode.meta = old_parent_inode.meta) ∧ valid-wb-inode(old_child_inode, dirs, files) ∧ old_child_inode.ino = old_dent.ino; (s)% ⊦ mkdentry(str, m) = mkdentry(str0, m0) ↔ str = str0 ∧ m = m0; (ws)% ⊦ (ad.entries:= entries).entries = entries; (s)% ⊦ mkdentry(str, m).dentry?; (s)% ⊦ mkdentry(str, m).ino = m; (s)% ⊦ dirs[ino, ad][ino0] = (ino0 = ino ∧ ino ∈ dirs ⊃ ad;dirs[ino0]); (s)% ⊦ mkdentry(str, m).name = str; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)