[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 155 from proof refine-unlink (previous step)

# links(entries0[str], cache_dirs) = m0 + 1, cache_files[entries0[str]] = mkfile(m2, md3, m0 + 1, content), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries0[str]] = mkfile(m7, md2, m0 + 1, content0), cache_dirs[m3] = mkdir(m9 + 1, md, # links(m3, cache_dirs), m4, entries0), dirs = cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m4, entries0 -- str)], files = ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries0[str], mkfile(m7, md2, m0, content0)], ino = inode.ino, inode = mkinode(entries0[str], md0, false, m0 + 1, 0, m6), afs-cons(cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m4, entries0 -- str)], cache_files[entries0[str], mkfile(m6, md0, m0, content)]), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons(cache_dirs, cache_files), dcache-cons (cache_dcache -- dentrykey(m3, str), cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m4, entries0 -- str)], cache_files[entries0[str], mkfile(m6, md0, m0, content)]), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons (cache_icache[entries0[str], mkientry(false, mkinode(entries0[str], md0, false, m0, 0, m6))] [m3, mkientry(false, mkinode(m3, md1, true, # links(m3, cache_dirs), m4, m9)) ], cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m4, entries0 -- str)], cache_files[entries0[str], mkfile(m6, md0, m0, content)]), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons (cache_pcache, cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m4, entries0 -- str)], cache_files[entries0[str], mkfile(m6, md0, m0, content)]), pcache-cons(cache_pcache, cache_dirs, cache_files), synced (cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m4, entries0 -- str)], cache_icache[entries0[str], mkientry(false, mkinode(entries0[str], md0, false, m0, 0, m6))] [m3, mkientry(false, mkinode(m3, md1, true, # links(m3, cache_dirs), m4, m9)) ], cache_pcache), synced(cache_dirs, cache_icache, cache_pcache), ino ∈ files, m3 ∈ cache_dirs, str ∈ entries0, entries0[str] ∈ cache_files, cache_sync → synced (cache_files[entries0[str], mkfile(m6, md0, m0, content)], cache_icache[entries0[str], mkientry(false, mkinode(entries0[str], md0, false, m0, 0, m6))] [m3, mkientry(false, mkinode(m3, md1, true, # links(m3, cache_dirs), m4, m9)) ], cache_pcache), cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO ⊦ ∃ asynced. dirs = cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m4, entries0 -- str)] ∧ files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta] = (cache_files[entries0[str], mkfile(m6, md0, m0, content)] ⊕ cache_pcache) ⊕ cache_icache[entries0[str], mkientry(false, mkinode(entries0[str], md0, false, m0, 0, m6))] [m3, mkientry(false, mkinode(m3, md1, true, # links(m3, cache_dirs), m4, m9)) ] ∧ (asynced ↔ asynced0) ∧ mkinode(m3, md1, true, # links(m3, cache_dirs), m4, m9) = (m3 ∈ dirs ⊃ mkinode(m3, dirs[m3].meta, true, dirs[m3].nlink, dirs[m3].nsubdirs, dirs[m3].size) ;mkinode (m3, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m3].meta, false, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m3].nlink, 0, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m3].size) ) ∧ mkinode(entries0[str], md0, false, m0, 0, m6) = getinode(entries0[str], dirs, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta]) ∧ ESUCCESS = ESUCCESS

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information

Used simplifier rules: ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs → ¬ ino ∈ files; (s)% ⊦ mkfile(m, md, m0, content).size = m; (s)% ⊦ mkfile(m, md, m0, content).nlink = m0; (s)% ⊦ mkfile(m, md, m0, content).meta = md; (s)%⊦ 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)% ⊦ mkdir(m, md, m0, m1, entries).size = m; (s)% ⊦ mkdir(m, md, m0, m1, entries).nsubdirs = m1; (s)% ⊦ mkdir(m, md, m0, m1, entries).nlink = m0; (s)% ⊦ mkdir(m, md, m0, m1, entries).meta = md; (s)% ⊦ dirs[ino, ad][ino0] = (ino0 = ino ∧ ino ∈ dirs ⊃ ad;dirs[ino0]); (s)% ⊦ ino ∈ dirs[ino0, ad] ↔ ino ∈ dirs; (s)% ⊦ mkfile(m, md, m0, content).meta:= md0 = mkfile(m, md0, m0, content); (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (s)% ⊦ files[ino, af][ino, af0] = files[ino, af0]; (s)% ⊦ mkfile(m, md, m0, content).size:= m1 = mkfile(m1, md, m0, content); (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).size = m2; (s)% ⊦ files[ino, af][ino0] = (ino0 = ino ∧ ino ∈ files ⊃ af;files[ino0]); (s)% ⊦ ino ∈ files ⊕ pcache ↔ ino ∈ files; (s)% ⊦ ino ∈ files ⊕ icache ↔ ino ∈ files; (s)% ⊦ ino ∈ files[ino0, af] ↔ ino ∈ files; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)