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

cache_dirs[ino3] = mkdir(m1, md4, # links(ino3, cache_dirs), m12, entries2), cache_dirs[ino0] = mkdir(m4, md2, # links(ino0, cache_dirs), m10, entries), cache_dirs[ino1] = mkdir(m0, md3, # links(ino1, cache_dirs), m2, entries0), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries2[str]] = mkfile(m5, md1, # links(entries2[str], cache_dirs), content), cache_dirs[m9] = mkdir(m, md7, # links(m9, cache_dirs), m6, entries3), entries0[str] = entries2[str], cache_files[entries2[str]] = mkfile(m3, md6, # links(entries2[str], cache_dirs), content1), entries[str] = entries2[str], cache_dirs[ino2] = mkdir(m7, md5, # links(ino2, cache_dirs), m11, entries1), entries1[str] = entries2[str], dirs = cache_dirs[m9, mkdir(m + 1, md0, # links(m9, cache_dirs), m6, entries3[str0, entries2[str]])], files = ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries2[str], mkfile(m5, md1, # links(entries2[str], cache_dirs) + 1, content)], ino = inode.ino, inode = mkinode(entries1[str], md, false, # links(entries1[str], cache_dirs), 0, m14), mkdentry(str, entries0[str]).dentry?, afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache), ino ∈ files, m9 ∈ cache_dirs, str ∈ entries0, str ∈ entries, ino1 ∈ cache_dirs, ino0 ∈ cache_dirs, ino2 ∈ cache_dirs, str ∈ entries1, entries2[str] ∈ cache_files, ino3 ∈ cache_dirs, str ∈ entries2, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m9, cache_dirs) ≠ ∅ ∨ m9 = ROOT_INO, links(ino1, cache_dirs) ≠ ∅ ∨ ino1 = ROOT_INO, links(ino0, cache_dirs) ≠ ∅ ∨ ino0 = ROOT_INO, links(ino2, cache_dirs) ≠ ∅ ∨ ino2 = ROOT_INO, links(ino3, cache_dirs) ≠ ∅ ∨ ino3 = ROOT_INO ⊦ str0 ∈ entries3, ∃ asynced. dirs = cache_dirs[m9, mkdir(m + 1, md0, # links(m9, cache_dirs), m6, entries3[str0, entries1[str]])] ∧ files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta] = ( cache_files[entries1[str], mkfile(m3, md6, # links(entries1[str], cache_dirs) + 1, content1)] [entries[str], mkfile(m14, md, # links(entries1[str], cache_dirs) + 1, content1) ] ⊕ cache_pcache) ⊕ cache_icache[m9, mkientry(false, mkinode(m9, md0, true, # links(m9, cache_dirs), m6, m + 1))] [entries1[str], mkientry (false, (entries0[str] ∈ cache_dirs ⊃ mkinode (entries0[str], (entries0[str] = m9 ⊃ mkdir (cache_dirs[entries0[str]].size + 1, md0, # links(entries0[str], cache_dirs), cache_dirs[entries0[str]].nsubdirs, entries3[str0, entries1[str]]) ;cache_dirs[entries0[str]] ) .meta, true, (entries0[str] = m9 ⊃ mkdir (cache_dirs[entries0[str]].size + 1, md0, # links(entries0[str], cache_dirs), cache_dirs[entries0[str]].nsubdirs, entries3[str0, entries1[str]]) ;cache_dirs[entries0[str]] ) .nlink, (entries0[str] = m9 ⊃ mkdir (cache_dirs[entries0[str]].size + 1, md0, # links(entries0[str], cache_dirs), cache_dirs[entries0[str]].nsubdirs, entries3[str0, entries1[str]]) ;cache_dirs[entries0[str]] ) .nsubdirs, (entries0[str] = m9 ⊃ mkdir (cache_dirs[entries0[str]].size + 1, md0, # links(entries0[str], cache_dirs), cache_dirs[entries0[str]].nsubdirs, entries3[str0, entries1[str]]) ;cache_dirs[entries0[str]] ) .size) ;mkinode (entries0[str], (entries0[str] = entries[str] ∧ entries[str] ∈ cache_files ⊃ mkfile(m14, md, # links(entries1[str], cache_dirs) + 1, content1) ;mkfile(m3, md6, # links(entries1[str], cache_dirs) + 1, content1) ) .meta, false, (entries0[str] = entries[str] ∧ entries[str] ∈ cache_files ⊃ mkfile(m14, md, # links(entries1[str], cache_dirs) + 1, content1) ;mkfile(m3, md6, # links(entries1[str], cache_dirs) + 1, content1) ) .nlink, 0, (entries0[str] = entries[str] ∧ entries[str] ∈ cache_files ⊃ mkfile(m14, md, # links(entries1[str], cache_dirs) + 1, content1) ;mkfile(m3, md6, # links(entries1[str], cache_dirs) + 1, content1) ) .size) )) ] ∧ (asynced ↔ asynced0) ∧ mkinode(m9, md0, true, # links(m9, cache_dirs), m6, m + 1) = (m9 ∈ dirs ⊃ mkinode(m9, dirs[m9].meta, true, dirs[m9].nlink, dirs[m9].nsubdirs, dirs[m9].size) ;mkinode (m9, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m9].meta, false, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m9].nlink, 0, files[ino, files[ino].size:= inode.size][ino, files[ino, files[ino].size:= inode.size][ino].meta:= inode.meta][m9].size) ) ∧ (entries0[str] ∈ cache_dirs ⊃ mkinode (entries0[str], (entries0[str] = m9 ⊃ mkdir (cache_dirs[entries0[str]].size + 1, md0, # links(entries0[str], cache_dirs), cache_dirs[entries0[str]].nsubdirs, entries3[str0, entries1[str]]) ;cache_dirs[entries0[str]] ) .meta, true, (entries0[str] = m9 ⊃ mkdir (cache_dirs[entries0[str]].size + 1, md0, # links(entries0[str], cache_dirs), cache_dirs[entries0[str]].nsubdirs, entries3[str0, entries1[str]]) ;cache_dirs[entries0[str]] ) .nlink, (entries0[str] = m9 ⊃ mkdir (cache_dirs[entries0[str]].size + 1, md0, # links(entries0[str], cache_dirs), cache_dirs[entries0[str]].nsubdirs, entries3[str0, entries1[str]]) ;cache_dirs[entries0[str]] ) .nsubdirs, (entries0[str] = m9 ⊃ mkdir (cache_dirs[entries0[str]].size + 1, md0, # links(entries0[str], cache_dirs), cache_dirs[entries0[str]].nsubdirs, entries3[str0, entries1[str]]) ;cache_dirs[entries0[str]] ) .size) ;mkinode (entries0[str], (entries0[str] = entries[str] ⊃ mkfile(m14, md, # links(entries1[str], cache_dirs) + 1, content1) ;mkfile(m3, md6, # links(entries1[str], cache_dirs) + 1, content1) ) .meta, false, (entries0[str] = entries[str] ⊃ mkfile(m14, md, # links(entries1[str], cache_dirs) + 1, content1) ;mkfile(m3, md6, # links(entries1[str], cache_dirs) + 1, content1) ) .nlink, 0, (entries0[str] = entries[str] ⊃ mkfile(m14, md, # links(entries1[str], cache_dirs) + 1, content1) ;mkfile(m3, md6, # links(entries1[str], cache_dirs) + 1, content1) ) .size) ) = getinode (mkdentry(str, entries0[str]).ino, 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: ⊦ mkfile(m, md, m0, content).size = m; (s)% ⊦ mkfile(m, md, m0, content).nlink = m0; (s)% ⊦ mkfile(m, md, m0, content).meta = md; (s)% ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs → ¬ ino ∈ files; (s)%⊦ mkinode(m, md, boolvar, m0, m1, m2) = mkinode(m3, md0, boolvar0, m4, m5, m6) ↔ m = m3 ∧ md = md0 ∧ (boolvar ↔ boolvar0) ∧ m0 = m4 ∧ m1 = m5 ∧ m2 = m6; (ws)%⊦ 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)% ⊦ mkdentry(str, m).ino = m; (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)% ⊦ files[ino, af][ino, af0] = files[ino, af0]; (s)% ⊦ mkfile(m, md, m0, content).meta:= md0 = mkfile(m, md0, m0, content); (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).meta = md; (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)% ⊦ mkdentry(str, m).dentry?; (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)