[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 13 from proof decode-node (
previous step
)
str0 = "persistence: decode_node buffer insufficient", # buf < n + m1, 2 * NODE_HEADER_SIZE ≤ m1 ⊦ ∀ . true → ⟪err := EINVAL⟫ ⌊err⌋
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 14
:
# buf < n + m1, 2 * NODE_HEADER_SIZE ≤ m1 ⊦ ⟪err := EINVAL⟫ ⌊err⌋
Rule argument
Additional information