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

0 QTRS
↳1 DependencyPairsProof (⇔)
↳2 QDP
↳3 DependencyGraphProof (⇔)
↳4 QDP
↳5 QDPSizeChangeProof (⇔)
↳6 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) QDPSizeChangeProof (EQUIVALENT transformation)

We used the following order and afs together with the size-change analysis [AAECC05] to show that there are no infinite chains for this DP problem.

Order:Combined order from the following AFS and order.
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)  =  x2
isNat(x1)  =  isNat
tt  =  tt
n__s(x1)  =  n__s(x1)
s(x1)  =  s(x1)
U41(x1, x2, x3)  =  U41(x1, x2, x3)
U11(x1, x2)  =  U11
U21(x1)  =  x1
U42(x1, x2, x3)  =  U42(x1, x2, x3)
U12(x1)  =  U12

Recursive path order with status [RPO].
Quasi-Precedence:

[n0, 0] > [isNat, tt, U11, U12]
[nplus2, plus2, U413, U423] > [ns1, s1] > [isNat, tt, U11, U12]

Status:
n0: multiset
0: multiset
nplus2: [2,1]
plus2: [2,1]
isNat: []
tt: multiset
ns1: multiset
s1: multiset
U413: [2,3,1]
U11: []
U423: [2,3,1]
U12: []

AFS:
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)  =  x2
isNat(x1)  =  isNat
tt  =  tt
n__s(x1)  =  n__s(x1)
s(x1)  =  s(x1)
U41(x1, x2, x3)  =  U41(x1, x2, x3)
U11(x1, x2)  =  U11
U21(x1)  =  x1
U42(x1, x2, x3)  =  U42(x1, x2, x3)
U12(x1)  =  U12

From the DPs we obtained the following set of size-change graphs:

  • ISNAT(n__plus(V1, V2)) → U111(isNat(activate(V1)), activate(V2)) (allowed arguments on rhs = {2})
    The graph contains the following edges 1 > 2

  • U111(tt, V2) → ISNAT(activate(V2)) (allowed arguments on rhs = {1})
    The graph contains the following edges 2 >= 1

  • U111(tt, V2) → ACTIVATE(V2) (allowed arguments on rhs = {1})
    The graph contains the following edges 2 >= 1

  • U411(tt, M, N) → ISNAT(activate(N)) (allowed arguments on rhs = {1})
    The graph contains the following edges 3 >= 1

  • ACTIVATE(n__plus(X1, X2)) → PLUS(activate(X1), activate(X2)) (allowed arguments on rhs = {1, 2})
    The graph contains the following edges 1 > 1, 1 > 2

  • U311(tt, N) → ACTIVATE(N) (allowed arguments on rhs = {1})
    The graph contains the following edges 2 >= 1

  • U421(tt, M, N) → PLUS(activate(N), activate(M)) (allowed arguments on rhs = {1, 2})
    The graph contains the following edges 3 >= 1, 2 >= 2

  • U411(tt, M, N) → U421(isNat(activate(N)), activate(M), activate(N)) (allowed arguments on rhs = {2, 3})
    The graph contains the following edges 2 >= 2, 3 >= 3

  • PLUS(N, 0) → U311(isNat(N), N) (allowed arguments on rhs = {2})
    The graph contains the following edges 1 >= 2

  • PLUS(N, s(M)) → U411(isNat(M), M, N) (allowed arguments on rhs = {2, 3})
    The graph contains the following edges 2 > 2, 1 >= 3

  • ISNAT(n__plus(V1, V2)) → ISNAT(activate(V1)) (allowed arguments on rhs = {1})
    The graph contains the following edges 1 > 1

  • ISNAT(n__s(V1)) → ISNAT(activate(V1)) (allowed arguments on rhs = {1})
    The graph contains the following edges 1 > 1

  • ISNAT(n__plus(V1, V2)) → ACTIVATE(V1) (allowed arguments on rhs = {1})
    The graph contains the following edges 1 > 1

  • ISNAT(n__plus(V1, V2)) → ACTIVATE(V2) (allowed arguments on rhs = {1})
    The graph contains the following edges 1 > 1

  • ISNAT(n__s(V1)) → ACTIVATE(V1) (allowed arguments on rhs = {1})
    The graph contains the following edges 1 > 1

  • PLUS(N, 0) → ISNAT(N) (allowed arguments on rhs = {1})
    The graph contains the following edges 1 >= 1

  • PLUS(N, s(M)) → ISNAT(M) (allowed arguments on rhs = {1})
    The graph contains the following edges 2 > 1

  • ACTIVATE(n__plus(X1, X2)) → ACTIVATE(X1) (allowed arguments on rhs = {1})
    The graph contains the following edges 1 > 1

  • ACTIVATE(n__plus(X1, X2)) → ACTIVATE(X2) (allowed arguments on rhs = {1})
    The graph contains the following edges 1 > 1

  • ACTIVATE(n__s(X)) → ACTIVATE(X) (allowed arguments on rhs = {1})
    The graph contains the following edges 1 > 1

  • U411(tt, M, N) → ACTIVATE(N) (allowed arguments on rhs = {1})
    The graph contains the following edges 3 >= 1

  • U411(tt, M, N) → ACTIVATE(M) (allowed arguments on rhs = {1})
    The graph contains the following edges 2 >= 1

  • U421(tt, M, N) → ACTIVATE(N) (allowed arguments on rhs = {1})
    The graph contains the following edges 3 >= 1

  • U421(tt, M, N) → ACTIVATE(M) (allowed arguments on rhs = {1})
    The graph contains the following edges 2 >= 1

We oriented the following set of usable rules [AAECC05,FROCOS05].


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(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)))
U41(tt, M, N) → U42(isNat(activate(N)), activate(M), activate(N))
U11(tt, V2) → U12(isNat(activate(V2)))
U42(tt, M, N) → s(plus(activate(N), activate(M)))
plus(X1, X2) → n__plus(X1, X2)
isNat(n__0) → tt
s(X) → n__s(X)
U21(tt) → tt
U12(tt) → tt
0 → n__0

(6) TRUE