(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) DependencyPairsProof (EQUIVALENT transformation)
Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
(2) Obligation:
Q DP problem:
The TRS P consists of the following rules:
F(f(x)) → G(f(x))
G(g(x)) → F(x)
The TRS R consists of the following rules:
f(f(x)) → g(f(x))
g(g(x)) → f(x)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(3) QDPOrderProof (EQUIVALENT transformation)
We use the reduction pair processor [LPAR04].
The following pairs can be oriented strictly and are deleted.
F(f(x)) → G(f(x))
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
F(
x0,
x1) =
F(
x0)
G(
x0,
x1) =
G(
x1)
Tags:
F has argument tags [1,2] and root tag 0
G has argument tags [2,1] and root tag 0
Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Combined order from the following AFS and order.
F(
x1) =
F(
x1)
f(
x1) =
f(
x1)
G(
x1) =
G
g(
x1) =
g(
x1)
Lexicographic path order with status [LPO].
Quasi-Precedence:
G > [F1, f1, g1]
Status:
F1: [1]
f1: [1]
G: []
g1: [1]
The following usable rules [FROCOS05] were oriented:
none
(4) Obligation:
Q DP problem:
The TRS P consists of the following rules:
G(g(x)) → F(x)
The TRS R consists of the following rules:
f(f(x)) → g(f(x))
g(g(x)) → f(x)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(5) DependencyGraphProof (EQUIVALENT transformation)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.
(6) TRUE