[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 297 from proof refine-rename-file-dentry (previous step)

# links(entries4[str], cache_dirs) = m19 + 1, cache_icache[m3, mkientry(false, mkinode(m3, md9, true, # links(m3, cache_dirs), m22, m6))] [entries4[str], mkientry(false, mkinode(entries4[str], md11, false, m19, 0, m18)) ] [ino ] .inode = mkinode(m, md, boolvar, m0, m1, m5), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries4[str]] = mkfile(m12, md3, m19 + 1, content), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries4[str0]] = mkfile(m8, md4, # links(entries4[str0], cache_dirs), content0), cache_dirs[m3] = mkdir(m6 + 1, md2, # links(m3, cache_dirs), m22, entries4), cache_files[entries4[str0]] = mkfile(m4, md5, # links(entries4[str0], cache_dirs), content2), cache_files[entries4[str]] = mkfile(m2, md7, m19 + 1, content1), boolvar, afs-cons(cache_dirs, (cache_files ⊕ cache_pcache) ⊕ cache_icache), afs-cons(cache_dirs, cache_files), afs-cons (cache_dirs[m3, mkdir(m6, md9, # links(m3, cache_dirs), m22, (entries4 -- str0)[str, entries4[str0]])], cache_files[entries4[str], mkfile(m18, md11, m19, content1)]), dcache-cons(cache_dcache, cache_dirs, cache_files), dcache-cons ((cache_dcache -- dentrykey(m3, str0))[dentrykey(m3, str), mkdentry(str, entries4[str0])], cache_dirs[m3, mkdir(m6, md9, # links(m3, cache_dirs), m22, (entries4 -- str0)[str, entries4[str0]])], cache_files[entries4[str], mkfile(m18, md11, m19, content1)]), icache-cons(cache_icache, cache_dirs, cache_files), icache-cons (cache_icache[m3, mkientry(false, mkinode(m3, md9, true, # links(m3, cache_dirs), m22, m6))] [entries4[str], mkientry(false, mkinode(entries4[str], md11, false, m19, 0, m18)) ], cache_dirs[m3, mkdir(m6, md9, # links(m3, cache_dirs), m22, (entries4 -- str0)[str, entries4[str0]])], cache_files[entries4[str], mkfile(m18, md11, m19, content1)]), pcache-cons(cache_pcache, cache_dirs, cache_files), pcache-cons (cache_pcache, cache_dirs[m3, mkdir(m6, md9, # links(m3, cache_dirs), m22, (entries4 -- str0)[str, entries4[str0]])], cache_files[entries4[str], mkfile(m18, md11, m19, content1)]), synced(cache_dirs, cache_icache, cache_pcache), synced (cache_dirs[m3, mkdir(m6, md9, # links(m3, cache_dirs), m22, (entries4 -- str0)[str, entries4[str0]])], cache_icache[m3, mkientry(false, mkinode(m3, md9, true, # links(m3, cache_dirs), m22, m6))] [entries4[str], mkientry(false, mkinode(entries4[str], md11, false, m19, 0, m18)) ], cache_pcache), ino ∈ cache_icache[m3, mkientry(false, mkinode(m3, md9, true, # links(m3, cache_dirs), m22, m6))] [entries4[str], mkientry(false, mkinode(entries4[str], md11, false, m19, 0, m18)) ], str ∈ entries4, entries4[str] ∈ cache_files, entries4[str0] ∈ cache_files, m3 ∈ cache_dirs, str0 ∈ entries4, ino ∈ cache_files, cache_sync → synced(cache_files, cache_icache, cache_pcache), cache_sync → synced (cache_files[entries4[str], mkfile(m18, md11, m19, content1)], cache_icache[m3, mkientry(false, mkinode(m3, md9, true, # links(m3, cache_dirs), m22, m6))] [entries4[str], mkientry(false, mkinode(entries4[str], md11, false, m19, 0, m18)) ], cache_pcache), links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO ⊦ (ino = entries4[str] ⊃ mkfile(m18, md11, m19, content);((cache_files ⊕ cache_pcache) ⊕ cache_icache)[ino]) = mkfile ((ino = entries4[str] ⊃ mkfile(m18, md11, m19, content1);cache_files[ino]).size, (ino = entries4[str] ⊃ mkfile(m18, md11, m19, content1);cache_files[ino]).meta, (ino = entries4[str] ⊃ mkfile(m18, md11, m19, content1);cache_files[ino]).nlink, (ino = entries4[str] ⊃ mkfile(m18, md11, m19, content1);cache_files[ino]).content ⊕ mkcontent(ino, cache_pcache)), mkdentry(str, entries4[str]) = mkdentry(str0, entries4[str0]), entries4[str0] ∈ cache_dirs, entries4[str] ∈ cache_dirs

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Rule argument

Additional information