Term Rewriting System R:
[m, n, r]
p(m, n, s(r)) -> p(m, r, n)
p(m, s(n), 0) -> p(0, n, m)
p(m, 0, 0) -> m

Innermost Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

P(m, n, s(r)) -> P(m, r, n)
P(m, s(n), 0) -> P(0, n, m)

Furthermore, R contains one SCC. 


   R
     ↳DPs
       →DP Problem 1
         ↳Forward Instantiation Transformation


Dependency Pairs:

P(m, s(n), 0) -> P(0, n, m)
P(m, n, s(r)) -> P(m, r, n)


Rules:


p(m, n, s(r)) -> p(m, r, n)
p(m, s(n), 0) -> p(0, n, m)
p(m, 0, 0) -> m


Strategy:

innermost




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

P(m, n, s(r)) -> P(m, r, n)
two new Dependency Pairs are created:

P(m'', s(r''), s(r0)) -> P(m'', r0, s(r''))
P(m'', 0, s(s(n''))) -> P(m'', s(n''), 0)

The transformation is resulting in one new DP problem: 



   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
           →DP Problem 2
             ↳Forward Instantiation Transformation


Dependency Pairs:

P(m'', 0, s(s(n''))) -> P(m'', s(n''), 0)
P(m'', s(r''), s(r0)) -> P(m'', r0, s(r''))
P(m, s(n), 0) -> P(0, n, m)


Rules:


p(m, n, s(r)) -> p(m, r, n)
p(m, s(n), 0) -> p(0, n, m)
p(m, 0, 0) -> m


Strategy:

innermost




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

P(m, s(n), 0) -> P(0, n, m)
three new Dependency Pairs are created:

P(0, s(s(n'')), 0) -> P(0, s(n''), 0)
P(s(r0''), s(s(r'''')), 0) -> P(0, s(r''''), s(r0''))
P(s(s(n'''')), s(0), 0) -> P(0, 0, s(s(n'''')))

The transformation is resulting in two new DP problems: 



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


Dependency Pair:

P(0, s(s(n'')), 0) -> P(0, s(n''), 0)


Rules:


p(m, n, s(r)) -> p(m, r, n)
p(m, s(n), 0) -> p(0, n, m)
p(m, 0, 0) -> m


Strategy:

innermost




The following dependency pair can be strictly oriented:

P(0, s(s(n'')), 0) -> P(0, s(n''), 0)


There are no usable rules for innermost that need to be oriented.
Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
trivial

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


   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
           →DP Problem 2
             ↳FwdInst
             ...
               →DP Problem 5
                 ↳Dependency Graph


Dependency Pair:


Rules:


p(m, n, s(r)) -> p(m, r, n)
p(m, s(n), 0) -> p(0, n, m)
p(m, 0, 0) -> m


Strategy:

innermost




Using the Dependency Graph resulted in no new DP problems.


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


Dependency Pairs:

P(s(s(n'''')), s(0), 0) -> P(0, 0, s(s(n'''')))
P(m'', s(r''), s(r0)) -> P(m'', r0, s(r''))
P(s(r0''), s(s(r'''')), 0) -> P(0, s(r''''), s(r0''))
P(m'', 0, s(s(n''))) -> P(m'', s(n''), 0)


Rules:


p(m, n, s(r)) -> p(m, r, n)
p(m, s(n), 0) -> p(0, n, m)
p(m, 0, 0) -> m


Strategy:

innermost




The following dependency pairs can be strictly oriented:

P(s(s(n'''')), s(0), 0) -> P(0, 0, s(s(n'''')))
P(s(r0''), s(s(r'''')), 0) -> P(0, s(r''''), s(r0''))


There are no usable rules for innermost that need to be oriented.
Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
P > 0
s > 0

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


   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
           →DP Problem 2
             ↳FwdInst
             ...
               →DP Problem 6
                 ↳Dependency Graph


Dependency Pairs:

P(m'', s(r''), s(r0)) -> P(m'', r0, s(r''))
P(m'', 0, s(s(n''))) -> P(m'', s(n''), 0)


Rules:


p(m, n, s(r)) -> p(m, r, n)
p(m, s(n), 0) -> p(0, n, m)
p(m, 0, 0) -> m


Strategy:

innermost




Using the Dependency Graph the DP problem was split into 1 DP problems.


   R
     ↳DPs
       →DP Problem 1
         ↳FwdInst
           →DP Problem 2
             ↳FwdInst
             ...
               →DP Problem 7
                 ↳Remaining Obligation(s)




The following remains to be proven:
Dependency Pair:

P(m'', s(r''), s(r0)) -> P(m'', r0, s(r''))


Rules:


p(m, n, s(r)) -> p(m, r, n)
p(m, s(n), 0) -> p(0, n, m)
p(m, 0, 0) -> m


Strategy:

innermost



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