[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 269 from proof refine-evict (previous step)

# links(m, cache_dirs) = 0, (∅)[m] = mkientry(boolvar1, mkinode(m7, md3, boolvar, m8, m9, m10)), cache_icache[ino] = mkientry(boolvar0, mkinode(m2, md, true, m3, m4, m5)), cache_files[m] = mkfile(m0, md0, 0, content), cache_files[ino] = mkfile(m6, md2, # links(ino, cache_dirs), content1), cache_pcache[datakey(ino, n)] = mkpentry(boolvar2, buf), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons(cache_dirs, cache_files), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache), datakey(ino, n) ∈ cache_pcache, ino ∈ cache_icache, ino ∈ cache_files, m ∈ cache_files, n ∈ content1 ⊕ mkcontent(ino, cache_pcache), cache_sync → synced(cache_files, cache_icache, cache_pcache), ∀ key. key ∈ cache_pcache → key.data? ⊦ buf = (content1 ⊕ mkcontent(ino, evict(m, cache_pcache)))[n], m = ROOT_INO, m ∈ cache_dirs, m ∈ cache_icache

Heuristic use patterns applied rule insert rewrite lemma

And obtained the following new goals

Proof step 270:
⊦ n ∈ content1 → (content0 ⊕ content1)[n] = content1[n]
Proof step 271:
# links(m, cache_dirs) = 0, cache_pcache[datakey(ino, n)] = mkpentry(boolvar2, buf), cache_files[ino] = mkfile(m6, md2, # links(ino, cache_dirs), content1), cache_files[m] = mkfile(m0, md0, 0, content), cache_icache[ino] = mkientry(boolvar0, mkinode(m2, md, true, m3, m4, m5)), (∅)[m] = mkientry(boolvar1, mkinode(m7, md3, boolvar, m8, m9, m10)), afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache), n ∈ content1 ⊕ mkcontent(ino, cache_pcache), m ∈ cache_files, ino ∈ cache_files, ino ∈ cache_icache, datakey(ino, n) ∈ cache_pcache, cache_sync → synced(cache_files, cache_icache, cache_pcache), ∀ key. key ∈ cache_pcache → key.data? ⊦ buf = (content1 ⊕ mkcontent(ino, evict(m, cache_pcache)))[n], m = ROOT_INO, m ∈ cache_icache, m ∈ cache_dirs, n ∈ mkcontent(ino, evict(m, cache_pcache))
Proof step 277:
# links(m, cache_dirs) = 0, cache_pcache[datakey(ino, n)] = mkpentry(boolvar2, buf), cache_files[ino] = mkfile(m6, md2, # links(ino, cache_dirs), content1), cache_files[m] = mkfile(m0, md0, 0, content), cache_icache[ino] = mkientry(boolvar0, mkinode(m2, md, true, m3, m4, m5)), (∅)[m] = mkientry(boolvar1, mkinode(m7, md3, boolvar, m8, m9, m10)), afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache), n ∈ content1 ⊕ mkcontent(ino, cache_pcache), m ∈ cache_files, ino ∈ cache_files, ino ∈ cache_icache, datakey(ino, n) ∈ cache_pcache, n ∈ mkcontent(ino, evict(m, cache_pcache)), cache_sync → synced(cache_files, cache_icache, cache_pcache), ∀ key. key ∈ cache_pcache → key.data? ⊦ buf = mkcontent(ino, evict(m, cache_pcache))[n], m = ROOT_INO, m ∈ cache_icache, m ∈ cache_dirs

Rule argument

spec: cache-base name: at-overwrite-content-new seq: ⊦ n ∈ content1 → (content0 ⊕ content1)[n] = content1[n] subst: [n, content1, content0] → [n, mkcontent(ino, evict(m, cache_pcache)), content1] flags: <all paths>

Additional information

Used terms: n, mkcontent(ino, evict(m, cache_pcache)), content1