[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 88 from proof write-term (previous step)

# links(m, dirs) = files[m].nlink, VFS_PAGE_SIZE = n1 + m5 % VFS_PAGE_SIZE, files1[m] = mkfile(m5, md0, files[m].nlink, content0), of[fd] = mkfile(m, mode, m0), err0 = ESUCCESS, m5 % VFS_PAGE_SIZE ≠ 0, ino ≠ 0, n ≠ 0, m5 < m0 + ino, afs-cons(dirs, files1), afs-cons (dirs, files1[m, mkfile(m5, md0, files[m].nlink, content0[m5 / VFS_PAGE_SIZE, fill(content0[m5 / VFS_PAGE_SIZE], zero, m5 % VFS_PAGE_SIZE, n1)] upto m5)]), of-cons(of, dirs, files1), m ∈ files, fd ∈ of, m5 / VFS_PAGE_SIZE ∈ content0, m ∈ files1, n ≤ # buf0 ⊦ ⟪afs_check_commit#(dirs, files; err0; asynced); ino0 := m5; dirs0 := dirs; if err0 = ESUCCESS then afs_write_inode# ( (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode (m, files1 [m, files1 [m, files1 [m, mkfile (m5, md0, files[m].nlink, content0[m5 / VFS_PAGE_SIZE, fill(content0[m5 / VFS_PAGE_SIZE], zero, m5 % VFS_PAGE_SIZE, n1)] upto m5) ] [m ] .size:= m5 ] [m ] .meta:= md0 ] [m ] .meta, false, files1 [m, files1 [m, files1 [m, mkfile (m5, md0, files[m].nlink, content0[m5 / VFS_PAGE_SIZE, fill(content0[m5 / VFS_PAGE_SIZE], zero, m5 % VFS_PAGE_SIZE, n1)] upto m5) ] [m ] .size:= m5 ] [m ] .meta:= md0 ] [m ] .nlink, 0, files1 [m, files1 [m, files1 [m, mkfile (m5, md0, files[m].nlink, content0[m5 / VFS_PAGE_SIZE, fill(content0[m5 / VFS_PAGE_SIZE], zero, m5 % VFS_PAGE_SIZE, n1)] upto m5) ] [m ] .size:= m5 ] [m ] .meta:= md0 ] [m ] .size) ) .size:= (m0 + ino) ; err0, dirs, files ; asynced); if err0 ≠ ESUCCESS then ino := (m0 ≤ ino0 ⊃ ino0 - m0;0), err0 := ESUCCESS; of[fd].pos := m0 + ino⟫ (dirs0 = dirs), mode ≠ MODE_W ∧ mode ≠ MODE_RW

Heuristic elimination applied rule insert elim lemma

And obtained the following new goals

Proof step 89:
# links(m, dirs) = m2, VFS_PAGE_SIZE = n1 + m5 % VFS_PAGE_SIZE, of[fd] = mkfile(m, mode, m0), files1[m] = mkfile(m5, md0, m2, content0), files[m] = mkfile(m1, md, m2, content), err0 = ESUCCESS, m5 < m0 + ino, afs-cons(dirs, files1[m, mkfile(m5, md0, m2, content0[m5 / VFS_PAGE_SIZE, fill(content0[m5 / VFS_PAGE_SIZE], zero, m5 % VFS_PAGE_SIZE, n1)] upto m5)]), afs-cons(dirs, files1), of-cons(of, dirs, files1), m ∈ files1, m5 / VFS_PAGE_SIZE ∈ content0, fd ∈ of, m ∈ files, n ≤ # buf0 ⊦ ⟪afs_check_commit#(dirs, files; err0; asynced); ino0 := m5; dirs0 := dirs; if err0 = ESUCCESS then afs_write_inode# ( (m ∈ dirs ⊃ mkinode(m, dirs[m].meta, true, dirs[m].nlink, dirs[m].nsubdirs, dirs[m].size) ;mkinode (m, files1 [m, files1 [m, files1 [m, mkfile (m5, md0, m2, content0[m5 / VFS_PAGE_SIZE, fill(content0[m5 / VFS_PAGE_SIZE], zero, m5 % VFS_PAGE_SIZE, n1)] upto m5) ] [m ] .size:= m5 ] [m ] .meta:= md0 ] [m ] .meta, false, files1 [m, files1 [m, files1 [m, mkfile (m5, md0, m2, content0[m5 / VFS_PAGE_SIZE, fill(content0[m5 / VFS_PAGE_SIZE], zero, m5 % VFS_PAGE_SIZE, n1)] upto m5) ] [m ] .size:= m5 ] [m ] .meta:= md0 ] [m ] .nlink, 0, files1 [m, files1 [m, files1 [m, mkfile (m5, md0, m2, content0[m5 / VFS_PAGE_SIZE, fill(content0[m5 / VFS_PAGE_SIZE], zero, m5 % VFS_PAGE_SIZE, n1)] upto m5) ] [m ] .size:= m5 ] [m ] .meta:= md0 ] [m ] .size) ) .size:= (m0 + ino) ; err0, dirs, files ; asynced); if err0 ≠ ESUCCESS then ino := (m0 ≤ ino0 ⊃ ino0 - m0;0), err0 := ESUCCESS; of[fd].pos := m0 + ino⟫ (dirs0 = dirs), m5 % VFS_PAGE_SIZE = 0, ino = 0, n = 0, mode ≠ MODE_W ∧ mode ≠ MODE_RW

Rule argument

spec: abstract-file name: elim seq: ⊦ ((m = af.size ∧ md = af.meta) ∧ m0 = af.nlink) ∧ content = af.content ↔ af = mkfile(m, md, m0, content) subst: [af, m, md, m0, content] → [files[m], m1, md, m2, content]

Additional information

Used simplifier rules: ⊦ ((m = af.size ∧ md = af.meta) ∧ m0 = af.nlink) ∧ content = af.content ↔ af = mkfile(m, md, m0, content); (elim) Used terms: files[m], m1, md, m2, content