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

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

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Rule argument

fma: ino = m3

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) Used formulas: ino = m3