(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(f(x)) → g(f(x))
g(g(x)) → f(x)
Q is empty.
(1) QTRSRRRProof (EQUIVALENT transformation)
Used ordering:
Polynomial interpretation [POLO]:
POL(f(x1)) = 3 + x1
POL(g(x1)) = 2 + x1
With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:
f(f(x)) → g(f(x))
g(g(x)) → f(x)
(2) Obligation:
Q restricted rewrite system:
R is empty.
Q is empty.
(3) RisEmptyProof (EQUIVALENT transformation)
The TRS R is empty. Hence, termination is trivially proven.
(4) YES