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

Innermost Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

+'(x, s(y)) -> +'(x, y)
+'(s(x), y) -> +'(x, y)
+'(x, +(y, z)) -> +'(+(x, y), z)
+'(x, +(y, z)) -> +'(x, y)
F(g(f(x))) -> F(h(s(0), x))
F(g(h(x, y))) -> F(h(s(x), y))
F(h(x, h(y, z))) -> F(h(+(x, y), z))
F(h(x, h(y, z))) -> +'(x, y)

Furthermore, R contains two SCCs.


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


Dependency Pairs:

+'(x, +(y, z)) -> +'(x, y)
+'(x, +(y, z)) -> +'(+(x, y), z)
+'(s(x), y) -> +'(x, y)
+'(x, s(y)) -> +'(x, y)


Rules:


+(x, 0) -> x
+(x, s(y)) -> s(+(x, y))
+(0, y) -> y
+(s(x), y) -> s(+(x, y))
+(x, +(y, z)) -> +(+(x, y), z)
f(g(f(x))) -> f(h(s(0), x))
f(g(h(x, y))) -> f(h(s(x), y))
f(h(x, h(y, z))) -> f(h(+(x, y), z))


Strategy:

innermost




The following dependency pair can be strictly oriented:

+'(x, +(y, z)) -> +'(x, y)


The following usable rules for innermost can be oriented:

+(x, 0) -> x
+(x, s(y)) -> s(+(x, y))
+(0, y) -> y
+(s(x), y) -> s(+(x, y))
+(x, +(y, z)) -> +(+(x, y), z)


Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(0)=  1  
  POL(s(x1))=  x1  
  POL(+(x1, x2))=  1 + x1 + x2  
  POL(+'(x1, x2))=  1 + x1 + x2  

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


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


Dependency Pairs:

+'(x, +(y, z)) -> +'(+(x, y), z)
+'(s(x), y) -> +'(x, y)
+'(x, s(y)) -> +'(x, y)


Rules:


+(x, 0) -> x
+(x, s(y)) -> s(+(x, y))
+(0, y) -> y
+(s(x), y) -> s(+(x, y))
+(x, +(y, z)) -> +(+(x, y), z)
f(g(f(x))) -> f(h(s(0), x))
f(g(h(x, y))) -> f(h(s(x), y))
f(h(x, h(y, z))) -> f(h(+(x, y), z))


Strategy:

innermost




The following dependency pairs can be strictly oriented:

+'(s(x), y) -> +'(x, y)
+'(x, s(y)) -> +'(x, y)


The following usable rules for innermost can be oriented:

+(x, 0) -> x
+(x, s(y)) -> s(+(x, y))
+(0, y) -> y
+(s(x), y) -> s(+(x, y))
+(x, +(y, z)) -> +(+(x, y), z)


Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(0)=  0  
  POL(s(x1))=  1 + x1  
  POL(+(x1, x2))=  x1 + x2  
  POL(+'(x1, x2))=  x1 + x2  

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


   R
DPs
       →DP Problem 1
AFS
           →DP Problem 3
AFS
             ...
               →DP Problem 4
Dependency Graph
       →DP Problem 2
AFS


Dependency Pair:

+'(x, +(y, z)) -> +'(+(x, y), z)


Rules:


+(x, 0) -> x
+(x, s(y)) -> s(+(x, y))
+(0, y) -> y
+(s(x), y) -> s(+(x, y))
+(x, +(y, z)) -> +(+(x, y), z)
f(g(f(x))) -> f(h(s(0), x))
f(g(h(x, y))) -> f(h(s(x), y))
f(h(x, h(y, z))) -> f(h(+(x, y), z))


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.


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


Dependency Pair:

F(h(x, h(y, z))) -> F(h(+(x, y), z))


Rules:


+(x, 0) -> x
+(x, s(y)) -> s(+(x, y))
+(0, y) -> y
+(s(x), y) -> s(+(x, y))
+(x, +(y, z)) -> +(+(x, y), z)
f(g(f(x))) -> f(h(s(0), x))
f(g(h(x, y))) -> f(h(s(x), y))
f(h(x, h(y, z))) -> f(h(+(x, y), z))


Strategy:

innermost




The following dependency pair can be strictly oriented:

F(h(x, h(y, z))) -> F(h(+(x, y), z))


The following usable rules for innermost can be oriented:

+(x, 0) -> x
+(x, s(y)) -> s(+(x, y))
+(0, y) -> y
+(s(x), y) -> s(+(x, y))
+(x, +(y, z)) -> +(+(x, y), z)


Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(0)=  1  
  POL(h(x1, x2))=  1 + x1 + x2  
  POL(s(x1))=  x1  
  POL(F(x1))=  1 + x1  
  POL(+(x1, x2))=  x1 + x2  

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


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
           →DP Problem 5
Dependency Graph


Dependency Pair:


Rules:


+(x, 0) -> x
+(x, s(y)) -> s(+(x, y))
+(0, y) -> y
+(s(x), y) -> s(+(x, y))
+(x, +(y, z)) -> +(+(x, y), z)
f(g(f(x))) -> f(h(s(0), x))
f(g(h(x, y))) -> f(h(s(x), y))
f(h(x, h(y, z))) -> f(h(+(x, y), z))


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.

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