Term Rewriting System R:
[x, y, u, v]
s(a) -> a
s(s(x)) -> x
s(f(x, y)) -> f(s(y), s(x))
s(g(x, y)) -> g(s(x), s(y))
f(x, a) -> x
f(a, y) -> y
f(g(x, y), g(u, v)) -> g(f(x, u), f(y, v))
g(a, a) -> a

Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

S(f(x, y)) -> F(s(y), s(x))
S(f(x, y)) -> S(y)
S(f(x, y)) -> S(x)
S(g(x, y)) -> G(s(x), s(y))
S(g(x, y)) -> S(x)
S(g(x, y)) -> S(y)
F(g(x, y), g(u, v)) -> G(f(x, u), f(y, v))
F(g(x, y), g(u, v)) -> F(x, u)
F(g(x, y), g(u, v)) -> F(y, v)

Furthermore, R contains two SCCs. 


   R
     ↳DPs
       →DP Problem 1
         ↳Argument Filtering and Ordering
       →DP Problem 2
         ↳AFS


Dependency Pairs:

F(g(x, y), g(u, v)) -> F(y, v)
F(g(x, y), g(u, v)) -> F(x, u)


Rules:


s(a) -> a
s(s(x)) -> x
s(f(x, y)) -> f(s(y), s(x))
s(g(x, y)) -> g(s(x), s(y))
f(x, a) -> x
f(a, y) -> y
f(g(x, y), g(u, v)) -> g(f(x, u), f(y, v))
g(a, a) -> a





The following dependency pairs can be strictly oriented:

F(g(x, y), g(u, v)) -> F(y, v)
F(g(x, y), g(u, v)) -> F(x, u)


The following rules can be oriented:

s(a) -> a
s(s(x)) -> x
s(f(x, y)) -> f(s(y), s(x))
s(g(x, y)) -> g(s(x), s(y))
f(x, a) -> x
f(a, y) -> y
f(g(x, y), g(u, v)) -> g(f(x, u), f(y, v))
g(a, a) -> a


Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
s > f > g

resulting in one new DP problem.
Used Argument Filtering System:
F(x1, x2) -> F(x1, x2)
g(x1, x2) -> g(x1, x2)
s(x1) -> s(x1)
f(x1, x2) -> f(x1, x2)


   R
     ↳DPs
       →DP Problem 1
         ↳AFS
           →DP Problem 3
             ↳Dependency Graph
       →DP Problem 2
         ↳AFS


Dependency Pair:


Rules:


s(a) -> a
s(s(x)) -> x
s(f(x, y)) -> f(s(y), s(x))
s(g(x, y)) -> g(s(x), s(y))
f(x, a) -> x
f(a, y) -> y
f(g(x, y), g(u, v)) -> g(f(x, u), f(y, v))
g(a, a) -> a





Using the Dependency Graph resulted in no new DP problems.


   R
     ↳DPs
       →DP Problem 1
         ↳AFS
       →DP Problem 2
         ↳Argument Filtering and Ordering


Dependency Pairs:

S(g(x, y)) -> S(y)
S(g(x, y)) -> S(x)
S(f(x, y)) -> S(x)
S(f(x, y)) -> S(y)


Rules:


s(a) -> a
s(s(x)) -> x
s(f(x, y)) -> f(s(y), s(x))
s(g(x, y)) -> g(s(x), s(y))
f(x, a) -> x
f(a, y) -> y
f(g(x, y), g(u, v)) -> g(f(x, u), f(y, v))
g(a, a) -> a





The following dependency pairs can be strictly oriented:

S(g(x, y)) -> S(y)
S(g(x, y)) -> S(x)
S(f(x, y)) -> S(x)
S(f(x, y)) -> S(y)


The following rules can be oriented:

s(a) -> a
s(s(x)) -> x
s(f(x, y)) -> f(s(y), s(x))
s(g(x, y)) -> g(s(x), s(y))
f(x, a) -> x
f(a, y) -> y
f(g(x, y), g(u, v)) -> g(f(x, u), f(y, v))
g(a, a) -> a


Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
s > f > g

resulting in one new DP problem.
Used Argument Filtering System:
S(x1) -> S(x1)
f(x1, x2) -> f(x1, x2)
g(x1, x2) -> g(x1, x2)
s(x1) -> s(x1)


   R
     ↳DPs
       →DP Problem 1
         ↳AFS
       →DP Problem 2
         ↳AFS
           →DP Problem 4
             ↳Dependency Graph


Dependency Pair:


Rules:


s(a) -> a
s(s(x)) -> x
s(f(x, y)) -> f(s(y), s(x))
s(g(x, y)) -> g(s(x), s(y))
f(x, a) -> x
f(a, y) -> y
f(g(x, y), g(u, v)) -> g(f(x, u), f(y, v))
g(a, a) -> a





Using the Dependency Graph resulted in no new DP problems.

Termination of R successfully shown.
Duration:
0:00 minutes