Term Rewriting System R:
[X, Y]
ackin(s(X), s(Y)) -> u21(ackin(s(X), Y), X)
u21(ackout(X), Y) -> u22(ackin(Y, X))

Innermost Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

ACKIN(s(X), s(Y)) -> U21(ackin(s(X), Y), X)
ACKIN(s(X), s(Y)) -> ACKIN(s(X), Y)
U21(ackout(X), Y) -> ACKIN(Y, X)

Furthermore, R contains one SCC.


   R
DPs
       →DP Problem 1
Forward Instantiation Transformation


Dependency Pairs:

ACKIN(s(X), s(Y)) -> ACKIN(s(X), Y)
U21(ackout(X), Y) -> ACKIN(Y, X)
ACKIN(s(X), s(Y)) -> U21(ackin(s(X), Y), X)


Rules:


ackin(s(X), s(Y)) -> u21(ackin(s(X), Y), X)
u21(ackout(X), Y) -> u22(ackin(Y, X))


Strategy:

innermost




On this DP problem, a Forward Instantiation SCC transformation can be performed.
As a result of transforming the rule

ACKIN(s(X), s(Y)) -> U21(ackin(s(X), Y), X)
no new Dependency Pairs are created.
The transformation is resulting in one new DP problem:



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


Dependency Pair:

ACKIN(s(X), s(Y)) -> ACKIN(s(X), Y)


Rules:


ackin(s(X), s(Y)) -> u21(ackin(s(X), Y), X)
u21(ackout(X), Y) -> u22(ackin(Y, X))


Strategy:

innermost




The following dependency pair can be strictly oriented:

ACKIN(s(X), s(Y)) -> ACKIN(s(X), Y)


There are no usable rules for innermost that need to be oriented.
Used ordering: Polynomial ordering with Polynomial interpretation:
  POL(s(x1))=  1 + x1  
  POL(ACKIN(x1, x2))=  x1 + x2  

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


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


Dependency Pair:


Rules:


ackin(s(X), s(Y)) -> u21(ackin(s(X), Y), X)
u21(ackout(X), Y) -> u22(ackin(Y, X))


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.

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