[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 1186 from proof refine-truncate-buff-some (previous step)

# buf-opt0.buf = VFS_PAGE_SIZE, cache_files[m] = mkfile(m1, md2, # links(m, cache_dirs), content1), cache_icache[m] = mkientry(boolvar0, mkinode(m0, md0, false, # links(m, cache_dirs), m11, m12)), buf-opt0.some?, afs-cons(cache_dirs, cache_files), afs-cons(cache_dirs, (cache_files ⊕ cache_pcache0) ⊕ cache_icache), dcache-cons(cache_dcache, cache_dirs, cache_files), icache-cons(cache_icache, cache_dirs, cache_files), pcache-cons(cache_pcache0, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache0), m ∈ cache_files, m ∈ cache_icache, cache_sync → synced(cache_files, cache_icache, cache_pcache0), ∀ key. key ∈ cache_pcache0 → key.data? ⊦ n * VFS_PAGE_SIZE < min(m8, m2) ∧ n ∈ content1 ⊕ mkcontent(m, cache_pcache0) ↔ n ∈ (content1 upto min(m8, m2)) ⊕ mkcontent(m, truncate(m, min(m8, m2), cache_pcache0)), m2 ≤ m8 ∧ m2 % VFS_PAGE_SIZE ≠ 0

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Proof step 1187:
# buf-opt0.buf = VFS_PAGE_SIZE, cache_icache[m] = mkientry(boolvar0, mkinode(m0, md0, false, # links(m, cache_dirs), m11, m12)), cache_files[m] = mkfile(m1, md2, # links(m, cache_dirs), content1), buf-opt0.some?, afs-cons(cache_dirs, (cache_files ⊕ cache_pcache0) ⊕ 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_pcache0, cache_dirs, cache_files), synced(cache_dirs, cache_icache, cache_pcache0), m ∈ cache_icache, m ∈ cache_files, n ∈ (content1 upto min(m8, m2)) ⊕ mkcontent(m, truncate(m, min(m8, m2), cache_pcache0)), cache_sync → synced(cache_files, cache_icache, cache_pcache0), ∀ key. key ∈ cache_pcache0 → key.data? ⊦ n * VFS_PAGE_SIZE < min(m8, m2) ∧ n ∈ content1 ⊕ mkcontent(m, cache_pcache0) ↔ n ∈ (content1 upto min(m8, m2)) ⊕ mkcontent(m, truncate(m, min(m8, m2), cache_pcache0)), m2 ≤ m8 ∧ m2 % VFS_PAGE_SIZE ≠ 0

Rule argument

fma: n ∈ (content1 upto min(m8, m2)) ⊕ mkcontent(m, truncate(m, min(m8, m2), cache_pcache0))

Additional information

Used simplifier rules: ⊦ n ∈ content0 ⊕ content1 ↔ n ∈ content0 ∨ n ∈ content1; (ws)% ⊦ m ∈ content upto n ↔ m * VFS_PAGE_SIZE < n ∧ m ∈ content; (s)% ⊦ n ∈ mkcontent(ino, pcache) ↔ datakey(ino, n) ∈ pcache; (s)%⊦ key ∈ truncate(ino, size, pcache) ↔ key.data? ∧ key ∈ pcache ∧ (key.part * VFS_PAGE_SIZE < size ∨ ino ≠ key.ino); (s)% ⊦ datakey(m, m0).data?; (s)% ⊦ datakey(m, m0).part = m0; (s) Used formulas: n ∈ (content1 upto min(m8, m2)) ⊕ mkcontent(m, truncate(m, min(m8, m2), cache_pcache0))