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

# links(m1, cache_dirs) = m7, (cache_dirs[m1, mkdir(m6 + 1, md, # links(m1, cache_dirs), m8 + 1, entries1[str, m5])] ++ m5)[m1] = mkdir(m, md0, m3, m4, entries0), cache_dirs[m1] = mkdir(m6, md, # links(m1, cache_dirs), m8, entries1), cache_dirs0 = cache_dirs, dent = negdentry(str), 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), m1 ∈ cache_dirs, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m1, cache_dirs) ≠ ∅ ∨ m1 = ROOT_INO ⊦ ¬ m5 ∈ cache_dirs ∧ ¬ m5 ∈ cache_files ∧ m5 ≠ 0 ∧ ⟨afs_mkdir_ino#(m1, md3, m5; dent, err, cache_dirs); afs_files := (cache_files ⊕ cache_pcache) ⊕ cache_icache; afs_inode_sync#(mkinode(m1, md2, true, m7, m8, m6); cache_dirs, afs_files); p_inode := (m1 ∈ cache_dirs ⊃ mkinode(m1, cache_dirs[m1].meta, true, cache_dirs[m1].nlink, cache_dirs[m1].nsubdirs, cache_dirs[m1].size) ;mkinode(m1, afs_files[m1].meta, false, afs_files[m1].nlink, 0, afs_files[m1].size) ); c_inode := getinode(dent.ino, cache_dirs, afs_files); asynced := ?⟩ ( cache_dirs = (cache_dirs0[m1, mkdir(m6 + 1, md, # links(m1, cache_dirs0), m8 + 1, entries1[str, m5])] ++ m5)[m5, mkdir(0, md3, 1, 0, ∅)] [m1, (m1 = m5 ∧ m5 ∈ cache_dirs0[m5, mkdir(m6 + 1, md, # links(m5, cache_dirs0), m8 + 1, entries1[str, m5])] ++ m5 ⊃ mkdir(0, md3, 1, 0, ∅) ;(cache_dirs0[m1, mkdir(m6 + 1, md, # links(m1, cache_dirs0), m8 + 1, entries1[str, m5])] ++ m5)[m1] ) .meta:= md2 ] ∧ afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache[m1, mkientry(false, mkinode(m1, md2, true, m3, m4, m))] [m5, mkientry (false, (m5 ∈ cache_dirs0[m1, mkdir(m6 + 1, md, # links(m1, cache_dirs0), m8 + 1, entries1[str, m5])] ++ m5 ⊃ mkinode (m5, (m5 = m1 ⊃ mkdir(m, md2, m3, m4, entries0);mkdir(0, md3, 1, 0, ∅)).meta, true, (m5 = m1 ⊃ mkdir(m, md2, m3, m4, entries0);mkdir(0, md3, 1, 0, ∅)).nlink, (m5 = m1 ⊃ mkdir(m, md2, m3, m4, entries0);mkdir(0, md3, 1, 0, ∅)).nsubdirs, (m5 = m1 ⊃ mkdir(m, md2, m3, m4, entries0);mkdir(0, md3, 1, 0, ∅)).size) ;mkinode(m5, cache_files[m5].meta, false, cache_files[m5].nlink, 0, cache_files[m5].size) )) ] ∧ (asynced ↔ asynced0) ∧ (m1 ∈ cache_dirs0[m1, mkdir(m6 + 1, md, # links(m1, cache_dirs0), m8 + 1, entries1[str, m5])] ++ m5 ⊃ mkinode (m1, md2, true, (m1 = m5 ⊃ mkdir(0, md3, 1, 0, ∅) ;(cache_dirs0[m1, mkdir(m6 + 1, md, # links(m1, cache_dirs0), m8 + 1, entries1[str, m5])] ++ m5)[m1] ) .nlink, (m1 = m5 ⊃ mkdir(0, md3, 1, 0, ∅) ;(cache_dirs0[m1, mkdir(m6 + 1, md, # links(m1, cache_dirs0), m8 + 1, entries1[str, m5])] ++ m5)[m1] ) .nsubdirs, (m1 = m5 ⊃ mkdir(0, md3, 1, 0, ∅) ;(cache_dirs0[m1, mkdir(m6 + 1, md, # links(m1, cache_dirs0), m8 + 1, entries1[str, m5])] ++ m5)[m1] ) .size) ;mkinode(m1, cache_files[m1].meta, false, cache_files[m1].nlink, 0, cache_files[m1].size) ) = p_inode ∧ (m5 ∈ cache_dirs0[m1, mkdir(m6 + 1, md, # links(m1, cache_dirs0), m8 + 1, entries1[str, m5])] ++ m5 ⊃ mkinode (m5, (m5 = m1 ⊃ mkdir(0, md2, 1, 0, ∅);mkdir(0, md3, 1, 0, ∅)).meta, true, (m5 = m1 ⊃ mkdir(0, md2, 1, 0, ∅);mkdir(0, md3, 1, 0, ∅)).nlink, (m5 = m1 ⊃ mkdir(0, md2, 1, 0, ∅);mkdir(0, md3, 1, 0, ∅)).nsubdirs, (m5 = m1 ⊃ mkdir(0, md2, 1, 0, ∅);mkdir(0, md3, 1, 0, ∅)).size) ;mkinode(m5, cache_files[m5].meta, false, cache_files[m5].nlink, 0, cache_files[m5].size) ) = c_inode ∧ mkdentry(str, m5) = dent ∧ ESUCCESS = err), m5 = 0, m5 ∈ cache_dirs, m5 ∈ cache_files, str ∈ entries1

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information