Termination w.r.t. Q proof of /tmp/tmpibmLXN/PEANO_complete-noand

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

  ↳24 QDP

    ↳25 QDPOrderProof (⇔)

    ↳26 QDP

    ↳27 PisEmptyProof (⇔)

    ↳28 TRUE

(0) Obligation:

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

U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0) → U51(isNat(N), N)
plus(N, s(M)) → U61(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:

U11¹(tt, V1, V2) → U12¹(isNatKind(activate(V1)), activate(V1), activate(V2))
U11¹(tt, V1, V2) → ISNATKIND(activate(V1))
U11¹(tt, V1, V2) → ACTIVATE(V1)
U11¹(tt, V1, V2) → ACTIVATE(V2)
U12¹(tt, V1, V2) → U13¹(isNatKind(activate(V2)), activate(V1), activate(V2))
U12¹(tt, V1, V2) → ISNATKIND(activate(V2))
U12¹(tt, V1, V2) → ACTIVATE(V2)
U12¹(tt, V1, V2) → ACTIVATE(V1)
U13¹(tt, V1, V2) → U14¹(isNatKind(activate(V2)), activate(V1), activate(V2))
U13¹(tt, V1, V2) → ISNATKIND(activate(V2))
U13¹(tt, V1, V2) → ACTIVATE(V2)
U13¹(tt, V1, V2) → ACTIVATE(V1)
U14¹(tt, V1, V2) → U15¹(isNat(activate(V1)), activate(V2))
U14¹(tt, V1, V2) → ISNAT(activate(V1))
U14¹(tt, V1, V2) → ACTIVATE(V1)
U14¹(tt, V1, V2) → ACTIVATE(V2)
U15¹(tt, V2) → U16¹(isNat(activate(V2)))
U15¹(tt, V2) → ISNAT(activate(V2))
U15¹(tt, V2) → ACTIVATE(V2)
U21¹(tt, V1) → U22¹(isNatKind(activate(V1)), activate(V1))
U21¹(tt, V1) → ISNATKIND(activate(V1))
U21¹(tt, V1) → ACTIVATE(V1)
U22¹(tt, V1) → U23¹(isNat(activate(V1)))
U22¹(tt, V1) → ISNAT(activate(V1))
U22¹(tt, V1) → ACTIVATE(V1)
U31¹(tt, V2) → U32¹(isNatKind(activate(V2)))
U31¹(tt, V2) → ISNATKIND(activate(V2))
U31¹(tt, V2) → ACTIVATE(V2)
U51¹(tt, N) → U52¹(isNatKind(activate(N)), activate(N))
U51¹(tt, N) → ISNATKIND(activate(N))
U51¹(tt, N) → ACTIVATE(N)
U52¹(tt, N) → ACTIVATE(N)
U61¹(tt, M, N) → U62¹(isNatKind(activate(M)), activate(M), activate(N))
U61¹(tt, M, N) → ISNATKIND(activate(M))
U61¹(tt, M, N) → ACTIVATE(M)
U61¹(tt, M, N) → ACTIVATE(N)
U62¹(tt, M, N) → U63¹(isNat(activate(N)), activate(M), activate(N))
U62¹(tt, M, N) → ISNAT(activate(N))
U62¹(tt, M, N) → ACTIVATE(N)
U62¹(tt, M, N) → ACTIVATE(M)
U63¹(tt, M, N) → U64¹(isNatKind(activate(N)), activate(M), activate(N))
U63¹(tt, M, N) → ISNATKIND(activate(N))
U63¹(tt, M, N) → ACTIVATE(N)
U63¹(tt, M, N) → ACTIVATE(M)
U64¹(tt, M, N) → S(plus(activate(N), activate(M)))
U64¹(tt, M, N) → PLUS(activate(N), activate(M))
U64¹(tt, M, N) → ACTIVATE(N)
U64¹(tt, M, N) → ACTIVATE(M)
ISNAT(n__plus(V1, V2)) → U11¹(isNatKind(activate(V1)), activate(V1), activate(V2))
ISNAT(n__plus(V1, V2)) → ISNATKIND(activate(V1))
ISNAT(n__plus(V1, V2)) → ACTIVATE(V1)
ISNAT(n__plus(V1, V2)) → ACTIVATE(V2)
ISNAT(n__s(V1)) → U21¹(isNatKind(activate(V1)), activate(V1))
ISNAT(n__s(V1)) → ISNATKIND(activate(V1))
ISNAT(n__s(V1)) → ACTIVATE(V1)
ISNATKIND(n__plus(V1, V2)) → U31¹(isNatKind(activate(V1)), activate(V2))
ISNATKIND(n__plus(V1, V2)) → ISNATKIND(activate(V1))
ISNATKIND(n__plus(V1, V2)) → ACTIVATE(V1)
ISNATKIND(n__plus(V1, V2)) → ACTIVATE(V2)
ISNATKIND(n__s(V1)) → U41¹(isNatKind(activate(V1)))
ISNATKIND(n__s(V1)) → ISNATKIND(activate(V1))
ISNATKIND(n__s(V1)) → ACTIVATE(V1)
PLUS(N, 0) → U51¹(isNat(N), N)
PLUS(N, 0) → ISNAT(N)
PLUS(N, s(M)) → U61¹(isNat(M), M, N)
PLUS(N, s(M)) → ISNAT(M)
ACTIVATE(n__0) → 0¹
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, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0) → U51(isNat(N), N)
plus(N, s(M)) → U61(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 7 less nodes.

(4) Obligation:

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

U12¹(tt, V1, V2) → U13¹(isNatKind(activate(V2)), activate(V1), activate(V2))
U13¹(tt, V1, V2) → U14¹(isNatKind(activate(V2)), activate(V1), activate(V2))
U14¹(tt, V1, V2) → U15¹(isNat(activate(V1)), activate(V2))
U15¹(tt, V2) → ISNAT(activate(V2))
ISNAT(n__plus(V1, V2)) → U11¹(isNatKind(activate(V1)), activate(V1), activate(V2))
U11¹(tt, V1, V2) → U12¹(isNatKind(activate(V1)), activate(V1), activate(V2))
U12¹(tt, V1, V2) → ISNATKIND(activate(V2))
ISNATKIND(n__plus(V1, V2)) → U31¹(isNatKind(activate(V1)), activate(V2))
U31¹(tt, V2) → ISNATKIND(activate(V2))
ISNATKIND(n__plus(V1, V2)) → ISNATKIND(activate(V1))
ISNATKIND(n__plus(V1, V2)) → ACTIVATE(V1)
ACTIVATE(n__plus(X1, X2)) → PLUS(activate(X1), activate(X2))
PLUS(N, 0) → U51¹(isNat(N), N)
U51¹(tt, N) → U52¹(isNatKind(activate(N)), activate(N))
U52¹(tt, N) → ACTIVATE(N)
ACTIVATE(n__plus(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n__plus(X1, X2)) → ACTIVATE(X2)
ACTIVATE(n__s(X)) → ACTIVATE(X)
U51¹(tt, N) → ISNATKIND(activate(N))
ISNATKIND(n__plus(V1, V2)) → ACTIVATE(V2)
ISNATKIND(n__s(V1)) → ISNATKIND(activate(V1))
ISNATKIND(n__s(V1)) → ACTIVATE(V1)
U51¹(tt, N) → ACTIVATE(N)
PLUS(N, 0) → ISNAT(N)
ISNAT(n__plus(V1, V2)) → ISNATKIND(activate(V1))
ISNAT(n__plus(V1, V2)) → ACTIVATE(V1)
ISNAT(n__plus(V1, V2)) → ACTIVATE(V2)
ISNAT(n__s(V1)) → U21¹(isNatKind(activate(V1)), activate(V1))
U21¹(tt, V1) → U22¹(isNatKind(activate(V1)), activate(V1))
U22¹(tt, V1) → ISNAT(activate(V1))
ISNAT(n__s(V1)) → ISNATKIND(activate(V1))
ISNAT(n__s(V1)) → ACTIVATE(V1)
U22¹(tt, V1) → ACTIVATE(V1)
U21¹(tt, V1) → ISNATKIND(activate(V1))
U21¹(tt, V1) → ACTIVATE(V1)
PLUS(N, s(M)) → U61¹(isNat(M), M, N)
U61¹(tt, M, N) → U62¹(isNatKind(activate(M)), activate(M), activate(N))
U62¹(tt, M, N) → U63¹(isNat(activate(N)), activate(M), activate(N))
U63¹(tt, M, N) → U64¹(isNatKind(activate(N)), activate(M), activate(N))
U64¹(tt, M, N) → PLUS(activate(N), activate(M))
PLUS(N, s(M)) → ISNAT(M)
U64¹(tt, M, N) → ACTIVATE(N)
U64¹(tt, M, N) → ACTIVATE(M)
U63¹(tt, M, N) → ISNATKIND(activate(N))
U63¹(tt, M, N) → ACTIVATE(N)
U63¹(tt, M, N) → ACTIVATE(M)
U62¹(tt, M, N) → ISNAT(activate(N))
U62¹(tt, M, N) → ACTIVATE(N)
U62¹(tt, M, N) → ACTIVATE(M)
U61¹(tt, M, N) → ISNATKIND(activate(M))
U61¹(tt, M, N) → ACTIVATE(M)
U61¹(tt, M, N) → ACTIVATE(N)
U31¹(tt, V2) → ACTIVATE(V2)
U12¹(tt, V1, V2) → ACTIVATE(V2)
U12¹(tt, V1, V2) → ACTIVATE(V1)
U11¹(tt, V1, V2) → ISNATKIND(activate(V1))
U11¹(tt, V1, V2) → ACTIVATE(V1)
U11¹(tt, V1, V2) → ACTIVATE(V2)
U15¹(tt, V2) → ACTIVATE(V2)
U14¹(tt, V1, V2) → ISNAT(activate(V1))
U14¹(tt, V1, V2) → ACTIVATE(V1)
U14¹(tt, V1, V2) → ACTIVATE(V2)
U13¹(tt, V1, V2) → ISNATKIND(activate(V2))
U13¹(tt, V1, V2) → ACTIVATE(V2)
U13¹(tt, V1, V2) → ACTIVATE(V1)

The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0) → U51(isNat(N), N)
plus(N, s(M)) → U61(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.

U12¹(tt, V1, V2) → U13¹(isNatKind(activate(V2)), activate(V1), activate(V2))
U13¹(tt, V1, V2) → U14¹(isNatKind(activate(V2)), activate(V1), activate(V2))
U14¹(tt, V1, V2) → U15¹(isNat(activate(V1)), activate(V2))
U11¹(tt, V1, V2) → U12¹(isNatKind(activate(V1)), activate(V1), activate(V2))
U12¹(tt, V1, V2) → ISNATKIND(activate(V2))
ISNATKIND(n__plus(V1, V2)) → U31¹(isNatKind(activate(V1)), activate(V2))
ISNATKIND(n__plus(V1, V2)) → ISNATKIND(activate(V1))
ISNATKIND(n__plus(V1, V2)) → ACTIVATE(V1)
ACTIVATE(n__plus(X1, X2)) → PLUS(activate(X1), activate(X2))
PLUS(N, 0) → U51¹(isNat(N), N)
ACTIVATE(n__plus(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n__plus(X1, X2)) → ACTIVATE(X2)
ISNATKIND(n__plus(V1, V2)) → ACTIVATE(V2)
PLUS(N, 0) → ISNAT(N)
ISNAT(n__plus(V1, V2)) → ISNATKIND(activate(V1))
ISNAT(n__plus(V1, V2)) → ACTIVATE(V1)
ISNAT(n__plus(V1, V2)) → ACTIVATE(V2)
PLUS(N, s(M)) → ISNAT(M)
U64¹(tt, M, N) → ACTIVATE(N)
U64¹(tt, M, N) → ACTIVATE(M)
U63¹(tt, M, N) → ISNATKIND(activate(N))
U63¹(tt, M, N) → ACTIVATE(N)
U63¹(tt, M, N) → ACTIVATE(M)
U62¹(tt, M, N) → ISNAT(activate(N))
U62¹(tt, M, N) → ACTIVATE(N)
U62¹(tt, M, N) → ACTIVATE(M)
U61¹(tt, M, N) → ISNATKIND(activate(M))
U61¹(tt, M, N) → ACTIVATE(M)
U61¹(tt, M, N) → ACTIVATE(N)
U12¹(tt, V1, V2) → ACTIVATE(V2)
U12¹(tt, V1, V2) → ACTIVATE(V1)
U11¹(tt, V1, V2) → ISNATKIND(activate(V1))
U11¹(tt, V1, V2) → ACTIVATE(V1)
U11¹(tt, V1, V2) → ACTIVATE(V2)
U14¹(tt, V1, V2) → ISNAT(activate(V1))
U14¹(tt, V1, V2) → ACTIVATE(V1)
U14¹(tt, V1, V2) → ACTIVATE(V2)
U13¹(tt, V1, V2) → ISNATKIND(activate(V2))
U13¹(tt, V1, V2) → ACTIVATE(V2)
U13¹(tt, V1, V2) → ACTIVATE(V1)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U12¹(x1, x2, x3) = U12¹(x2, x3)
tt = tt
U13¹(x1, x2, x3) = U13¹(x1, x2, x3)
isNatKind(x1) = x1
activate(x1) = x1
U14¹(x1, x2, x3) = U14¹(x1, x2, x3)
U15¹(x1, x2) = x2
isNat(x1) = x1
ISNAT(x1) = x1
n__plus(x1, x2) = n__plus(x1, x2)
U11¹(x1, x2, x3) = U11¹(x2, x3)
ISNATKIND(x1) = x1
U31¹(x1, x2) = x2
ACTIVATE(x1) = x1
PLUS(x1, x2) = PLUS(x1, x2)
0 = 0
U51¹(x1, x2) = x2
U52¹(x1, x2) = x2
n__s(x1) = x1
U21¹(x1, x2) = x2
U22¹(x1, x2) = x2
s(x1) = x1
U61¹(x1, x2, x3) = U61¹(x2, x3)
U62¹(x1, x2, x3) = U62¹(x2, x3)
U63¹(x1, x2, x3) = U63¹(x2, x3)
U64¹(x1, x2, x3) = U64¹(x2, x3)
U11(x1, x2, x3) = U11(x3)
U12(x1, x2, x3) = U12(x3)
U13(x1, x2, x3) = U13(x1, x3)
U14(x1, x2, x3) = U14(x3)
U15(x1, x2) = U15(x2)
U16(x1) = U16(x1)
U21(x1, x2) = x1
U22(x1, x2) = U22
U23(x1) = U23
U31(x1, x2) = U31(x2)
U32(x1) = U32(x1)
U41(x1) = x1
U51(x1, x2) = U51(x2)
U52(x1, x2) = x2
U61(x1, x2, x3) = U61(x2, x3)
U62(x1, x2, x3) = U62(x2, x3)
U63(x1, x2, x3) = U63(x2, x3)
U64(x1, x2, x3) = U64(x2, x3)
plus(x1, x2) = plus(x1, x2)
n__0 = n__0

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

[n_{_plus₂}, U11^1₂, U61₂, U62₂, U63₂, U64₂, plus₂] > [tt, 0, U11₁, U12₁, U22, U23, U31₁, U32₁, n_₀] > U12^1₂ > U13^1₃ > U14^1₃
[n_{_plus₂}, U11^1₂, U61₂, U62₂, U63₂, U64₂, plus₂] > [tt, 0, U11₁, U12₁, U22, U23, U31₁, U32₁, n_₀] > [PLUS₂, U61^1₂, U62^1₂, U63^1₂, U64^1₂]
[n_{_plus₂}, U11^1₂, U61₂, U62₂, U63₂, U64₂, plus₂] > [tt, 0, U11₁, U12₁, U22, U23, U31₁, U32₁, n_₀] > [U13₂, U14₁, U15₁, U16₁]
[n_{_plus₂}, U11^1₂, U61₂, U62₂, U63₂, U64₂, plus₂] > [tt, 0, U11₁, U12₁, U22, U23, U31₁, U32₁, n_₀] > U51₁

Status:

U12^1₂: multiset
tt: multiset
U13^1₃: multiset
U14^1₃: multiset
n_{_plus₂}: multiset
U11^1₂: multiset
PLUS₂: multiset
0: multiset
U61^1₂: multiset
U62^1₂: multiset
U63^1₂: multiset
U64^1₂: multiset
U11₁: multiset
U12₁: multiset
U13₂: [2,1]
U14₁: [1]
U15₁: [1]
U16₁: [1]
U22: multiset
U23: multiset
U31₁: [1]
U32₁: [1]
U51₁: multiset
U61₂: multiset
U62₂: multiset
U63₂: multiset
U64₂: multiset
plus₂: multiset
n_₀: multiset

The following usable rules [FROCOS05] were oriented:

U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0) → U51(isNat(N), N)
plus(N, s(M)) → U61(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

(6) Obligation:

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

U15¹(tt, V2) → ISNAT(activate(V2))
ISNAT(n__plus(V1, V2)) → U11¹(isNatKind(activate(V1)), activate(V1), activate(V2))
U31¹(tt, V2) → ISNATKIND(activate(V2))
U51¹(tt, N) → U52¹(isNatKind(activate(N)), activate(N))
U52¹(tt, N) → ACTIVATE(N)
ACTIVATE(n__s(X)) → ACTIVATE(X)
U51¹(tt, N) → ISNATKIND(activate(N))
ISNATKIND(n__s(V1)) → ISNATKIND(activate(V1))
ISNATKIND(n__s(V1)) → ACTIVATE(V1)
U51¹(tt, N) → ACTIVATE(N)
ISNAT(n__s(V1)) → U21¹(isNatKind(activate(V1)), activate(V1))
U21¹(tt, V1) → U22¹(isNatKind(activate(V1)), activate(V1))
U22¹(tt, V1) → ISNAT(activate(V1))
ISNAT(n__s(V1)) → ISNATKIND(activate(V1))
ISNAT(n__s(V1)) → ACTIVATE(V1)
U22¹(tt, V1) → ACTIVATE(V1)
U21¹(tt, V1) → ISNATKIND(activate(V1))
U21¹(tt, V1) → ACTIVATE(V1)
PLUS(N, s(M)) → U61¹(isNat(M), M, N)
U61¹(tt, M, N) → U62¹(isNatKind(activate(M)), activate(M), activate(N))
U62¹(tt, M, N) → U63¹(isNat(activate(N)), activate(M), activate(N))
U63¹(tt, M, N) → U64¹(isNatKind(activate(N)), activate(M), activate(N))
U64¹(tt, M, N) → PLUS(activate(N), activate(M))
U31¹(tt, V2) → ACTIVATE(V2)
U15¹(tt, V2) → ACTIVATE(V2)

The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0) → U51(isNat(N), N)
plus(N, s(M)) → U61(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 4 SCCs with 15 less nodes.

(8) Complex Obligation (AND)

(9) Obligation:

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

U61¹(tt, M, N) → U62¹(isNatKind(activate(M)), activate(M), activate(N))
U62¹(tt, M, N) → U63¹(isNat(activate(N)), activate(M), activate(N))
U63¹(tt, M, N) → U64¹(isNatKind(activate(N)), activate(M), activate(N))
U64¹(tt, M, N) → PLUS(activate(N), activate(M))
PLUS(N, s(M)) → U61¹(isNat(M), M, N)

The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0) → U51(isNat(N), N)
plus(N, s(M)) → U61(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.

U61¹(tt, M, N) → U62¹(isNatKind(activate(M)), activate(M), activate(N))
PLUS(N, s(M)) → U61¹(isNat(M), M, N)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U61¹(x1, x2, x3) = U61¹(x1, x2)
tt = tt
U62¹(x1, x2, x3) = U62¹(x2)
isNatKind(x1) = isNatKind
activate(x1) = x1
U63¹(x1, x2, x3) = U63¹(x2)
isNat(x1) = isNat
U64¹(x1, x2, x3) = U64¹(x2)
PLUS(x1, x2) = PLUS(x2)
s(x1) = s(x1)
U11(x1, x2, x3) = U11
U12(x1, x2, x3) = U12
U13(x1, x2, x3) = U13
U14(x1, x2, x3) = U14
U15(x1, x2) = U15
U16(x1) = U16
U21(x1, x2) = U21
U22(x1, x2) = U22
U23(x1) = x1
U31(x1, x2) = x1
U32(x1) = U32
U41(x1) = x1
U51(x1, x2) = U51(x2)
U52(x1, x2) = x2
U61(x1, x2, x3) = U61(x1, x2, x3)
U62(x1, x2, x3) = U62(x1, x2, x3)
U63(x1, x2, x3) = U63(x1, x2, x3)
U64(x1, x2, x3) = U64(x1, x2, x3)
plus(x1, x2) = plus(x1, x2)
n__0 = n__0
n__plus(x1, x2) = n__plus(x1, x2)
n__s(x1) = n__s(x1)
0 = 0

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

[U61^1₂, U62^1₁, U63^1₁, U64^1₁, PLUS₁] > [tt, isNatKind, isNat, U11, U12, U13, U14, U15, U16, U21, U22, U32, U61₃, U62₃, U63₃, U64₃, plus₂, n_{_plus₂}] > [s₁, U51₁, n_{_s₁}]
[n_₀, 0] > [tt, isNatKind, isNat, U11, U12, U13, U14, U15, U16, U21, U22, U32, U61₃, U62₃, U63₃, U64₃, plus₂, n_{_plus₂}] > [s₁, U51₁, n_{_s₁}]

Status:

U61^1₂: [2,1]
tt: multiset
U62^1₁: [1]
isNatKind: []
U63^1₁: [1]
isNat: []
U64^1₁: [1]
PLUS₁: [1]
s₁: multiset
U11: []
U12: []
U13: []
U14: []
U15: []
U16: []
U21: []
U22: []
U32: []
U51₁: multiset
U61₃: [3,2,1]
U62₃: [3,2,1]
U63₃: [3,2,1]
U64₃: [3,2,1]
plus₂: [1,2]
n_₀: multiset
n_{_plus₂}: [1,2]
n_{_s₁}: multiset
0: multiset

The following usable rules [FROCOS05] were oriented:

U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0) → U51(isNat(N), N)
plus(N, s(M)) → U61(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

(11) Obligation:

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

U62¹(tt, M, N) → U63¹(isNat(activate(N)), activate(M), activate(N))
U63¹(tt, M, N) → U64¹(isNatKind(activate(N)), activate(M), activate(N))
U64¹(tt, M, N) → PLUS(activate(N), activate(M))

The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0) → U51(isNat(N), N)
plus(N, s(M)) → U61(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 3 less nodes.

(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, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0) → U51(isNat(N), N)
plus(N, s(M)) → U61(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) = ACTIVATE(x1)
n__s(x1) = n__s(x1)
U11(x1, x2, x3) = x1
tt = tt
U12(x1, x2, x3) = U12
isNatKind(x1) = isNatKind
activate(x1) = x1
U13(x1, x2, x3) = U13
U14(x1, x2, x3) = x1
U15(x1, x2) = U15
isNat(x1) = isNat
U16(x1) = U16
U21(x1, x2) = x1
U22(x1, x2) = x1
U23(x1) = U23
U31(x1, x2) = x1
U32(x1) = U32
U41(x1) = U41
U51(x1, x2) = U51(x2)
U52(x1, x2) = U52(x1, x2)
U61(x1, x2, x3) = U61(x1, x2, x3)
U62(x1, x2, x3) = U62(x1, x2, x3)
U63(x1, x2, x3) = U63(x1, x2, x3)
U64(x1, x2, x3) = U64(x1, x2, x3)
s(x1) = s(x1)
plus(x1, x2) = plus(x1, x2)
n__0 = n__0
n__plus(x1, x2) = n__plus(x1, x2)
0 = 0

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

[U51₁, U61₃, U62₃, U63₃, U64₃, plus₂, n_{_plus₂}] > [ACTIVATE₁, n_{_s₁}, s₁] > [tt, U12, isNatKind, U13, U15, isNat, U16, U23, U32, U41, U52₂, n_₀, 0]

Status:

ACTIVATE₁: multiset
n_{_s₁}: multiset
tt: multiset
U12: []
isNatKind: []
U13: []
U15: []
isNat: []
U16: []
U23: []
U32: []
U41: []
U51₁: multiset
U52₂: multiset
U61₃: multiset
U62₃: multiset
U63₃: multiset
U64₃: multiset
s₁: multiset
plus₂: multiset
n_₀: multiset
n_{_plus₂}: multiset
0: multiset

The following usable rules [FROCOS05] were oriented:

U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0) → U51(isNat(N), N)
plus(N, s(M)) → U61(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

(16) Obligation:

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

U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0) → U51(isNat(N), N)
plus(N, s(M)) → U61(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:

ISNATKIND(n__s(V1)) → ISNATKIND(activate(V1))

The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0) → U51(isNat(N), N)
plus(N, s(M)) → U61(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.

ISNATKIND(n__s(V1)) → ISNATKIND(activate(V1))

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ISNATKIND(x1) = x1
n__s(x1) = n__s(x1)
activate(x1) = x1
U11(x1, x2, x3) = U11
tt = tt
U12(x1, x2, x3) = x1
isNatKind(x1) = isNatKind
U13(x1, x2, x3) = x1
U14(x1, x2, x3) = x1
U15(x1, x2) = U15
isNat(x1) = isNat
U16(x1) = x1
U21(x1, x2) = U21
U22(x1, x2) = U22
U23(x1) = U23
U31(x1, x2) = U31
U32(x1) = x1
U41(x1) = U41
U51(x1, x2) = U51(x2)
U52(x1, x2) = U52(x1, x2)
U61(x1, x2, x3) = U61(x1, x2, x3)
U62(x1, x2, x3) = U62(x1, x2, x3)
U63(x1, x2, x3) = U63(x1, x2, x3)
U64(x1, x2, x3) = U64(x1, x2, x3)
s(x1) = s(x1)
plus(x1, x2) = plus(x1, x2)
n__0 = n__0
n__plus(x1, x2) = n__plus(x1, x2)
0 = 0

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

[U61₃, U62₃, U63₃, U64₃, plus₂, n_{_plus₂}] > [n_{_s₁}, s₁] > [U11, tt, isNatKind, U15, isNat, U21, U22, U23, U31, U41]
[U61₃, U62₃, U63₃, U64₃, plus₂, n_{_plus₂}] > U51₁ > U52₂ > [U11, tt, isNatKind, U15, isNat, U21, U22, U23, U31, U41]
[n_₀, 0] > U51₁ > U52₂ > [U11, tt, isNatKind, U15, isNat, U21, U22, U23, U31, U41]

Status:

n_{_s₁}: [1]
U11: []
tt: multiset
isNatKind: []
U15: []
isNat: []
U21: []
U22: []
U23: []
U31: []
U41: []
U51₁: multiset
U52₂: multiset
U61₃: multiset
U62₃: multiset
U63₃: multiset
U64₃: multiset
s₁: [1]
plus₂: multiset
n_₀: multiset
n_{_plus₂}: multiset
0: multiset

The following usable rules [FROCOS05] were oriented:

U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0) → U51(isNat(N), N)
plus(N, s(M)) → U61(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

(21) Obligation:

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

U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0) → U51(isNat(N), N)
plus(N, s(M)) → U61(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

(24) Obligation:

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

ISNAT(n__s(V1)) → U21¹(isNatKind(activate(V1)), activate(V1))
U21¹(tt, V1) → U22¹(isNatKind(activate(V1)), activate(V1))
U22¹(tt, V1) → ISNAT(activate(V1))

The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0) → U51(isNat(N), N)
plus(N, s(M)) → U61(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.

(25) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ISNAT(n__s(V1)) → U21¹(isNatKind(activate(V1)), activate(V1))
U21¹(tt, V1) → U22¹(isNatKind(activate(V1)), activate(V1))
U22¹(tt, 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) = ISNAT(x1)
n__s(x1) = n__s(x1)
U21¹(x1, x2) = U21¹(x1, x2)
isNatKind(x1) = isNatKind
activate(x1) = x1
tt = tt
U22¹(x1, x2) = U22¹(x1, x2)
U11(x1, x2, x3) = U11
U12(x1, x2, x3) = U12
U13(x1, x2, x3) = U13
U14(x1, x2, x3) = U14
U15(x1, x2) = x1
isNat(x1) = isNat
U16(x1) = U16
U21(x1, x2) = U21
U22(x1, x2) = U22
U23(x1) = x1
U31(x1, x2) = U31
U32(x1) = x1
U41(x1) = U41
U51(x1, x2) = x2
U52(x1, x2) = x2
U61(x1, x2, x3) = U61(x1, x2, x3)
U62(x1, x2, x3) = U62(x1, x2, x3)
U63(x1, x2, x3) = U63(x1, x2, x3)
U64(x1, x2, x3) = U64(x1, x2, x3)
s(x1) = s(x1)
plus(x1, x2) = plus(x1, x2)
n__0 = n__0
n__plus(x1, x2) = n__plus(x1, x2)
0 = 0

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

[U61₃, U62₃, U63₃, U64₃, plus₂, n_{_plus₂}] > [n_{_s₁}, s₁] > U21^1₂ > U22^1₂ > ISNAT₁ > [isNatKind, tt, U11, U12, U13, U14, isNat, U16, U21, U22, U31, U41]
[n_₀, 0] > [isNatKind, tt, U11, U12, U13, U14, isNat, U16, U21, U22, U31, U41]

Status:

ISNAT₁: [1]
n_{_s₁}: multiset
U21^1₂: multiset
isNatKind: multiset
tt: multiset
U22^1₂: multiset
U11: multiset
U12: multiset
U13: multiset
U14: multiset
isNat: multiset
U16: multiset
U21: multiset
U22: multiset
U31: multiset
U41: multiset
U61₃: [3,2,1]
U62₃: [3,2,1]
U63₃: [3,2,1]
U64₃: [3,2,1]
s₁: multiset
plus₂: [1,2]
n_₀: multiset
n_{_plus₂}: [1,2]
0: multiset

The following usable rules [FROCOS05] were oriented:

U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0) → U51(isNat(N), N)
plus(N, s(M)) → U61(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

(26) Obligation:

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

U11(tt, V1, V2) → U12(isNatKind(activate(V1)), activate(V1), activate(V2))
U12(tt, V1, V2) → U13(isNatKind(activate(V2)), activate(V1), activate(V2))
U13(tt, V1, V2) → U14(isNatKind(activate(V2)), activate(V1), activate(V2))
U14(tt, V1, V2) → U15(isNat(activate(V1)), activate(V2))
U15(tt, V2) → U16(isNat(activate(V2)))
U16(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V2) → U32(isNatKind(activate(V2)))
U32(tt) → tt
U41(tt) → tt
U51(tt, N) → U52(isNatKind(activate(N)), activate(N))
U52(tt, N) → activate(N)
U61(tt, M, N) → U62(isNatKind(activate(M)), activate(M), activate(N))
U62(tt, M, N) → U63(isNat(activate(N)), activate(M), activate(N))
U63(tt, M, N) → U64(isNatKind(activate(N)), activate(M), activate(N))
U64(tt, M, N) → s(plus(activate(N), activate(M)))
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → U11(isNatKind(activate(V1)), activate(V1), activate(V2))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatKind(n__0) → tt
isNatKind(n__plus(V1, V2)) → U31(isNatKind(activate(V1)), activate(V2))
isNatKind(n__s(V1)) → U41(isNatKind(activate(V1)))
plus(N, 0) → U51(isNat(N), N)
plus(N, s(M)) → U61(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.

(27) PisEmptyProof (EQUIVALENT transformation)

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

(0) Obligation:

(1) DependencyPairsProof (EQUIVALENT transformation)

(2) Obligation:

(3) DependencyGraphProof (EQUIVALENT transformation)

(4) Obligation:

(5) QDPOrderProof (EQUIVALENT transformation)

(6) Obligation:

(7) DependencyGraphProof (EQUIVALENT transformation)

(8) Complex Obligation (AND)

(9) Obligation:

(10) QDPOrderProof (EQUIVALENT transformation)

(11) Obligation:

(12) DependencyGraphProof (EQUIVALENT transformation)

(13) TRUE

(14) Obligation:

(15) QDPOrderProof (EQUIVALENT transformation)

(16) Obligation:

(17) PisEmptyProof (EQUIVALENT transformation)

(18) TRUE

(19) Obligation:

(20) QDPOrderProof (EQUIVALENT transformation)

(21) Obligation:

(22) PisEmptyProof (EQUIVALENT transformation)

(23) TRUE

(24) Obligation:

(25) QDPOrderProof (EQUIVALENT transformation)

(26) Obligation:

(27) PisEmptyProof (EQUIVALENT transformation)

(28) TRUE