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

# links (entries[str], dirs0 [m8, (m8 = m ⊃ mkdir(m1 + 1, md2, m4, m6, entries1[str0, entries[str]]);mkdir(m2, md3, # links(m8, dirs0), m5, entries -- str)).meta:= md0 ] [m, mkdir(m12, md5, m13, m14, entries3) ]) = # links(entries[str], dirs0), (m = m8 ⊃ mkdir(m1 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m1 + 1, md2, m4, m6, entries1[str0, entries[str]])) = mkdir(m12, md6, m13, m14, entries3), (m8 = m ⊃ mkdir(m1 + 1, md5, m4, m6, entries1[str0, entries[str]]);mkdir(m2, md0, # links(m8, dirs0), m5, entries -- str)) = mkdir(m0, md1, m10, m11, entries0), (m = m8 ⊃ mkdir(m2, md3, # links(m8, dirs0), m5, entries -- str);mkdir(m7, md4, # links(m, dirs0), m9, entries2)) = mkdir(m1, md2, m4, m6, entries1), (key.ino = m ⊃ mkdir(m12, md5, m13, m14, entries3) ;(key.ino = m8 ⊃ mkdir(m2, md0, # links(key.ino, dirs0), m5, entries -- str);mkdir(m18, md8, m19, m20, entries5)) ) = mkdir(m15, md7, m16, m17, entries4), dirs0[m] = mkdir(m7, md4, # links(m, dirs0), m9, entries2), files[entries[str]] = mkfile(m3, md, # links(entries[str], dirs0), content0), dirs0[m8] = mkdir(m2 + 1, md3, # links(m8, dirs0), m5, entries), dirs0[key.ino] = mkdir(m18, md8, m19, m20, entries5), key = dentrykey(m, str0), afs-cons (dirs0[m8, (m8 = m ⊃ mkdir(m1 + 1, md2, m4, m6, entries1[str0, entries[str]]);mkdir(m2, md3, # links(m8, dirs0), m5, entries -- str)).meta:= md0] [m, mkdir(m12, md5, m13, m14, entries3) ], files), afs-cons(dirs0, files), synced(dirs0, icache0, pcache), m ∈ dirs0, m8 ∈ dirs0, entries[str] ∈ files, str ∈ entries, key ∈ (dcache0 -- dentrykey(m8, str))[dentrykey(m, str0), mkdentry(str0, entries[str])], key ∈ dcache0 → key.dentry? ∧ key.name = dcache0[key].name ∧ key.ino ∈ dirs0 ∧ (links(key.ino, dirs0) ≠ ∅ ∨ key.ino = ROOT_INO) ∧ (dcache0[key].ino ∈ dirs0 ∨ dcache0[key].ino ∈ files) ∧ dcache0[key].name ∈ entries5 ∧ dcache0[key].ino = entries5[dcache0[key].name] ∧ dcache0[key].dentry?, m = m8 → md5 = md0, 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(m, dirs0) ≠ ∅ ∨ m = ROOT_INO, links(m8, dirs0) ≠ ∅ ∨ m8 = ROOT_INO ⊦ str0 ∈ entries2, entries[str] ∈ dirs0, key.dentry? ∧ key.name = (dcache0 -- dentrykey(m8, str))[dentrykey(m, str0), mkdentry(str0, entries[str])][key].name ∧ key.ino ∈ dirs0 ∧ ( links (key.ino, dirs0 [m8, (m8 = m ⊃ mkdir(m1 + 1, md2, m4, m6, entries1[str0, entries[str]]);mkdir(m2, md3, # links(m8, dirs0), m5, entries -- str)).meta:= md0 ] [m, mkdir(m12, md5, m13, m14, entries3) ]) ≠ ∅ ∨ key.ino = ROOT_INO) ∧ ( (dcache0 -- dentrykey(m8, str))[dentrykey(m, str0), mkdentry(str0, entries[str])][key].ino ∈ dirs0 ∨ (dcache0 -- dentrykey(m8, str))[dentrykey(m, str0), mkdentry(str0, entries[str])][key].ino ∈ files) ∧ (dcache0 -- dentrykey(m8, str))[dentrykey(m, str0), mkdentry(str0, entries[str])][key].name ∈ entries4 ∧ (dcache0 -- dentrykey(m8, str))[dentrykey(m, str0), mkdentry(str0, entries[str])][key].ino = entries4[(dcache0 -- dentrykey(m8, str))[dentrykey(m, str0), mkdentry(str0, entries[str])][key].name] ∧ (dcache0 -- dentrykey(m8, str))[dentrykey(m, str0), mkdentry(str0, entries[str])][key].dentry?

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 215:
# links (entries[str], dirs0 [m8, (m8 = m ⊃ mkdir(m1 + 1, md2, m4, m6, entries1[str0, entries[str]]);mkdir(m2, md3, # links(m8, dirs0), m5, entries -- str)).meta:= md0 ] [m, mkdir(m12, md5, m13, m14, entries4) ]) = # links(entries[str], dirs0), (m = m8 ⊃ mkdir(m2, md3, # links(m8, dirs0), m5, entries -- str);mkdir(m18, md8, # links(m, dirs0), m20, entries5)) = mkdir(m1, md2, m4, m6, entries1), (m8 = m ⊃ mkdir(m1 + 1, md5, m4, m6, entries1[str0, entries[str]]);mkdir(m2, md0, # links(m8, dirs0), m5, entries -- str)) = mkdir(m0, md1, m10, m11, entries0), (m = m8 ⊃ mkdir(m1 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m1 + 1, md2, m4, m6, entries1[str0, entries[str]])) = mkdir(m12, md6, m13, m14, entries4), 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(m18, md8, # links(m, dirs0), m20, entries5), afs-cons(dirs0, files), afs-cons (dirs0[m8, (m8 = m ⊃ mkdir(m1 + 1, md2, m4, m6, entries1[str0, entries[str]]);mkdir(m2, md3, # links(m8, dirs0), m5, entries -- str)).meta:= md0] [m, mkdir(m12, md5, m13, m14, entries4) ], files), synced(dirs0, icache0, pcache), str ∈ entries, entries[str] ∈ files, m8 ∈ dirs0, m ∈ dirs0, asynced2 → synced(files, icache0, pcache), m = m8 → md5 = md0, dentrykey(m, str0) ∈ dcache0 → str0 = dcache0[dentrykey(m, str0)].name ∧ (dcache0[dentrykey(m, str0)].ino ∈ dirs0 ∨ dcache0[dentrykey(m, str0)].ino ∈ files) ∧ dcache0[dentrykey(m, str0)].name ∈ entries5 ∧ dcache0[dentrykey(m, str0)].ino = entries5[dcache0[dentrykey(m, str0)].name] ∧ dcache0[dentrykey(m, str0)].dentry?, ∀ 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 ⊦ entries[str] ∈ dirs0, str0 ∈ entries5, ( links (m, dirs0 [m8, (m8 = m ⊃ mkdir(m1 + 1, md2, m4, m6, entries1[str0, entries[str]]);mkdir(m2, md3, # links(m8, dirs0), m5, entries -- str)).meta:= md0 ] [m, mkdir(m12, md5, m13, m14, entries4) ]) ≠ ∅ ∨ m = ROOT_INO) ∧ str0 ∈ entries4 ∧ entries[str] = entries4[str0]

Rule argument

Additional information

Used simplifier rules: afs-cons-file-nlink: ⊦ afs-cons(dirs, files) ∧ ino ∈ files ∧ files[ino] = mkfile(m, md, n, content) → # links(ino, dirs) = n; (forward) from specification afs-base%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% ⊦ mkdentry(str, m).dentry?; (s)% ⊦ mkdentry(str, m).ino = m; (s)% ⊦ mkdentry(str, m).name = str; (s)% ⊦ dcache[key, dent][key] = dent; (s)% ⊦ dentrykey(m, str).name = str; (s)% ⊦ dentrykey(m, str).dentry?; (s)% ⊦ key ∈ dcache[key, dent]; (s)%⊦ mkdir(m, md, m0, m1, entries) = mkdir(m2, md0, m3, m4, entries0) ↔ m = m2 ∧ md = md0 ∧ m0 = m3 ∧ m1 = m4 ∧ entries = entries0; (ws)% ⊦ dentrykey(m, str).ino = m; (s)