[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 38 from proof inv-mkdir (previous step)

dirs0[m] = mkdir(m0, md2, # links(m, dirs0), m2, entries0), ino0 ≠ 0, afs-cons(dirs0, files), afs-cons((dirs0[m, mkdir(m0 + 1, md2, # links(m, dirs0), m2 + 1, entries0[str, ino0])] ++ ino0)[ino0, mkdir(0, md, 1, 0, ∅)], files), afs-cons ((dirs0[m, mkdir(m0 + 1, md2, # links(m, dirs0), m2 + 1, entries0[str, ino0])] ++ ino0)[ino0, mkdir(0, md, 1, 0, ∅)] [m, (dirs0[m, mkdir(m0 + 1, md2, # links(m, dirs0), m2 + 1, entries0[str, ino0])] ++ ino0)[m].meta:= md0 ], files), m ∈ dirs0, ¬ str ∈ entries0, ¬ ino0 ∈ files, ¬ ino0 ∈ dirs0, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO ⊦ ⟪asynced := ?⟫ true

Heuristic nonsplitting cut applied rule cut formula

And obtained the following new goals

Proof step 39:
dirs0[m] = mkdir(m0, md2, # links(m, dirs0), m2, entries0), afs-cons ((dirs0[m, mkdir(m0 + 1, md2, # links(m, dirs0), m2 + 1, entries0[str, ino0])] ++ ino0)[ino0, mkdir(0, md, 1, 0, ∅)] [m, (dirs0[m, mkdir(m0 + 1, md2, # links(m, dirs0), m2 + 1, entries0[str, ino0])] ++ ino0)[m].meta:= md0 ], files), afs-cons((dirs0[m, mkdir(m0 + 1, md2, # links(m, dirs0), m2 + 1, entries0[str, ino0])] ++ ino0)[ino0, mkdir(0, md, 1, 0, ∅)], files), afs-cons(dirs0, files), m ∈ dirs0, links(m, dirs0) ≠ ∅ ∨ m = ROOT_INO ⊦ ⟪asynced := ?⟫ true, ino0 = 0, m = ino0, str ∈ entries0, ino0 ∈ files, ino0 ∈ dirs0

Rule argument

fma: m = ino0

Additional information

Used simplifier rules: ⊦ afs-cons(dirs, files) ∧ ¬ ino ∈ dirs ∧ ¬ ino ∈ files → links(ino, dirs) = ∅; (s)% ⊦ # ∅ = 0; (s) Used formulas: m = ino0