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

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

Heuristic simplifier applied rule simplifier

And obtained the following new goals

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

Rule argument

Additional information

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