(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
g(0, f(x, x)) → x
g(x, s(y)) → g(f(x, y), 0)
g(s(x), y) → g(f(x, y), 0)
g(f(x, y), 0) → f(g(x, 0), g(y, 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:
G(x, s(y)) → G(f(x, y), 0)
G(s(x), y) → G(f(x, y), 0)
G(f(x, y), 0) → G(x, 0)
G(f(x, y), 0) → G(y, 0)
The TRS R consists of the following rules:
g(0, f(x, x)) → x
g(x, s(y)) → g(f(x, y), 0)
g(s(x), y) → g(f(x, y), 0)
g(f(x, y), 0) → f(g(x, 0), g(y, 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 1 less node.
(4) Obligation:
Q DP problem:
The TRS P consists of the following rules:
G(f(x, y), 0) → G(x, 0)
G(s(x), y) → G(f(x, y), 0)
G(f(x, y), 0) → G(y, 0)
The TRS R consists of the following rules:
g(0, f(x, x)) → x
g(x, s(y)) → g(f(x, y), 0)
g(s(x), y) → g(f(x, y), 0)
g(f(x, y), 0) → f(g(x, 0), g(y, 0))
Q is empty.
We have to consider all minimal (P,Q,R)-chains.