[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 134 from proof inv-write_inode (previous step)

icache[m] = mkientry(boolvar, mkinode(m1, md1, boolvar0, m3, m4, m5)), dirs[m] = mkdir(m0, md0, # links(m, dirs), m2, entries), icache[m1, mkientry(false, mkinode(m1, md, boolvar0, m3, m4, m5))][ino] = mkientry(boolvar2, mkinode(m6, md2, boolvar1, m7, m8, m9)), afs-cons(dirs[m, mkdir(m0, md, # links(m, dirs), m2, entries)], files), afs-cons(dirs, files), synced(dirs, icache, pcache), ino ∈ icache[m1, mkientry(false, mkinode(m1, md, boolvar0, m3, m4, m5))], m ∈ icache, m ∈ dirs, asynced2 → synced(files, icache, pcache), 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) ) ) ⊦ m6 = ino ∧ (boolvar2 ⊃ ino ∈ files ∧ m7 = files[ino].nlink ∧ m8 = 0 ∧ ¬ boolvar1 ; (ino ∈ dirs ∨ ino ∈ files) ∧ mkinode(ino, md2, boolvar1, m7, m8, m9) = (ino ∈ dirs ⊃ mkinode (ino, (ino = m ⊃ mkdir(m0, md, # links(m, dirs), m2, entries);dirs[ino]).meta, true, (ino = m ⊃ mkdir(m0, md, # links(m, dirs), m2, entries);dirs[ino]).nlink, (ino = m ⊃ mkdir(m0, md, # links(m, dirs), m2, entries);dirs[ino]).nsubdirs, (ino = m ⊃ mkdir(m0, md, # links(m, dirs), m2, entries);dirs[ino]).size) ;mkinode(ino, files[ino].meta, false, files[ino].nlink, 0, files[ino].size) ) )

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 135:
dirs[m1] = mkdir(m0, md0, # links(m1, dirs), m2, entries), icache[m1] = mkientry(false, mkinode(m1, md0, true, # links(m1, dirs), m2, m0)), icache[m1, mkientry(false, mkinode(m1, md, true, # links(m1, dirs), m2, m0))][ino] = mkientry(boolvar2, mkinode(m6, md2, boolvar1, m7, m8, m9)), afs-cons(dirs, files), afs-cons(dirs[m1, mkdir(m0, md, # links(m1, dirs), m2, entries)], files), synced(dirs, icache, pcache), m1 ∈ dirs, m1 ∈ icache, ino ∈ icache[m1, mkientry(false, mkinode(m1, md, true, # links(m1, dirs), m2, m0))], asynced2 → synced(files, icache, pcache), ∀ 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) ) ) ⊦ m6 = ino ∧ (boolvar2 ⊃ ino ∈ files ∧ m7 = files[ino].nlink ∧ m8 = 0 ∧ ¬ boolvar1 ; (ino ∈ dirs ∨ ino ∈ files) ∧ mkinode(ino, md2, boolvar1, m7, m8, m9) = (ino ∈ dirs ⊃ mkinode (ino, (ino = m1 ⊃ mkdir(m0, md, # links(m1, dirs), m2, entries);dirs[ino]).meta, true, (ino = m1 ⊃ mkdir(m0, md, # links(m1, dirs), m2, entries);dirs[ino]).nlink, (ino = m1 ⊃ mkdir(m0, md, # links(m1, dirs), m2, entries);dirs[ino]).nsubdirs, (ino = m1 ⊃ mkdir(m0, md, # links(m1, dirs), m2, entries);dirs[ino]).size) ;mkinode(ino, files[ino].meta, false, files[ino].nlink, 0, files[ino].size) ) )

Rule argument

Additional information

Used simplifier rules: ⊦ 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)% ⊦ 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)% ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs → ¬ ino ∈ files; (s)% ⊦ mkientry(boolvar, inode).dirty ↔ boolvar; (s)% ⊦ mkinode(m, md, boolvar, m0, m1, m2).ino = m; (s)% ⊦ mkientry(boolvar, inode).inode = inode; (s)