Term Rewriting System
R
:
[
x
]
f
(
f
(
x
)) ->
g
(
f
(
x
))
Innermost Termination
of
R
to be shown.
R
↳
Dependency Pair Analysis
R
contains
no
Dependency Pairs
and therefore no SCCs.
Innermost Termination
of
R
successfully shown.
Duration:
0:00 minutes