Term Rewriting System R:
[x, y, z]
f(x, c(x), c(y)) -> f(y, y, f(y, x, y))
f(s(x), y, z) -> f(x, s(c(y)), c(z))
f(c(x), x, y) -> c(y)
g(x, y) -> x
g(x, y) -> y

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

F(x, c(x), c(y)) -> F(y, y, f(y, x, y))
F(x, c(x), c(y)) -> F(y, x, y)
F(s(x), y, z) -> F(x, s(c(y)), c(z))

Furthermore, R contains two SCCs. 


   R
     ↳DPs
       →DP Problem 1
         ↳Usable Rules (Innermost)
       →DP Problem 2
         ↳UsableRules


Dependency Pair:

F(s(x), y, z) -> F(x, s(c(y)), c(z))


Rules:


f(x, c(x), c(y)) -> f(y, y, f(y, x, y))
f(s(x), y, z) -> f(x, s(c(y)), c(z))
f(c(x), x, y) -> c(y)
g(x, y) -> x
g(x, y) -> y


Strategy:

innermost




As we are in the innermost case, we can delete all 5 non-usable-rules.


   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
           →DP Problem 3
             ↳Size-Change Principle
       →DP Problem 2
         ↳UsableRules


Dependency Pair:

F(s(x), y, z) -> F(x, s(c(y)), c(z))


Rule:

none


Strategy:

innermost




We number the DPs as follows:
  1. F(s(x), y, z) -> F(x, s(c(y)), c(z))
and get the following Size-Change Graph(s):
{1} , {1}
1>1

which lead(s) to this/these maximal multigraph(s):
{1} , {1}
1>1

DP: empty set
Oriented Rules: none

We used the order Homeomorphic Embedding Order with Non-Strict Precedence.
trivial

with Argument Filtering System:
c(x1) -> c(x1)
s(x1) -> s(x1)

We obtain no new DP problems. 


   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
       →DP Problem 2
         ↳Usable Rules (Innermost)


Dependency Pair:

F(x, c(x), c(y)) -> F(y, x, y)


Rules:


f(x, c(x), c(y)) -> f(y, y, f(y, x, y))
f(s(x), y, z) -> f(x, s(c(y)), c(z))
f(c(x), x, y) -> c(y)
g(x, y) -> x
g(x, y) -> y


Strategy:

innermost




As we are in the innermost case, we can delete all 5 non-usable-rules.


   R
     ↳DPs
       →DP Problem 1
         ↳UsableRules
       →DP Problem 2
         ↳UsableRules
           →DP Problem 4
             ↳Size-Change Principle


Dependency Pair:

F(x, c(x), c(y)) -> F(y, x, y)


Rule:

none


Strategy:

innermost




We number the DPs as follows:
  1. F(x, c(x), c(y)) -> F(y, x, y)
and get the following Size-Change Graph(s):
{1} , {1}
1=2
2>2
3>1
3>3

which lead(s) to this/these maximal multigraph(s):
{1} , {1}
1>2
2>2
3>1
3>2
3>3

DP: empty set
Oriented Rules: none

We used the order Homeomorphic Embedding Order with Non-Strict Precedence.
trivial

with Argument Filtering System:
c(x1) -> c(x1)

We obtain no new DP problems.

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