[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 142 from proof fsync-inode-inv (previous step)

icache[m] = mkientry(true, mkinode(m1, md, false, # links(m1, dirs), 0, m4)), dirs[m1] = mkdir(m7, md2, m8, m9, entries), files[m1] = mkfile(m5, md1, # links(m1, dirs), content0), files[m] = mkfile(m0, md0, # links(m, dirs), content), icache[m, mkientry(false, mkinode(m1, md, false, # links(m1, dirs), 0, m4))][ino] = mkientry(boolvar0, mkinode(m2, md3, boolvar, m3, m6, m10)), afs-cons(dirs, files[m1, mkfile(m4, md, # links(m1, dirs), content0)]), afs-cons(dirs, files), synced(dirs, icache, pcache), ino ∈ icache[m, mkientry(false, mkinode(m1, md, false, # links(m1, dirs), 0, m4))], m ∈ files, m ∈ icache, m1 ∈ files, m ∈ icache → icache[m].inode.ino = m ∧ (icache[m].dirty ⊃ icache[m].inode.ino ∈ files ∧ icache[m].inode.nlink = files[icache[m].inode.ino].nlink ∧ icache[m].inode.nsubdirs = 0 ∧ ¬ icache[m].inode.directory ; (m ∈ dirs ∨ m ∈ files) ∧ icache[m].inode = (icache[m].inode.ino ∈ dirs ⊃ mkinode (icache[m].inode.ino, dirs[icache[m].inode.ino].meta, true, dirs[icache[m].inode.ino].nlink, dirs[icache[m].inode.ino].nsubdirs, dirs[icache[m].inode.ino].size) ;mkinode(icache[m].inode.ino, files[icache[m].inode.ino].meta, false, files[icache[m].inode.ino].nlink, 0, files[icache[m].inode.ino].size) ) ), ∀ ino0. ino0 ∈ icache → icache[ino0].inode.ino = ino0 ∧ (icache[ino0].dirty ⊃ icache[ino0].inode.ino ∈ files ∧ icache[ino0].inode.nlink = files[icache[ino0].inode.ino].nlink ∧ icache[ino0].inode.nsubdirs = 0 ∧ ¬ icache[ino0].inode.directory ; (ino0 ∈ dirs ∨ ino0 ∈ files) ∧ icache[ino0].inode = (icache[ino0].inode.ino ∈ dirs ⊃ mkinode (icache[ino0].inode.ino, dirs[icache[ino0].inode.ino].meta, true, dirs[icache[ino0].inode.ino].nlink, dirs[icache[ino0].inode.ino].nsubdirs, dirs[icache[ino0].inode.ino].size) ;mkinode (icache[ino0].inode.ino, files[icache[ino0].inode.ino].meta, false, files[icache[ino0].inode.ino].nlink, 0, files[icache[ino0].inode.ino].size) ) ) ⊦ m2 = ino ∧ (boolvar0 ⊃ ino ∈ files ∧ m3 = (ino = m1 ⊃ mkfile(m4, md, # links(m1, dirs), content0);files[ino]).nlink ∧ m6 = 0 ∧ ¬ boolvar ; (ino ∈ dirs ∨ ino ∈ files) ∧ mkinode(ino, md3, boolvar, m3, m6, m10) = (ino ∈ dirs ⊃ mkinode(ino, dirs[ino].meta, true, dirs[ino].nlink, dirs[ino].nsubdirs, dirs[ino].size) ;mkinode (ino, (ino = m1 ⊃ mkfile(m4, md, # links(m1, dirs), content0);files[ino]).meta, false, (ino = m1 ⊃ mkfile(m4, md, # links(m1, dirs), content0);files[ino]).nlink, 0, (ino = m1 ⊃ mkfile(m4, md, # links(m1, dirs), content0);files[ino]).size) ) )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 143:
files[m1] = mkfile(m5, md1, # links(m1, dirs), content0), icache[m1, mkientry(false, mkinode(m1, md, false, # links(m1, dirs), 0, m4))][ino] = mkientry(boolvar0, mkinode(m2, md3, boolvar, m3, m6, m10)), icache[m1] = mkientry(true, mkinode(m1, md, false, # links(m1, dirs), 0, m4)), dirs[m1] = mkdir(m7, md2, m8, m9, entries), afs-cons(dirs, files[m1, mkfile(m4, md, # links(m1, dirs), content0)]), afs-cons(dirs, files), synced(dirs, icache, pcache), ino ∈ icache[m1, mkientry(false, mkinode(m1, md, false, # links(m1, dirs), 0, m4))], m1 ∈ files, m1 ∈ icache, ∀ ino0. ino0 ∈ icache → icache[ino0].inode.ino = ino0 ∧ (icache[ino0].dirty ⊃ icache[ino0].inode.ino ∈ files ∧ icache[ino0].inode.nlink = files[icache[ino0].inode.ino].nlink ∧ icache[ino0].inode.nsubdirs = 0 ∧ ¬ icache[ino0].inode.directory ; (ino0 ∈ dirs ∨ ino0 ∈ files) ∧ icache[ino0].inode = (icache[ino0].inode.ino ∈ dirs ⊃ mkinode (icache[ino0].inode.ino, dirs[icache[ino0].inode.ino].meta, true, dirs[icache[ino0].inode.ino].nlink, dirs[icache[ino0].inode.ino].nsubdirs, dirs[icache[ino0].inode.ino].size) ;mkinode (icache[ino0].inode.ino, files[icache[ino0].inode.ino].meta, false, files[icache[ino0].inode.ino].nlink, 0, files[icache[ino0].inode.ino].size) ) ) ⊦ m2 = ino ∧ (boolvar0 ⊃ ino ∈ files ∧ m3 = (ino = m1 ⊃ mkfile(m4, md, # links(m1, dirs), content0);files[ino]).nlink ∧ m6 = 0 ∧ ¬ boolvar ; (ino ∈ dirs ∨ ino ∈ files) ∧ mkinode(ino, md3, boolvar, m3, m6, m10) = (ino ∈ dirs ⊃ mkinode(ino, dirs[ino].meta, true, dirs[ino].nlink, dirs[ino].nsubdirs, dirs[ino].size) ;mkinode (ino, (ino = m1 ⊃ mkfile(m4, md, # links(m1, dirs), content0);files[ino]).meta, false, (ino = m1 ⊃ mkfile(m4, md, # links(m1, dirs), content0);files[ino]).nlink, 0, (ino = m1 ⊃ mkfile(m4, md, # links(m1, dirs), content0);files[ino]).size) ) )

Rule argument

Additional information

Used simplifier rules: ⊦ mkfile(m, md, m0, content) = mkfile(m1, md0, m2, content0) ↔ m = m1 ∧ md = md0 ∧ m0 = m2 ∧ content = content0; (ws)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).directory ↔ boolvar; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nsubdirs = m1; (s)% ⊦ mkfile(m, md, m0, content).nlink = m0; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).nlink = m0; (s)% ⊦ mkientry(boolvar, inode).dirty ↔ boolvar; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)% ⊦ mkientry(boolvar, inode).inode = inode; (s)