Term Rewriting System R:
[n, m]
ackin(0, n) -> ackout(s(n))
ackin(s(m), 0) -> u11(ackin(m, s(0)))
ackin(s(m), s(n)) -> u21(ackin(s(m), n), m)
u11(ackout(n)) -> ackout(n)
u21(ackout(n), m) -> u22(ackin(m, n))
u22(ackout(n)) -> ackout(n)

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

ACKIN(s(m), 0) -> U11(ackin(m, s(0)))
ACKIN(s(m), 0) -> ACKIN(m, s(0))
ACKIN(s(m), s(n)) -> U21(ackin(s(m), n), m)
ACKIN(s(m), s(n)) -> ACKIN(s(m), n)
U21(ackout(n), m) -> U22(ackin(m, n))
U21(ackout(n), m) -> ACKIN(m, n)

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Size-Change Principle


Dependency Pairs:

ACKIN(s(m), s(n)) -> ACKIN(s(m), n)
U21(ackout(n), m) -> ACKIN(m, n)
ACKIN(s(m), s(n)) -> U21(ackin(s(m), n), m)
ACKIN(s(m), 0) -> ACKIN(m, s(0))


Rules:


ackin(0, n) -> ackout(s(n))
ackin(s(m), 0) -> u11(ackin(m, s(0)))
ackin(s(m), s(n)) -> u21(ackin(s(m), n), m)
u11(ackout(n)) -> ackout(n)
u21(ackout(n), m) -> u22(ackin(m, n))
u22(ackout(n)) -> ackout(n)


Strategy:

innermost




We number the DPs as follows:
  1. ACKIN(s(m), s(n)) -> ACKIN(s(m), n)
  2. U21(ackout(n), m) -> ACKIN(m, n)
  3. ACKIN(s(m), s(n)) -> U21(ackin(s(m), n), m)
  4. ACKIN(s(m), 0) -> ACKIN(m, s(0))
and get the following Size-Change Graph(s):
{1} , {1}
1=1
2>2
{2} , {2}
1>2
2=1
{3} , {3}
1>2
{4} , {4}
1>1

which lead(s) to this/these maximal multigraph(s):
{1} , {1}
1=1
2>2
{3} , {2}
1>1
{1} , {4}
1>1
{4} , {1}
1>1
{2} , {3}
2>2
{4} , {2}
1>1
{3} , {1}
1>1
{1} , {1}
1>1
{1} , {2}
1>1
{3} , {4}
1>1

DP: empty set
Oriented Rules: none

We used the order Homeomorphic Embedding Order with Non-Strict Precedence.
trivial

with Argument Filtering System:
ackout(x1) -> ackout(x1)
s(x1) -> s(x1)

We obtain no new DP problems.

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