[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 4 from proof inv-fsync (previous step)
| inode.nlink = files[inode.ino].nlink, inode.nsubdirs = 0, afs-cons(dirs, files), inode.ino ∈ files, ¬ inode.directory
⊦ ⟪fail_or_success#(; ; err); choose bv with true in asynced0 := bv⟫ true |
Heuristic elimination applied rule insert elim lemma
And obtained the following new goals
- Proof step 5:
¬ boolvar, inode = mkinode(m, md, boolvar, m0, m1, m2), m0 = files[m].nlink, m1 = 0, afs-cons(dirs, files), m ∈ files
⊦ ⟪fail_or_success#(; ; err); choose bv with true in asynced0 := bv⟫ true
Rule argument
spec: inode
name: elim
seq: ⊦ ( ( ( (m = inode.ino ∧ md = inode.meta)
∧ (boolvar ↔ inode.directory))
∧ m0 = inode.nlink)
∧ m1 = inode.nsubdirs)
∧ m2 = inode.size
↔ inode = mkinode(m, md, boolvar, m0, m1, m2)
subst: [inode, m, md, boolvar, m0, m1, m2]
→ [inode, m, md, boolvar, m0, m1, m2]Additional information
Used simplifier rules:
⊦ ( ( ( (m = inode.ino ∧ md = inode.meta)
∧ (boolvar ↔ inode.directory))
∧ m0 = inode.nlink)
∧ m1 = inode.nsubdirs)
∧ m2 = inode.size
↔ inode = mkinode(m, md, boolvar, m0, m1, m2); (elim)
Used terms: inode, m, md, boolvar, m0, m1, m2