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

(0) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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:

ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
ACTIVE(U11(tt, V1, V2)) → U12¹(isNatKind(V1), V1, V2)
ACTIVE(U11(tt, V1, V2)) → ISNATKIND(V1)
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
ACTIVE(U12(tt, V1, V2)) → U13¹(isNatKind(V2), V1, V2)
ACTIVE(U12(tt, V1, V2)) → ISNATKIND(V2)
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
ACTIVE(U13(tt, V1, V2)) → U14¹(isNatKind(V2), V1, V2)
ACTIVE(U13(tt, V1, V2)) → ISNATKIND(V2)
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
ACTIVE(U14(tt, V1, V2)) → U15¹(isNat(V1), V2)
ACTIVE(U14(tt, V1, V2)) → ISNAT(V1)
ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))
ACTIVE(U15(tt, V2)) → U16¹(isNat(V2))
ACTIVE(U15(tt, V2)) → ISNAT(V2)
ACTIVE(U16(tt)) → MARK(tt)
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
ACTIVE(U21(tt, V1)) → U22¹(isNatKind(V1), V1)
ACTIVE(U21(tt, V1)) → ISNATKIND(V1)
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U22(tt, V1)) → U23¹(isNat(V1))
ACTIVE(U22(tt, V1)) → ISNAT(V1)
ACTIVE(U23(tt)) → MARK(tt)
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
ACTIVE(U31(tt, V2)) → U32¹(isNatKind(V2))
ACTIVE(U31(tt, V2)) → ISNATKIND(V2)
ACTIVE(U32(tt)) → MARK(tt)
ACTIVE(U41(tt)) → MARK(tt)
ACTIVE(U51(tt, N)) → MARK(U52(isNatKind(N), N))
ACTIVE(U51(tt, N)) → U52¹(isNatKind(N), N)
ACTIVE(U51(tt, N)) → ISNATKIND(N)
ACTIVE(U52(tt, N)) → MARK(N)
ACTIVE(U61(tt, M, N)) → MARK(U62(isNatKind(M), M, N))
ACTIVE(U61(tt, M, N)) → U62¹(isNatKind(M), M, N)
ACTIVE(U61(tt, M, N)) → ISNATKIND(M)
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
ACTIVE(U62(tt, M, N)) → U63¹(isNat(N), M, N)
ACTIVE(U62(tt, M, N)) → ISNAT(N)
ACTIVE(U63(tt, M, N)) → MARK(U64(isNatKind(N), M, N))
ACTIVE(U63(tt, M, N)) → U64¹(isNatKind(N), M, N)
ACTIVE(U63(tt, M, N)) → ISNATKIND(N)
ACTIVE(U64(tt, M, N)) → MARK(s(plus(N, M)))
ACTIVE(U64(tt, M, N)) → S(plus(N, M))
ACTIVE(U64(tt, M, N)) → PLUS(N, M)
ACTIVE(isNat(0)) → MARK(tt)
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
ACTIVE(isNat(plus(V1, V2))) → U11¹(isNatKind(V1), V1, V2)
ACTIVE(isNat(plus(V1, V2))) → ISNATKIND(V1)
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
ACTIVE(isNat(s(V1))) → U21¹(isNatKind(V1), V1)
ACTIVE(isNat(s(V1))) → ISNATKIND(V1)
ACTIVE(isNatKind(0)) → MARK(tt)
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
ACTIVE(isNatKind(plus(V1, V2))) → U31¹(isNatKind(V1), V2)
ACTIVE(isNatKind(plus(V1, V2))) → ISNATKIND(V1)
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
ACTIVE(isNatKind(s(V1))) → U41¹(isNatKind(V1))
ACTIVE(isNatKind(s(V1))) → ISNATKIND(V1)
ACTIVE(plus(N, 0)) → MARK(U51(isNat(N), N))
ACTIVE(plus(N, 0)) → U51¹(isNat(N), N)
ACTIVE(plus(N, 0)) → ISNAT(N)
ACTIVE(plus(N, s(M))) → MARK(U61(isNat(M), M, N))
ACTIVE(plus(N, s(M))) → U61¹(isNat(M), M, N)
ACTIVE(plus(N, s(M))) → ISNAT(M)
MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
MARK(U11(X1, X2, X3)) → U11¹(mark(X1), X2, X3)
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(tt) → ACTIVE(tt)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
MARK(U12(X1, X2, X3)) → U12¹(mark(X1), X2, X3)
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
MARK(U13(X1, X2, X3)) → U13¹(mark(X1), X2, X3)
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → U14¹(mark(X1), X2, X3)
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
MARK(U15(X1, X2)) → U15¹(mark(X1), X2)
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
MARK(U16(X)) → ACTIVE(U16(mark(X)))
MARK(U16(X)) → U16¹(mark(X))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → U21¹(mark(X1), X2)
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → U22¹(mark(X1), X2)
MARK(U22(X1, X2)) → MARK(X1)
MARK(U23(X)) → ACTIVE(U23(mark(X)))
MARK(U23(X)) → U23¹(mark(X))
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(U31(X1, X2)) → U31¹(mark(X1), X2)
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → ACTIVE(U32(mark(X)))
MARK(U32(X)) → U32¹(mark(X))
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → ACTIVE(U41(mark(X)))
MARK(U41(X)) → U41¹(mark(X))
MARK(U41(X)) → MARK(X)
MARK(U51(X1, X2)) → ACTIVE(U51(mark(X1), X2))
MARK(U51(X1, X2)) → U51¹(mark(X1), X2)
MARK(U51(X1, X2)) → MARK(X1)
MARK(U52(X1, X2)) → ACTIVE(U52(mark(X1), X2))
MARK(U52(X1, X2)) → U52¹(mark(X1), X2)
MARK(U52(X1, X2)) → MARK(X1)
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
MARK(U61(X1, X2, X3)) → U61¹(mark(X1), X2, X3)
MARK(U61(X1, X2, X3)) → MARK(X1)
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
MARK(U62(X1, X2, X3)) → U62¹(mark(X1), X2, X3)
MARK(U62(X1, X2, X3)) → MARK(X1)
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))
MARK(U63(X1, X2, X3)) → U63¹(mark(X1), X2, X3)
MARK(U63(X1, X2, X3)) → MARK(X1)
MARK(U64(X1, X2, X3)) → ACTIVE(U64(mark(X1), X2, X3))
MARK(U64(X1, X2, X3)) → U64¹(mark(X1), X2, X3)
MARK(U64(X1, X2, X3)) → MARK(X1)
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(s(X)) → S(mark(X))
MARK(s(X)) → MARK(X)
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))
MARK(plus(X1, X2)) → PLUS(mark(X1), mark(X2))
MARK(plus(X1, X2)) → MARK(X1)
MARK(plus(X1, X2)) → MARK(X2)
MARK(0) → ACTIVE(0)
U11¹(mark(X1), X2, X3) → U11¹(X1, X2, X3)
U11¹(X1, mark(X2), X3) → U11¹(X1, X2, X3)
U11¹(X1, X2, mark(X3)) → U11¹(X1, X2, X3)
U11¹(active(X1), X2, X3) → U11¹(X1, X2, X3)
U11¹(X1, active(X2), X3) → U11¹(X1, X2, X3)
U11¹(X1, X2, active(X3)) → U11¹(X1, X2, X3)
U12¹(mark(X1), X2, X3) → U12¹(X1, X2, X3)
U12¹(X1, mark(X2), X3) → U12¹(X1, X2, X3)
U12¹(X1, X2, mark(X3)) → U12¹(X1, X2, X3)
U12¹(active(X1), X2, X3) → U12¹(X1, X2, X3)
U12¹(X1, active(X2), X3) → U12¹(X1, X2, X3)
U12¹(X1, X2, active(X3)) → U12¹(X1, X2, X3)
ISNATKIND(mark(X)) → ISNATKIND(X)
ISNATKIND(active(X)) → ISNATKIND(X)
U13¹(mark(X1), X2, X3) → U13¹(X1, X2, X3)
U13¹(X1, mark(X2), X3) → U13¹(X1, X2, X3)
U13¹(X1, X2, mark(X3)) → U13¹(X1, X2, X3)
U13¹(active(X1), X2, X3) → U13¹(X1, X2, X3)
U13¹(X1, active(X2), X3) → U13¹(X1, X2, X3)
U13¹(X1, X2, active(X3)) → U13¹(X1, X2, X3)
U14¹(mark(X1), X2, X3) → U14¹(X1, X2, X3)
U14¹(X1, mark(X2), X3) → U14¹(X1, X2, X3)
U14¹(X1, X2, mark(X3)) → U14¹(X1, X2, X3)
U14¹(active(X1), X2, X3) → U14¹(X1, X2, X3)
U14¹(X1, active(X2), X3) → U14¹(X1, X2, X3)
U14¹(X1, X2, active(X3)) → U14¹(X1, X2, X3)
U15¹(mark(X1), X2) → U15¹(X1, X2)
U15¹(X1, mark(X2)) → U15¹(X1, X2)
U15¹(active(X1), X2) → U15¹(X1, X2)
U15¹(X1, active(X2)) → U15¹(X1, X2)
ISNAT(mark(X)) → ISNAT(X)
ISNAT(active(X)) → ISNAT(X)
U16¹(mark(X)) → U16¹(X)
U16¹(active(X)) → U16¹(X)
U21¹(mark(X1), X2) → U21¹(X1, X2)
U21¹(X1, mark(X2)) → U21¹(X1, X2)
U21¹(active(X1), X2) → U21¹(X1, X2)
U21¹(X1, active(X2)) → U21¹(X1, X2)
U22¹(mark(X1), X2) → U22¹(X1, X2)
U22¹(X1, mark(X2)) → U22¹(X1, X2)
U22¹(active(X1), X2) → U22¹(X1, X2)
U22¹(X1, active(X2)) → U22¹(X1, X2)
U23¹(mark(X)) → U23¹(X)
U23¹(active(X)) → U23¹(X)
U31¹(mark(X1), X2) → U31¹(X1, X2)
U31¹(X1, mark(X2)) → U31¹(X1, X2)
U31¹(active(X1), X2) → U31¹(X1, X2)
U31¹(X1, active(X2)) → U31¹(X1, X2)
U32¹(mark(X)) → U32¹(X)
U32¹(active(X)) → U32¹(X)
U41¹(mark(X)) → U41¹(X)
U41¹(active(X)) → U41¹(X)
U51¹(mark(X1), X2) → U51¹(X1, X2)
U51¹(X1, mark(X2)) → U51¹(X1, X2)
U51¹(active(X1), X2) → U51¹(X1, X2)
U51¹(X1, active(X2)) → U51¹(X1, X2)
U52¹(mark(X1), X2) → U52¹(X1, X2)
U52¹(X1, mark(X2)) → U52¹(X1, X2)
U52¹(active(X1), X2) → U52¹(X1, X2)
U52¹(X1, active(X2)) → U52¹(X1, X2)
U61¹(mark(X1), X2, X3) → U61¹(X1, X2, X3)
U61¹(X1, mark(X2), X3) → U61¹(X1, X2, X3)
U61¹(X1, X2, mark(X3)) → U61¹(X1, X2, X3)
U61¹(active(X1), X2, X3) → U61¹(X1, X2, X3)
U61¹(X1, active(X2), X3) → U61¹(X1, X2, X3)
U61¹(X1, X2, active(X3)) → U61¹(X1, X2, X3)
U62¹(mark(X1), X2, X3) → U62¹(X1, X2, X3)
U62¹(X1, mark(X2), X3) → U62¹(X1, X2, X3)
U62¹(X1, X2, mark(X3)) → U62¹(X1, X2, X3)
U62¹(active(X1), X2, X3) → U62¹(X1, X2, X3)
U62¹(X1, active(X2), X3) → U62¹(X1, X2, X3)
U62¹(X1, X2, active(X3)) → U62¹(X1, X2, X3)
U63¹(mark(X1), X2, X3) → U63¹(X1, X2, X3)
U63¹(X1, mark(X2), X3) → U63¹(X1, X2, X3)
U63¹(X1, X2, mark(X3)) → U63¹(X1, X2, X3)
U63¹(active(X1), X2, X3) → U63¹(X1, X2, X3)
U63¹(X1, active(X2), X3) → U63¹(X1, X2, X3)
U63¹(X1, X2, active(X3)) → U63¹(X1, X2, X3)
U64¹(mark(X1), X2, X3) → U64¹(X1, X2, X3)
U64¹(X1, mark(X2), X3) → U64¹(X1, X2, X3)
U64¹(X1, X2, mark(X3)) → U64¹(X1, X2, X3)
U64¹(active(X1), X2, X3) → U64¹(X1, X2, X3)
U64¹(X1, active(X2), X3) → U64¹(X1, X2, X3)
U64¹(X1, X2, active(X3)) → U64¹(X1, X2, X3)
S(mark(X)) → S(X)
S(active(X)) → S(X)
PLUS(mark(X1), X2) → PLUS(X1, X2)
PLUS(X1, mark(X2)) → PLUS(X1, X2)
PLUS(active(X1), X2) → PLUS(X1, X2)
PLUS(X1, active(X2)) → PLUS(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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 23 SCCs with 66 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

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

PLUS(X1, mark(X2)) → PLUS(X1, X2)
PLUS(mark(X1), X2) → PLUS(X1, X2)
PLUS(active(X1), X2) → PLUS(X1, X2)
PLUS(X1, active(X2)) → PLUS(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(6) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PLUS(mark(X1), X2) → PLUS(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
PLUS(x0, x1, x2)  =  PLUS(x0, x1)

Tags:
PLUS has argument tags [3,0,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(PLUS(x₁, x₂)) = 0   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(7) Obligation:

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

PLUS(X1, mark(X2)) → PLUS(X1, X2)
PLUS(active(X1), X2) → PLUS(X1, X2)
PLUS(X1, active(X2)) → PLUS(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(8) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PLUS(X1, mark(X2)) → PLUS(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
PLUS(x0, x1, x2)  =  PLUS(x2)

Tags:
PLUS has argument tags [1,2,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(PLUS(x₁, x₂)) = 1 + x₁   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(9) Obligation:

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

PLUS(active(X1), X2) → PLUS(X1, X2)
PLUS(X1, active(X2)) → PLUS(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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.

PLUS(active(X1), X2) → PLUS(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
PLUS(x0, x1, x2)  =  PLUS(x0, x1)

Tags:
PLUS has argument tags [0,1,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(PLUS(x₁, x₂)) = 1   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(11) Obligation:

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

PLUS(X1, active(X2)) → PLUS(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(12) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PLUS(X1, active(X2)) → PLUS(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
PLUS(x0, x1, x2)  =  PLUS(x0, x2)

Tags:
PLUS has argument tags [3,2,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(PLUS(x₁, x₂)) = 0   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(13) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(14) PisEmptyProof (EQUIVALENT transformation)

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

(15) TRUE

(16) Obligation:

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

S(active(X)) → S(X)
S(mark(X)) → S(X)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(17) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

S(active(X)) → S(X)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
S(x0, x1)  =  S(x1)

Tags:
S has argument tags [0,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(S(x₁)) = 1   
POL(active(x₁)) = 1 + x₁   
POL(mark(x₁)) = x₁   

The following usable rules [FROCOS05] were oriented: none

(18) Obligation:

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

S(mark(X)) → S(X)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(19) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

S(mark(X)) → S(X)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
S(x0, x1)  =  S(x1)

Tags:
S has argument tags [1,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(S(x₁)) = 0   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(20) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(21) PisEmptyProof (EQUIVALENT transformation)

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

(22) TRUE

(23) Obligation:

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

U64¹(X1, mark(X2), X3) → U64¹(X1, X2, X3)
U64¹(mark(X1), X2, X3) → U64¹(X1, X2, X3)
U64¹(X1, X2, mark(X3)) → U64¹(X1, X2, X3)
U64¹(active(X1), X2, X3) → U64¹(X1, X2, X3)
U64¹(X1, active(X2), X3) → U64¹(X1, X2, X3)
U64¹(X1, X2, active(X3)) → U64¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(24) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U64¹(X1, mark(X2), X3) → U64¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U64¹(x0, x1, x2, x3)  =  U64¹(x2)

Tags:
U64¹ has argument tags [1,1,3,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U64¹(x₁, x₂, x₃)) = 1 + x₃   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(25) Obligation:

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

U64¹(mark(X1), X2, X3) → U64¹(X1, X2, X3)
U64¹(X1, X2, mark(X3)) → U64¹(X1, X2, X3)
U64¹(active(X1), X2, X3) → U64¹(X1, X2, X3)
U64¹(X1, active(X2), X3) → U64¹(X1, X2, X3)
U64¹(X1, X2, active(X3)) → U64¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(26) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U64¹(mark(X1), X2, X3) → U64¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U64¹(x0, x1, x2, x3)  =  U64¹(x1)

Tags:
U64¹ has argument tags [1,2,3,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U64¹(x₁, x₂, x₃)) = x₂   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(27) Obligation:

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

U64¹(X1, X2, mark(X3)) → U64¹(X1, X2, X3)
U64¹(active(X1), X2, X3) → U64¹(X1, X2, X3)
U64¹(X1, active(X2), X3) → U64¹(X1, X2, X3)
U64¹(X1, X2, active(X3)) → U64¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(28) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U64¹(X1, X2, mark(X3)) → U64¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U64¹(x0, x1, x2, x3)  =  U64¹(x0, x2)

Tags:
U64¹ has argument tags [1,3,2,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U64¹(x₁, x₂, x₃)) = x₂ + x₃   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(29) Obligation:

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

U64¹(active(X1), X2, X3) → U64¹(X1, X2, X3)
U64¹(X1, active(X2), X3) → U64¹(X1, X2, X3)
U64¹(X1, X2, active(X3)) → U64¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(30) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U64¹(X1, X2, active(X3)) → U64¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U64¹(x0, x1, x2, x3)  =  U64¹(x3)

Tags:
U64¹ has argument tags [1,2,3,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U64¹(x₁, x₂, x₃)) = 1   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(31) Obligation:

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

U64¹(active(X1), X2, X3) → U64¹(X1, X2, X3)
U64¹(X1, active(X2), X3) → U64¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(32) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U64¹(active(X1), X2, X3) → U64¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U64¹(x0, x1, x2, x3)  =  U64¹(x1)

Tags:
U64¹ has argument tags [1,0,1,3] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U64¹(x₁, x₂, x₃)) = x₃   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(33) Obligation:

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

U64¹(X1, active(X2), X3) → U64¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(34) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U64¹(X1, active(X2), X3) → U64¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U64¹(x0, x1, x2, x3)  =  U64¹(x0)

Tags:
U64¹ has argument tags [3,3,1,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U64¹(x₁, x₂, x₃)) = x₂ + x₃   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(35) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(36) PisEmptyProof (EQUIVALENT transformation)

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

(37) TRUE

(38) Obligation:

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

U63¹(X1, mark(X2), X3) → U63¹(X1, X2, X3)
U63¹(mark(X1), X2, X3) → U63¹(X1, X2, X3)
U63¹(X1, X2, mark(X3)) → U63¹(X1, X2, X3)
U63¹(active(X1), X2, X3) → U63¹(X1, X2, X3)
U63¹(X1, active(X2), X3) → U63¹(X1, X2, X3)
U63¹(X1, X2, active(X3)) → U63¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(39) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U63¹(X1, mark(X2), X3) → U63¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U63¹(x0, x1, x2, x3)  =  U63¹(x2)

Tags:
U63¹ has argument tags [1,1,3,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U63¹(x₁, x₂, x₃)) = 1 + x₃   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(40) Obligation:

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

U63¹(mark(X1), X2, X3) → U63¹(X1, X2, X3)
U63¹(X1, X2, mark(X3)) → U63¹(X1, X2, X3)
U63¹(active(X1), X2, X3) → U63¹(X1, X2, X3)
U63¹(X1, active(X2), X3) → U63¹(X1, X2, X3)
U63¹(X1, X2, active(X3)) → U63¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(41) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U63¹(mark(X1), X2, X3) → U63¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U63¹(x0, x1, x2, x3)  =  U63¹(x1)

Tags:
U63¹ has argument tags [1,2,3,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U63¹(x₁, x₂, x₃)) = x₂   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(42) Obligation:

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

U63¹(X1, X2, mark(X3)) → U63¹(X1, X2, X3)
U63¹(active(X1), X2, X3) → U63¹(X1, X2, X3)
U63¹(X1, active(X2), X3) → U63¹(X1, X2, X3)
U63¹(X1, X2, active(X3)) → U63¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(43) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U63¹(X1, X2, mark(X3)) → U63¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U63¹(x0, x1, x2, x3)  =  U63¹(x0, x2)

Tags:
U63¹ has argument tags [1,3,2,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U63¹(x₁, x₂, x₃)) = x₂ + x₃   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(44) Obligation:

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

U63¹(active(X1), X2, X3) → U63¹(X1, X2, X3)
U63¹(X1, active(X2), X3) → U63¹(X1, X2, X3)
U63¹(X1, X2, active(X3)) → U63¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(45) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U63¹(X1, X2, active(X3)) → U63¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U63¹(x0, x1, x2, x3)  =  U63¹(x3)

Tags:
U63¹ has argument tags [1,2,3,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U63¹(x₁, x₂, x₃)) = 1   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(46) Obligation:

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

U63¹(active(X1), X2, X3) → U63¹(X1, X2, X3)
U63¹(X1, active(X2), X3) → U63¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(47) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U63¹(active(X1), X2, X3) → U63¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U63¹(x0, x1, x2, x3)  =  U63¹(x1)

Tags:
U63¹ has argument tags [1,0,1,3] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U63¹(x₁, x₂, x₃)) = x₃   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(48) Obligation:

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

U63¹(X1, active(X2), X3) → U63¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(49) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U63¹(X1, active(X2), X3) → U63¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U63¹(x0, x1, x2, x3)  =  U63¹(x0)

Tags:
U63¹ has argument tags [3,3,1,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U63¹(x₁, x₂, x₃)) = x₂ + x₃   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(50) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(51) PisEmptyProof (EQUIVALENT transformation)

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

(52) TRUE

(53) Obligation:

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

U62¹(X1, mark(X2), X3) → U62¹(X1, X2, X3)
U62¹(mark(X1), X2, X3) → U62¹(X1, X2, X3)
U62¹(X1, X2, mark(X3)) → U62¹(X1, X2, X3)
U62¹(active(X1), X2, X3) → U62¹(X1, X2, X3)
U62¹(X1, active(X2), X3) → U62¹(X1, X2, X3)
U62¹(X1, X2, active(X3)) → U62¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(54) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U62¹(X1, mark(X2), X3) → U62¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U62¹(x0, x1, x2, x3)  =  U62¹(x2)

Tags:
U62¹ has argument tags [1,1,3,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U62¹(x₁, x₂, x₃)) = 1 + x₃   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(55) Obligation:

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

U62¹(mark(X1), X2, X3) → U62¹(X1, X2, X3)
U62¹(X1, X2, mark(X3)) → U62¹(X1, X2, X3)
U62¹(active(X1), X2, X3) → U62¹(X1, X2, X3)
U62¹(X1, active(X2), X3) → U62¹(X1, X2, X3)
U62¹(X1, X2, active(X3)) → U62¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(56) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U62¹(mark(X1), X2, X3) → U62¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U62¹(x0, x1, x2, x3)  =  U62¹(x1)

Tags:
U62¹ has argument tags [1,2,3,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U62¹(x₁, x₂, x₃)) = x₂   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(57) Obligation:

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

U62¹(X1, X2, mark(X3)) → U62¹(X1, X2, X3)
U62¹(active(X1), X2, X3) → U62¹(X1, X2, X3)
U62¹(X1, active(X2), X3) → U62¹(X1, X2, X3)
U62¹(X1, X2, active(X3)) → U62¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(58) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U62¹(X1, X2, mark(X3)) → U62¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U62¹(x0, x1, x2, x3)  =  U62¹(x0, x2)

Tags:
U62¹ has argument tags [1,3,2,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U62¹(x₁, x₂, x₃)) = x₂ + x₃   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(59) Obligation:

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

U62¹(active(X1), X2, X3) → U62¹(X1, X2, X3)
U62¹(X1, active(X2), X3) → U62¹(X1, X2, X3)
U62¹(X1, X2, active(X3)) → U62¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(60) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U62¹(X1, X2, active(X3)) → U62¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U62¹(x0, x1, x2, x3)  =  U62¹(x3)

Tags:
U62¹ has argument tags [1,2,3,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U62¹(x₁, x₂, x₃)) = 1   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(61) Obligation:

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

U62¹(active(X1), X2, X3) → U62¹(X1, X2, X3)
U62¹(X1, active(X2), X3) → U62¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(62) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U62¹(active(X1), X2, X3) → U62¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U62¹(x0, x1, x2, x3)  =  U62¹(x1)

Tags:
U62¹ has argument tags [1,0,1,3] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U62¹(x₁, x₂, x₃)) = x₃   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(63) Obligation:

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

U62¹(X1, active(X2), X3) → U62¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(64) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U62¹(X1, active(X2), X3) → U62¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U62¹(x0, x1, x2, x3)  =  U62¹(x0)

Tags:
U62¹ has argument tags [3,3,1,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U62¹(x₁, x₂, x₃)) = x₂ + x₃   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(65) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(66) PisEmptyProof (EQUIVALENT transformation)

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

(67) TRUE

(68) Obligation:

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

U61¹(X1, mark(X2), X3) → U61¹(X1, X2, X3)
U61¹(mark(X1), X2, X3) → U61¹(X1, X2, X3)
U61¹(X1, X2, mark(X3)) → U61¹(X1, X2, X3)
U61¹(active(X1), X2, X3) → U61¹(X1, X2, X3)
U61¹(X1, active(X2), X3) → U61¹(X1, X2, X3)
U61¹(X1, X2, active(X3)) → U61¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(69) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U61¹(X1, mark(X2), X3) → U61¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U61¹(x0, x1, x2, x3)  =  U61¹(x2)

Tags:
U61¹ has argument tags [1,1,3,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U61¹(x₁, x₂, x₃)) = 1 + x₃   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(70) Obligation:

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

U61¹(mark(X1), X2, X3) → U61¹(X1, X2, X3)
U61¹(X1, X2, mark(X3)) → U61¹(X1, X2, X3)
U61¹(active(X1), X2, X3) → U61¹(X1, X2, X3)
U61¹(X1, active(X2), X3) → U61¹(X1, X2, X3)
U61¹(X1, X2, active(X3)) → U61¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(71) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U61¹(mark(X1), X2, X3) → U61¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U61¹(x0, x1, x2, x3)  =  U61¹(x1)

Tags:
U61¹ has argument tags [1,2,3,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U61¹(x₁, x₂, x₃)) = x₂   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(72) Obligation:

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

U61¹(X1, X2, mark(X3)) → U61¹(X1, X2, X3)
U61¹(active(X1), X2, X3) → U61¹(X1, X2, X3)
U61¹(X1, active(X2), X3) → U61¹(X1, X2, X3)
U61¹(X1, X2, active(X3)) → U61¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(73) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U61¹(X1, X2, mark(X3)) → U61¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U61¹(x0, x1, x2, x3)  =  U61¹(x0, x2)

Tags:
U61¹ has argument tags [1,3,2,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U61¹(x₁, x₂, x₃)) = x₂ + x₃   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(74) Obligation:

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

U61¹(active(X1), X2, X3) → U61¹(X1, X2, X3)
U61¹(X1, active(X2), X3) → U61¹(X1, X2, X3)
U61¹(X1, X2, active(X3)) → U61¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(75) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U61¹(X1, X2, active(X3)) → U61¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U61¹(x0, x1, x2, x3)  =  U61¹(x3)

Tags:
U61¹ has argument tags [1,2,3,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U61¹(x₁, x₂, x₃)) = 1   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(76) Obligation:

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

U61¹(active(X1), X2, X3) → U61¹(X1, X2, X3)
U61¹(X1, active(X2), X3) → U61¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(77) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U61¹(active(X1), X2, X3) → U61¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U61¹(x0, x1, x2, x3)  =  U61¹(x1)

Tags:
U61¹ has argument tags [1,0,1,3] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U61¹(x₁, x₂, x₃)) = x₃   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(78) Obligation:

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

U61¹(X1, active(X2), X3) → U61¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(79) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U61¹(X1, active(X2), X3) → U61¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U61¹(x0, x1, x2, x3)  =  U61¹(x0)

Tags:
U61¹ has argument tags [3,3,1,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U61¹(x₁, x₂, x₃)) = x₂ + x₃   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(80) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(81) PisEmptyProof (EQUIVALENT transformation)

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

(82) TRUE

(83) Obligation:

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

U52¹(X1, mark(X2)) → U52¹(X1, X2)
U52¹(mark(X1), X2) → U52¹(X1, X2)
U52¹(active(X1), X2) → U52¹(X1, X2)
U52¹(X1, active(X2)) → U52¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(84) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U52¹(mark(X1), X2) → U52¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U52¹(x0, x1, x2)  =  U52¹(x0, x1)

Tags:
U52¹ has argument tags [3,0,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U52¹(x₁, x₂)) = 0   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(85) Obligation:

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

U52¹(X1, mark(X2)) → U52¹(X1, X2)
U52¹(active(X1), X2) → U52¹(X1, X2)
U52¹(X1, active(X2)) → U52¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(86) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U52¹(X1, mark(X2)) → U52¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U52¹(x0, x1, x2)  =  U52¹(x2)

Tags:
U52¹ has argument tags [1,2,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U52¹(x₁, x₂)) = 1 + x₁   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(87) Obligation:

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

U52¹(active(X1), X2) → U52¹(X1, X2)
U52¹(X1, active(X2)) → U52¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(88) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U52¹(active(X1), X2) → U52¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U52¹(x0, x1, x2)  =  U52¹(x0, x1)

Tags:
U52¹ has argument tags [0,1,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U52¹(x₁, x₂)) = 1   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(89) Obligation:

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

U52¹(X1, active(X2)) → U52¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(90) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U52¹(X1, active(X2)) → U52¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U52¹(x0, x1, x2)  =  U52¹(x0, x2)

Tags:
U52¹ has argument tags [3,2,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U52¹(x₁, x₂)) = 0   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(91) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(92) PisEmptyProof (EQUIVALENT transformation)

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

(93) TRUE

(94) Obligation:

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

U51¹(X1, mark(X2)) → U51¹(X1, X2)
U51¹(mark(X1), X2) → U51¹(X1, X2)
U51¹(active(X1), X2) → U51¹(X1, X2)
U51¹(X1, active(X2)) → U51¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(95) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U51¹(mark(X1), X2) → U51¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U51¹(x0, x1, x2)  =  U51¹(x0, x1)

Tags:
U51¹ has argument tags [3,0,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U51¹(x₁, x₂)) = 0   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(96) Obligation:

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

U51¹(X1, mark(X2)) → U51¹(X1, X2)
U51¹(active(X1), X2) → U51¹(X1, X2)
U51¹(X1, active(X2)) → U51¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(97) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U51¹(X1, mark(X2)) → U51¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U51¹(x0, x1, x2)  =  U51¹(x2)

Tags:
U51¹ has argument tags [1,2,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U51¹(x₁, x₂)) = 1 + x₁   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(98) Obligation:

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

U51¹(active(X1), X2) → U51¹(X1, X2)
U51¹(X1, active(X2)) → U51¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(99) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U51¹(active(X1), X2) → U51¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U51¹(x0, x1, x2)  =  U51¹(x0, x1)

Tags:
U51¹ has argument tags [0,1,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U51¹(x₁, x₂)) = 1   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(100) Obligation:

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

U51¹(X1, active(X2)) → U51¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(101) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U51¹(X1, active(X2)) → U51¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U51¹(x0, x1, x2)  =  U51¹(x0, x2)

Tags:
U51¹ has argument tags [3,2,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U51¹(x₁, x₂)) = 0   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(102) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(103) PisEmptyProof (EQUIVALENT transformation)

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

(104) TRUE

(105) Obligation:

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

U41¹(active(X)) → U41¹(X)
U41¹(mark(X)) → U41¹(X)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(106) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U41¹(active(X)) → U41¹(X)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U41¹(x0, x1)  =  U41¹(x1)

Tags:
U41¹ has argument tags [0,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U41¹(x₁)) = 1   
POL(active(x₁)) = 1 + x₁   
POL(mark(x₁)) = x₁   

The following usable rules [FROCOS05] were oriented: none

(107) Obligation:

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

U41¹(mark(X)) → U41¹(X)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(108) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U41¹(mark(X)) → U41¹(X)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U41¹(x0, x1)  =  U41¹(x1)

Tags:
U41¹ has argument tags [1,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U41¹(x₁)) = 0   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(109) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(110) PisEmptyProof (EQUIVALENT transformation)

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

(111) TRUE

(112) Obligation:

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

U32¹(active(X)) → U32¹(X)
U32¹(mark(X)) → U32¹(X)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(113) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U32¹(active(X)) → U32¹(X)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U32¹(x0, x1)  =  U32¹(x1)

Tags:
U32¹ has argument tags [0,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U32¹(x₁)) = 1   
POL(active(x₁)) = 1 + x₁   
POL(mark(x₁)) = x₁   

The following usable rules [FROCOS05] were oriented: none

(114) Obligation:

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

U32¹(mark(X)) → U32¹(X)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(115) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U32¹(mark(X)) → U32¹(X)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U32¹(x0, x1)  =  U32¹(x1)

Tags:
U32¹ has argument tags [1,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U32¹(x₁)) = 0   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(116) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(117) PisEmptyProof (EQUIVALENT transformation)

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

(118) TRUE

(119) Obligation:

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

U31¹(X1, mark(X2)) → U31¹(X1, X2)
U31¹(mark(X1), X2) → U31¹(X1, X2)
U31¹(active(X1), X2) → U31¹(X1, X2)
U31¹(X1, active(X2)) → U31¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(120) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U31¹(mark(X1), X2) → U31¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U31¹(x0, x1, x2)  =  U31¹(x0, x1)

Tags:
U31¹ has argument tags [3,0,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U31¹(x₁, x₂)) = 0   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(121) Obligation:

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

U31¹(X1, mark(X2)) → U31¹(X1, X2)
U31¹(active(X1), X2) → U31¹(X1, X2)
U31¹(X1, active(X2)) → U31¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(122) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U31¹(X1, mark(X2)) → U31¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U31¹(x0, x1, x2)  =  U31¹(x2)

Tags:
U31¹ has argument tags [1,2,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U31¹(x₁, x₂)) = 1 + x₁   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(123) Obligation:

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

U31¹(active(X1), X2) → U31¹(X1, X2)
U31¹(X1, active(X2)) → U31¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(124) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U31¹(active(X1), X2) → U31¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U31¹(x0, x1, x2)  =  U31¹(x0, x1)

Tags:
U31¹ has argument tags [0,1,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U31¹(x₁, x₂)) = 1   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(125) Obligation:

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

U31¹(X1, active(X2)) → U31¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(126) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U31¹(X1, active(X2)) → U31¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U31¹(x0, x1, x2)  =  U31¹(x0, x2)

Tags:
U31¹ has argument tags [3,2,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U31¹(x₁, x₂)) = 0   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(127) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(128) PisEmptyProof (EQUIVALENT transformation)

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

(129) TRUE

(130) Obligation:

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

U23¹(active(X)) → U23¹(X)
U23¹(mark(X)) → U23¹(X)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(131) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U23¹(active(X)) → U23¹(X)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U23¹(x0, x1)  =  U23¹(x1)

Tags:
U23¹ has argument tags [0,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U23¹(x₁)) = 1   
POL(active(x₁)) = 1 + x₁   
POL(mark(x₁)) = x₁   

The following usable rules [FROCOS05] were oriented: none

(132) Obligation:

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

U23¹(mark(X)) → U23¹(X)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(133) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U23¹(mark(X)) → U23¹(X)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U23¹(x0, x1)  =  U23¹(x1)

Tags:
U23¹ has argument tags [1,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U23¹(x₁)) = 0   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(134) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(135) PisEmptyProof (EQUIVALENT transformation)

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

(136) TRUE

(137) Obligation:

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

U22¹(X1, mark(X2)) → U22¹(X1, X2)
U22¹(mark(X1), X2) → U22¹(X1, X2)
U22¹(active(X1), X2) → U22¹(X1, X2)
U22¹(X1, active(X2)) → U22¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(138) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U22¹(mark(X1), X2) → U22¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U22¹(x0, x1, x2)  =  U22¹(x0, x1)

Tags:
U22¹ has argument tags [3,0,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U22¹(x₁, x₂)) = 0   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(139) Obligation:

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

U22¹(X1, mark(X2)) → U22¹(X1, X2)
U22¹(active(X1), X2) → U22¹(X1, X2)
U22¹(X1, active(X2)) → U22¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(140) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U22¹(X1, mark(X2)) → U22¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U22¹(x0, x1, x2)  =  U22¹(x2)

Tags:
U22¹ has argument tags [1,2,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U22¹(x₁, x₂)) = 1 + x₁   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(141) Obligation:

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

U22¹(active(X1), X2) → U22¹(X1, X2)
U22¹(X1, active(X2)) → U22¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(142) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U22¹(active(X1), X2) → U22¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U22¹(x0, x1, x2)  =  U22¹(x0, x1)

Tags:
U22¹ has argument tags [0,1,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U22¹(x₁, x₂)) = 1   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(143) Obligation:

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

U22¹(X1, active(X2)) → U22¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(144) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U22¹(X1, active(X2)) → U22¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U22¹(x0, x1, x2)  =  U22¹(x0, x2)

Tags:
U22¹ has argument tags [3,2,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U22¹(x₁, x₂)) = 0   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(145) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(146) PisEmptyProof (EQUIVALENT transformation)

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

(147) TRUE

(148) Obligation:

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

U21¹(X1, mark(X2)) → U21¹(X1, X2)
U21¹(mark(X1), X2) → U21¹(X1, X2)
U21¹(active(X1), X2) → U21¹(X1, X2)
U21¹(X1, active(X2)) → U21¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(149) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U21¹(mark(X1), X2) → U21¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U21¹(x0, x1, x2)  =  U21¹(x0, x1)

Tags:
U21¹ has argument tags [3,0,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U21¹(x₁, x₂)) = 0   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(150) Obligation:

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

U21¹(X1, mark(X2)) → U21¹(X1, X2)
U21¹(active(X1), X2) → U21¹(X1, X2)
U21¹(X1, active(X2)) → U21¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(151) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U21¹(X1, mark(X2)) → U21¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U21¹(x0, x1, x2)  =  U21¹(x2)

Tags:
U21¹ has argument tags [1,2,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U21¹(x₁, x₂)) = 1 + x₁   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(152) Obligation:

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

U21¹(active(X1), X2) → U21¹(X1, X2)
U21¹(X1, active(X2)) → U21¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(153) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U21¹(active(X1), X2) → U21¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U21¹(x0, x1, x2)  =  U21¹(x0, x1)

Tags:
U21¹ has argument tags [0,1,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U21¹(x₁, x₂)) = 1   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(154) Obligation:

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

U21¹(X1, active(X2)) → U21¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(155) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U21¹(X1, active(X2)) → U21¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U21¹(x0, x1, x2)  =  U21¹(x0, x2)

Tags:
U21¹ has argument tags [3,2,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U21¹(x₁, x₂)) = 0   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(156) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(157) PisEmptyProof (EQUIVALENT transformation)

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

(158) TRUE

(159) Obligation:

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

U16¹(active(X)) → U16¹(X)
U16¹(mark(X)) → U16¹(X)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(160) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U16¹(active(X)) → U16¹(X)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U16¹(x0, x1)  =  U16¹(x1)

Tags:
U16¹ has argument tags [0,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U16¹(x₁)) = 1   
POL(active(x₁)) = 1 + x₁   
POL(mark(x₁)) = x₁   

The following usable rules [FROCOS05] were oriented: none

(161) Obligation:

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

U16¹(mark(X)) → U16¹(X)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(162) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U16¹(mark(X)) → U16¹(X)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U16¹(x0, x1)  =  U16¹(x1)

Tags:
U16¹ has argument tags [1,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U16¹(x₁)) = 0   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(163) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(164) PisEmptyProof (EQUIVALENT transformation)

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

(165) TRUE

(166) Obligation:

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

ISNAT(active(X)) → ISNAT(X)
ISNAT(mark(X)) → ISNAT(X)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(167) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ISNAT(active(X)) → ISNAT(X)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
ISNAT(x0, x1)  =  ISNAT(x1)

Tags:
ISNAT has argument tags [0,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(ISNAT(x₁)) = 1   
POL(active(x₁)) = 1 + x₁   
POL(mark(x₁)) = x₁   

The following usable rules [FROCOS05] were oriented: none

(168) Obligation:

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

ISNAT(mark(X)) → ISNAT(X)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(169) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ISNAT(mark(X)) → ISNAT(X)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
ISNAT(x0, x1)  =  ISNAT(x1)

Tags:
ISNAT has argument tags [1,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(ISNAT(x₁)) = 0   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(170) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(171) PisEmptyProof (EQUIVALENT transformation)

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

(172) TRUE

(173) Obligation:

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

U15¹(X1, mark(X2)) → U15¹(X1, X2)
U15¹(mark(X1), X2) → U15¹(X1, X2)
U15¹(active(X1), X2) → U15¹(X1, X2)
U15¹(X1, active(X2)) → U15¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(174) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U15¹(mark(X1), X2) → U15¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U15¹(x0, x1, x2)  =  U15¹(x0, x1)

Tags:
U15¹ has argument tags [3,0,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U15¹(x₁, x₂)) = 0   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(175) Obligation:

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

U15¹(X1, mark(X2)) → U15¹(X1, X2)
U15¹(active(X1), X2) → U15¹(X1, X2)
U15¹(X1, active(X2)) → U15¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(176) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U15¹(X1, mark(X2)) → U15¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U15¹(x0, x1, x2)  =  U15¹(x2)

Tags:
U15¹ has argument tags [1,2,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U15¹(x₁, x₂)) = 1 + x₁   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(177) Obligation:

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

U15¹(active(X1), X2) → U15¹(X1, X2)
U15¹(X1, active(X2)) → U15¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(178) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U15¹(active(X1), X2) → U15¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U15¹(x0, x1, x2)  =  U15¹(x0, x1)

Tags:
U15¹ has argument tags [0,1,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U15¹(x₁, x₂)) = 1   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(179) Obligation:

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

U15¹(X1, active(X2)) → U15¹(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(180) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U15¹(X1, active(X2)) → U15¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U15¹(x0, x1, x2)  =  U15¹(x0, x2)

Tags:
U15¹ has argument tags [3,2,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U15¹(x₁, x₂)) = 0   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(181) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(182) PisEmptyProof (EQUIVALENT transformation)

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

(183) TRUE

(184) Obligation:

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

U14¹(X1, mark(X2), X3) → U14¹(X1, X2, X3)
U14¹(mark(X1), X2, X3) → U14¹(X1, X2, X3)
U14¹(X1, X2, mark(X3)) → U14¹(X1, X2, X3)
U14¹(active(X1), X2, X3) → U14¹(X1, X2, X3)
U14¹(X1, active(X2), X3) → U14¹(X1, X2, X3)
U14¹(X1, X2, active(X3)) → U14¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(185) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U14¹(X1, mark(X2), X3) → U14¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U14¹(x0, x1, x2, x3)  =  U14¹(x2)

Tags:
U14¹ has argument tags [1,1,3,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U14¹(x₁, x₂, x₃)) = 1 + x₃   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(186) Obligation:

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

U14¹(mark(X1), X2, X3) → U14¹(X1, X2, X3)
U14¹(X1, X2, mark(X3)) → U14¹(X1, X2, X3)
U14¹(active(X1), X2, X3) → U14¹(X1, X2, X3)
U14¹(X1, active(X2), X3) → U14¹(X1, X2, X3)
U14¹(X1, X2, active(X3)) → U14¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(187) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U14¹(mark(X1), X2, X3) → U14¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U14¹(x0, x1, x2, x3)  =  U14¹(x1)

Tags:
U14¹ has argument tags [1,2,3,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U14¹(x₁, x₂, x₃)) = x₂   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(188) Obligation:

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

U14¹(X1, X2, mark(X3)) → U14¹(X1, X2, X3)
U14¹(active(X1), X2, X3) → U14¹(X1, X2, X3)
U14¹(X1, active(X2), X3) → U14¹(X1, X2, X3)
U14¹(X1, X2, active(X3)) → U14¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(189) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U14¹(X1, X2, mark(X3)) → U14¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U14¹(x0, x1, x2, x3)  =  U14¹(x0, x2)

Tags:
U14¹ has argument tags [1,3,2,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U14¹(x₁, x₂, x₃)) = x₂ + x₃   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(190) Obligation:

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

U14¹(active(X1), X2, X3) → U14¹(X1, X2, X3)
U14¹(X1, active(X2), X3) → U14¹(X1, X2, X3)
U14¹(X1, X2, active(X3)) → U14¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(191) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U14¹(X1, X2, active(X3)) → U14¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U14¹(x0, x1, x2, x3)  =  U14¹(x3)

Tags:
U14¹ has argument tags [1,2,3,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U14¹(x₁, x₂, x₃)) = 1   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(192) Obligation:

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

U14¹(active(X1), X2, X3) → U14¹(X1, X2, X3)
U14¹(X1, active(X2), X3) → U14¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(193) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U14¹(active(X1), X2, X3) → U14¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U14¹(x0, x1, x2, x3)  =  U14¹(x1)

Tags:
U14¹ has argument tags [1,0,1,3] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U14¹(x₁, x₂, x₃)) = x₃   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(194) Obligation:

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

U14¹(X1, active(X2), X3) → U14¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(195) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U14¹(X1, active(X2), X3) → U14¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U14¹(x0, x1, x2, x3)  =  U14¹(x0)

Tags:
U14¹ has argument tags [3,3,1,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U14¹(x₁, x₂, x₃)) = x₂ + x₃   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(196) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(197) PisEmptyProof (EQUIVALENT transformation)

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

(198) TRUE

(199) Obligation:

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

U13¹(X1, mark(X2), X3) → U13¹(X1, X2, X3)
U13¹(mark(X1), X2, X3) → U13¹(X1, X2, X3)
U13¹(X1, X2, mark(X3)) → U13¹(X1, X2, X3)
U13¹(active(X1), X2, X3) → U13¹(X1, X2, X3)
U13¹(X1, active(X2), X3) → U13¹(X1, X2, X3)
U13¹(X1, X2, active(X3)) → U13¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(200) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U13¹(X1, mark(X2), X3) → U13¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U13¹(x0, x1, x2, x3)  =  U13¹(x2)

Tags:
U13¹ has argument tags [1,1,3,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U13¹(x₁, x₂, x₃)) = 1 + x₃   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(201) Obligation:

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

U13¹(mark(X1), X2, X3) → U13¹(X1, X2, X3)
U13¹(X1, X2, mark(X3)) → U13¹(X1, X2, X3)
U13¹(active(X1), X2, X3) → U13¹(X1, X2, X3)
U13¹(X1, active(X2), X3) → U13¹(X1, X2, X3)
U13¹(X1, X2, active(X3)) → U13¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(202) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U13¹(mark(X1), X2, X3) → U13¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U13¹(x0, x1, x2, x3)  =  U13¹(x1)

Tags:
U13¹ has argument tags [1,2,3,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U13¹(x₁, x₂, x₃)) = x₂   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(203) Obligation:

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

U13¹(X1, X2, mark(X3)) → U13¹(X1, X2, X3)
U13¹(active(X1), X2, X3) → U13¹(X1, X2, X3)
U13¹(X1, active(X2), X3) → U13¹(X1, X2, X3)
U13¹(X1, X2, active(X3)) → U13¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(204) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U13¹(X1, X2, mark(X3)) → U13¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U13¹(x0, x1, x2, x3)  =  U13¹(x0, x2)

Tags:
U13¹ has argument tags [1,3,2,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U13¹(x₁, x₂, x₃)) = x₂ + x₃   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(205) Obligation:

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

U13¹(active(X1), X2, X3) → U13¹(X1, X2, X3)
U13¹(X1, active(X2), X3) → U13¹(X1, X2, X3)
U13¹(X1, X2, active(X3)) → U13¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(206) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U13¹(X1, X2, active(X3)) → U13¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U13¹(x0, x1, x2, x3)  =  U13¹(x3)

Tags:
U13¹ has argument tags [1,2,3,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U13¹(x₁, x₂, x₃)) = 1   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(207) Obligation:

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

U13¹(active(X1), X2, X3) → U13¹(X1, X2, X3)
U13¹(X1, active(X2), X3) → U13¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(208) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U13¹(active(X1), X2, X3) → U13¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U13¹(x0, x1, x2, x3)  =  U13¹(x1)

Tags:
U13¹ has argument tags [1,0,1,3] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U13¹(x₁, x₂, x₃)) = x₃   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(209) Obligation:

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

U13¹(X1, active(X2), X3) → U13¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(210) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U13¹(X1, active(X2), X3) → U13¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U13¹(x0, x1, x2, x3)  =  U13¹(x0)

Tags:
U13¹ has argument tags [3,3,1,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U13¹(x₁, x₂, x₃)) = x₂ + x₃   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(211) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(212) PisEmptyProof (EQUIVALENT transformation)

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

(213) TRUE

(214) Obligation:

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

ISNATKIND(active(X)) → ISNATKIND(X)
ISNATKIND(mark(X)) → ISNATKIND(X)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(215) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ISNATKIND(active(X)) → ISNATKIND(X)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
ISNATKIND(x0, x1)  =  ISNATKIND(x1)

Tags:
ISNATKIND has argument tags [0,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(ISNATKIND(x₁)) = 1   
POL(active(x₁)) = 1 + x₁   
POL(mark(x₁)) = x₁   

The following usable rules [FROCOS05] were oriented: none

(216) Obligation:

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

ISNATKIND(mark(X)) → ISNATKIND(X)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(217) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ISNATKIND(mark(X)) → ISNATKIND(X)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
ISNATKIND(x0, x1)  =  ISNATKIND(x1)

Tags:
ISNATKIND has argument tags [1,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(ISNATKIND(x₁)) = 0   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(218) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(219) PisEmptyProof (EQUIVALENT transformation)

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

(220) TRUE

(221) Obligation:

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

U12¹(X1, mark(X2), X3) → U12¹(X1, X2, X3)
U12¹(mark(X1), X2, X3) → U12¹(X1, X2, X3)
U12¹(X1, X2, mark(X3)) → U12¹(X1, X2, X3)
U12¹(active(X1), X2, X3) → U12¹(X1, X2, X3)
U12¹(X1, active(X2), X3) → U12¹(X1, X2, X3)
U12¹(X1, X2, active(X3)) → U12¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(222) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U12¹(X1, mark(X2), X3) → U12¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U12¹(x0, x1, x2, x3)  =  U12¹(x2)

Tags:
U12¹ has argument tags [1,1,3,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U12¹(x₁, x₂, x₃)) = 1 + x₃   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(223) Obligation:

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

U12¹(mark(X1), X2, X3) → U12¹(X1, X2, X3)
U12¹(X1, X2, mark(X3)) → U12¹(X1, X2, X3)
U12¹(active(X1), X2, X3) → U12¹(X1, X2, X3)
U12¹(X1, active(X2), X3) → U12¹(X1, X2, X3)
U12¹(X1, X2, active(X3)) → U12¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(224) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U12¹(mark(X1), X2, X3) → U12¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U12¹(x0, x1, x2, x3)  =  U12¹(x1)

Tags:
U12¹ has argument tags [1,2,3,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U12¹(x₁, x₂, x₃)) = x₂   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(225) Obligation:

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

U12¹(X1, X2, mark(X3)) → U12¹(X1, X2, X3)
U12¹(active(X1), X2, X3) → U12¹(X1, X2, X3)
U12¹(X1, active(X2), X3) → U12¹(X1, X2, X3)
U12¹(X1, X2, active(X3)) → U12¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(226) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U12¹(X1, X2, mark(X3)) → U12¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U12¹(x0, x1, x2, x3)  =  U12¹(x0, x2)

Tags:
U12¹ has argument tags [1,3,2,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U12¹(x₁, x₂, x₃)) = x₂ + x₃   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(227) Obligation:

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

U12¹(active(X1), X2, X3) → U12¹(X1, X2, X3)
U12¹(X1, active(X2), X3) → U12¹(X1, X2, X3)
U12¹(X1, X2, active(X3)) → U12¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(228) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U12¹(X1, X2, active(X3)) → U12¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U12¹(x0, x1, x2, x3)  =  U12¹(x3)

Tags:
U12¹ has argument tags [1,2,3,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U12¹(x₁, x₂, x₃)) = 1   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(229) Obligation:

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

U12¹(active(X1), X2, X3) → U12¹(X1, X2, X3)
U12¹(X1, active(X2), X3) → U12¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(230) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U12¹(active(X1), X2, X3) → U12¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U12¹(x0, x1, x2, x3)  =  U12¹(x1)

Tags:
U12¹ has argument tags [1,0,1,3] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U12¹(x₁, x₂, x₃)) = x₃   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(231) Obligation:

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

U12¹(X1, active(X2), X3) → U12¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(232) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U12¹(X1, active(X2), X3) → U12¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U12¹(x0, x1, x2, x3)  =  U12¹(x0)

Tags:
U12¹ has argument tags [3,3,1,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U12¹(x₁, x₂, x₃)) = x₂ + x₃   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(233) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(234) PisEmptyProof (EQUIVALENT transformation)

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

(235) TRUE

(236) Obligation:

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

U11¹(X1, mark(X2), X3) → U11¹(X1, X2, X3)
U11¹(mark(X1), X2, X3) → U11¹(X1, X2, X3)
U11¹(X1, X2, mark(X3)) → U11¹(X1, X2, X3)
U11¹(active(X1), X2, X3) → U11¹(X1, X2, X3)
U11¹(X1, active(X2), X3) → U11¹(X1, X2, X3)
U11¹(X1, X2, active(X3)) → U11¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(237) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U11¹(X1, mark(X2), X3) → U11¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U11¹(x0, x1, x2, x3)  =  U11¹(x2)

Tags:
U11¹ has argument tags [1,1,3,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U11¹(x₁, x₂, x₃)) = 1 + x₃   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(238) Obligation:

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

U11¹(mark(X1), X2, X3) → U11¹(X1, X2, X3)
U11¹(X1, X2, mark(X3)) → U11¹(X1, X2, X3)
U11¹(active(X1), X2, X3) → U11¹(X1, X2, X3)
U11¹(X1, active(X2), X3) → U11¹(X1, X2, X3)
U11¹(X1, X2, active(X3)) → U11¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(239) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U11¹(mark(X1), X2, X3) → U11¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U11¹(x0, x1, x2, x3)  =  U11¹(x1)

Tags:
U11¹ has argument tags [1,2,3,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U11¹(x₁, x₂, x₃)) = x₂   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(240) Obligation:

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

U11¹(X1, X2, mark(X3)) → U11¹(X1, X2, X3)
U11¹(active(X1), X2, X3) → U11¹(X1, X2, X3)
U11¹(X1, active(X2), X3) → U11¹(X1, X2, X3)
U11¹(X1, X2, active(X3)) → U11¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(241) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U11¹(X1, X2, mark(X3)) → U11¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U11¹(x0, x1, x2, x3)  =  U11¹(x0, x2)

Tags:
U11¹ has argument tags [1,3,2,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U11¹(x₁, x₂, x₃)) = x₂ + x₃   
POL(active(x₁)) = x₁   
POL(mark(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(242) Obligation:

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

U11¹(active(X1), X2, X3) → U11¹(X1, X2, X3)
U11¹(X1, active(X2), X3) → U11¹(X1, X2, X3)
U11¹(X1, X2, active(X3)) → U11¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(243) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U11¹(X1, X2, active(X3)) → U11¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U11¹(x0, x1, x2, x3)  =  U11¹(x3)

Tags:
U11¹ has argument tags [1,2,3,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U11¹(x₁, x₂, x₃)) = 1   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(244) Obligation:

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

U11¹(active(X1), X2, X3) → U11¹(X1, X2, X3)
U11¹(X1, active(X2), X3) → U11¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(245) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U11¹(active(X1), X2, X3) → U11¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U11¹(x0, x1, x2, x3)  =  U11¹(x1)

Tags:
U11¹ has argument tags [1,0,1,3] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U11¹(x₁, x₂, x₃)) = x₃   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(246) Obligation:

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

U11¹(X1, active(X2), X3) → U11¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(247) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U11¹(X1, active(X2), X3) → U11¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
U11¹(x0, x1, x2, x3)  =  U11¹(x0)

Tags:
U11¹ has argument tags [3,3,1,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(U11¹(x₁, x₂, x₃)) = x₂ + x₃   
POL(active(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(248) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(249) PisEmptyProof (EQUIVALENT transformation)

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

(250) TRUE

(251) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
MARK(U16(X)) → ACTIVE(U16(mark(X)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
ACTIVE(U51(tt, N)) → MARK(U52(isNatKind(N), N))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
ACTIVE(U52(tt, N)) → MARK(N)
MARK(U22(X1, X2)) → MARK(X1)
MARK(U23(X)) → ACTIVE(U23(mark(X)))
ACTIVE(U61(tt, M, N)) → MARK(U62(isNatKind(M), M, N))
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → ACTIVE(U32(mark(X)))
ACTIVE(U63(tt, M, N)) → MARK(U64(isNatKind(N), M, N))
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → ACTIVE(U41(mark(X)))
ACTIVE(U64(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U41(X)) → MARK(X)
MARK(U51(X1, X2)) → ACTIVE(U51(mark(X1), X2))
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
MARK(U51(X1, X2)) → MARK(X1)
MARK(U52(X1, X2)) → ACTIVE(U52(mark(X1), X2))
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
MARK(U52(X1, X2)) → MARK(X1)
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U61(X1, X2, X3)) → MARK(X1)
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U62(X1, X2, X3)) → MARK(X1)
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))
ACTIVE(plus(N, 0)) → MARK(U51(isNat(N), N))
MARK(U63(X1, X2, X3)) → MARK(X1)
MARK(U64(X1, X2, X3)) → ACTIVE(U64(mark(X1), X2, X3))
ACTIVE(plus(N, s(M))) → MARK(U61(isNat(M), M, N))
MARK(U64(X1, X2, X3)) → MARK(X1)
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(s(X)) → MARK(X)
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))
MARK(plus(X1, X2)) → MARK(X1)
MARK(plus(X1, X2)) → MARK(X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(252) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U23(X)) → ACTIVE(U23(mark(X)))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0)
ACTIVE(x0, x1)  =  ACTIVE(x0, x1)

Tags:
MARK has argument tags [0,1] and root tag 0
ACTIVE has argument tags [2,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 1   
POL(U11(x₁, x₂, x₃)) = 1   
POL(U12(x₁, x₂, x₃)) = 1   
POL(U13(x₁, x₂, x₃)) = 1   
POL(U14(x₁, x₂, x₃)) = 1   
POL(U15(x₁, x₂)) = 1   
POL(U16(x₁)) = 1   
POL(U21(x₁, x₂)) = 1   
POL(U22(x₁, x₂)) = 1   
POL(U23(x₁)) = 0   
POL(U31(x₁, x₂)) = 1   
POL(U32(x₁)) = 1   
POL(U41(x₁)) = 1   
POL(U51(x₁, x₂)) = 1   
POL(U52(x₁, x₂)) = 1   
POL(U61(x₁, x₂, x₃)) = 1   
POL(U62(x₁, x₂, x₃)) = 1   
POL(U63(x₁, x₂, x₃)) = 1   
POL(U64(x₁, x₂, x₃)) = 1   
POL(active(x₁)) = 0   
POL(isNat(x₁)) = 1   
POL(isNatKind(x₁)) = 1   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = 1   
POL(s(x₁)) = 1   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(253) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
MARK(U16(X)) → ACTIVE(U16(mark(X)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
ACTIVE(U51(tt, N)) → MARK(U52(isNatKind(N), N))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
ACTIVE(U52(tt, N)) → MARK(N)
MARK(U22(X1, X2)) → MARK(X1)
ACTIVE(U61(tt, M, N)) → MARK(U62(isNatKind(M), M, N))
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → ACTIVE(U32(mark(X)))
ACTIVE(U63(tt, M, N)) → MARK(U64(isNatKind(N), M, N))
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → ACTIVE(U41(mark(X)))
ACTIVE(U64(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U41(X)) → MARK(X)
MARK(U51(X1, X2)) → ACTIVE(U51(mark(X1), X2))
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
MARK(U51(X1, X2)) → MARK(X1)
MARK(U52(X1, X2)) → ACTIVE(U52(mark(X1), X2))
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
MARK(U52(X1, X2)) → MARK(X1)
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U61(X1, X2, X3)) → MARK(X1)
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U62(X1, X2, X3)) → MARK(X1)
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))
ACTIVE(plus(N, 0)) → MARK(U51(isNat(N), N))
MARK(U63(X1, X2, X3)) → MARK(X1)
MARK(U64(X1, X2, X3)) → ACTIVE(U64(mark(X1), X2, X3))
ACTIVE(plus(N, s(M))) → MARK(U61(isNat(M), M, N))
MARK(U64(X1, X2, X3)) → MARK(X1)
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(s(X)) → MARK(X)
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))
MARK(plus(X1, X2)) → MARK(X1)
MARK(plus(X1, X2)) → MARK(X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(254) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(plus(N, 0)) → MARK(U51(isNat(N), N))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x1)
ACTIVE(x0, x1)  =  ACTIVE(x0, x1)

Tags:
MARK has argument tags [0,2] and root tag 1
ACTIVE has argument tags [2,2] and root tag 1

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 1   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 0   
POL(U11(x₁, x₂, x₃)) = x₁   
POL(U12(x₁, x₂, x₃)) = x₁   
POL(U13(x₁, x₂, x₃)) = x₁   
POL(U14(x₁, x₂, x₃)) = x₁   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = x₁   
POL(U22(x₁, x₂)) = x₁   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = x₁ + x₂   
POL(U52(x₁, x₂)) = x₁ + x₂   
POL(U61(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U62(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U63(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U64(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = 0   
POL(isNatKind(x₁)) = 0   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = x₁ + x₂   
POL(s(x₁)) = x₁   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(255) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
MARK(U16(X)) → ACTIVE(U16(mark(X)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
ACTIVE(U51(tt, N)) → MARK(U52(isNatKind(N), N))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
ACTIVE(U52(tt, N)) → MARK(N)
MARK(U22(X1, X2)) → MARK(X1)
ACTIVE(U61(tt, M, N)) → MARK(U62(isNatKind(M), M, N))
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → ACTIVE(U32(mark(X)))
ACTIVE(U63(tt, M, N)) → MARK(U64(isNatKind(N), M, N))
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → ACTIVE(U41(mark(X)))
ACTIVE(U64(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U41(X)) → MARK(X)
MARK(U51(X1, X2)) → ACTIVE(U51(mark(X1), X2))
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
MARK(U51(X1, X2)) → MARK(X1)
MARK(U52(X1, X2)) → ACTIVE(U52(mark(X1), X2))
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
MARK(U52(X1, X2)) → MARK(X1)
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U61(X1, X2, X3)) → MARK(X1)
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U62(X1, X2, X3)) → MARK(X1)
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))
MARK(U63(X1, X2, X3)) → MARK(X1)
MARK(U64(X1, X2, X3)) → ACTIVE(U64(mark(X1), X2, X3))
ACTIVE(plus(N, s(M))) → MARK(U61(isNat(M), M, N))
MARK(U64(X1, X2, X3)) → MARK(X1)
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(s(X)) → MARK(X)
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))
MARK(plus(X1, X2)) → MARK(X1)
MARK(plus(X1, X2)) → MARK(X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(256) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U16(X)) → ACTIVE(U16(mark(X)))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0)
ACTIVE(x0, x1)  =  ACTIVE(x0)

Tags:
MARK has argument tags [0,3] and root tag 1
ACTIVE has argument tags [0,3] and root tag 1

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = x₁   
POL(MARK(x₁)) = 1   
POL(U11(x₁, x₂, x₃)) = 1   
POL(U12(x₁, x₂, x₃)) = 1   
POL(U13(x₁, x₂, x₃)) = 1   
POL(U14(x₁, x₂, x₃)) = 1   
POL(U15(x₁, x₂)) = 1   
POL(U16(x₁)) = 0   
POL(U21(x₁, x₂)) = 1   
POL(U22(x₁, x₂)) = 1   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = 1   
POL(U32(x₁)) = 1   
POL(U41(x₁)) = 1   
POL(U51(x₁, x₂)) = 1   
POL(U52(x₁, x₂)) = 1   
POL(U61(x₁, x₂, x₃)) = 1   
POL(U62(x₁, x₂, x₃)) = 1   
POL(U63(x₁, x₂, x₃)) = 1   
POL(U64(x₁, x₂, x₃)) = 1   
POL(active(x₁)) = 0   
POL(isNat(x₁)) = 1   
POL(isNatKind(x₁)) = 1   
POL(mark(x₁)) = 0   
POL(plus(x₁, x₂)) = 1   
POL(s(x₁)) = 1   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented:

U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
isNatKind(active(X)) → isNatKind(X)
isNatKind(mark(X)) → isNatKind(X)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U15(X1, mark(X2)) → U15(X1, X2)
U15(mark(X1), X2) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
U16(active(X)) → U16(X)
U16(mark(X)) → U16(X)
U22(X1, mark(X2)) → U22(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U32(active(X)) → U32(X)
U32(mark(X)) → U32(X)
U21(X1, mark(X2)) → U21(X1, X2)
U21(mark(X1), X2) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U31(X1, mark(X2)) → U31(X1, X2)
U31(mark(X1), X2) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
U41(active(X)) → U41(X)
U41(mark(X)) → U41(X)
plus(X1, mark(X2)) → plus(X1, X2)
plus(mark(X1), X2) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)
s(active(X)) → s(X)
s(mark(X)) → s(X)
U51(X1, mark(X2)) → U51(X1, X2)
U51(mark(X1), X2) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)

(257) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
ACTIVE(U51(tt, N)) → MARK(U52(isNatKind(N), N))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
ACTIVE(U52(tt, N)) → MARK(N)
MARK(U22(X1, X2)) → MARK(X1)
ACTIVE(U61(tt, M, N)) → MARK(U62(isNatKind(M), M, N))
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → ACTIVE(U32(mark(X)))
ACTIVE(U63(tt, M, N)) → MARK(U64(isNatKind(N), M, N))
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → ACTIVE(U41(mark(X)))
ACTIVE(U64(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U41(X)) → MARK(X)
MARK(U51(X1, X2)) → ACTIVE(U51(mark(X1), X2))
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
MARK(U51(X1, X2)) → MARK(X1)
MARK(U52(X1, X2)) → ACTIVE(U52(mark(X1), X2))
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
MARK(U52(X1, X2)) → MARK(X1)
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U61(X1, X2, X3)) → MARK(X1)
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U62(X1, X2, X3)) → MARK(X1)
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))
MARK(U63(X1, X2, X3)) → MARK(X1)
MARK(U64(X1, X2, X3)) → ACTIVE(U64(mark(X1), X2, X3))
ACTIVE(plus(N, s(M))) → MARK(U61(isNat(M), M, N))
MARK(U64(X1, X2, X3)) → MARK(X1)
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(s(X)) → MARK(X)
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))
MARK(plus(X1, X2)) → MARK(X1)
MARK(plus(X1, X2)) → MARK(X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(258) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U32(X)) → ACTIVE(U32(mark(X)))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0)
ACTIVE(x0, x1)  =  ACTIVE(x0, x1)

Tags:
MARK has argument tags [1,2] and root tag 1
ACTIVE has argument tags [0,1] and root tag 1

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 1   
POL(MARK(x₁)) = 1   
POL(U11(x₁, x₂, x₃)) = 1   
POL(U12(x₁, x₂, x₃)) = 1   
POL(U13(x₁, x₂, x₃)) = 1   
POL(U14(x₁, x₂, x₃)) = 1   
POL(U15(x₁, x₂)) = 1   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = 1   
POL(U22(x₁, x₂)) = 1   
POL(U23(x₁)) = 1   
POL(U31(x₁, x₂)) = 1   
POL(U32(x₁)) = 0   
POL(U41(x₁)) = 1   
POL(U51(x₁, x₂)) = 1   
POL(U52(x₁, x₂)) = 1   
POL(U61(x₁, x₂, x₃)) = 1   
POL(U62(x₁, x₂, x₃)) = 1   
POL(U63(x₁, x₂, x₃)) = 1   
POL(U64(x₁, x₂, x₃)) = 1   
POL(active(x₁)) = 1   
POL(isNat(x₁)) = 1   
POL(isNatKind(x₁)) = 1   
POL(mark(x₁)) = 0   
POL(plus(x₁, x₂)) = 1   
POL(s(x₁)) = 1   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(259) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
ACTIVE(U51(tt, N)) → MARK(U52(isNatKind(N), N))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
ACTIVE(U52(tt, N)) → MARK(N)
MARK(U22(X1, X2)) → MARK(X1)
ACTIVE(U61(tt, M, N)) → MARK(U62(isNatKind(M), M, N))
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
ACTIVE(U63(tt, M, N)) → MARK(U64(isNatKind(N), M, N))
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → ACTIVE(U41(mark(X)))
ACTIVE(U64(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U41(X)) → MARK(X)
MARK(U51(X1, X2)) → ACTIVE(U51(mark(X1), X2))
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
MARK(U51(X1, X2)) → MARK(X1)
MARK(U52(X1, X2)) → ACTIVE(U52(mark(X1), X2))
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
MARK(U52(X1, X2)) → MARK(X1)
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U61(X1, X2, X3)) → MARK(X1)
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U62(X1, X2, X3)) → MARK(X1)
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))
MARK(U63(X1, X2, X3)) → MARK(X1)
MARK(U64(X1, X2, X3)) → ACTIVE(U64(mark(X1), X2, X3))
ACTIVE(plus(N, s(M))) → MARK(U61(isNat(M), M, N))
MARK(U64(X1, X2, X3)) → MARK(X1)
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(s(X)) → MARK(X)
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))
MARK(plus(X1, X2)) → MARK(X1)
MARK(plus(X1, X2)) → MARK(X2)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(260) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U52(tt, N)) → MARK(N)
MARK(plus(X1, X2)) → MARK(X1)
MARK(plus(X1, X2)) → MARK(X2)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x1)
ACTIVE(x0, x1)  =  ACTIVE(x1)

Tags:
MARK has argument tags [3,0] and root tag 1
ACTIVE has argument tags [0,0] and root tag 1

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 1   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 0   
POL(U11(x₁, x₂, x₃)) = x₁   
POL(U12(x₁, x₂, x₃)) = x₁   
POL(U13(x₁, x₂, x₃)) = x₁   
POL(U14(x₁, x₂, x₃)) = x₁   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = x₁   
POL(U22(x₁, x₂)) = x₁   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = x₁ + x₂   
POL(U52(x₁, x₂)) = x₁ + x₂   
POL(U61(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U62(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U63(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U64(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = 1   
POL(isNatKind(x₁)) = 1   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = 1 + x₁ + x₂   
POL(s(x₁)) = x₁   
POL(tt) = 1   

The following usable rules [FROCOS05] were oriented: none

(261) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
ACTIVE(U51(tt, N)) → MARK(U52(isNatKind(N), N))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
ACTIVE(U61(tt, M, N)) → MARK(U62(isNatKind(M), M, N))
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
ACTIVE(U63(tt, M, N)) → MARK(U64(isNatKind(N), M, N))
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → ACTIVE(U41(mark(X)))
ACTIVE(U64(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U41(X)) → MARK(X)
MARK(U51(X1, X2)) → ACTIVE(U51(mark(X1), X2))
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
MARK(U51(X1, X2)) → MARK(X1)
MARK(U52(X1, X2)) → ACTIVE(U52(mark(X1), X2))
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
MARK(U52(X1, X2)) → MARK(X1)
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U61(X1, X2, X3)) → MARK(X1)
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U62(X1, X2, X3)) → MARK(X1)
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))
MARK(U63(X1, X2, X3)) → MARK(X1)
MARK(U64(X1, X2, X3)) → ACTIVE(U64(mark(X1), X2, X3))
ACTIVE(plus(N, s(M))) → MARK(U61(isNat(M), M, N))
MARK(U64(X1, X2, X3)) → MARK(X1)
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(s(X)) → MARK(X)
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(262) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(s(X)) → MARK(X)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x1)
ACTIVE(x0, x1)  =  ACTIVE(x0, x1)

Tags:
MARK has argument tags [0,0] and root tag 0
ACTIVE has argument tags [0,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 1   
POL(ACTIVE(x₁)) = x₁   
POL(MARK(x₁)) = 0   
POL(U11(x₁, x₂, x₃)) = x₁   
POL(U12(x₁, x₂, x₃)) = x₁   
POL(U13(x₁, x₂, x₃)) = x₁   
POL(U14(x₁, x₂, x₃)) = x₁   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = x₁   
POL(U22(x₁, x₂)) = x₁   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = x₁ + x₂   
POL(U52(x₁, x₂)) = x₁ + x₂   
POL(U61(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U62(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U63(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U64(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = 1   
POL(isNatKind(x₁)) = 1   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = x₁ + x₂   
POL(s(x₁)) = 1 + x₁   
POL(tt) = 1   

The following usable rules [FROCOS05] were oriented:

mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
mark(isNatKind(X)) → active(isNatKind(X))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
mark(isNat(X)) → active(isNat(X))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
mark(U16(X)) → active(U16(mark(X)))
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
active(U52(tt, N)) → mark(N)
mark(U23(X)) → active(U23(mark(X)))
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
mark(U32(X)) → active(U32(mark(X)))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
mark(U41(X)) → active(U41(mark(X)))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
active(plus(N, 0)) → mark(U51(isNat(N), N))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(tt) → active(tt)
mark(0) → active(0)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
isNatKind(active(X)) → isNatKind(X)
isNatKind(mark(X)) → isNatKind(X)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U15(X1, mark(X2)) → U15(X1, X2)
U15(mark(X1), X2) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
U16(active(X)) → U16(X)
U16(mark(X)) → U16(X)
U22(X1, mark(X2)) → U22(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(active(X)) → U23(X)
U23(mark(X)) → U23(X)
U32(active(X)) → U32(X)
U32(mark(X)) → U32(X)
U21(X1, mark(X2)) → U21(X1, X2)
U21(mark(X1), X2) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U31(X1, mark(X2)) → U31(X1, X2)
U31(mark(X1), X2) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
U41(active(X)) → U41(X)
U41(mark(X)) → U41(X)
plus(X1, mark(X2)) → plus(X1, X2)
plus(mark(X1), X2) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)
s(active(X)) → s(X)
s(mark(X)) → s(X)
U51(X1, mark(X2)) → U51(X1, X2)
U51(mark(X1), X2) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
active(U16(tt)) → mark(tt)
active(U23(tt)) → mark(tt)
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(isNat(0)) → mark(tt)
active(isNatKind(0)) → mark(tt)

(263) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
ACTIVE(U51(tt, N)) → MARK(U52(isNatKind(N), N))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
ACTIVE(U61(tt, M, N)) → MARK(U62(isNatKind(M), M, N))
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
ACTIVE(U63(tt, M, N)) → MARK(U64(isNatKind(N), M, N))
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → ACTIVE(U41(mark(X)))
ACTIVE(U64(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U41(X)) → MARK(X)
MARK(U51(X1, X2)) → ACTIVE(U51(mark(X1), X2))
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
MARK(U51(X1, X2)) → MARK(X1)
MARK(U52(X1, X2)) → ACTIVE(U52(mark(X1), X2))
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
MARK(U52(X1, X2)) → MARK(X1)
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U61(X1, X2, X3)) → MARK(X1)
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U62(X1, X2, X3)) → MARK(X1)
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))
MARK(U63(X1, X2, X3)) → MARK(X1)
MARK(U64(X1, X2, X3)) → ACTIVE(U64(mark(X1), X2, X3))
ACTIVE(plus(N, s(M))) → MARK(U61(isNat(M), M, N))
MARK(U64(X1, X2, X3)) → MARK(X1)
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(264) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U52(X1, X2)) → ACTIVE(U52(mark(X1), X2))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0)
ACTIVE(x0, x1)  =  ACTIVE(x0, x1)

Tags:
MARK has argument tags [1,3] and root tag 0
ACTIVE has argument tags [2,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 1   
POL(U11(x₁, x₂, x₃)) = 1   
POL(U12(x₁, x₂, x₃)) = 1   
POL(U13(x₁, x₂, x₃)) = 1   
POL(U14(x₁, x₂, x₃)) = 1   
POL(U15(x₁, x₂)) = 1   
POL(U16(x₁)) = 0   
POL(U21(x₁, x₂)) = 1   
POL(U22(x₁, x₂)) = 1   
POL(U23(x₁)) = 1   
POL(U31(x₁, x₂)) = 1   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = 1   
POL(U51(x₁, x₂)) = 1   
POL(U52(x₁, x₂)) = 0   
POL(U61(x₁, x₂, x₃)) = 1   
POL(U62(x₁, x₂, x₃)) = 1   
POL(U63(x₁, x₂, x₃)) = 1   
POL(U64(x₁, x₂, x₃)) = 1   
POL(active(x₁)) = 0   
POL(isNat(x₁)) = 1   
POL(isNatKind(x₁)) = 1   
POL(mark(x₁)) = 0   
POL(plus(x₁, x₂)) = 1   
POL(s(x₁)) = 1   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(265) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
ACTIVE(U51(tt, N)) → MARK(U52(isNatKind(N), N))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
ACTIVE(U61(tt, M, N)) → MARK(U62(isNatKind(M), M, N))
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
ACTIVE(U63(tt, M, N)) → MARK(U64(isNatKind(N), M, N))
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → ACTIVE(U41(mark(X)))
ACTIVE(U64(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U41(X)) → MARK(X)
MARK(U51(X1, X2)) → ACTIVE(U51(mark(X1), X2))
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
MARK(U51(X1, X2)) → MARK(X1)
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
MARK(U52(X1, X2)) → MARK(X1)
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U61(X1, X2, X3)) → MARK(X1)
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U62(X1, X2, X3)) → MARK(X1)
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))
MARK(U63(X1, X2, X3)) → MARK(X1)
MARK(U64(X1, X2, X3)) → ACTIVE(U64(mark(X1), X2, X3))
ACTIVE(plus(N, s(M))) → MARK(U61(isNat(M), M, N))
MARK(U64(X1, X2, X3)) → MARK(X1)
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(266) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(plus(N, s(M))) → MARK(U61(isNat(M), M, N))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x1)
ACTIVE(x0, x1)  =  ACTIVE(x1)

Tags:
MARK has argument tags [0,2] and root tag 1
ACTIVE has argument tags [2,2] and root tag 1

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 1   
POL(MARK(x₁)) = 0   
POL(U11(x₁, x₂, x₃)) = x₁   
POL(U12(x₁, x₂, x₃)) = x₁   
POL(U13(x₁, x₂, x₃)) = x₁   
POL(U14(x₁, x₂, x₃)) = x₁   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = x₁   
POL(U22(x₁, x₂)) = x₁   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = x₁ + x₂   
POL(U52(x₁, x₂)) = x₁ + x₂   
POL(U61(x₁, x₂, x₃)) = x₁ + x₃   
POL(U62(x₁, x₂, x₃)) = x₁ + x₃   
POL(U63(x₁, x₂, x₃)) = x₁ + x₃   
POL(U64(x₁, x₂, x₃)) = x₁ + x₃   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = 0   
POL(isNatKind(x₁)) = 0   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = 1 + x₁   
POL(s(x₁)) = 0   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(267) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
ACTIVE(U51(tt, N)) → MARK(U52(isNatKind(N), N))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
ACTIVE(U61(tt, M, N)) → MARK(U62(isNatKind(M), M, N))
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
ACTIVE(U63(tt, M, N)) → MARK(U64(isNatKind(N), M, N))
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → ACTIVE(U41(mark(X)))
ACTIVE(U64(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U41(X)) → MARK(X)
MARK(U51(X1, X2)) → ACTIVE(U51(mark(X1), X2))
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
MARK(U51(X1, X2)) → MARK(X1)
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
MARK(U52(X1, X2)) → MARK(X1)
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U61(X1, X2, X3)) → MARK(X1)
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U62(X1, X2, X3)) → MARK(X1)
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))
MARK(U63(X1, X2, X3)) → MARK(X1)
MARK(U64(X1, X2, X3)) → ACTIVE(U64(mark(X1), X2, X3))
MARK(U64(X1, X2, X3)) → MARK(X1)
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(268) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(s(X)) → ACTIVE(s(mark(X)))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0)
ACTIVE(x0, x1)  =  ACTIVE(x1)

Tags:
MARK has argument tags [1,2] and root tag 0
ACTIVE has argument tags [0,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 1   
POL(U11(x₁, x₂, x₃)) = 1   
POL(U12(x₁, x₂, x₃)) = 1   
POL(U13(x₁, x₂, x₃)) = 1   
POL(U14(x₁, x₂, x₃)) = 1   
POL(U15(x₁, x₂)) = 1   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = 1   
POL(U22(x₁, x₂)) = 1   
POL(U23(x₁)) = 1 + x₁   
POL(U31(x₁, x₂)) = 1   
POL(U32(x₁)) = 1 + x₁   
POL(U41(x₁)) = 1   
POL(U51(x₁, x₂)) = 1   
POL(U52(x₁, x₂)) = x₁ + x₂   
POL(U61(x₁, x₂, x₃)) = 1   
POL(U62(x₁, x₂, x₃)) = 1   
POL(U63(x₁, x₂, x₃)) = 1   
POL(U64(x₁, x₂, x₃)) = 1   
POL(active(x₁)) = 0   
POL(isNat(x₁)) = 1   
POL(isNatKind(x₁)) = 1   
POL(mark(x₁)) = 0   
POL(plus(x₁, x₂)) = 1   
POL(s(x₁)) = 0   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(269) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
ACTIVE(U51(tt, N)) → MARK(U52(isNatKind(N), N))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
ACTIVE(U61(tt, M, N)) → MARK(U62(isNatKind(M), M, N))
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
ACTIVE(U63(tt, M, N)) → MARK(U64(isNatKind(N), M, N))
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → ACTIVE(U41(mark(X)))
ACTIVE(U64(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U41(X)) → MARK(X)
MARK(U51(X1, X2)) → ACTIVE(U51(mark(X1), X2))
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
MARK(U51(X1, X2)) → MARK(X1)
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
MARK(U52(X1, X2)) → MARK(X1)
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U61(X1, X2, X3)) → MARK(X1)
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U62(X1, X2, X3)) → MARK(X1)
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))
MARK(U63(X1, X2, X3)) → MARK(X1)
MARK(U64(X1, X2, X3)) → ACTIVE(U64(mark(X1), X2, X3))
MARK(U64(X1, X2, X3)) → MARK(X1)
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(270) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U51(tt, N)) → MARK(U52(isNatKind(N), N))
MARK(U51(X1, X2)) → MARK(X1)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0, x1)
ACTIVE(x0, x1)  =  ACTIVE(x1)

Tags:
MARK has argument tags [2,2] and root tag 1
ACTIVE has argument tags [0,2] and root tag 1

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 0   
POL(U11(x₁, x₂, x₃)) = x₁   
POL(U12(x₁, x₂, x₃)) = x₁   
POL(U13(x₁, x₂, x₃)) = x₁   
POL(U14(x₁, x₂, x₃)) = x₁   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = x₁   
POL(U22(x₁, x₂)) = x₁   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = 1 + x₁ + x₂   
POL(U52(x₁, x₂)) = x₁ + x₂   
POL(U61(x₁, x₂, x₃)) = x₁   
POL(U62(x₁, x₂, x₃)) = x₁   
POL(U63(x₁, x₂, x₃)) = x₁   
POL(U64(x₁, x₂, x₃)) = x₁   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = 0   
POL(isNatKind(x₁)) = 0   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = 1 + x₁   
POL(s(x₁)) = 0   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(271) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
ACTIVE(U61(tt, M, N)) → MARK(U62(isNatKind(M), M, N))
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
ACTIVE(U63(tt, M, N)) → MARK(U64(isNatKind(N), M, N))
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → ACTIVE(U41(mark(X)))
ACTIVE(U64(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U41(X)) → MARK(X)
MARK(U51(X1, X2)) → ACTIVE(U51(mark(X1), X2))
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
MARK(U52(X1, X2)) → MARK(X1)
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U61(X1, X2, X3)) → MARK(X1)
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U62(X1, X2, X3)) → MARK(X1)
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))
MARK(U63(X1, X2, X3)) → MARK(X1)
MARK(U64(X1, X2, X3)) → ACTIVE(U64(mark(X1), X2, X3))
MARK(U64(X1, X2, X3)) → MARK(X1)
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(272) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U52(X1, X2)) → MARK(X1)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x1)
ACTIVE(x0, x1)  =  ACTIVE(x0, x1)

Tags:
MARK has argument tags [0,2] and root tag 0
ACTIVE has argument tags [2,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 1   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 0   
POL(U11(x₁, x₂, x₃)) = x₁   
POL(U12(x₁, x₂, x₃)) = x₁   
POL(U13(x₁, x₂, x₃)) = x₁   
POL(U14(x₁, x₂, x₃)) = x₁   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = x₁   
POL(U22(x₁, x₂)) = x₁   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = 1 + x₁ + x₂   
POL(U52(x₁, x₂)) = 1 + x₁ + x₂   
POL(U61(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U62(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U63(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U64(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = 0   
POL(isNatKind(x₁)) = 0   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = x₁ + x₂   
POL(s(x₁)) = x₁   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(273) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
ACTIVE(U61(tt, M, N)) → MARK(U62(isNatKind(M), M, N))
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
ACTIVE(U63(tt, M, N)) → MARK(U64(isNatKind(N), M, N))
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → ACTIVE(U41(mark(X)))
ACTIVE(U64(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U41(X)) → MARK(X)
MARK(U51(X1, X2)) → ACTIVE(U51(mark(X1), X2))
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U61(X1, X2, X3)) → MARK(X1)
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U62(X1, X2, X3)) → MARK(X1)
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))
MARK(U63(X1, X2, X3)) → MARK(X1)
MARK(U64(X1, X2, X3)) → ACTIVE(U64(mark(X1), X2, X3))
MARK(U64(X1, X2, X3)) → MARK(X1)
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(274) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0, x1)
ACTIVE(x0, x1)  =  ACTIVE(x0)

Tags:
MARK has argument tags [1,2] and root tag 0
ACTIVE has argument tags [2,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 0   
POL(U11(x₁, x₂, x₃)) = x₁   
POL(U12(x₁, x₂, x₃)) = x₁   
POL(U13(x₁, x₂, x₃)) = x₁   
POL(U14(x₁, x₂, x₃)) = x₁   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = x₁   
POL(U22(x₁, x₂)) = x₁   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = x₂   
POL(U52(x₁, x₂)) = 0   
POL(U61(x₁, x₂, x₃)) = x₁   
POL(U62(x₁, x₂, x₃)) = x₁   
POL(U63(x₁, x₂, x₃)) = x₁   
POL(U64(x₁, x₂, x₃)) = x₁   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = 0   
POL(isNatKind(x₁)) = 0   
POL(mark(x₁)) = 1 + x₁   
POL(plus(x₁, x₂)) = 1   
POL(s(x₁)) = 0   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(275) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
ACTIVE(U61(tt, M, N)) → MARK(U62(isNatKind(M), M, N))
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
ACTIVE(U63(tt, M, N)) → MARK(U64(isNatKind(N), M, N))
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → ACTIVE(U41(mark(X)))
ACTIVE(U64(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U41(X)) → MARK(X)
MARK(U51(X1, X2)) → ACTIVE(U51(mark(X1), X2))
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U61(X1, X2, X3)) → MARK(X1)
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U62(X1, X2, X3)) → MARK(X1)
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))
MARK(U63(X1, X2, X3)) → MARK(X1)
MARK(U64(X1, X2, X3)) → ACTIVE(U64(mark(X1), X2, X3))
MARK(U64(X1, X2, X3)) → MARK(X1)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(276) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U51(X1, X2)) → ACTIVE(U51(mark(X1), X2))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0)
ACTIVE(x0, x1)  =  ACTIVE(x1)

Tags:
MARK has argument tags [0,0] and root tag 0
ACTIVE has argument tags [0,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 1   
POL(U11(x₁, x₂, x₃)) = 1   
POL(U12(x₁, x₂, x₃)) = 1   
POL(U13(x₁, x₂, x₃)) = 1   
POL(U14(x₁, x₂, x₃)) = 1   
POL(U15(x₁, x₂)) = 1   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = 1   
POL(U22(x₁, x₂)) = 1   
POL(U23(x₁)) = 1   
POL(U31(x₁, x₂)) = 1   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = 1   
POL(U51(x₁, x₂)) = 0   
POL(U52(x₁, x₂)) = 0   
POL(U61(x₁, x₂, x₃)) = 1   
POL(U62(x₁, x₂, x₃)) = 1   
POL(U63(x₁, x₂, x₃)) = 1   
POL(U64(x₁, x₂, x₃)) = 1   
POL(active(x₁)) = 0   
POL(isNat(x₁)) = 1   
POL(isNatKind(x₁)) = 1   
POL(mark(x₁)) = 0   
POL(plus(x₁, x₂)) = x₁   
POL(s(x₁)) = x₁   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(277) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
ACTIVE(U61(tt, M, N)) → MARK(U62(isNatKind(M), M, N))
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
ACTIVE(U63(tt, M, N)) → MARK(U64(isNatKind(N), M, N))
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → ACTIVE(U41(mark(X)))
ACTIVE(U64(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U41(X)) → MARK(X)
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U61(X1, X2, X3)) → MARK(X1)
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U62(X1, X2, X3)) → MARK(X1)
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))
MARK(U63(X1, X2, X3)) → MARK(X1)
MARK(U64(X1, X2, X3)) → ACTIVE(U64(mark(X1), X2, X3))
MARK(U64(X1, X2, X3)) → MARK(X1)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(278) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U64(tt, M, N)) → MARK(s(plus(N, M)))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0, x1)
ACTIVE(x0, x1)  =  ACTIVE(x0, x1)

Tags:
MARK has argument tags [1,2] and root tag 0
ACTIVE has argument tags [2,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 1   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 0   
POL(U11(x₁, x₂, x₃)) = x₁   
POL(U12(x₁, x₂, x₃)) = x₁   
POL(U13(x₁, x₂, x₃)) = x₁   
POL(U14(x₁, x₂, x₃)) = x₁   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = x₁   
POL(U22(x₁, x₂)) = x₁   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = x₂   
POL(U52(x₁, x₂)) = x₂   
POL(U61(x₁, x₂, x₃)) = x₁ + x₃   
POL(U62(x₁, x₂, x₃)) = x₁ + x₃   
POL(U63(x₁, x₂, x₃)) = x₁ + x₃   
POL(U64(x₁, x₂, x₃)) = x₁   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = 1   
POL(isNatKind(x₁)) = 1   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = 1 + x₁ + x₂   
POL(s(x₁)) = 0   
POL(tt) = 1   

The following usable rules [FROCOS05] were oriented: none

(279) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
ACTIVE(U61(tt, M, N)) → MARK(U62(isNatKind(M), M, N))
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
ACTIVE(U63(tt, M, N)) → MARK(U64(isNatKind(N), M, N))
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → ACTIVE(U41(mark(X)))
MARK(U41(X)) → MARK(X)
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U61(X1, X2, X3)) → MARK(X1)
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U62(X1, X2, X3)) → MARK(X1)
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))
MARK(U63(X1, X2, X3)) → MARK(X1)
MARK(U64(X1, X2, X3)) → ACTIVE(U64(mark(X1), X2, X3))
MARK(U64(X1, X2, X3)) → MARK(X1)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(280) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U64(X1, X2, X3)) → ACTIVE(U64(mark(X1), X2, X3))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0)
ACTIVE(x0, x1)  =  ACTIVE(x0)

Tags:
MARK has argument tags [0,3] and root tag 0
ACTIVE has argument tags [0,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = x₁   
POL(MARK(x₁)) = 1   
POL(U11(x₁, x₂, x₃)) = 1   
POL(U12(x₁, x₂, x₃)) = 1   
POL(U13(x₁, x₂, x₃)) = 1   
POL(U14(x₁, x₂, x₃)) = 1   
POL(U15(x₁, x₂)) = 1   
POL(U16(x₁)) = 0   
POL(U21(x₁, x₂)) = 1   
POL(U22(x₁, x₂)) = 1   
POL(U23(x₁)) = 0   
POL(U31(x₁, x₂)) = 1   
POL(U32(x₁)) = 1   
POL(U41(x₁)) = 1   
POL(U51(x₁, x₂)) = x₁ + x₂   
POL(U52(x₁, x₂)) = x₂   
POL(U61(x₁, x₂, x₃)) = 1   
POL(U62(x₁, x₂, x₃)) = 1   
POL(U63(x₁, x₂, x₃)) = 1   
POL(U64(x₁, x₂, x₃)) = 0   
POL(active(x₁)) = 0   
POL(isNat(x₁)) = 1   
POL(isNatKind(x₁)) = 1   
POL(mark(x₁)) = 0   
POL(plus(x₁, x₂)) = 0   
POL(s(x₁)) = 0   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented:

U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
isNatKind(active(X)) → isNatKind(X)
isNatKind(mark(X)) → isNatKind(X)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U15(X1, mark(X2)) → U15(X1, X2)
U15(mark(X1), X2) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(mark(X1), X2) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U31(X1, mark(X2)) → U31(X1, X2)
U31(mark(X1), X2) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
U41(active(X)) → U41(X)
U41(mark(X)) → U41(X)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)

(281) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
ACTIVE(U61(tt, M, N)) → MARK(U62(isNatKind(M), M, N))
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
ACTIVE(U63(tt, M, N)) → MARK(U64(isNatKind(N), M, N))
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → ACTIVE(U41(mark(X)))
MARK(U41(X)) → MARK(X)
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U61(X1, X2, X3)) → MARK(X1)
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U62(X1, X2, X3)) → MARK(X1)
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))
MARK(U63(X1, X2, X3)) → MARK(X1)
MARK(U64(X1, X2, X3)) → MARK(X1)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(282) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U41(X)) → ACTIVE(U41(mark(X)))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0)
ACTIVE(x0, x1)  =  ACTIVE(x0, x1)

Tags:
MARK has argument tags [0,3] and root tag 1
ACTIVE has argument tags [0,0] and root tag 1

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 1   
POL(U11(x₁, x₂, x₃)) = 1   
POL(U12(x₁, x₂, x₃)) = 1   
POL(U13(x₁, x₂, x₃)) = 1   
POL(U14(x₁, x₂, x₃)) = 1   
POL(U15(x₁, x₂)) = 1   
POL(U16(x₁)) = 0   
POL(U21(x₁, x₂)) = 1   
POL(U22(x₁, x₂)) = 1   
POL(U23(x₁)) = 0   
POL(U31(x₁, x₂)) = 1   
POL(U32(x₁)) = 0   
POL(U41(x₁)) = 0   
POL(U51(x₁, x₂)) = x₁   
POL(U52(x₁, x₂)) = x₂   
POL(U61(x₁, x₂, x₃)) = 1   
POL(U62(x₁, x₂, x₃)) = 1   
POL(U63(x₁, x₂, x₃)) = 1   
POL(U64(x₁, x₂, x₃)) = x₂   
POL(active(x₁)) = 0   
POL(isNat(x₁)) = 1   
POL(isNatKind(x₁)) = 1   
POL(mark(x₁)) = 1   
POL(plus(x₁, x₂)) = x₂   
POL(s(x₁)) = 0   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(283) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
ACTIVE(U61(tt, M, N)) → MARK(U62(isNatKind(M), M, N))
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
ACTIVE(U63(tt, M, N)) → MARK(U64(isNatKind(N), M, N))
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U61(X1, X2, X3)) → MARK(X1)
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U62(X1, X2, X3)) → MARK(X1)
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))
MARK(U63(X1, X2, X3)) → MARK(X1)
MARK(U64(X1, X2, X3)) → MARK(X1)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(284) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U61(tt, M, N)) → MARK(U62(isNatKind(M), M, N))
MARK(U61(X1, X2, X3)) → MARK(X1)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x1)
ACTIVE(x0, x1)  =  ACTIVE(x0, x1)

Tags:
MARK has argument tags [0,3] and root tag 1
ACTIVE has argument tags [3,3] and root tag 1

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 0   
POL(U11(x₁, x₂, x₃)) = x₁   
POL(U12(x₁, x₂, x₃)) = x₁   
POL(U13(x₁, x₂, x₃)) = x₁   
POL(U14(x₁, x₂, x₃)) = x₁   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = x₁   
POL(U22(x₁, x₂)) = x₁   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = x₂   
POL(U52(x₁, x₂)) = x₁ + x₂   
POL(U61(x₁, x₂, x₃)) = 1 + x₁   
POL(U62(x₁, x₂, x₃)) = x₁   
POL(U63(x₁, x₂, x₃)) = x₁   
POL(U64(x₁, x₂, x₃)) = x₁   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = 0   
POL(isNatKind(x₁)) = 0   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = 1 + x₁   
POL(s(x₁)) = 0   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(285) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
ACTIVE(U63(tt, M, N)) → MARK(U64(isNatKind(N), M, N))
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U62(X1, X2, X3)) → MARK(X1)
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))
MARK(U63(X1, X2, X3)) → MARK(X1)
MARK(U64(X1, X2, X3)) → MARK(X1)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(286) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U63(tt, M, N)) → MARK(U64(isNatKind(N), M, N))
MARK(U62(X1, X2, X3)) → MARK(X1)
MARK(U63(X1, X2, X3)) → MARK(X1)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0, x1)
ACTIVE(x0, x1)  =  ACTIVE(x0, x1)

Tags:
MARK has argument tags [0,1] and root tag 1
ACTIVE has argument tags [0,0] and root tag 1

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 1 + x₁   
POL(MARK(x₁)) = 1 + x₁   
POL(U11(x₁, x₂, x₃)) = x₁   
POL(U12(x₁, x₂, x₃)) = x₁   
POL(U13(x₁, x₂, x₃)) = x₁   
POL(U14(x₁, x₂, x₃)) = x₁   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = x₁   
POL(U22(x₁, x₂)) = x₁   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = x₂   
POL(U52(x₁, x₂)) = x₂   
POL(U61(x₁, x₂, x₃)) = 1 + x₁   
POL(U62(x₁, x₂, x₃)) = 1 + x₁   
POL(U63(x₁, x₂, x₃)) = 1 + x₁   
POL(U64(x₁, x₂, x₃)) = x₁   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = 1   
POL(isNatKind(x₁)) = 1   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = 1 + x₁ + x₂   
POL(s(x₁)) = 1   
POL(tt) = 1   

The following usable rules [FROCOS05] were oriented:

mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
mark(isNatKind(X)) → active(isNatKind(X))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
mark(isNat(X)) → active(isNat(X))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
mark(U16(X)) → active(U16(mark(X)))
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
active(U52(tt, N)) → mark(N)
mark(U23(X)) → active(U23(mark(X)))
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
mark(U32(X)) → active(U32(mark(X)))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
mark(U41(X)) → active(U41(mark(X)))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
active(plus(N, 0)) → mark(U51(isNat(N), N))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(tt) → active(tt)
mark(0) → active(0)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
isNatKind(active(X)) → isNatKind(X)
isNatKind(mark(X)) → isNatKind(X)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U15(X1, mark(X2)) → U15(X1, X2)
U15(mark(X1), X2) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
U16(active(X)) → U16(X)
U16(mark(X)) → U16(X)
U22(X1, mark(X2)) → U22(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(active(X)) → U23(X)
U23(mark(X)) → U23(X)
U32(active(X)) → U32(X)
U32(mark(X)) → U32(X)
U21(X1, mark(X2)) → U21(X1, X2)
U21(mark(X1), X2) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(mark(X1), X2) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U41(active(X)) → U41(X)
U41(mark(X)) → U41(X)
active(U16(tt)) → mark(tt)
active(U23(tt)) → mark(tt)
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(isNat(0)) → mark(tt)
active(isNatKind(0)) → mark(tt)
U52(X1, mark(X2)) → U52(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(mark(X1), X2) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)
s(active(X)) → s(X)
s(mark(X)) → s(X)
U51(X1, mark(X2)) → U51(X1, X2)
U51(mark(X1), X2) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)

(287) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))
MARK(U64(X1, X2, X3)) → MARK(X1)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(288) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U64(X1, X2, X3)) → MARK(X1)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x1)
ACTIVE(x0, x1)  =  ACTIVE(x0, x1)

Tags:
MARK has argument tags [3,0] and root tag 0
ACTIVE has argument tags [0,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 0   
POL(U11(x₁, x₂, x₃)) = x₁   
POL(U12(x₁, x₂, x₃)) = x₁   
POL(U13(x₁, x₂, x₃)) = x₁   
POL(U14(x₁, x₂, x₃)) = x₁   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = x₁   
POL(U22(x₁, x₂)) = x₁   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = x₂   
POL(U52(x₁, x₂)) = x₂   
POL(U61(x₁, x₂, x₃)) = 1 + x₃   
POL(U62(x₁, x₂, x₃)) = 1 + x₃   
POL(U63(x₁, x₂, x₃)) = 1 + x₃   
POL(U64(x₁, x₂, x₃)) = 1 + x₁ + x₃   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = 0   
POL(isNatKind(x₁)) = 0   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = 1 + x₁   
POL(s(x₁)) = 0   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(289) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(290) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U15(tt, V2)) → MARK(U16(isNat(V2)))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0, x1)
ACTIVE(x0, x1)  =  ACTIVE(x0)

Tags:
MARK has argument tags [2,2] and root tag 0
ACTIVE has argument tags [2,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = x₁   
POL(MARK(x₁)) = 1   
POL(U11(x₁, x₂, x₃)) = 1 + x₁ + x₂ + x₃   
POL(U12(x₁, x₂, x₃)) = 1 + x₁ + x₂ + x₃   
POL(U13(x₁, x₂, x₃)) = 1 + x₁ + x₂ + x₃   
POL(U14(x₁, x₂, x₃)) = 1 + x₁ + x₂ + x₃   
POL(U15(x₁, x₂)) = 1 + x₁ + x₂   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = x₁ + x₂   
POL(U22(x₁, x₂)) = x₁ + x₂   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = x₂   
POL(U52(x₁, x₂)) = x₂   
POL(U61(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U62(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U63(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U64(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = 1 + x₁   
POL(isNatKind(x₁)) = 1   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = 1 + x₁ + x₂   
POL(s(x₁)) = x₁   
POL(tt) = 1   

The following usable rules [FROCOS05] were oriented:

mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
mark(isNatKind(X)) → active(isNatKind(X))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
mark(isNat(X)) → active(isNat(X))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
mark(U16(X)) → active(U16(mark(X)))
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
active(U52(tt, N)) → mark(N)
mark(U23(X)) → active(U23(mark(X)))
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
mark(U32(X)) → active(U32(mark(X)))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
mark(U41(X)) → active(U41(mark(X)))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
active(plus(N, 0)) → mark(U51(isNat(N), N))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(tt) → active(tt)
mark(0) → active(0)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
isNatKind(active(X)) → isNatKind(X)
isNatKind(mark(X)) → isNatKind(X)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U15(X1, mark(X2)) → U15(X1, X2)
U15(mark(X1), X2) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
U16(active(X)) → U16(X)
U16(mark(X)) → U16(X)
U22(X1, mark(X2)) → U22(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(active(X)) → U23(X)
U23(mark(X)) → U23(X)
U32(active(X)) → U32(X)
U32(mark(X)) → U32(X)
U21(X1, mark(X2)) → U21(X1, X2)
U21(mark(X1), X2) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(mark(X1), X2) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U41(active(X)) → U41(X)
U41(mark(X)) → U41(X)
active(U16(tt)) → mark(tt)
active(U23(tt)) → mark(tt)
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(isNat(0)) → mark(tt)
active(isNatKind(0)) → mark(tt)
U52(X1, mark(X2)) → U52(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
plus(X1, mark(X2)) → plus(X1, X2)
plus(mark(X1), X2) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)
s(active(X)) → s(X)
s(mark(X)) → s(X)
U51(X1, mark(X2)) → U51(X1, X2)
U51(mark(X1), X2) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)

(291) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(292) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U61(X1, X2, X3)) → ACTIVE(U61(mark(X1), X2, X3))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0, x1)
ACTIVE(x0, x1)  =  ACTIVE(x0)

Tags:
MARK has argument tags [3,2] and root tag 0
ACTIVE has argument tags [3,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 1   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 0   
POL(U11(x₁, x₂, x₃)) = x₁   
POL(U12(x₁, x₂, x₃)) = x₁   
POL(U13(x₁, x₂, x₃)) = x₁   
POL(U14(x₁, x₂, x₃)) = x₁   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = x₁   
POL(U22(x₁, x₂)) = x₁   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = 0   
POL(U52(x₁, x₂)) = x₁ + x₂   
POL(U61(x₁, x₂, x₃)) = 1   
POL(U62(x₁, x₂, x₃)) = x₂   
POL(U63(x₁, x₂, x₃)) = 0   
POL(U64(x₁, x₂, x₃)) = x₂   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = 0   
POL(isNatKind(x₁)) = 0   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = 0   
POL(s(x₁)) = 0   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(293) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))
MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(294) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U63(X1, X2, X3)) → ACTIVE(U63(mark(X1), X2, X3))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0)
ACTIVE(x0, x1)  =  ACTIVE(x0, x1)

Tags:
MARK has argument tags [0,2] and root tag 0
ACTIVE has argument tags [0,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 1   
POL(U11(x₁, x₂, x₃)) = 1   
POL(U12(x₁, x₂, x₃)) = 1   
POL(U13(x₁, x₂, x₃)) = 1   
POL(U14(x₁, x₂, x₃)) = 1   
POL(U15(x₁, x₂)) = 1   
POL(U16(x₁)) = 0   
POL(U21(x₁, x₂)) = 1   
POL(U22(x₁, x₂)) = 1   
POL(U23(x₁)) = 1   
POL(U31(x₁, x₂)) = 1   
POL(U32(x₁)) = 0   
POL(U41(x₁)) = 0   
POL(U51(x₁, x₂)) = x₁ + x₂   
POL(U52(x₁, x₂)) = x₁ + x₂   
POL(U61(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U62(x₁, x₂, x₃)) = 1   
POL(U63(x₁, x₂, x₃)) = 0   
POL(U64(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(active(x₁)) = 0   
POL(isNat(x₁)) = 1   
POL(isNatKind(x₁)) = 1   
POL(mark(x₁)) = 0   
POL(plus(x₁, x₂)) = 0   
POL(s(x₁)) = 0   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(295) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(296) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(isNat(s(V1))) → MARK(U21(isNatKind(V1), V1))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0, x1)
ACTIVE(x0, x1)  =  ACTIVE(x0, x1)

Tags:
MARK has argument tags [0,2] and root tag 0
ACTIVE has argument tags [0,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 1   
POL(ACTIVE(x₁)) = 1   
POL(MARK(x₁)) = 1   
POL(U11(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U12(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U13(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U14(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U15(x₁, x₂)) = x₁ + x₂   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = x₁ + x₂   
POL(U22(x₁, x₂)) = x₁ + x₂   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = x₂   
POL(U52(x₁, x₂)) = x₂   
POL(U61(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U62(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U63(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U64(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = x₁   
POL(isNatKind(x₁)) = 0   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = x₁ + x₂   
POL(s(x₁)) = 1 + x₁   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(297) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(298) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U62(tt, M, N)) → MARK(U63(isNat(N), M, N))
MARK(U62(X1, X2, X3)) → ACTIVE(U62(mark(X1), X2, X3))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x1)
ACTIVE(x0, x1)  =  ACTIVE(x0, x1)

Tags:
MARK has argument tags [3,2] and root tag 1
ACTIVE has argument tags [2,1] and root tag 1

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 0   
POL(U11(x₁, x₂, x₃)) = x₁   
POL(U12(x₁, x₂, x₃)) = x₁   
POL(U13(x₁, x₂, x₃)) = x₁   
POL(U14(x₁, x₂, x₃)) = x₁   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = x₁   
POL(U22(x₁, x₂)) = x₁   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = x₂   
POL(U52(x₁, x₂)) = x₂   
POL(U61(x₁, x₂, x₃)) = 1 + x₃   
POL(U62(x₁, x₂, x₃)) = 1 + x₁   
POL(U63(x₁, x₂, x₃)) = 0   
POL(U64(x₁, x₂, x₃)) = 0   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = 0   
POL(isNatKind(x₁)) = 0   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = 1 + x₁   
POL(s(x₁)) = 0   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(299) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(300) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U15(X1, X2)) → ACTIVE(U15(mark(X1), X2))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0)
ACTIVE(x0, x1)  =  ACTIVE(x0, x1)

Tags:
MARK has argument tags [0,0] and root tag 1
ACTIVE has argument tags [3,0] and root tag 1

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 1   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 1   
POL(U11(x₁, x₂, x₃)) = 1   
POL(U12(x₁, x₂, x₃)) = 1   
POL(U13(x₁, x₂, x₃)) = 1   
POL(U14(x₁, x₂, x₃)) = 1   
POL(U15(x₁, x₂)) = 0   
POL(U16(x₁)) = 0   
POL(U21(x₁, x₂)) = 1   
POL(U22(x₁, x₂)) = 1   
POL(U23(x₁)) = 1   
POL(U31(x₁, x₂)) = 1   
POL(U32(x₁)) = 1 + x₁   
POL(U41(x₁)) = 1 + x₁   
POL(U51(x₁, x₂)) = 1 + x₂   
POL(U52(x₁, x₂)) = 1   
POL(U61(x₁, x₂, x₃)) = 1 + x₁ + x₂   
POL(U62(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U63(x₁, x₂, x₃)) = 1 + x₃   
POL(U64(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(active(x₁)) = 1 + x₁   
POL(isNat(x₁)) = 1   
POL(isNatKind(x₁)) = 1   
POL(mark(x₁)) = 0   
POL(plus(x₁, x₂)) = x₁ + x₂   
POL(s(x₁)) = 1 + x₁   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(301) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(302) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(isNat(plus(V1, V2))) → MARK(U11(isNatKind(V1), V1, V2))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0, x1)
ACTIVE(x0, x1)  =  ACTIVE(x0)

Tags:
MARK has argument tags [0,0] and root tag 0
ACTIVE has argument tags [0,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = x₁   
POL(MARK(x₁)) = 0   
POL(U11(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U12(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U13(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U14(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U15(x₁, x₂)) = x₁ + x₂   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = x₁ + x₂   
POL(U22(x₁, x₂)) = x₁ + x₂   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = x₂   
POL(U52(x₁, x₂)) = x₂   
POL(U61(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U62(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U63(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U64(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = x₁   
POL(isNatKind(x₁)) = 0   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = 1 + x₁ + x₂   
POL(s(x₁)) = x₁   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented:

mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
mark(isNatKind(X)) → active(isNatKind(X))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
mark(isNat(X)) → active(isNat(X))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
mark(U16(X)) → active(U16(mark(X)))
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
active(U52(tt, N)) → mark(N)
mark(U23(X)) → active(U23(mark(X)))
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
mark(U32(X)) → active(U32(mark(X)))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
mark(U41(X)) → active(U41(mark(X)))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
active(plus(N, 0)) → mark(U51(isNat(N), N))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(tt) → active(tt)
mark(0) → active(0)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
isNatKind(active(X)) → isNatKind(X)
isNatKind(mark(X)) → isNatKind(X)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U15(X1, mark(X2)) → U15(X1, X2)
U15(mark(X1), X2) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(active(X)) → U23(X)
U23(mark(X)) → U23(X)
U32(active(X)) → U32(X)
U32(mark(X)) → U32(X)
U21(X1, mark(X2)) → U21(X1, X2)
U21(mark(X1), X2) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(mark(X1), X2) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(active(X)) → U41(X)
U41(mark(X)) → U41(X)
active(U16(tt)) → mark(tt)
active(U23(tt)) → mark(tt)
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(isNat(0)) → mark(tt)
active(isNatKind(0)) → mark(tt)
U16(active(X)) → U16(X)
U16(mark(X)) → U16(X)
U52(X1, mark(X2)) → U52(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
plus(X1, mark(X2)) → plus(X1, X2)
plus(mark(X1), X2) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)
s(active(X)) → s(X)
s(mark(X)) → s(X)
U51(X1, mark(X2)) → U51(X1, X2)
U51(mark(X1), X2) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)

(303) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(304) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U11(X1, X2, X3)) → MARK(X1)
ACTIVE(U12(tt, V1, V2)) → MARK(U13(isNatKind(V2), V1, V2))
MARK(U12(X1, X2, X3)) → MARK(X1)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0, x1)
ACTIVE(x0, x1)  =  ACTIVE(x1)

Tags:
MARK has argument tags [1,1] and root tag 1
ACTIVE has argument tags [0,1] and root tag 1

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 1   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 0   
POL(U11(x₁, x₂, x₃)) = 1 + x₁ + x₂ + x₃   
POL(U12(x₁, x₂, x₃)) = 1 + x₁ + x₂ + x₃   
POL(U13(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U14(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U15(x₁, x₂)) = x₁ + x₂   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = x₁ + x₂   
POL(U22(x₁, x₂)) = x₁ + x₂   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = x₂   
POL(U52(x₁, x₂)) = x₁ + x₂   
POL(U61(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U62(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U63(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U64(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = x₁   
POL(isNatKind(x₁)) = 0   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = 1 + x₁ + x₂   
POL(s(x₁)) = x₁   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(305) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U16(X)) → MARK(X)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(306) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U16(X)) → MARK(X)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0, x1)
ACTIVE(x0, x1)  =  ACTIVE(x0)

Tags:
MARK has argument tags [0,2] and root tag 0
ACTIVE has argument tags [0,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 1   
POL(MARK(x₁)) = 1   
POL(U11(x₁, x₂, x₃)) = 0   
POL(U12(x₁, x₂, x₃)) = x₁   
POL(U13(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U14(x₁, x₂, x₃)) = x₁   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = 1 + x₁   
POL(U21(x₁, x₂)) = x₁ + x₂   
POL(U22(x₁, x₂)) = x₁   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = x₂   
POL(U52(x₁, x₂)) = x₂   
POL(U61(x₁, x₂, x₃)) = x₂ + x₃   
POL(U62(x₁, x₂, x₃)) = x₂ + x₃   
POL(U63(x₁, x₂, x₃)) = x₂ + x₃   
POL(U64(x₁, x₂, x₃)) = x₂ + x₃   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = 0   
POL(isNatKind(x₁)) = 0   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = 0   
POL(s(x₁)) = 0   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(307) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U13(X1, X2, X3)) → MARK(X1)
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(308) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U13(tt, V1, V2)) → MARK(U14(isNatKind(V2), V1, V2))
MARK(U13(X1, X2, X3)) → MARK(X1)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x1)
ACTIVE(x0, x1)  =  ACTIVE(x0, x1)

Tags:
MARK has argument tags [0,2] and root tag 0
ACTIVE has argument tags [2,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = x₁   
POL(MARK(x₁)) = 0   
POL(U11(x₁, x₂, x₃)) = 1 + x₁ + x₂   
POL(U12(x₁, x₂, x₃)) = 1 + x₁ + x₂   
POL(U13(x₁, x₂, x₃)) = 1 + x₁ + x₂   
POL(U14(x₁, x₂, x₃)) = x₁ + x₂   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = 0   
POL(U21(x₁, x₂)) = x₁ + x₂   
POL(U22(x₁, x₂)) = x₁ + x₂   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = x₂   
POL(U52(x₁, x₂)) = x₁ + x₂   
POL(U61(x₁, x₂, x₃)) = 1 + x₃   
POL(U62(x₁, x₂, x₃)) = 1 + x₁ + x₃   
POL(U63(x₁, x₂, x₃)) = 1 + x₃   
POL(U64(x₁, x₂, x₃)) = 1 + x₃   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = x₁   
POL(isNatKind(x₁)) = 0   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = 1 + x₁   
POL(s(x₁)) = x₁   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented:

mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
mark(isNatKind(X)) → active(isNatKind(X))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
mark(isNat(X)) → active(isNat(X))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
mark(U16(X)) → active(U16(mark(X)))
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
active(U52(tt, N)) → mark(N)
mark(U23(X)) → active(U23(mark(X)))
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
mark(U32(X)) → active(U32(mark(X)))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
mark(U41(X)) → active(U41(mark(X)))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
active(plus(N, 0)) → mark(U51(isNat(N), N))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(tt) → active(tt)
mark(0) → active(0)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
isNatKind(active(X)) → isNatKind(X)
isNatKind(mark(X)) → isNatKind(X)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U15(X1, mark(X2)) → U15(X1, X2)
U15(mark(X1), X2) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(active(X)) → U23(X)
U23(mark(X)) → U23(X)
U32(active(X)) → U32(X)
U32(mark(X)) → U32(X)
U21(X1, mark(X2)) → U21(X1, X2)
U21(mark(X1), X2) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(mark(X1), X2) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(active(X)) → U41(X)
U41(mark(X)) → U41(X)
active(U16(tt)) → mark(tt)
active(U23(tt)) → mark(tt)
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(isNat(0)) → mark(tt)
active(isNatKind(0)) → mark(tt)
U16(active(X)) → U16(X)
U16(mark(X)) → U16(X)
U52(X1, mark(X2)) → U52(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
plus(X1, mark(X2)) → plus(X1, X2)
plus(mark(X1), X2) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)
s(active(X)) → s(X)
s(mark(X)) → s(X)
U51(X1, mark(X2)) → U51(X1, X2)
U51(mark(X1), X2) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)

(309) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(310) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0)
ACTIVE(x0, x1)  =  ACTIVE(x0, x1)

Tags:
MARK has argument tags [0,0] and root tag 0
ACTIVE has argument tags [2,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 1   
POL(U11(x₁, x₂, x₃)) = 1   
POL(U12(x₁, x₂, x₃)) = 0   
POL(U13(x₁, x₂, x₃)) = 1   
POL(U14(x₁, x₂, x₃)) = 1   
POL(U15(x₁, x₂)) = x₂   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = 1   
POL(U22(x₁, x₂)) = 1   
POL(U23(x₁)) = 0   
POL(U31(x₁, x₂)) = 1   
POL(U32(x₁)) = 1   
POL(U41(x₁)) = 1 + x₁   
POL(U51(x₁, x₂)) = x₂   
POL(U52(x₁, x₂)) = x₁ + x₂   
POL(U61(x₁, x₂, x₃)) = x₃   
POL(U62(x₁, x₂, x₃)) = x₁ + x₂   
POL(U63(x₁, x₂, x₃)) = x₂   
POL(U64(x₁, x₂, x₃)) = 0   
POL(active(x₁)) = 0   
POL(isNat(x₁)) = 1   
POL(isNatKind(x₁)) = 1   
POL(mark(x₁)) = 0   
POL(plus(x₁, x₂)) = x₂   
POL(s(x₁)) = 0   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(311) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U22(X1, X2)) → MARK(X1)
MARK(U23(X)) → MARK(X)
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(312) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U21(X1, X2)) → MARK(X1)
MARK(U22(X1, X2)) → MARK(X1)
MARK(U23(X)) → MARK(X)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0, x1)
ACTIVE(x0, x1)  =  ACTIVE(x0, x1)

Tags:
MARK has argument tags [2,0] and root tag 0
ACTIVE has argument tags [2,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = x₁   
POL(U11(x₁, x₂, x₃)) = x₁ + x₂   
POL(U12(x₁, x₂, x₃)) = 1 + x₂   
POL(U13(x₁, x₂, x₃)) = x₁ + x₂   
POL(U14(x₁, x₂, x₃)) = x₁ + x₂   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = 1   
POL(U21(x₁, x₂)) = 1 + x₁ + x₂   
POL(U22(x₁, x₂)) = 1 + x₁ + x₂   
POL(U23(x₁)) = 1 + x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = x₂   
POL(U52(x₁, x₂)) = x₂   
POL(U61(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U62(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U63(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U64(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = 1 + x₁   
POL(isNatKind(x₁)) = 1   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = x₁ + x₂   
POL(s(x₁)) = 1 + x₁   
POL(tt) = 1   

The following usable rules [FROCOS05] were oriented:

isNatKind(active(X)) → isNatKind(X)
isNatKind(mark(X)) → isNatKind(X)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U15(X1, mark(X2)) → U15(X1, X2)
U15(mark(X1), X2) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(active(X)) → U23(X)
U23(mark(X)) → U23(X)
U32(active(X)) → U32(X)
U32(mark(X)) → U32(X)
U31(X1, mark(X2)) → U31(X1, X2)
U31(mark(X1), X2) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(active(X)) → U41(X)
U41(mark(X)) → U41(X)

(313) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(314) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x1)
ACTIVE(x0, x1)  =  ACTIVE(x0)

Tags:
MARK has argument tags [1,2] and root tag 0
ACTIVE has argument tags [2,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 1 + x₁   
POL(U11(x₁, x₂, x₃)) = 1 + x₂   
POL(U12(x₁, x₂, x₃)) = 0   
POL(U13(x₁, x₂, x₃)) = 0   
POL(U14(x₁, x₂, x₃)) = x₁   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = 0   
POL(U21(x₁, x₂)) = 0   
POL(U22(x₁, x₂)) = 0   
POL(U23(x₁)) = 0   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = 0   
POL(U52(x₁, x₂)) = 0   
POL(U61(x₁, x₂, x₃)) = 0   
POL(U62(x₁, x₂, x₃)) = 0   
POL(U63(x₁, x₂, x₃)) = 0   
POL(U64(x₁, x₂, x₃)) = 0   
POL(active(x₁)) = 1 + x₁   
POL(isNat(x₁)) = 0   
POL(isNatKind(x₁)) = 0   
POL(mark(x₁)) = 1 + x₁   
POL(plus(x₁, x₂)) = x₁   
POL(s(x₁)) = 0   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented:

isNatKind(active(X)) → isNatKind(X)
isNatKind(mark(X)) → isNatKind(X)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U15(X1, mark(X2)) → U15(X1, X2)
U15(mark(X1), X2) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(active(X)) → U23(X)
U23(mark(X)) → U23(X)
U32(active(X)) → U32(X)
U32(mark(X)) → U32(X)
U31(X1, mark(X2)) → U31(X1, X2)
U31(mark(X1), X2) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(active(X)) → U41(X)
U41(mark(X)) → U41(X)

(315) Obligation:

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

ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(316) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U13(X1, X2, X3)) → ACTIVE(U13(mark(X1), X2, X3))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
ACTIVE(x0, x1)  =  ACTIVE(x0)
MARK(x0, x1)  =  MARK(x0, x1)

Tags:
ACTIVE has argument tags [2,0] and root tag 1
MARK has argument tags [1,2] and root tag 1

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 0   
POL(U11(x₁, x₂, x₃)) = 0   
POL(U12(x₁, x₂, x₃)) = 0   
POL(U13(x₁, x₂, x₃)) = 1   
POL(U14(x₁, x₂, x₃)) = x₁ + x₂   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = 0   
POL(U21(x₁, x₂)) = x₁   
POL(U22(x₁, x₂)) = x₁   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = 0   
POL(U52(x₁, x₂)) = 0   
POL(U61(x₁, x₂, x₃)) = 0   
POL(U62(x₁, x₂, x₃)) = x₃   
POL(U63(x₁, x₂, x₃)) = x₂   
POL(U64(x₁, x₂, x₃)) = 1 + x₃   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = 0   
POL(isNatKind(x₁)) = 0   
POL(mark(x₁)) = 1 + x₁   
POL(plus(x₁, x₂)) = x₂   
POL(s(x₁)) = x₁   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(317) Obligation:

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

ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(318) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U31(tt, V2)) → MARK(U32(isNatKind(V2)))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
ACTIVE(x0, x1)  =  ACTIVE(x1)
MARK(x0, x1)  =  MARK(x1)

Tags:
ACTIVE has argument tags [2,0] and root tag 0
MARK has argument tags [0,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 1   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 0   
POL(U11(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U12(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U13(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U14(x₁, x₂, x₃)) = x₁ + x₂   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = 1   
POL(U21(x₁, x₂)) = x₂   
POL(U22(x₁, x₂)) = x₁   
POL(U23(x₁)) = 1   
POL(U31(x₁, x₂)) = x₁ + x₂   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = x₂   
POL(U52(x₁, x₂)) = x₂   
POL(U61(x₁, x₂, x₃)) = x₂ + x₃   
POL(U62(x₁, x₂, x₃)) = x₂ + x₃   
POL(U63(x₁, x₂, x₃)) = x₂ + x₃   
POL(U64(x₁, x₂, x₃)) = x₂ + x₃   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = 1 + x₁   
POL(isNatKind(x₁)) = x₁   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = x₁ + x₂   
POL(s(x₁)) = x₁   
POL(tt) = 1   

The following usable rules [FROCOS05] were oriented: none

(319) Obligation:

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

ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))
MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(320) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U11(tt, V1, V2)) → MARK(U12(isNatKind(V1), V1, V2))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
ACTIVE(x0, x1)  =  ACTIVE(x1)
MARK(x0, x1)  =  MARK(x0)

Tags:
ACTIVE has argument tags [3,0] and root tag 1
MARK has argument tags [0,0] and root tag 1

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 0   
POL(U11(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U12(x₁, x₂, x₃)) = 1   
POL(U13(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U14(x₁, x₂, x₃)) = 0   
POL(U15(x₁, x₂)) = x₂   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = 0   
POL(U22(x₁, x₂)) = 0   
POL(U23(x₁)) = 1 + x₁   
POL(U31(x₁, x₂)) = 0   
POL(U32(x₁)) = 1 + x₁   
POL(U41(x₁)) = 0   
POL(U51(x₁, x₂)) = 0   
POL(U52(x₁, x₂)) = x₁ + x₂   
POL(U61(x₁, x₂, x₃)) = x₁ + x₂   
POL(U62(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U63(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U64(x₁, x₂, x₃)) = 0   
POL(active(x₁)) = 0   
POL(isNat(x₁)) = 0   
POL(isNatKind(x₁)) = 0   
POL(mark(x₁)) = 1   
POL(plus(x₁, x₂)) = 0   
POL(s(x₁)) = 0   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(321) Obligation:

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

MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))
ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(322) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(isNatKind(s(V1))) → MARK(U41(isNatKind(V1)))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x1)
ACTIVE(x0, x1)  =  ACTIVE(x0)

Tags:
MARK has argument tags [2,2] and root tag 1
ACTIVE has argument tags [2,1] and root tag 1

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = x₁   
POL(MARK(x₁)) = x₁   
POL(U11(x₁, x₂, x₃)) = x₂ + x₃   
POL(U12(x₁, x₂, x₃)) = x₂ + x₃   
POL(U13(x₁, x₂, x₃)) = x₂ + x₃   
POL(U14(x₁, x₂, x₃)) = x₁ + x₂   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = 0   
POL(U21(x₁, x₂)) = 0   
POL(U22(x₁, x₂)) = 0   
POL(U23(x₁)) = 0   
POL(U31(x₁, x₂)) = x₁ + x₂   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = x₂   
POL(U52(x₁, x₂)) = x₂   
POL(U61(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U62(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U63(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(U64(x₁, x₂, x₃)) = 1 + x₂ + x₃   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = x₁   
POL(isNatKind(x₁)) = x₁   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = x₁ + x₂   
POL(s(x₁)) = 1 + x₁   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented:

isNatKind(active(X)) → isNatKind(X)
isNatKind(mark(X)) → isNatKind(X)
isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U15(X1, mark(X2)) → U15(X1, X2)
U15(mark(X1), X2) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
mark(isNatKind(X)) → active(isNatKind(X))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
mark(isNat(X)) → active(isNat(X))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
mark(U16(X)) → active(U16(mark(X)))
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
active(U52(tt, N)) → mark(N)
mark(U23(X)) → active(U23(mark(X)))
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
mark(U32(X)) → active(U32(mark(X)))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
mark(U41(X)) → active(U41(mark(X)))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
active(plus(N, 0)) → mark(U51(isNat(N), N))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(tt) → active(tt)
mark(0) → active(0)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U22(X1, mark(X2)) → U22(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(active(X)) → U23(X)
U23(mark(X)) → U23(X)
U21(X1, mark(X2)) → U21(X1, X2)
U21(mark(X1), X2) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(mark(X1), X2) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U41(active(X)) → U41(X)
U41(mark(X)) → U41(X)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
active(U16(tt)) → mark(tt)
active(U23(tt)) → mark(tt)
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(isNat(0)) → mark(tt)
active(isNatKind(0)) → mark(tt)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U16(active(X)) → U16(X)
U16(mark(X)) → U16(X)
U32(active(X)) → U32(X)
U32(mark(X)) → U32(X)
U52(X1, mark(X2)) → U52(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
plus(X1, mark(X2)) → plus(X1, X2)
plus(mark(X1), X2) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)
s(active(X)) → s(X)
s(mark(X)) → s(X)
U51(X1, mark(X2)) → U51(X1, X2)
U51(mark(X1), X2) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)

(323) Obligation:

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

MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(324) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U31(X1, X2)) → ACTIVE(U31(mark(X1), X2))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0)
ACTIVE(x0, x1)  =  ACTIVE(x0)

Tags:
MARK has argument tags [0,2] and root tag 1
ACTIVE has argument tags [0,0] and root tag 1

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = x₁   
POL(MARK(x₁)) = 1   
POL(U11(x₁, x₂, x₃)) = x₁   
POL(U12(x₁, x₂, x₃)) = x₃   
POL(U13(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U14(x₁, x₂, x₃)) = 1   
POL(U15(x₁, x₂)) = x₂   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = 1   
POL(U22(x₁, x₂)) = 1   
POL(U23(x₁)) = 1 + x₁   
POL(U31(x₁, x₂)) = 0   
POL(U32(x₁)) = 0   
POL(U41(x₁)) = 0   
POL(U51(x₁, x₂)) = 0   
POL(U52(x₁, x₂)) = x₂   
POL(U61(x₁, x₂, x₃)) = x₃   
POL(U62(x₁, x₂, x₃)) = x₃   
POL(U63(x₁, x₂, x₃)) = 0   
POL(U64(x₁, x₂, x₃)) = 0   
POL(active(x₁)) = 0   
POL(isNat(x₁)) = 1   
POL(isNatKind(x₁)) = 1   
POL(mark(x₁)) = 0   
POL(plus(x₁, x₂)) = 0   
POL(s(x₁)) = 0   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented:

isNatKind(active(X)) → isNatKind(X)
isNatKind(mark(X)) → isNatKind(X)
isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U22(X1, mark(X2)) → U22(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(mark(X1), X2) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(mark(X1), X2) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)

(325) Obligation:

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

MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(326) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U22(tt, V1)) → MARK(U23(isNat(V1)))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x1)
ACTIVE(x0, x1)  =  ACTIVE(x1)

Tags:
MARK has argument tags [3,2] and root tag 1
ACTIVE has argument tags [0,2] and root tag 1

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 0   
POL(U11(x₁, x₂, x₃)) = x₂ + x₃   
POL(U12(x₁, x₂, x₃)) = x₂ + x₃   
POL(U13(x₁, x₂, x₃)) = x₂ + x₃   
POL(U14(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U15(x₁, x₂)) = x₁ + x₂   
POL(U16(x₁)) = 0   
POL(U21(x₁, x₂)) = 1   
POL(U22(x₁, x₂)) = 1   
POL(U23(x₁)) = 0   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = x₂   
POL(U52(x₁, x₂)) = x₂   
POL(U61(x₁, x₂, x₃)) = 1 + x₃   
POL(U62(x₁, x₂, x₃)) = 1 + x₃   
POL(U63(x₁, x₂, x₃)) = 1 + x₃   
POL(U64(x₁, x₂, x₃)) = 1 + x₃   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = x₁   
POL(isNatKind(x₁)) = 0   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = x₁ + x₂   
POL(s(x₁)) = 1   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(327) Obligation:

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

MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(328) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U14(tt, V1, V2)) → MARK(U15(isNat(V1), V2))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0)
ACTIVE(x0, x1)  =  ACTIVE(x1)

Tags:
MARK has argument tags [0,0] and root tag 1
ACTIVE has argument tags [3,0] and root tag 1

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 1   
POL(ACTIVE(x₁)) = 1 + x₁   
POL(MARK(x₁)) = x₁   
POL(U11(x₁, x₂, x₃)) = x₂ + x₃   
POL(U12(x₁, x₂, x₃)) = x₂ + x₃   
POL(U13(x₁, x₂, x₃)) = x₂ + x₃   
POL(U14(x₁, x₂, x₃)) = x₁ + x₂   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = 1   
POL(U21(x₁, x₂)) = x₁   
POL(U22(x₁, x₂)) = 1   
POL(U23(x₁)) = 1   
POL(U31(x₁, x₂)) = x₁ + x₂   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = 1 + x₂   
POL(U52(x₁, x₂)) = 1 + x₂   
POL(U61(x₁, x₂, x₃)) = x₂ + x₃   
POL(U62(x₁, x₂, x₃)) = x₂ + x₃   
POL(U63(x₁, x₂, x₃)) = x₂ + x₃   
POL(U64(x₁, x₂, x₃)) = x₂ + x₃   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = x₁   
POL(isNatKind(x₁)) = x₁   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = x₁ + x₂   
POL(s(x₁)) = x₁   
POL(tt) = 1   

The following usable rules [FROCOS05] were oriented:

isNatKind(active(X)) → isNatKind(X)
isNatKind(mark(X)) → isNatKind(X)
isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U15(X1, mark(X2)) → U15(X1, X2)
U15(mark(X1), X2) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
mark(isNatKind(X)) → active(isNatKind(X))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
mark(isNat(X)) → active(isNat(X))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
mark(U16(X)) → active(U16(mark(X)))
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
active(U52(tt, N)) → mark(N)
mark(U23(X)) → active(U23(mark(X)))
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
mark(U32(X)) → active(U32(mark(X)))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
mark(U41(X)) → active(U41(mark(X)))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
active(plus(N, 0)) → mark(U51(isNat(N), N))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(tt) → active(tt)
mark(0) → active(0)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U22(X1, mark(X2)) → U22(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(mark(X1), X2) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(mark(X1), X2) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
active(U16(tt)) → mark(tt)
active(U23(tt)) → mark(tt)
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(isNat(0)) → mark(tt)
active(isNatKind(0)) → mark(tt)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U16(active(X)) → U16(X)
U16(mark(X)) → U16(X)
U23(active(X)) → U23(X)
U23(mark(X)) → U23(X)
U32(active(X)) → U32(X)
U32(mark(X)) → U32(X)
U52(X1, mark(X2)) → U52(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
U41(active(X)) → U41(X)
U41(mark(X)) → U41(X)
plus(X1, mark(X2)) → plus(X1, X2)
plus(mark(X1), X2) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)
s(active(X)) → s(X)
s(mark(X)) → s(X)
U51(X1, mark(X2)) → U51(X1, X2)
U51(mark(X1), X2) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)

(329) Obligation:

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

MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(isNat(X)) → ACTIVE(isNat(X))
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(330) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(isNat(X)) → ACTIVE(isNat(X))
MARK(U22(X1, X2)) → ACTIVE(U22(mark(X1), X2))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0)
ACTIVE(x0, x1)  =  ACTIVE(x0)

Tags:
MARK has argument tags [0,2] and root tag 0
ACTIVE has argument tags [0,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = x₁   
POL(MARK(x₁)) = 1   
POL(U11(x₁, x₂, x₃)) = 0   
POL(U12(x₁, x₂, x₃)) = 0   
POL(U13(x₁, x₂, x₃)) = 0   
POL(U14(x₁, x₂, x₃)) = 1   
POL(U15(x₁, x₂)) = 0   
POL(U16(x₁)) = 0   
POL(U21(x₁, x₂)) = 1   
POL(U22(x₁, x₂)) = 0   
POL(U23(x₁)) = 0   
POL(U31(x₁, x₂)) = x₂   
POL(U32(x₁)) = 0   
POL(U41(x₁)) = 0   
POL(U51(x₁, x₂)) = 0   
POL(U52(x₁, x₂)) = 0   
POL(U61(x₁, x₂, x₃)) = x₁   
POL(U62(x₁, x₂, x₃)) = 0   
POL(U63(x₁, x₂, x₃)) = x₁   
POL(U64(x₁, x₂, x₃)) = x₁ + x₂   
POL(active(x₁)) = 0   
POL(isNat(x₁)) = 0   
POL(isNatKind(x₁)) = 1   
POL(mark(x₁)) = 0   
POL(plus(x₁, x₂)) = 0   
POL(s(x₁)) = 0   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented:

isNatKind(active(X)) → isNatKind(X)
isNatKind(mark(X)) → isNatKind(X)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U22(X1, mark(X2)) → U22(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
isNat(active(X)) → isNat(X)
isNat(mark(X)) → isNat(X)
U21(X1, mark(X2)) → U21(X1, X2)
U21(mark(X1), X2) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)

(331) Obligation:

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

MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))
MARK(U15(X1, X2)) → MARK(X1)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(332) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U21(tt, V1)) → MARK(U22(isNatKind(V1), V1))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0, x1)
ACTIVE(x0, x1)  =  ACTIVE(x1)

Tags:
MARK has argument tags [0,0] and root tag 0
ACTIVE has argument tags [0,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 0   
POL(U11(x₁, x₂, x₃)) = x₂   
POL(U12(x₁, x₂, x₃)) = x₁ + x₂   
POL(U13(x₁, x₂, x₃)) = x₂   
POL(U14(x₁, x₂, x₃)) = x₁ + x₂   
POL(U15(x₁, x₂)) = x₁   
POL(U16(x₁)) = 0   
POL(U21(x₁, x₂)) = 1   
POL(U22(x₁, x₂)) = 0   
POL(U23(x₁)) = 0   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(U51(x₁, x₂)) = 1 + x₂   
POL(U52(x₁, x₂)) = x₂   
POL(U61(x₁, x₂, x₃)) = 1   
POL(U62(x₁, x₂, x₃)) = 1 + x₁   
POL(U63(x₁, x₂, x₃)) = 1   
POL(U64(x₁, x₂, x₃)) = 1   
POL(active(x₁)) = x₁   
POL(isNat(x₁)) = x₁   
POL(isNatKind(x₁)) = 0   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = 1 + x₁   
POL(s(x₁)) = 1   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(333) Obligation:

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

MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → MARK(X1)
MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(334) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U21(X1, X2)) → ACTIVE(U21(mark(X1), X2))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0)
ACTIVE(x0, x1)  =  ACTIVE(x0, x1)

Tags:
MARK has argument tags [3,2] and root tag 0
ACTIVE has argument tags [0,3] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = x₁   
POL(MARK(x₁)) = 1   
POL(U11(x₁, x₂, x₃)) = x₁ + x₃   
POL(U12(x₁, x₂, x₃)) = 1 + x₁ + x₃   
POL(U13(x₁, x₂, x₃)) = 1 + x₁ + x₂   
POL(U14(x₁, x₂, x₃)) = 1   
POL(U15(x₁, x₂)) = 1   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = 0   
POL(U22(x₁, x₂)) = 0   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₂   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = 0   
POL(U51(x₁, x₂)) = 0   
POL(U52(x₁, x₂)) = 0   
POL(U61(x₁, x₂, x₃)) = x₁ + x₂   
POL(U62(x₁, x₂, x₃)) = 0   
POL(U63(x₁, x₂, x₃)) = 0   
POL(U64(x₁, x₂, x₃)) = 0   
POL(active(x₁)) = 0   
POL(isNat(x₁)) = x₁   
POL(isNatKind(x₁)) = 1   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = 0   
POL(s(x₁)) = 0   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented:

isNatKind(active(X)) → isNatKind(X)
isNatKind(mark(X)) → isNatKind(X)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U21(X1, mark(X2)) → U21(X1, X2)
U21(mark(X1), X2) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)

(335) Obligation:

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

MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → MARK(X1)
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(336) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U14(X1, X2, X3)) → ACTIVE(U14(mark(X1), X2, X3))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x0)
ACTIVE(x0, x1)  =  ACTIVE(x1)

Tags:
MARK has argument tags [0,0] and root tag 0
ACTIVE has argument tags [3,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 1   
POL(U11(x₁, x₂, x₃)) = x₂ + x₃   
POL(U12(x₁, x₂, x₃)) = x₂   
POL(U13(x₁, x₂, x₃)) = x₂   
POL(U14(x₁, x₂, x₃)) = 0   
POL(U15(x₁, x₂)) = x₂   
POL(U16(x₁)) = x₁   
POL(U21(x₁, x₂)) = x₁ + x₂   
POL(U22(x₁, x₂)) = x₁ + x₂   
POL(U23(x₁)) = x₁   
POL(U31(x₁, x₂)) = x₂   
POL(U32(x₁)) = 0   
POL(U41(x₁)) = 0   
POL(U51(x₁, x₂)) = x₂   
POL(U52(x₁, x₂)) = x₂   
POL(U61(x₁, x₂, x₃)) = x₁ + x₂ + x₃   
POL(U62(x₁, x₂, x₃)) = x₂   
POL(U63(x₁, x₂, x₃)) = x₂   
POL(U64(x₁, x₂, x₃)) = x₂ + x₃   
POL(active(x₁)) = 0   
POL(isNat(x₁)) = 0   
POL(isNatKind(x₁)) = 1   
POL(mark(x₁)) = 0   
POL(plus(x₁, x₂)) = 0   
POL(s(x₁)) = 0   
POL(tt) = 0   

The following usable rules [FROCOS05] were oriented: none

(337) Obligation:

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

MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U15(X1, X2)) → MARK(X1)
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(338) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U15(X1, X2)) → MARK(X1)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x1)
ACTIVE(x0, x1)  =  ACTIVE(x0, x1)

Tags:
MARK has argument tags [2,0] and root tag 0
ACTIVE has argument tags [0,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(ACTIVE(x₁)) = 0   
POL(MARK(x₁)) = 0   
POL(U14(x₁, x₂, x₃)) = x₁   
POL(U15(x₁, x₂)) = 1 + x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(active(x₁)) = x₁   
POL(isNatKind(x₁)) = 0   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = 0   

The following usable rules [FROCOS05] were oriented: none

(339) Obligation:

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

MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(340) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(isNatKind(X)) → ACTIVE(isNatKind(X))
ACTIVE(isNatKind(plus(V1, V2))) → MARK(U31(isNatKind(V1), V2))

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x1)
ACTIVE(x0, x1)  =  ACTIVE(x1)

Tags:
MARK has argument tags [2,0] and root tag 1
ACTIVE has argument tags [3,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(ACTIVE(x₁)) = 1   
POL(MARK(x₁)) = 0   
POL(U14(x₁, x₂, x₃)) = x₁   
POL(U31(x₁, x₂)) = x₁ + x₂   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   
POL(active(x₁)) = x₁   
POL(isNatKind(x₁)) = x₁   
POL(mark(x₁)) = x₁   
POL(plus(x₁, x₂)) = 1 + x₁ + x₂   

The following usable rules [FROCOS05] were oriented: none

(341) Obligation:

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

MARK(U14(X1, X2, X3)) → MARK(X1)
MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(342) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U14(X1, X2, X3)) → MARK(X1)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x1)

Tags:
MARK has argument tags [1,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(MARK(x₁)) = 1   
POL(U14(x₁, x₂, x₃)) = 1 + x₁   
POL(U31(x₁, x₂)) = x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   

The following usable rules [FROCOS05] were oriented: none

(343) Obligation:

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

MARK(U31(X1, X2)) → MARK(X1)
MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(344) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U31(X1, X2)) → MARK(X1)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x1)

Tags:
MARK has argument tags [1,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(MARK(x₁)) = 1   
POL(U31(x₁, x₂)) = 1 + x₁   
POL(U32(x₁)) = x₁   
POL(U41(x₁)) = x₁   

The following usable rules [FROCOS05] were oriented: none

(345) Obligation:

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

MARK(U32(X)) → MARK(X)
MARK(U41(X)) → MARK(X)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(346) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U32(X)) → MARK(X)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x1)

Tags:
MARK has argument tags [0,0] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(MARK(x₁)) = 1   
POL(U32(x₁)) = 1 + x₁   
POL(U41(x₁)) = x₁   

The following usable rules [FROCOS05] were oriented: none

(347) Obligation:

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

MARK(U41(X)) → MARK(X)

The TRS R consists of the following rules:

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(348) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U41(X)) → MARK(X)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
MARK(x0, x1)  =  MARK(x1)

Tags:
MARK has argument tags [1,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(MARK(x₁)) = 0   
POL(U41(x₁)) = 1 + x₁   

The following usable rules [FROCOS05] were oriented: none

(349) Obligation:

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

active(U11(tt, V1, V2)) → mark(U12(isNatKind(V1), V1, V2))
active(U12(tt, V1, V2)) → mark(U13(isNatKind(V2), V1, V2))
active(U13(tt, V1, V2)) → mark(U14(isNatKind(V2), V1, V2))
active(U14(tt, V1, V2)) → mark(U15(isNat(V1), V2))
active(U15(tt, V2)) → mark(U16(isNat(V2)))
active(U16(tt)) → mark(tt)
active(U21(tt, V1)) → mark(U22(isNatKind(V1), V1))
active(U22(tt, V1)) → mark(U23(isNat(V1)))
active(U23(tt)) → mark(tt)
active(U31(tt, V2)) → mark(U32(isNatKind(V2)))
active(U32(tt)) → mark(tt)
active(U41(tt)) → mark(tt)
active(U51(tt, N)) → mark(U52(isNatKind(N), N))
active(U52(tt, N)) → mark(N)
active(U61(tt, M, N)) → mark(U62(isNatKind(M), M, N))
active(U62(tt, M, N)) → mark(U63(isNat(N), M, N))
active(U63(tt, M, N)) → mark(U64(isNatKind(N), M, N))
active(U64(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNatKind(V1), V1, V2))
active(isNat(s(V1))) → mark(U21(isNatKind(V1), V1))
active(isNatKind(0)) → mark(tt)
active(isNatKind(plus(V1, V2))) → mark(U31(isNatKind(V1), V2))
active(isNatKind(s(V1))) → mark(U41(isNatKind(V1)))
active(plus(N, 0)) → mark(U51(isNat(N), N))
active(plus(N, s(M))) → mark(U61(isNat(M), M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(isNatKind(X)) → active(isNatKind(X))
mark(U13(X1, X2, X3)) → active(U13(mark(X1), X2, X3))
mark(U14(X1, X2, X3)) → active(U14(mark(X1), X2, X3))
mark(U15(X1, X2)) → active(U15(mark(X1), X2))
mark(isNat(X)) → active(isNat(X))
mark(U16(X)) → active(U16(mark(X)))
mark(U21(X1, X2)) → active(U21(mark(X1), X2))
mark(U22(X1, X2)) → active(U22(mark(X1), X2))
mark(U23(X)) → active(U23(mark(X)))
mark(U31(X1, X2)) → active(U31(mark(X1), X2))
mark(U32(X)) → active(U32(mark(X)))
mark(U41(X)) → active(U41(mark(X)))
mark(U51(X1, X2)) → active(U51(mark(X1), X2))
mark(U52(X1, X2)) → active(U52(mark(X1), X2))
mark(U61(X1, X2, X3)) → active(U61(mark(X1), X2, X3))
mark(U62(X1, X2, X3)) → active(U62(mark(X1), X2, X3))
mark(U63(X1, X2, X3)) → active(U63(mark(X1), X2, X3))
mark(U64(X1, X2, X3)) → active(U64(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
isNatKind(mark(X)) → isNatKind(X)
isNatKind(active(X)) → isNatKind(X)
U13(mark(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, mark(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, mark(X3)) → U13(X1, X2, X3)
U13(active(X1), X2, X3) → U13(X1, X2, X3)
U13(X1, active(X2), X3) → U13(X1, X2, X3)
U13(X1, X2, active(X3)) → U13(X1, X2, X3)
U14(mark(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, mark(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, mark(X3)) → U14(X1, X2, X3)
U14(active(X1), X2, X3) → U14(X1, X2, X3)
U14(X1, active(X2), X3) → U14(X1, X2, X3)
U14(X1, X2, active(X3)) → U14(X1, X2, X3)
U15(mark(X1), X2) → U15(X1, X2)
U15(X1, mark(X2)) → U15(X1, X2)
U15(active(X1), X2) → U15(X1, X2)
U15(X1, active(X2)) → U15(X1, X2)
isNat(mark(X)) → isNat(X)
isNat(active(X)) → isNat(X)
U16(mark(X)) → U16(X)
U16(active(X)) → U16(X)
U21(mark(X1), X2) → U21(X1, X2)
U21(X1, mark(X2)) → U21(X1, X2)
U21(active(X1), X2) → U21(X1, X2)
U21(X1, active(X2)) → U21(X1, X2)
U22(mark(X1), X2) → U22(X1, X2)
U22(X1, mark(X2)) → U22(X1, X2)
U22(active(X1), X2) → U22(X1, X2)
U22(X1, active(X2)) → U22(X1, X2)
U23(mark(X)) → U23(X)
U23(active(X)) → U23(X)
U31(mark(X1), X2) → U31(X1, X2)
U31(X1, mark(X2)) → U31(X1, X2)
U31(active(X1), X2) → U31(X1, X2)
U31(X1, active(X2)) → U31(X1, X2)
U32(mark(X)) → U32(X)
U32(active(X)) → U32(X)
U41(mark(X)) → U41(X)
U41(active(X)) → U41(X)
U51(mark(X1), X2) → U51(X1, X2)
U51(X1, mark(X2)) → U51(X1, X2)
U51(active(X1), X2) → U51(X1, X2)
U51(X1, active(X2)) → U51(X1, X2)
U52(mark(X1), X2) → U52(X1, X2)
U52(X1, mark(X2)) → U52(X1, X2)
U52(active(X1), X2) → U52(X1, X2)
U52(X1, active(X2)) → U52(X1, X2)
U61(mark(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, mark(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, mark(X3)) → U61(X1, X2, X3)
U61(active(X1), X2, X3) → U61(X1, X2, X3)
U61(X1, active(X2), X3) → U61(X1, X2, X3)
U61(X1, X2, active(X3)) → U61(X1, X2, X3)
U62(mark(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, mark(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, mark(X3)) → U62(X1, X2, X3)
U62(active(X1), X2, X3) → U62(X1, X2, X3)
U62(X1, active(X2), X3) → U62(X1, X2, X3)
U62(X1, X2, active(X3)) → U62(X1, X2, X3)
U63(mark(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, mark(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, mark(X3)) → U63(X1, X2, X3)
U63(active(X1), X2, X3) → U63(X1, X2, X3)
U63(X1, active(X2), X3) → U63(X1, X2, X3)
U63(X1, X2, active(X3)) → U63(X1, X2, X3)
U64(mark(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, mark(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, mark(X3)) → U64(X1, X2, X3)
U64(active(X1), X2, X3) → U64(X1, X2, X3)
U64(X1, active(X2), X3) → U64(X1, X2, X3)
U64(X1, X2, active(X3)) → U64(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(350) PisEmptyProof (EQUIVALENT transformation)

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

(351) TRUE