(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
f(f(x)) → f(x)
f(s(x)) → f(x)
g(s(0)) → g(f(s(0)))
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(s(x)) → F(x)
G(s(0)) → G(f(s(0)))
G(s(0)) → F(s(0))
The TRS R consists of the following rules:
f(f(x)) → f(x)
f(s(x)) → f(x)
g(s(0)) → g(f(s(0)))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(3) DependencyGraphProof (EQUIVALENT transformation)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 2 less nodes.
(4) Obligation:
Q DP problem:
The TRS P consists of the following rules:
F(s(x)) → F(x)
The TRS R consists of the following rules:
f(f(x)) → f(x)
f(s(x)) → f(x)
g(s(0)) → g(f(s(0)))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(5) QDPOrderProof (EQUIVALENT transformation)
We use the reduction pair processor [LPAR04].
The following pairs can be oriented strictly and are deleted.
F(s(x)) → F(x)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
F(
x1) =
F(
x1)
s(
x1) =
s(
x1)
f(
x1) =
x1
g(
x1) =
g(
x1)
0 =
0
Lexicographic path order with status [LPO].
Quasi-Precedence:
0 > [F1, s1] > g1
Status:
F1: [1]
s1: [1]
g1: [1]
0: []
The following usable rules [FROCOS05] were oriented:
f(f(x)) → f(x)
f(s(x)) → f(x)
g(s(0)) → g(f(s(0)))
(6) Obligation:
Q DP problem:
P is empty.
The TRS R consists of the following rules:
f(f(x)) → f(x)
f(s(x)) → f(x)
g(s(0)) → g(f(s(0)))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(7) PisEmptyProof (EQUIVALENT transformation)
The TRS P is empty. Hence, there is no (P,Q,R) chain.
(8) TRUE