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

# links(entries[str], cache_dirs) = m0 + 1, (m ∈ cache_dirs ⊃ mkinode(m, md, true, # links(m, cache_dirs), m4, m1) ;mkinode (m, cache_files [entries[str], cache_files [entries[str], cache_files[entries[str], mkfile(m2, md3, m0, content)][entries[str]] .size:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).size ] [entries[str] ] .meta:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).meta ] [m ] .meta, false, cache_files [entries[str], cache_files [entries[str], cache_files[entries[str], mkfile(m2, md3, m0, content)][entries[str]] .size:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).size ] [entries[str] ] .meta:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).meta ] [m ] .nlink, 0, cache_files [entries[str], cache_files [entries[str], cache_files[entries[str], mkfile(m2, md3, m0, content)][entries[str]] .size:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).size ] [entries[str] ] .meta:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).meta ] [m ] .size) ) = mkinode(m3, md1, boolvar, m5, m8, m9), cache_files[entries[str]] = mkfile(m2, md3, m0 + 1, content), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries[str]] = mkfile(m7, md2, m0 + 1, content0), cache_dirs[m] = mkdir(m1 + 1, md4, # links(m, cache_dirs), m4, entries), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, err = ESUCCESS, 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), entries[str] ∈ cache_files, m ∈ cache_dirs, str ∈ entries, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m, cache_dirs) ≠ ∅ ∨ m = ROOT_INO ⊦ [icache_set# (getinode (entries[str], cache_dirs[m, mkdir(m1, md, # links(m, cache_dirs), m4, entries -- str)], cache_files [entries[str], cache_files[entries[str], cache_files[entries[str], mkfile(m2, md3, m0, content)][entries[str]].size:= m6][entries[str]].meta:= md0 ]), false ; err, cache_icache); icache_set# ((m ∈ cache_dirs ⊃ mkinode(m, md, true, # links(m, cache_dirs), m4, m1) ;mkinode (m, cache_files [entries[str], cache_files [entries[str], cache_files[entries[str], mkfile(m2, md3, m0, content)][entries[str]] .size:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).size ] [entries[str] ] .meta:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).meta ] [m ] .meta, false, cache_files [entries[str], cache_files [entries[str], cache_files[entries[str], mkfile(m2, md3, m0, content)][entries[str]] .size:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).size ] [entries[str] ] .meta:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).meta ] [m ] .nlink, 0, cache_files [entries[str], cache_files [entries[str], cache_files[entries[str], mkfile(m2, md3, m0, content)][entries[str]] .size:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).size ] [entries[str] ] .meta:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).meta ] [m ] .size) ), false ; err, cache_icache); dcache_delete#(m3, mkdentry(str, entries[str]).name; err, cache_dcache)] ( icache-cons (cache_icache, cache_dirs[m, mkdir(m1, md, # links(m, cache_dirs), m4, entries -- str)], cache_files[entries[str], mkfile(m6, md0, m0, content)]) ∧ dcache-cons (cache_dcache, cache_dirs[m, mkdir(m1, md, # links(m, cache_dirs), m4, entries -- str)], cache_files[entries[str], mkfile(m6, md0, m0, content)]) ∧ pcache-cons (cache_pcache, cache_dirs[m, mkdir(m1, md, # links(m, cache_dirs), m4, entries -- str)], cache_files[entries[str], mkfile(m6, md0, m0, content)]) ∧ synced(cache_dirs[m, mkdir(m1, md, # links(m, cache_dirs), m4, entries -- str)], cache_icache, cache_pcache) ∧ (cache_sync → synced(cache_files[entries[str], mkfile(m6, md0, m0, content)], cache_icache, cache_pcache)) ∧ afs-cons (cache_dirs[m, mkdir(m1, md, # links(m, cache_dirs), m4, entries -- str)], cache_files[entries[str], mkfile(m6, md0, m0, content)]) → ⟨dent0 := mkdentry(str, entries[str]); p_inode0 := mkinode(m, md, true, # links(m, cache_dirs), m4, m1 + 1); p_inode1 := mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6); cache_dirs0 := cache_dirs; cache_dirs1 := cache_dirs; cache_dirs2 := cache_dirs; cache_dirs3 := cache_dirs; afs_unlink#(; p_inode0, p_inode1, dent0, err0, cache_dirs, afs_files; afs_asynced)⟩ ( cache_dirs = cache_dirs2[m, mkdir(m1, md, # links(m, cache_dirs2), m4, entries -- str)] ∧ afs_files = (cache_files[entries[str], mkfile(m6, md0, m0, content)] ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ asynced0) ∧ (m ∈ cache_dirs2 ⊃ mkinode(m, md, true, # links(m, cache_dirs2), m4, m1) ;mkinode (m, (m = entries[str] ⊃ mkfile(m6, md0, m0, content);cache_files[m]).meta, false, (m = entries[str] ⊃ mkfile(m6, md0, m0, content);cache_files[m]).nlink, 0, (m = entries[str] ⊃ mkfile(m6, md0, m0, content);cache_files[m]).size) ) = p_inode0 ∧ (entries[str] ∈ cache_dirs3 ⊃ mkinode (entries[str], (entries[str] = m ⊃ mkdir(m1, md, # links(entries[str], cache_dirs3), m4, entries -- str);cache_dirs3[entries[str]]).meta, true, (entries[str] = m ⊃ mkdir(m1, md, # links(entries[str], cache_dirs3), m4, entries -- str);cache_dirs3[entries[str]]).nlink, (entries[str] = m ⊃ mkdir(m1, md, # links(entries[str], cache_dirs3), m4, entries -- str);cache_dirs3[entries[str]]).nsubdirs, (entries[str] = m ⊃ mkdir(m1, md, # links(entries[str], cache_dirs3), m4, entries -- str);cache_dirs3[entries[str]]).size) ;mkinode(entries[str], md0, false, m0, 0, m6) ) = p_inode1 ∧ negdentry(str) = dent0 ∧ err = err0))

Heuristic simplifier applied rule simplifier

And obtained the following new goals

Proof step 98:
# links(entries[str], cache_dirs) = m0 + 1, cache_files[entries[str]] = mkfile(m2, md3, m0 + 1, content), ((cache_files ⊕ cache_pcache) ⊕ cache_icache)[entries[str]] = mkfile(m7, md2, m0 + 1, content0), cache_dirs[m3] = mkdir(m9 + 1, md4, # links(m3, cache_dirs), m8, entries), afs_files = (cache_files ⊕ cache_pcache) ⊕ cache_icache, err = ESUCCESS, 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), entries[str] ∈ cache_files, m3 ∈ cache_dirs, str ∈ entries, cache_sync → synced(cache_files, cache_icache, cache_pcache), links(m3, cache_dirs) ≠ ∅ ∨ m3 = ROOT_INO ⊦ [icache_set# (getinode (entries[str], cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m8, entries -- str)], cache_files [entries[str], cache_files[entries[str], cache_files[entries[str], mkfile(m2, md3, m0, content)][entries[str]].size:= m6][entries[str]].meta:= md0 ]), false ; err, cache_icache); icache_set# ((m3 ∈ cache_dirs ⊃ mkinode(m3, md1, true, # links(m3, cache_dirs), m8, m9) ;mkinode (m3, cache_files [entries[str], cache_files [entries[str], cache_files[entries[str], mkfile(m2, md3, m0, content)][entries[str]] .size:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).size ] [entries[str] ] .meta:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).meta ] [m3 ] .meta, false, cache_files [entries[str], cache_files [entries[str], cache_files[entries[str], mkfile(m2, md3, m0, content)][entries[str]] .size:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).size ] [entries[str] ] .meta:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).meta ] [m3 ] .nlink, 0, cache_files [entries[str], cache_files [entries[str], cache_files[entries[str], mkfile(m2, md3, m0, content)][entries[str]] .size:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).size ] [entries[str] ] .meta:= mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6).meta ] [m3 ] .size) ), false ; err, cache_icache); dcache_delete#(m3, mkdentry(str, entries[str]).name; err, cache_dcache)] ( icache-cons (cache_icache, cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m8, entries -- str)], cache_files[entries[str], mkfile(m6, md0, m0, content)]) ∧ dcache-cons (cache_dcache, cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m8, entries -- str)], cache_files[entries[str], mkfile(m6, md0, m0, content)]) ∧ pcache-cons (cache_pcache, cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m8, entries -- str)], cache_files[entries[str], mkfile(m6, md0, m0, content)]) ∧ synced(cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m8, entries -- str)], cache_icache, cache_pcache) ∧ (cache_sync → synced(cache_files[entries[str], mkfile(m6, md0, m0, content)], cache_icache, cache_pcache)) ∧ afs-cons (cache_dirs[m3, mkdir(m9, md1, # links(m3, cache_dirs), m8, entries -- str)], cache_files[entries[str], mkfile(m6, md0, m0, content)]) → ⟨dent0 := mkdentry(str, entries[str]); p_inode0 := mkinode(m3, md1, true, # links(m3, cache_dirs), m8, m9 + 1); p_inode1 := mkinode(entries[str], md0, false, # links(entries[str], cache_dirs), 0, m6); cache_dirs0 := cache_dirs; cache_dirs1 := cache_dirs; cache_dirs2 := cache_dirs; cache_dirs3 := cache_dirs; afs_unlink#(; p_inode0, p_inode1, dent0, err0, cache_dirs, afs_files; afs_asynced)⟩ ( cache_dirs = cache_dirs2[m3, mkdir(m9, md1, # links(m3, cache_dirs2), m8, entries -- str)] ∧ afs_files = (cache_files[entries[str], mkfile(m6, md0, m0, content)] ⊕ cache_pcache) ⊕ cache_icache ∧ (afs_asynced ↔ asynced0) ∧ (m3 ∈ cache_dirs2 ⊃ mkinode(m3, md1, true, # links(m3, cache_dirs2), m8, m9) ;mkinode (m3, (m3 = entries[str] ⊃ mkfile(m6, md0, m0, content);cache_files[m3]).meta, false, (m3 = entries[str] ⊃ mkfile(m6, md0, m0, content);cache_files[m3]).nlink, 0, (m3 = entries[str] ⊃ mkfile(m6, md0, m0, content);cache_files[m3]).size) ) = p_inode0 ∧ (entries[str] ∈ cache_dirs3 ⊃ mkinode (entries[str], (entries[str] = m3 ⊃ mkdir(m9, md1, # links(entries[str], cache_dirs3), m8, entries -- str);cache_dirs3[entries[str]]).meta, true, (entries[str] = m3 ⊃ mkdir(m9, md1, # links(entries[str], cache_dirs3), m8, entries -- str);cache_dirs3[entries[str]]).nlink, (entries[str] = m3 ⊃ mkdir(m9, md1, # links(entries[str], cache_dirs3), m8, entries -- str);cache_dirs3[entries[str]]).nsubdirs, (entries[str] = m3 ⊃ mkdir(m9, md1, # links(entries[str], cache_dirs3), m8, entries -- str);cache_dirs3[entries[str]]).size) ;mkinode(entries[str], md0, false, m0, 0, m6) ) = p_inode1 ∧ negdentry(str) = dent0 ∧ err = err0))

Rule argument

Additional information

Used simplifier rules: ⊦ 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)