[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 110 from proof truncate-greater (previous step)

files1[m0] = mkfile(m, md0, # links(m0, dirs), content0), files = files1[m0, mkfile(m, md0, # links(m0, dirs), content0 upto m3)], ino = inode.ino, inode = mkinode(m0, md, false, # links(m0, dirs), 0, n), inode0 = mkinode(m0, md, false, # links(m0, dirs), 0, m3), m3 < n, afs-cons(dirs, files1), m0 ∈ files1 ⊦ [if ino ∈ dirs then dirs[ino].meta := inode.meta; inode0 := (inode0.ino ∈ dirs ⊃ mkinode(inode0.ino, dirs[inode0.ino].meta, true, dirs[inode0.ino].nlink, dirs[inode0.ino].nsubdirs, dirs[inode0.ino].size) ;mkinode(inode0.ino, files[inode0.ino].meta, false, files[inode0.ino].nlink, 0, files[inode0.ino].size) ); err := ESUCCESS; asynced := ?] (err = ESUCCESS ⊃ files[inode0.ino].content.stream to files[inode0.ino].size = (files1[inode0.ino].content.stream to m3) + (σ⊥ to (files[inode0.ino].size - m3)) ∧ inode0.ino ∈ files ∧ n = files[inode0.ino].size ∧ files1[inode0.ino].nlink = files[inode0.ino].nlink ∧ files1 -- inode0.ino = files -- inode0.ino ;⌊err⌋ ∧ files1 = files ), ino ∈ files, m3 % VFS_PAGE_SIZE ≠ 0 ∧ m3 / VFS_PAGE_SIZE ∈ content0

Heuristic conditional right split applied rule if right

And obtained the following new goals

Rule argument

pos: right 1

Additional information