[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 246 from proof refine-rename-dir-negdentry (previous step)

# links (ino, cache_dirs [m9, (m9 = m16 ⊃ mkdir(m2 + 1, md2, m4, m5 + 1, entries[str0, entries1[str]]);mkdir(m0, md1, # links(m9, cache_dirs), m1, entries1 -- str)) .meta:= md0 ] [m16, mkdir(m13, md5, m14, m15, entries4) ]) = # links(ino, cache_dirs), (m16 = m9 ⊃ mkdir(m0, md1, # links(m9, cache_dirs), m1, entries1 -- str);mkdir(m6, md4, # links(m16, cache_dirs), m10, entries5)) = mkdir(m2, md2, m4, m5, entries), (m9 = m16 ⊃ mkdir(m2 + 1, md5, m4, m5 + 1, entries[str0, entries1[str]]);mkdir(m0, md0, # links(m9, cache_dirs), m1, entries1 -- str)) = mkdir(m8, md6, m17, m18, entries3), (m16 = m9 ⊃ mkdir(m2 + 1, md0, m4, m5 + 1, entries[str0, entries1[str]]);mkdir(m2 + 1, md2, m4, m5 + 1, entries[str0, entries1[str]])) = mkdir(m13, md7, m14, m15, entries4), cache_icache[ino] = mkientry(boolvar0, mkinode(m21, md9, false, m22, m23, m24)), cache_files[ino] = mkfile(m20, md8, # links(ino, cache_dirs), content), cache_icache[m9, mkientry(false, mkinode(m9, md6, true, m17, m18, m8))][m16, mkientry(false, mkinode(m16, md5, true, m14, m15, m13))][ino] = mkientry(boolvar, mkinode(m, md, true, m11, m12, m19)), cache_dirs[entries1[str]] = mkdir(m3, md3, # links(entries1[str], cache_dirs), m7, entries0), cache_dirs[m16] = mkdir(m6, md4, # links(m16, cache_dirs), m10, entries5), cache_dirs[m9] = mkdir(m0 + 1, md1, # links(m9, cache_dirs), m1 + 1, entries1), afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons (cache_dirs [m9, (m9 = m16 ⊃ mkdir(m2 + 1, md2, m4, m5 + 1, entries[str0, entries1[str]]);mkdir(m0, md1, # links(m9, cache_dirs), m1, entries1 -- str)) .meta:= md0 ] [m16, mkdir(m13, md5, m14, m15, entries4) ], cache_files), dcache-cons ((cache_dcache -- dentrykey(m9, str))[dentrykey(m16, str0), mkdentry(str0, entries1[str])], cache_dirs [m9, (m9 = m16 ⊃ mkdir(m2 + 1, md2, m4, m5 + 1, entries[str0, entries1[str]]);mkdir(m0, md1, # links(m9, cache_dirs), m1, entries1 -- str)) .meta:= md0 ] [m16, mkdir(m13, md5, m14, m15, entries4) ], cache_files), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons (cache_icache[m9, mkientry(false, mkinode(m9, md6, true, m17, m18, m8))][m16, mkientry(false, mkinode(m16, md5, true, m14, m15, m13))], cache_dirs [m9, (m9 = m16 ⊃ mkdir(m2 + 1, md2, m4, m5 + 1, entries[str0, entries1[str]]);mkdir(m0, md1, # links(m9, cache_dirs), m1, entries1 -- str)) .meta:= md0 ] [m16, mkdir(m13, md5, m14, m15, entries4) ], cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons (cache_pcache, cache_dirs [m9, (m9 = m16 ⊃ mkdir(m2 + 1, md2, m4, m5 + 1, entries[str0, entries1[str]]);mkdir(m0, md1, # links(m9, cache_dirs), m1, entries1 -- str)) .meta:= md0 ] [m16, mkdir(m13, md5, m14, m15, entries4) ], cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), synced (cache_dirs [m9, (m9 = m16 ⊃ mkdir(m2 + 1, md2, m4, m5 + 1, entries[str0, entries1[str]]);mkdir(m0, md1, # links(m9, cache_dirs), m1, entries1 -- str)) .meta:= md0 ] [m16, mkdir(m13, md5, m14, m15, entries4) ], cache_icache[m9, mkientry(false, mkinode(m9, md6, true, m17, m18, m8))][m16, mkientry(false, mkinode(m16, md5, true, m14, m15, m13))], cache_pcache), synced(cache_dirs, cache_icache, cache_pcache), ino ∈ cache_files, entries1[str] ∈ cache_dirs, m16 ∈ cache_dirs, str ∈ entries1, m9 ∈ cache_dirs, ino ∈ cache_icache[m9, mkientry(false, mkinode(m9, md6, true, m17, m18, m8))][m16, mkientry(false, mkinode(m16, md5, true, m14, m15, m13))], ino ∈ cache_icache, cache_sync → synced (cache_files, cache_icache[m9, mkientry(false, mkinode(m9, md6, true, m17, m18, m8))][m16, mkientry(false, mkinode(m16, md5, true, m14, m15, m13))], cache_pcache), cache_sync → synced(cache_files, cache_icache, cache_pcache), m16 = m9 → md5 = md0, links(m9, cache_dirs) ≠ ∅ ∨ m9 = ROOT_INO, links(m16, cache_dirs) ≠ ∅ ∨ m16 = ROOT_INO ⊦ str0 ∈ entries5, m24 = m20 ∧ md9 = md8 ∧ m22 = # links(ino, cache_dirs)

Heuristic use patterns applied rule insert rewrite lemma

And obtained the following new goals

Rule argument

spec: store, inst: icache name: At-other seq: ⊦ ino ≠ ino0 → icache[ino0, ie][ino] = icache[ino] subst: [ino, ino0, icache, ie] → [ino, m16, cache_icache [m9, mkientry(false, mkinode(m9, md6, true, m17, m18, m8)) ], mkientry(false, mkinode(m16, md5, true, m14, m15, m13))] flags: <all paths>

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) Used terms: ino, m16, cache_icache [m9, mkientry(false, mkinode(m9, md6, true, m17, m18, m8)) ], mkientry(false, mkinode(m16, md5, true, m14, m15, m13))