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

Innermost Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

ACK(s(x), 0) -> ACK(x, s(0))
ACK(s(x), s(y)) -> ACK(x, ack(s(x), y))
ACK(s(x), s(y)) -> ACK(s(x), y)

Furthermore, R contains one SCC.


   R
DPs
       →DP Problem 1
Polynomial Ordering


Dependency Pairs:

ACK(s(x), s(y)) -> ACK(s(x), y)
ACK(s(x), s(y)) -> ACK(x, ack(s(x), y))
ACK(s(x), 0) -> ACK(x, s(0))


Rules:


ack(0, y) -> s(y)
ack(s(x), 0) -> ack(x, s(0))
ack(s(x), s(y)) -> ack(x, ack(s(x), y))


Strategy:

innermost




The following dependency pairs can be strictly oriented:

ACK(s(x), s(y)) -> ACK(x, ack(s(x), y))
ACK(s(x), 0) -> ACK(x, s(0))


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

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

resulting in one new DP problem.



   R
DPs
       →DP Problem 1
Polo
           →DP Problem 2
Polynomial Ordering


Dependency Pair:

ACK(s(x), s(y)) -> ACK(s(x), y)


Rules:


ack(0, y) -> s(y)
ack(s(x), 0) -> ack(x, s(0))
ack(s(x), s(y)) -> ack(x, ack(s(x), y))


Strategy:

innermost




The following dependency pair can be strictly oriented:

ACK(s(x), s(y)) -> ACK(s(x), y)


There are no usable rules for innermost w.r.t. to the implicit AFS that need to be oriented.

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

resulting in one new DP problem.



   R
DPs
       →DP Problem 1
Polo
           →DP Problem 2
Polo
             ...
               →DP Problem 3
Dependency Graph


Dependency Pair:


Rules:


ack(0, y) -> s(y)
ack(s(x), 0) -> ack(x, s(0))
ack(s(x), s(y)) -> ack(x, ack(s(x), y))


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.

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