Termination w.r.t. Q of the given QTRS could be proven:

0 QTRS
↳1 DependencyPairsProof (⇔)
↳2 QDP
↳3 DependencyGraphProof (⇔)
↳4 QDP
↳5 QDPOrderProof (⇔)
↳6 QDP
↳7 DependencyGraphProof (⇔)
↳8 AND
  ↳9 QDP
    ↳10 QDPOrderProof (⇔)
    ↳11 QDP
    ↳12 DependencyGraphProof (⇔)
    ↳13 TRUE
  ↳14 QDP
    ↳15 QDPOrderProof (⇔)
    ↳16 QDP
    ↳17 PisEmptyProof (⇔)
    ↳18 TRUE
  ↳19 QDP
    ↳20 QDPOrderProof (⇔)
    ↳21 QDP
    ↳22 PisEmptyProof (⇔)
    ↳23 TRUE

(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

U11(tt, V2) → U12(isNat(activate(V2)))
U12(tt) → tt
U21(tt) → tt
U31(tt, N) → activate(N)
U41(tt, M, N) → U42(isNat(activate(N)), activate(M), activate(N))
U42(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNat(activate(V1)), activate(V2))
isNat(n__s(V1)) → U21(isNat(activate(V1)))
plus(N, 0) → U31(isNat(N), N)
plus(N, s(M)) → U41(isNat(M), M, N)
0 → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0
activate(n__plus(X1, X2)) → plus(activate(X1), activate(X2))
activate(n__s(X)) → s(activate(X))
activate(X) → X

Q is empty.

(1) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.

(2) Obligation:

Q DP problem:
The TRS P consists of the following rules:

U111(tt, V2) → U121(isNat(activate(V2)))
U111(tt, V2) → ISNAT(activate(V2))
U111(tt, V2) → ACTIVATE(V2)
U311(tt, N) → ACTIVATE(N)
U411(tt, M, N) → U421(isNat(activate(N)), activate(M), activate(N))
U411(tt, M, N) → ISNAT(activate(N))
U411(tt, M, N) → ACTIVATE(N)
U411(tt, M, N) → ACTIVATE(M)
U421(tt, M, N) → S(plus(activate(N), activate(M)))
U421(tt, M, N) → PLUS(activate(N), activate(M))
U421(tt, M, N) → ACTIVATE(N)
U421(tt, M, N) → ACTIVATE(M)
ISNAT(n__plus(V1, V2)) → U111(isNat(activate(V1)), activate(V2))
ISNAT(n__plus(V1, V2)) → ISNAT(activate(V1))
ISNAT(n__plus(V1, V2)) → ACTIVATE(V1)
ISNAT(n__plus(V1, V2)) → ACTIVATE(V2)
ISNAT(n__s(V1)) → U211(isNat(activate(V1)))
ISNAT(n__s(V1)) → ISNAT(activate(V1))
ISNAT(n__s(V1)) → ACTIVATE(V1)
PLUS(N, 0) → U311(isNat(N), N)
PLUS(N, 0) → ISNAT(N)
PLUS(N, s(M)) → U411(isNat(M), M, N)
PLUS(N, s(M)) → ISNAT(M)
ACTIVATE(n__0) → 01
ACTIVATE(n__plus(X1, X2)) → PLUS(activate(X1), activate(X2))
ACTIVATE(n__plus(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n__plus(X1, X2)) → ACTIVATE(X2)
ACTIVATE(n__s(X)) → S(activate(X))
ACTIVATE(n__s(X)) → ACTIVATE(X)

The TRS R consists of the following rules:

U11(tt, V2) → U12(isNat(activate(V2)))
U12(tt) → tt
U21(tt) → tt
U31(tt, N) → activate(N)
U41(tt, M, N) → U42(isNat(activate(N)), activate(M), activate(N))
U42(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNat(activate(V1)), activate(V2))
isNat(n__s(V1)) → U21(isNat(activate(V1)))
plus(N, 0) → U31(isNat(N), N)
plus(N, s(M)) → U41(isNat(M), M, N)
0 → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0
activate(n__plus(X1, X2)) → plus(activate(X1), activate(X2))
activate(n__s(X)) → s(activate(X))
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(3) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 5 less nodes.

(4) Obligation:

Q DP problem:
The TRS P consists of the following rules:

U111(tt, V2) → ISNAT(activate(V2))
ISNAT(n__plus(V1, V2)) → U111(isNat(activate(V1)), activate(V2))
U111(tt, V2) → ACTIVATE(V2)
ACTIVATE(n__plus(X1, X2)) → PLUS(activate(X1), activate(X2))
PLUS(N, 0) → U311(isNat(N), N)
U311(tt, N) → ACTIVATE(N)
ACTIVATE(n__plus(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n__plus(X1, X2)) → ACTIVATE(X2)
ACTIVATE(n__s(X)) → ACTIVATE(X)
PLUS(N, 0) → ISNAT(N)
ISNAT(n__plus(V1, V2)) → ISNAT(activate(V1))
ISNAT(n__plus(V1, V2)) → ACTIVATE(V1)
ISNAT(n__plus(V1, V2)) → ACTIVATE(V2)
ISNAT(n__s(V1)) → ISNAT(activate(V1))
ISNAT(n__s(V1)) → ACTIVATE(V1)
PLUS(N, s(M)) → U411(isNat(M), M, N)
U411(tt, M, N) → U421(isNat(activate(N)), activate(M), activate(N))
U421(tt, M, N) → PLUS(activate(N), activate(M))
PLUS(N, s(M)) → ISNAT(M)
U421(tt, M, N) → ACTIVATE(N)
U421(tt, M, N) → ACTIVATE(M)
U411(tt, M, N) → ISNAT(activate(N))
U411(tt, M, N) → ACTIVATE(N)
U411(tt, M, N) → ACTIVATE(M)

The TRS R consists of the following rules:

U11(tt, V2) → U12(isNat(activate(V2)))
U12(tt) → tt
U21(tt) → tt
U31(tt, N) → activate(N)
U41(tt, M, N) → U42(isNat(activate(N)), activate(M), activate(N))
U42(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNat(activate(V1)), activate(V2))
isNat(n__s(V1)) → U21(isNat(activate(V1)))
plus(N, 0) → U31(isNat(N), N)
plus(N, s(M)) → U41(isNat(M), M, N)
0 → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0
activate(n__plus(X1, X2)) → plus(activate(X1), activate(X2))
activate(n__s(X)) → s(activate(X))
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(5) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U111(tt, V2) → ISNAT(activate(V2))
ISNAT(n__plus(V1, V2)) → U111(isNat(activate(V1)), activate(V2))
U111(tt, V2) → ACTIVATE(V2)
ACTIVATE(n__plus(X1, X2)) → PLUS(activate(X1), activate(X2))
PLUS(N, 0) → U311(isNat(N), N)
ACTIVATE(n__plus(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n__plus(X1, X2)) → ACTIVATE(X2)
PLUS(N, 0) → ISNAT(N)
ISNAT(n__plus(V1, V2)) → ISNAT(activate(V1))
ISNAT(n__plus(V1, V2)) → ACTIVATE(V1)
ISNAT(n__plus(V1, V2)) → ACTIVATE(V2)
PLUS(N, s(M)) → ISNAT(M)
U421(tt, M, N) → ACTIVATE(N)
U421(tt, M, N) → ACTIVATE(M)
U411(tt, M, N) → ISNAT(activate(N))
U411(tt, M, N) → ACTIVATE(N)
U411(tt, M, N) → ACTIVATE(M)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U111(x1, x2)  =  U111(x1, x2)
tt  =  tt
ISNAT(x1)  =  ISNAT(x1)
activate(x1)  =  x1
n__plus(x1, x2)  =  n__plus(x1, x2)
isNat(x1)  =  isNat(x1)
ACTIVATE(x1)  =  ACTIVATE(x1)
PLUS(x1, x2)  =  PLUS(x1, x2)
0  =  0
U311(x1, x2)  =  U311(x2)
n__s(x1)  =  x1
s(x1)  =  x1
U411(x1, x2, x3)  =  U411(x2, x3)
U421(x1, x2, x3)  =  U421(x2, x3)
n__0  =  n__0
plus(x1, x2)  =  plus(x1, x2)
U31(x1, x2)  =  x2
U11(x1, x2)  =  U11(x2)
U21(x1)  =  x1
U41(x1, x2, x3)  =  U41(x2, x3)
U12(x1)  =  x1
U42(x1, x2, x3)  =  U42(x2, x3)

Recursive Path Order [RPO].
Precedence:
[tt, 0, n0] > [nplus2, plus2, U412, U422] > [U11^12, ISNAT1, isNat1, ACTIVATE1, PLUS2, U31^11, U41^12, U42^12, U111]


The following usable rules [FROCOS05] were oriented:

activate(n__0) → 0
activate(n__plus(X1, X2)) → plus(activate(X1), activate(X2))
plus(N, 0) → U31(isNat(N), N)
U31(tt, N) → activate(N)
activate(n__s(X)) → s(activate(X))
activate(X) → X
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNat(activate(V1)), activate(V2))
isNat(n__s(V1)) → U21(isNat(activate(V1)))
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
plus(N, s(M)) → U41(isNat(M), M, N)
U21(tt) → tt
U11(tt, V2) → U12(isNat(activate(V2)))
U12(tt) → tt
U41(tt, M, N) → U42(isNat(activate(N)), activate(M), activate(N))
U42(tt, M, N) → s(plus(activate(N), activate(M)))
0 → n__0

(6) Obligation:

Q DP problem:
The TRS P consists of the following rules:

U311(tt, N) → ACTIVATE(N)
ACTIVATE(n__s(X)) → ACTIVATE(X)
ISNAT(n__s(V1)) → ISNAT(activate(V1))
ISNAT(n__s(V1)) → ACTIVATE(V1)
PLUS(N, s(M)) → U411(isNat(M), M, N)
U411(tt, M, N) → U421(isNat(activate(N)), activate(M), activate(N))
U421(tt, M, N) → PLUS(activate(N), activate(M))

The TRS R consists of the following rules:

U11(tt, V2) → U12(isNat(activate(V2)))
U12(tt) → tt
U21(tt) → tt
U31(tt, N) → activate(N)
U41(tt, M, N) → U42(isNat(activate(N)), activate(M), activate(N))
U42(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNat(activate(V1)), activate(V2))
isNat(n__s(V1)) → U21(isNat(activate(V1)))
plus(N, 0) → U31(isNat(N), N)
plus(N, s(M)) → U41(isNat(M), M, N)
0 → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0
activate(n__plus(X1, X2)) → plus(activate(X1), activate(X2))
activate(n__s(X)) → s(activate(X))
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(7) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 3 SCCs with 2 less nodes.

(8) Complex Obligation (AND)

(9) Obligation:

Q DP problem:
The TRS P consists of the following rules:

U411(tt, M, N) → U421(isNat(activate(N)), activate(M), activate(N))
U421(tt, M, N) → PLUS(activate(N), activate(M))
PLUS(N, s(M)) → U411(isNat(M), M, N)

The TRS R consists of the following rules:

U11(tt, V2) → U12(isNat(activate(V2)))
U12(tt) → tt
U21(tt) → tt
U31(tt, N) → activate(N)
U41(tt, M, N) → U42(isNat(activate(N)), activate(M), activate(N))
U42(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNat(activate(V1)), activate(V2))
isNat(n__s(V1)) → U21(isNat(activate(V1)))
plus(N, 0) → U31(isNat(N), N)
plus(N, s(M)) → U41(isNat(M), M, N)
0 → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0
activate(n__plus(X1, X2)) → plus(activate(X1), activate(X2))
activate(n__s(X)) → s(activate(X))
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(10) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


U421(tt, M, N) → PLUS(activate(N), activate(M))
PLUS(N, s(M)) → U411(isNat(M), M, N)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U411(x1, x2, x3)  =  U411(x1, x2)
tt  =  tt
U421(x1, x2, x3)  =  U421(x1, x2)
isNat(x1)  =  isNat
activate(x1)  =  x1
PLUS(x1, x2)  =  PLUS(x2)
s(x1)  =  s(x1)
n__0  =  n__0
0  =  0
n__plus(x1, x2)  =  n__plus(x1, x2)
plus(x1, x2)  =  plus(x1, x2)
U31(x1, x2)  =  U31(x2)
n__s(x1)  =  n__s(x1)
U11(x1, x2)  =  x1
U21(x1)  =  x1
U41(x1, x2, x3)  =  U41(x1, x2, x3)
U12(x1)  =  x1
U42(x1, x2, x3)  =  U42(x1, x2, x3)

Recursive Path Order [RPO].
Precedence:
[n0, 0] > [U41^12, tt, U42^12, isNat, PLUS1] > U311
[nplus2, plus2, U413, U423] > [s1, ns1] > [U41^12, tt, U42^12, isNat, PLUS1] > U311


The following usable rules [FROCOS05] were oriented:

activate(n__0) → 0
activate(n__plus(X1, X2)) → plus(activate(X1), activate(X2))
plus(N, 0) → U31(isNat(N), N)
U31(tt, N) → activate(N)
activate(n__s(X)) → s(activate(X))
activate(X) → X
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNat(activate(V1)), activate(V2))
isNat(n__s(V1)) → U21(isNat(activate(V1)))
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
plus(N, s(M)) → U41(isNat(M), M, N)
U21(tt) → tt
U11(tt, V2) → U12(isNat(activate(V2)))
U12(tt) → tt
U41(tt, M, N) → U42(isNat(activate(N)), activate(M), activate(N))
U42(tt, M, N) → s(plus(activate(N), activate(M)))
0 → n__0

(11) Obligation:

Q DP problem:
The TRS P consists of the following rules:

U411(tt, M, N) → U421(isNat(activate(N)), activate(M), activate(N))

The TRS R consists of the following rules:

U11(tt, V2) → U12(isNat(activate(V2)))
U12(tt) → tt
U21(tt) → tt
U31(tt, N) → activate(N)
U41(tt, M, N) → U42(isNat(activate(N)), activate(M), activate(N))
U42(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNat(activate(V1)), activate(V2))
isNat(n__s(V1)) → U21(isNat(activate(V1)))
plus(N, 0) → U31(isNat(N), N)
plus(N, s(M)) → U41(isNat(M), M, N)
0 → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0
activate(n__plus(X1, X2)) → plus(activate(X1), activate(X2))
activate(n__s(X)) → s(activate(X))
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(12) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 1 less node.

(13) TRUE

(14) Obligation:

Q DP problem:
The TRS P consists of the following rules:

ACTIVATE(n__s(X)) → ACTIVATE(X)

The TRS R consists of the following rules:

U11(tt, V2) → U12(isNat(activate(V2)))
U12(tt) → tt
U21(tt) → tt
U31(tt, N) → activate(N)
U41(tt, M, N) → U42(isNat(activate(N)), activate(M), activate(N))
U42(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNat(activate(V1)), activate(V2))
isNat(n__s(V1)) → U21(isNat(activate(V1)))
plus(N, 0) → U31(isNat(N), N)
plus(N, s(M)) → U41(isNat(M), M, N)
0 → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0
activate(n__plus(X1, X2)) → plus(activate(X1), activate(X2))
activate(n__s(X)) → s(activate(X))
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(15) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


ACTIVATE(n__s(X)) → ACTIVATE(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ACTIVATE(x1)  =  x1
n__s(x1)  =  n__s(x1)

Recursive Path Order [RPO].
Precedence:
trivial


The following usable rules [FROCOS05] were oriented: none

(16) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

U11(tt, V2) → U12(isNat(activate(V2)))
U12(tt) → tt
U21(tt) → tt
U31(tt, N) → activate(N)
U41(tt, M, N) → U42(isNat(activate(N)), activate(M), activate(N))
U42(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNat(activate(V1)), activate(V2))
isNat(n__s(V1)) → U21(isNat(activate(V1)))
plus(N, 0) → U31(isNat(N), N)
plus(N, s(M)) → U41(isNat(M), M, N)
0 → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0
activate(n__plus(X1, X2)) → plus(activate(X1), activate(X2))
activate(n__s(X)) → s(activate(X))
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(17) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(18) TRUE

(19) Obligation:

Q DP problem:
The TRS P consists of the following rules:

ISNAT(n__s(V1)) → ISNAT(activate(V1))

The TRS R consists of the following rules:

U11(tt, V2) → U12(isNat(activate(V2)))
U12(tt) → tt
U21(tt) → tt
U31(tt, N) → activate(N)
U41(tt, M, N) → U42(isNat(activate(N)), activate(M), activate(N))
U42(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNat(activate(V1)), activate(V2))
isNat(n__s(V1)) → U21(isNat(activate(V1)))
plus(N, 0) → U31(isNat(N), N)
plus(N, s(M)) → U41(isNat(M), M, N)
0 → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0
activate(n__plus(X1, X2)) → plus(activate(X1), activate(X2))
activate(n__s(X)) → s(activate(X))
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(20) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


ISNAT(n__s(V1)) → ISNAT(activate(V1))
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ISNAT(x1)  =  x1
n__s(x1)  =  n__s(x1)
activate(x1)  =  x1
n__0  =  n__0
0  =  0
n__plus(x1, x2)  =  n__plus(x1, x2)
plus(x1, x2)  =  plus(x1, x2)
U31(x1, x2)  =  U31(x2)
isNat(x1)  =  isNat
tt  =  tt
s(x1)  =  s(x1)
U41(x1, x2, x3)  =  U41(x1, x2, x3)
U11(x1, x2)  =  U11
U21(x1)  =  x1
U12(x1)  =  U12
U42(x1, x2, x3)  =  U42(x1, x2, x3)

Recursive Path Order [RPO].
Precedence:
[n0, 0] > [isNat, tt, U11, U12]
[nplus2, plus2, U413, U423] > [ns1, s1] > [isNat, tt, U11, U12]
[nplus2, plus2, U413, U423] > U311 > [isNat, tt, U11, U12]


The following usable rules [FROCOS05] were oriented:

activate(n__0) → 0
activate(n__plus(X1, X2)) → plus(activate(X1), activate(X2))
plus(N, 0) → U31(isNat(N), N)
U31(tt, N) → activate(N)
activate(n__s(X)) → s(activate(X))
activate(X) → X
plus(X1, X2) → n__plus(X1, X2)
isNat(n__0) → tt
s(X) → n__s(X)
plus(N, s(M)) → U41(isNat(M), M, N)
isNat(n__plus(V1, V2)) → U11(isNat(activate(V1)), activate(V2))
isNat(n__s(V1)) → U21(isNat(activate(V1)))
U21(tt) → tt
U11(tt, V2) → U12(isNat(activate(V2)))
U12(tt) → tt
U41(tt, M, N) → U42(isNat(activate(N)), activate(M), activate(N))
U42(tt, M, N) → s(plus(activate(N), activate(M)))
0 → n__0

(21) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

U11(tt, V2) → U12(isNat(activate(V2)))
U12(tt) → tt
U21(tt) → tt
U31(tt, N) → activate(N)
U41(tt, M, N) → U42(isNat(activate(N)), activate(M), activate(N))
U42(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNat(activate(V1)), activate(V2))
isNat(n__s(V1)) → U21(isNat(activate(V1)))
plus(N, 0) → U31(isNat(N), N)
plus(N, s(M)) → U41(isNat(M), M, N)
0 → n__0
plus(X1, X2) → n__plus(X1, X2)
s(X) → n__s(X)
activate(n__0) → 0
activate(n__plus(X1, X2)) → plus(activate(X1), activate(X2))
activate(n__s(X)) → s(activate(X))
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(22) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(23) TRUE