Term Rewriting System R:
[]
f(a) -> f(b)
g(b) -> g(a)

Termination of R to be shown.



   TRS
RFC Match Bounds



Termination could be shown with a Match Bound of 0.
The certificate found is represented by the following graph.

The certificate consists of the following enumerated nodes:

1, 2, 3, 4

Node 1 is start node and node 2 is final node.

Those nodes are connect through the following edges:



Termination of R successfully shown.
Duration:
0:00 minutes