[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 273 from proof inv-rename-file-negdentry (previous step)

# links (entries[str], dirs0 [m8, (m8 = m ⊃ mkdir(m1 + 1, md2, m4, m6, entries1[str0, entries[str]]);mkdir(m2, md3, # links(m8, dirs0), m5, entries -- str)).meta:= md0 ] [m, mkdir(m12, md5, m13, m14, entries3) ]) = # links(entries[str], dirs0), (m = m8 ⊃ mkdir(m1 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m1 + 1, md2, m4, m6, entries1[str0, entries[str]])) = mkdir(m12, md6, m13, m14, entries3), (m8 = m ⊃ mkdir(m1 + 1, md5, m4, m6, entries1[str0, entries[str]]);mkdir(m2, md0, # links(m8, dirs0), m5, entries -- str)) = mkdir(m0, md1, m10, m11, entries0), (m = m8 ⊃ mkdir(m2, md3, # links(m8, dirs0), m5, entries -- str);mkdir(m7, md4, # links(m, dirs0), m9, entries2)) = mkdir(m1, md2, m4, m6, entries1), dirs0[m] = mkdir(m7, md4, # links(m, dirs0), m9, entries2), files[entries[str]] = mkfile(m3, md, # links(entries[str], dirs0), content0), dirs0[m8] = mkdir(m2 + 1, md3, # links(m8, dirs0), m5, entries), icache0[m8, mkientry(false, mkinode(m8, md1, true, m10, m11, m0))][m, mkientry(false, mkinode(m, md5, true, m13, m14, m12))][ino] = mkientry(boolvar0, mkinode(m15, md7, boolvar, m16, m17, m18)), icache0[ino] = mkientry(boolvar2, mkinode(m19, md8, boolvar1, m20, m21, m22)), afs-cons (dirs0[m8, (m8 = m ⊃ mkdir(m1 + 1, md2, m4, m6, entries1[str0, entries[str]]);mkdir(m2, md3, # links(m8, dirs0), m5, entries -- str)).meta:= md0] [m, mkdir(m12, md5, m13, m14, entries3) ], files), afs-cons(dirs0, files), synced(dirs0, icache0, pcache), m8 ∈ dirs0, entries[str] ∈ files, str ∈ entries, m ∈ dirs0, ino ∈ icache0 → m19 = ino ∧ (boolvar2 ⊃ ino ∈ files ∧ m20 = files[ino].nlink ∧ m21 = 0 ∧ ¬ boolvar1 ; (ino ∈ dirs0 ∨ ino ∈ files) ∧ mkinode(ino, md8, boolvar1, m20, m21, m22) = (ino ∈ dirs0 ⊃ mkinode(ino, dirs0[ino].meta, true, dirs0[ino].nlink, dirs0[ino].nsubdirs, dirs0[ino].size) ;mkinode(ino, files[ino].meta, false, files[ino].nlink, 0, files[ino].size) ) ), m = m8 → md5 = md0, asynced2 → synced(files, icache0, pcache), ∀ ino0. ino0 ∈ icache0 → icache0[ino0].inode.ino = ino0 ∧ (icache0[ino0].dirty ⊃ icache0[ino0].inode.ino ∈ files ∧ icache0[ino0].inode.nlink = files[icache0[ino0].inode.ino].nlink ∧ icache0[ino0].inode.nsubdirs = 0 ∧ ¬ icache0[ino0].inode.directory ; (ino0 ∈ dirs0 ∨ ino0 ∈ files) ∧ icache0[ino0].inode = (icache0[ino0].inode.ino ∈ dirs0 ⊃ mkinode (icache0[ino0].inode.ino, dirs0[icache0[ino0].inode.ino].meta, true, dirs0[icache0[ino0].inode.ino].nlink, dirs0[icache0[ino0].inode.ino].nsubdirs, dirs0[icache0[ino0].inode.ino].size) ;mkinode (icache0[ino0].inode.ino, files[icache0[ino0].inode.ino].meta, false, files[icache0[ino0].inode.ino].nlink, 0, files[icache0[ino0].inode.ino].size) ) ), links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO, links(m8, dirs0) ≠ ∅ ∨ m8 = ROOT_INO, ino = m ∨ ino ∈ icache0[m8, mkientry(false, mkinode(m8, md1, true, m10, m11, m0))] ⊦ str0 ∈ entries2, entries[str] ∈ dirs0, m15 = ino ∧ (boolvar0 ⊃ ino ∈ files ∧ m16 = files[ino].nlink ∧ m17 = 0 ∧ ¬ boolvar ; (ino ∈ dirs0 ∨ ino ∈ files) ∧ mkinode(ino, md7, boolvar, m16, m17, m18) = (ino ∈ dirs0 ⊃ mkinode (ino, (ino = m ⊃ mkdir(m12, md5, m13, m14, entries3);(ino = m8 ⊃ mkdir(m2, md0, # links(m8, dirs0), m5, entries -- str);dirs0[ino])).meta, true, (ino = m ⊃ mkdir(m12, md5, m13, m14, entries3);(ino = m8 ⊃ mkdir(m2, md0, # links(m8, dirs0), m5, entries -- str);dirs0[ino])).nlink, (ino = m ⊃ mkdir(m12, md5, m13, m14, entries3);(ino = m8 ⊃ mkdir(m2, md0, # links(m8, dirs0), m5, entries -- str);dirs0[ino])) .nsubdirs, (ino = m ⊃ mkdir(m12, md5, m13, m14, entries3);(ino = m8 ⊃ mkdir(m2, md0, # links(m8, dirs0), m5, entries -- str);dirs0[ino])).size) ;mkinode(ino, files[ino].meta, false, files[ino].nlink, 0, files[ino].size) ) )

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Proof step 274:
# links (entries[str], dirs0 [m8, (m8 = m ⊃ mkdir(m1 + 1, md2, m4, m6, entries1[str0, entries[str]]);mkdir(m2, md3, # links(m8, dirs0), m5, entries -- str)).meta:= md0 ] [m, mkdir(m12, md5, m13, m14, entries3) ]) = # links(entries[str], dirs0), (m = m8 ⊃ mkdir(m2, md3, # links(m8, dirs0), m5, entries -- str);mkdir(m7, md4, # links(m, dirs0), m9, entries2)) = mkdir(m1, md2, m4, m6, entries1), (m8 = m ⊃ mkdir(m1 + 1, md5, m4, m6, entries1[str0, entries[str]]);mkdir(m2, md0, # links(m8, dirs0), m5, entries -- str)) = mkdir(m0, md1, m10, m11, entries0), (m = m8 ⊃ mkdir(m1 + 1, md0, m4, m6, entries1[str0, entries[str]]);mkdir(m1 + 1, md2, m4, m6, entries1[str0, entries[str]])) = mkdir(m12, md6, m13, m14, entries3), icache0[ino] = mkientry(boolvar2, mkinode(m19, md8, boolvar1, m20, m21, m22)), icache0[m8, mkientry(false, mkinode(m8, md1, true, m10, m11, m0))][m, mkientry(false, mkinode(m, md5, true, m13, m14, m12))][ino] = mkientry(boolvar0, mkinode(m15, md7, boolvar, m16, m17, m18)), dirs0[m8] = mkdir(m2 + 1, md3, # links(m8, dirs0), m5, entries), files[entries[str]] = mkfile(m3, md, # links(entries[str], dirs0), content0), dirs0[m] = mkdir(m7, md4, # links(m, dirs0), m9, entries2), afs-cons(dirs0, files), afs-cons (dirs0[m8, (m8 = m ⊃ mkdir(m1 + 1, md2, m4, m6, entries1[str0, entries[str]]);mkdir(m2, md3, # links(m8, dirs0), m5, entries -- str)).meta:= md0] [m, mkdir(m12, md5, m13, m14, entries3) ], files), synced(dirs0, icache0, pcache), m ∈ dirs0, str ∈ entries, entries[str] ∈ files, m8 ∈ dirs0, asynced2 → synced(files, icache0, pcache), m = m8 → md5 = md0, ino ∈ icache0 → m19 = ino ∧ (boolvar2 ⊃ ino ∈ files ∧ m20 = files[ino].nlink ∧ m21 = 0 ∧ ¬ boolvar1 ; (ino ∈ dirs0 ∨ ino ∈ files) ∧ mkinode(ino, md8, boolvar1, m20, m21, m22) = (ino ∈ dirs0 ⊃ mkinode(ino, dirs0[ino].meta, true, dirs0[ino].nlink, dirs0[ino].nsubdirs, dirs0[ino].size) ;mkinode(ino, files[ino].meta, false, files[ino].nlink, 0, files[ino].size) ) ), ∀ ino0. ino0 ∈ icache0 → icache0[ino0].inode.ino = ino0 ∧ (icache0[ino0].dirty ⊃ icache0[ino0].inode.ino ∈ files ∧ icache0[ino0].inode.nlink = files[icache0[ino0].inode.ino].nlink ∧ icache0[ino0].inode.nsubdirs = 0 ∧ ¬ icache0[ino0].inode.directory ; (ino0 ∈ dirs0 ∨ ino0 ∈ files) ∧ icache0[ino0].inode = (icache0[ino0].inode.ino ∈ dirs0 ⊃ mkinode (icache0[ino0].inode.ino, dirs0[icache0[ino0].inode.ino].meta, true, dirs0[icache0[ino0].inode.ino].nlink, dirs0[icache0[ino0].inode.ino].nsubdirs, dirs0[icache0[ino0].inode.ino].size) ;mkinode (icache0[ino0].inode.ino, files[icache0[ino0].inode.ino].meta, false, files[icache0[ino0].inode.ino].nlink, 0, files[icache0[ino0].inode.ino].size) ) ), ino = m ∨ ino ∈ icache0[m8, mkientry(false, mkinode(m8, md1, true, m10, m11, m0))], links(m8, dirs0) ≠ ∅ ∨ m8 = ROOT_INO, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO ⊦ ino = m, entries[str] ∈ dirs0, str0 ∈ entries2, m15 = ino ∧ (boolvar0 ⊃ ino ∈ files ∧ m16 = files[ino].nlink ∧ m17 = 0 ∧ ¬ boolvar ; (ino ∈ dirs0 ∨ ino ∈ files) ∧ mkinode(ino, md7, boolvar, m16, m17, m18) = (ino ∈ dirs0 ⊃ mkinode (ino, (ino = m ⊃ mkdir(m12, md5, m13, m14, entries3);(ino = m8 ⊃ mkdir(m2, md0, # links(m8, dirs0), m5, entries -- str);dirs0[ino])).meta, true, (ino = m ⊃ mkdir(m12, md5, m13, m14, entries3);(ino = m8 ⊃ mkdir(m2, md0, # links(m8, dirs0), m5, entries -- str);dirs0[ino])).nlink, (ino = m ⊃ mkdir(m12, md5, m13, m14, entries3);(ino = m8 ⊃ mkdir(m2, md0, # links(m8, dirs0), m5, entries -- str);dirs0[ino])) .nsubdirs, (ino = m ⊃ mkdir(m12, md5, m13, m14, entries3);(ino = m8 ⊃ mkdir(m2, md0, # links(m8, dirs0), m5, entries -- str);dirs0[ino])).size) ;mkinode(ino, files[ino].meta, false, files[ino].nlink, 0, files[ino].size) ) )

Rule argument

fma: ino = m

Additional information

Used simplifier rules: ⊦ icache[ino, ie][ino] = ie; (s)%⊦ mkientry(boolvar, inode) = mkientry(boolvar0, inode0) ↔ (boolvar ↔ boolvar0) ∧ inode = inode0; (ws)%⊦ 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)% ⊦ afs-cons(dirs, files) ∧ ino ∈ dirs → ¬ ino ∈ files; (s)% ⊦ mkdir(m, md, m0, m1, entries).meta = md; (s)% ⊦ mkdir(m, md, m0, m1, entries).nlink = m0; (s)% ⊦ mkdir(m, md, m0, m1, entries).nsubdirs = m1; (s)% ⊦ mkdir(m, md, m0, m1, entries).size = m; (s) Used formulas: ino = m