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
         ↳Argument Filtering and Ordering


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




The following dependency pairs can be strictly oriented:

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)


The following usable rules for innermost can be oriented:

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


Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
s > {ackin, ackout} > u22
s > U21 > ACKIN

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


   R
     ↳DPs
       →DP Problem 1
         ↳AFS
           →DP Problem 2
             ↳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