[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 233 from proof inv-rename-file-negdentry (previous step)

# links (entries[str], dirs0[m8, mkdir(m2, md0, # links(m8, dirs0), m5, entries -- str)] [m, mkdir(m1 + 1, md5, # links(m, dirs0), m14, entries1[str0, entries[str]]) ]) = # links(entries[str], dirs0), (m19 = m ⊃ mkdir(m1 + 1, md5, # links(m, dirs0), m14, entries1[str0, entries[str]]) ;(m19 = m8 ⊃ mkdir(m2, md0, # links(m8, dirs0), m5, entries -- str);mkdir(m18, md8, # links(m19, dirs0), m20, entries5)) ) = mkdir(m15, md7, m16, m17, entries4), dcache0[dentrykey(m19, str1)] = mkdentry(str1, entries5[str1]), dirs0[m] = mkdir(m1, md2, # links(m, dirs0), m14, entries1), files[entries[str]] = mkfile(m3, md, # links(entries[str], dirs0), content0), dirs0[m8] = mkdir(m2 + 1, md3, # links(m8, dirs0), m5, entries), dirs0[m19] = mkdir(m18, md8, # links(m19, dirs0), m20, entries5), afs-cons(dirs0, files), afs-cons (dirs0[m8, mkdir(m2, md0, # links(m8, dirs0), m5, entries -- str)] [m, mkdir(m1 + 1, md5, # links(m, dirs0), m14, entries1[str0, entries[str]]) ], files), synced(dirs0, icache0, pcache), str1 ∈ entries5, m19 ∈ dirs0, dentrykey(m19, str1) ∈ dcache0, m ∈ dirs0, m8 ∈ dirs0, entries[str] ∈ files, str ∈ entries, m ∈ dirs0[m8, mkdir(m2, md0, # links(m8, dirs0), m5, entries -- str)], asynced2 → synced(files, icache0, pcache), ∀ key0. key0 ∈ dcache0 → key0.dentry? ∧ key0.name = dcache0[key0].name ∧ key0.ino ∈ dirs0 ∧ (links(key0.ino, dirs0) ≠ ∅ ∨ key0.ino = ROOT_INO) ∧ (dcache0[key0].ino ∈ dirs0 ∨ dcache0[key0].ino ∈ files) ∧ dcache0[key0].name ∈ dirs0[key0.ino].entries ∧ dcache0[key0].ino = dirs0[key0.ino].entries[dcache0[key0].name] ∧ dcache0[key0].dentry?, entries5[str1] ∈ dirs0 ∨ entries5[str1] ∈ files, links(m19, dirs0) ≠ ∅ ∨ m19 = ROOT_INO, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO, links(m8, dirs0) ≠ ∅ ∨ m8 = ROOT_INO ⊦ dentrykey(m19, str1) = dentrykey(m8, str), dentrykey(m19, str1) = dentrykey(m, str0), m8 = m, str0 ∈ entries1, entries[str] ∈ dirs0, str1 ∈ entries4

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 234:
#((links(entries[str], dirs0) -- mklink(m8, str)) ++ mklink(m, str0)) = # links(entries[str], dirs0), (m19 = m ⊃ mkdir(m1 + 1, md5, # links(m, dirs0), m14, entries1[str0, entries[str]]) ;(m19 = m8 ⊃ mkdir(m2, md0, # links(m8, dirs0), m5, entries -- str);mkdir(m18, md8, # links(m19, dirs0), m20, entries5)) ) = mkdir(m15, md7, m16, m17, entries4), dirs0[m19] = mkdir(m18, md8, # links(m19, dirs0), m20, entries5), dirs0[m8] = mkdir(m2 + 1, md3, # links(m8, dirs0), m5, entries), files[entries[str]] = mkfile(m3, md, # links(entries[str], dirs0), content0), dirs0[m] = mkdir(m1, md2, # links(m, dirs0), m14, entries1), dcache0[dentrykey(m19, str1)] = mkdentry(str1, entries5[str1]), afs-cons (dirs0[m8, mkdir(m2, md0, # links(m8, dirs0), m5, entries -- str)] [m, mkdir(m1 + 1, md5, # links(m, dirs0), m14, entries1[str0, entries[str]]) ], files), afs-cons(dirs0, files), synced(dirs0, icache0, pcache), str ∈ entries, entries[str] ∈ files, m8 ∈ dirs0, dentrykey(m19, str1) ∈ dcache0, m19 ∈ dirs0, str1 ∈ entries5, m ∈ dirs0, asynced2 → synced(files, icache0, pcache), ∀ key0. key0 ∈ dcache0 → key0.dentry? ∧ key0.name = dcache0[key0].name ∧ key0.ino ∈ dirs0 ∧ (links(key0.ino, dirs0) ≠ ∅ ∨ key0.ino = ROOT_INO) ∧ (dcache0[key0].ino ∈ dirs0 ∨ dcache0[key0].ino ∈ files) ∧ dcache0[key0].name ∈ dirs0[key0.ino].entries ∧ dcache0[key0].ino = dirs0[key0.ino].entries[dcache0[key0].name] ∧ dcache0[key0].dentry?, links(m8, dirs0) ≠ ∅ ∨ m8 = ROOT_INO, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO, links(m19, dirs0) ≠ ∅ ∨ m19 = ROOT_INO, entries5[str1] ∈ dirs0 ∨ entries5[str1] ∈ files ⊦ dentrykey(m19, str1) = dentrykey(m, str0), dentrykey(m19, str1) = dentrykey(m8, str), m8 = m, str1 ∈ entries4, entries[str] ∈ dirs0, str0 ∈ entries1

Rule argument

Additional information

Used simplifier rules: ⊦ ino ∈ dirs[ino0, ad] ↔ ino ∈ dirs; (s)%⊦ ino ∈ dirs ∧ dirs[ino] = mkdir(m0, md0, n1, n2, entries) → links(ino0, dirs[ino, mkdir(m, md, n, n0, entries)]) = links(ino0, dirs); (s)%⊦ ino0 ∈ dirs → links(ino, dirs[ino0, mkdir(m, md, n0, n1, entries -- str)]) = (str ∈ entries ∧ entries[str] = ino ⊃ links(ino, dirs[ino0, mkdir(m, md, n0, n1, entries)]) -- mklink(ino0, str) ;links(ino, dirs[ino0, mkdir(m, md, n0, n1, entries)]) ); (s)%⊦ ino ∈ dirs ∧ dirs[ino] = mkdir(m0, md0, n1, n2, entries) ∧ ino ≠ ino1 → links(ino0, dirs[ino1, ad][ino, mkdir(m, md, n, n0, entries)]) = links(ino0, dirs[ino1, ad]); (s)%⊦ p_ino ∈ dirs → links (ino0, dirs[p_ino, mkdir(m0, md, n, n0, entries[str, ino])]) = (ino = ino0 ⊃ links(ino0, dirs[p_ino, mkdir(m0, md, n, n0, entries)]) ++ mklink(p_ino, str) ;(str ∈ entries ∧ entries[str] = ino0 ⊃ links(ino0, dirs[p_ino, mkdir(m0, md, n, n0, entries)]) -- mklink(p_ino, str) ;links(ino0, dirs[p_ino, mkdir(m0, md, n, n0, entries)]) ) ); (s)