Termination proof of /tmp/tmpekKl2C/MYNAT

Termination of the following Term Rewriting System could be proven:

Context-sensitive rewrite system:
The TRS R consists of the following rules:

U11(tt, M, N) → U12(tt, M, N)
U12(tt, M, N) → s(plus(N, M))
plus(N, 0) → N
plus(N, s(M)) → U11(tt, M, N)

The replacement map contains the following entries:

U11: {1}
tt: empty set
U12: {1}
s: {1}
plus: {1, 2}
0: empty set

↳ CSR

  ↳ CSRInnermostProof

Context-sensitive rewrite system:
The TRS R consists of the following rules:

U11(tt, M, N) → U12(tt, M, N)
U12(tt, M, N) → s(plus(N, M))
plus(N, 0) → N
plus(N, s(M)) → U11(tt, M, N)

The replacement map contains the following entries:

U11: {1}
tt: empty set
U12: {1}
s: {1}
plus: {1, 2}
0: empty set

The CSR is orthogonal. By [10] we can switch to innermost.

↳ CSR

  ↳ CSRInnermostProof

    ↳ CSR

      ↳ CSDependencyPairsProof

Context-sensitive rewrite system:
The TRS R consists of the following rules:

U11(tt, M, N) → U12(tt, M, N)
U12(tt, M, N) → s(plus(N, M))
plus(N, 0) → N
plus(N, s(M)) → U11(tt, M, N)

The replacement map contains the following entries:

U11: {1}
tt: empty set
U12: {1}
s: {1}
plus: {1, 2}
0: empty set

Innermost Strategy.

Using Improved CS-DPs we result in the following initial Q-CSDP problem.

↳ CSR

  ↳ CSRInnermostProof

    ↳ CSR

      ↳ CSDependencyPairsProof

        ↳ QCSDP

          ↳ QCSDependencyGraphProof

Q-restricted context-sensitive dependency pair problem:
The symbols in {s, plus, PLUS} are replacing on all positions.
For all symbols f in {U11, U12, U12¹, U11¹} we have µ(f) = {1}.
The symbols in {U} are not replacing on any position.

The ordinary context-sensitive dependency pairs DP_o are:

U11¹(tt, M, N) → U12¹(tt, M, N)
U12¹(tt, M, N) → PLUS(N, M)
PLUS(N, s(M)) → U11¹(tt, M, N)

The collapsing dependency pairs are DP_c:

U12¹(tt, M, N) → N
U12¹(tt, M, N) → M

The hidden terms of R are:
none

Every hiding context is built from:none

Hence, the new unhiding pairs DP_u are :

U12¹(tt, M, N) → U(N)
U12¹(tt, M, N) → U(M)

The TRS R consists of the following rules:

U11(tt, M, N) → U12(tt, M, N)
U12(tt, M, N) → s(plus(N, M))
plus(N, 0) → N
plus(N, s(M)) → U11(tt, M, N)

The set Q consists of the following terms:

U11(tt, x0, x1)
U12(tt, x0, x1)
plus(x0, 0)
plus(x0, s(x1))

The approximation of the Context-Sensitive Dependency Graph contains 1 SCC with 2 less nodes.

↳ CSR

  ↳ CSRInnermostProof

    ↳ CSR

      ↳ CSDependencyPairsProof

        ↳ QCSDP

          ↳ QCSDependencyGraphProof

            ↳ QCSDP

              ↳ QCSDPSubtermProof

U12¹(tt, M, N) → PLUS(N, M)
PLUS(N, s(M)) → U11¹(tt, M, N)
U11¹(tt, M, N) → U12¹(tt, M, N)

The TRS R consists of the following rules:

U11(tt, M, N) → U12(tt, M, N)
U12(tt, M, N) → s(plus(N, M))
plus(N, 0) → N
plus(N, s(M)) → U11(tt, M, N)

The set Q consists of the following terms:

U11(tt, x0, x1)
U12(tt, x0, x1)
plus(x0, 0)
plus(x0, s(x1))

We use the subterm processor [20].

The following pairs can be oriented strictly and are deleted.

PLUS(N, s(M)) → U11¹(tt, M, N)

The remaining pairs can at least be oriented weakly.

U12¹(tt, M, N) → PLUS(N, M)
U11¹(tt, M, N) → U12¹(tt, M, N)

Used ordering: Combined order from the following AFS and order.
PLUS(x1, x2) = x2
U12¹(x1, x2, x3) = x2
U11¹(x1, x2, x3) = x2

Subterm Order

↳ CSR

  ↳ CSRInnermostProof

    ↳ CSR

      ↳ CSDependencyPairsProof

        ↳ QCSDP

          ↳ QCSDependencyGraphProof

            ↳ QCSDP

              ↳ QCSDPSubtermProof

                ↳ QCSDP

                  ↳ QCSDependencyGraphProof

U12¹(tt, M, N) → PLUS(N, M)
U11¹(tt, M, N) → U12¹(tt, M, N)

The TRS R consists of the following rules:

U11(tt, M, N) → U12(tt, M, N)
U12(tt, M, N) → s(plus(N, M))
plus(N, 0) → N
plus(N, s(M)) → U11(tt, M, N)

The set Q consists of the following terms:

U11(tt, x0, x1)
U12(tt, x0, x1)
plus(x0, 0)
plus(x0, s(x1))

The approximation of the Context-Sensitive Dependency Graph contains 0 SCCs with 2 less nodes.