[Imprint]
[Data Privacy Statement]
[E-Mail]
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
,
Theorem base summary for Specification search-tree
Status:
Proved!
Axioms: 13, User Theorems: 16 (Proved: 16, Partially proved: 0, Unproved: 0, Invalid: 0, Siginvalid: 0)
Proof steps: 329, Interactions: 54
bst-branch(0,0)
bst-leaf(0,0)
delete-prepost-loop(46,10)
insert-branch-right(0,0)
insert-prepost(83,18)
root-nonnull(4,1)
bst-branch-rec(2,1)
butleftmost(0,0)
delete-prepost-min(8,2)
insert-branch-same(0,0)
leftmost(0,0)
search_tree_delete_min(0,0)
bst-elem-in-branch(4,1)
butleftmost-bst(10,2)
in-branch(0,0)
insert-bst(35,3)
leftmost-in(2,0)
search_tree_insert(0,0)
bst-elem-order-left(4,1)
butleftmost-in(33,1)
in-leaf(0,0)
insert-in(25,0)
leftmost-ismin(12,0)
search_tree_mknode(0,0)
bst-elem-order-right(4,1)
delete-prepost(46,5)
insert-branch-left(0,0)
insert-leaf(0,0)
mknode-prepost(11,8)