At:
dfl-traversal-consl
2
1
1.
the_graph: Graph
2.
L: Vertices(the_graph) List
3.
i: Vertices(the_graph)
4.
s: traversal(the_graph)
5.
(inr(i) 
s)
6.
dfl-traversal(the_graph;L;s)
7.
j: Vertices(the_graph)
8.
inr(j) = inl(i) Vertices(the_graph)+Vertices(the_graph)
L-the_graph- > *j
By:
ObviousContradiction [-1]
Generated subgoals:
None
About:
