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

Innermost Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

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

Furthermore, R contains four SCCs.


   R
DPs
       →DP Problem 1
Polynomial Ordering
       →DP Problem 2
Polo
       →DP Problem 3
Remaining
       →DP Problem 4
Remaining


Dependency Pair:

F(0, s(s(y)), s(0)) -> F(0, y, s(0))


Rules:


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


Strategy:

innermost




The following dependency pair can be strictly oriented:

F(0, s(s(y)), s(0)) -> F(0, y, s(0))


There are no usable rules for innermost that need to be oriented.

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

resulting in one new DP problem.



   R
DPs
       →DP Problem 1
Polo
           →DP Problem 5
Dependency Graph
       →DP Problem 2
Polo
       →DP Problem 3
Remaining
       →DP Problem 4
Remaining


Dependency Pair:


Rules:


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


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.


   R
DPs
       →DP Problem 1
Polo
       →DP Problem 2
Polynomial Ordering
       →DP Problem 3
Remaining
       →DP Problem 4
Remaining


Dependency Pair:

F(0, s(0), s(s(z))) -> F(0, s(0), z)


Rules:


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


Strategy:

innermost




The following dependency pair can be strictly oriented:

F(0, s(0), s(s(z))) -> F(0, s(0), z)


There are no usable rules for innermost that need to be oriented.

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

resulting in one new DP problem.



   R
DPs
       →DP Problem 1
Polo
       →DP Problem 2
Polo
           →DP Problem 6
Dependency Graph
       →DP Problem 3
Remaining
       →DP Problem 4
Remaining


Dependency Pair:


Rules:


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


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.


   R
DPs
       →DP Problem 1
Polo
       →DP Problem 2
Polo
       →DP Problem 3
Remaining Obligation(s)
       →DP Problem 4
Remaining Obligation(s)




The following remains to be proven:


   R
DPs
       →DP Problem 1
Polo
       →DP Problem 2
Polo
       →DP Problem 3
Remaining Obligation(s)
       →DP Problem 4
Remaining Obligation(s)




The following remains to be proven:

Innermost Termination of R could not be shown.
Duration:
0:00 minutes