[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 3 from proof abs-nodes-nospace-h (
previous step
)
x = [], # buf < NODE_HEADER_SIZE ⊦ abs-nodes(buf, m, x, lax, boolvar) ↔ x = [] ∧ lax = [] ∧ buf = mkbuf(0)
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 4
:
# buf < NODE_HEADER_SIZE ⊦ abs-nodes(buf, m, [], lax, boolvar) ↔ lax = [] ∧ buf = mkbuf(0)
Rule argument
Additional information