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

(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

Q is empty.

(1) DependencyPairsProof (EQUIVALENT transformation)

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

(2) Obligation:

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

ACTIVE(U11(tt, V1, V2)) → U12¹(isNatKind(V1), V1, V2)
ACTIVE(U11(tt, V1, V2)) → ISNATKIND(V1)
ACTIVE(U12(tt, V1, V2)) → U13¹(isNatKind(V2), V1, V2)
ACTIVE(U12(tt, V1, V2)) → ISNATKIND(V2)
ACTIVE(U13(tt, V1, V2)) → U14¹(isNatKind(V2), V1, V2)
ACTIVE(U13(tt, V1, V2)) → ISNATKIND(V2)
ACTIVE(U14(tt, V1, V2)) → U15¹(isNat(V1), V2)
ACTIVE(U14(tt, V1, V2)) → ISNAT(V1)
ACTIVE(U15(tt, V2)) → U16¹(isNat(V2))
ACTIVE(U15(tt, V2)) → ISNAT(V2)
ACTIVE(U21(tt, V1)) → U22¹(isNatKind(V1), V1)
ACTIVE(U21(tt, V1)) → ISNATKIND(V1)
ACTIVE(U22(tt, V1)) → U23¹(isNat(V1))
ACTIVE(U22(tt, V1)) → ISNAT(V1)
ACTIVE(U31(tt, V2)) → U32¹(isNatKind(V2))
ACTIVE(U31(tt, V2)) → ISNATKIND(V2)
ACTIVE(U51(tt, N)) → U52¹(isNatKind(N), N)
ACTIVE(U51(tt, N)) → ISNATKIND(N)
ACTIVE(U61(tt, M, N)) → U62¹(isNatKind(M), M, N)
ACTIVE(U61(tt, M, N)) → ISNATKIND(M)
ACTIVE(U62(tt, M, N)) → U63¹(isNat(N), M, N)
ACTIVE(U62(tt, M, N)) → ISNAT(N)
ACTIVE(U63(tt, M, N)) → U64¹(isNatKind(N), M, N)
ACTIVE(U63(tt, M, N)) → ISNATKIND(N)
ACTIVE(U64(tt, M, N)) → S(plus(N, M))
ACTIVE(U64(tt, M, N)) → PLUS(N, M)
ACTIVE(isNat(plus(V1, V2))) → U11¹(isNatKind(V1), V1, V2)
ACTIVE(isNat(plus(V1, V2))) → ISNATKIND(V1)
ACTIVE(isNat(s(V1))) → U21¹(isNatKind(V1), V1)
ACTIVE(isNat(s(V1))) → ISNATKIND(V1)
ACTIVE(isNatKind(plus(V1, V2))) → U31¹(isNatKind(V1), V2)
ACTIVE(isNatKind(plus(V1, V2))) → ISNATKIND(V1)
ACTIVE(isNatKind(s(V1))) → U41¹(isNatKind(V1))
ACTIVE(isNatKind(s(V1))) → ISNATKIND(V1)
ACTIVE(plus(N, 0)) → U51¹(isNat(N), N)
ACTIVE(plus(N, 0)) → ISNAT(N)
ACTIVE(plus(N, s(M))) → U61¹(isNat(M), M, N)
ACTIVE(plus(N, s(M))) → ISNAT(M)
ACTIVE(U11(X1, X2, X3)) → U11¹(active(X1), X2, X3)
ACTIVE(U11(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U12(X1, X2, X3)) → U12¹(active(X1), X2, X3)
ACTIVE(U12(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U13(X1, X2, X3)) → U13¹(active(X1), X2, X3)
ACTIVE(U13(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U14(X1, X2, X3)) → U14¹(active(X1), X2, X3)
ACTIVE(U14(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U15(X1, X2)) → U15¹(active(X1), X2)
ACTIVE(U15(X1, X2)) → ACTIVE(X1)
ACTIVE(U16(X)) → U16¹(active(X))
ACTIVE(U16(X)) → ACTIVE(X)
ACTIVE(U21(X1, X2)) → U21¹(active(X1), X2)
ACTIVE(U21(X1, X2)) → ACTIVE(X1)
ACTIVE(U22(X1, X2)) → U22¹(active(X1), X2)
ACTIVE(U22(X1, X2)) → ACTIVE(X1)
ACTIVE(U23(X)) → U23¹(active(X))
ACTIVE(U23(X)) → ACTIVE(X)
ACTIVE(U31(X1, X2)) → U31¹(active(X1), X2)
ACTIVE(U31(X1, X2)) → ACTIVE(X1)
ACTIVE(U32(X)) → U32¹(active(X))
ACTIVE(U32(X)) → ACTIVE(X)
ACTIVE(U41(X)) → U41¹(active(X))
ACTIVE(U41(X)) → ACTIVE(X)
ACTIVE(U51(X1, X2)) → U51¹(active(X1), X2)
ACTIVE(U51(X1, X2)) → ACTIVE(X1)
ACTIVE(U52(X1, X2)) → U52¹(active(X1), X2)
ACTIVE(U52(X1, X2)) → ACTIVE(X1)
ACTIVE(U61(X1, X2, X3)) → U61¹(active(X1), X2, X3)
ACTIVE(U61(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U62(X1, X2, X3)) → U62¹(active(X1), X2, X3)
ACTIVE(U62(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U63(X1, X2, X3)) → U63¹(active(X1), X2, X3)
ACTIVE(U63(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U64(X1, X2, X3)) → U64¹(active(X1), X2, X3)
ACTIVE(U64(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(s(X)) → S(active(X))
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(plus(X1, X2)) → PLUS(active(X1), X2)
ACTIVE(plus(X1, X2)) → ACTIVE(X1)
ACTIVE(plus(X1, X2)) → PLUS(X1, active(X2))
ACTIVE(plus(X1, X2)) → ACTIVE(X2)
U11¹(mark(X1), X2, X3) → U11¹(X1, X2, X3)
U12¹(mark(X1), X2, X3) → U12¹(X1, X2, X3)
U13¹(mark(X1), X2, X3) → U13¹(X1, X2, X3)
U14¹(mark(X1), X2, X3) → U14¹(X1, X2, X3)
U15¹(mark(X1), X2) → U15¹(X1, X2)
U16¹(mark(X)) → U16¹(X)
U21¹(mark(X1), X2) → U21¹(X1, X2)
U22¹(mark(X1), X2) → U22¹(X1, X2)
U23¹(mark(X)) → U23¹(X)
U31¹(mark(X1), X2) → U31¹(X1, X2)
U32¹(mark(X)) → U32¹(X)
U41¹(mark(X)) → U41¹(X)
U51¹(mark(X1), X2) → U51¹(X1, X2)
U52¹(mark(X1), X2) → U52¹(X1, X2)
U61¹(mark(X1), X2, X3) → U61¹(X1, X2, X3)
U62¹(mark(X1), X2, X3) → U62¹(X1, X2, X3)
U63¹(mark(X1), X2, X3) → U63¹(X1, X2, X3)
U64¹(mark(X1), X2, X3) → U64¹(X1, X2, X3)
S(mark(X)) → S(X)
PLUS(mark(X1), X2) → PLUS(X1, X2)
PLUS(X1, mark(X2)) → PLUS(X1, X2)
PROPER(U11(X1, X2, X3)) → U11¹(proper(X1), proper(X2), proper(X3))
PROPER(U11(X1, X2, X3)) → PROPER(X1)
PROPER(U11(X1, X2, X3)) → PROPER(X2)
PROPER(U11(X1, X2, X3)) → PROPER(X3)
PROPER(U12(X1, X2, X3)) → U12¹(proper(X1), proper(X2), proper(X3))
PROPER(U12(X1, X2, X3)) → PROPER(X1)
PROPER(U12(X1, X2, X3)) → PROPER(X2)
PROPER(U12(X1, X2, X3)) → PROPER(X3)
PROPER(isNatKind(X)) → ISNATKIND(proper(X))
PROPER(isNatKind(X)) → PROPER(X)
PROPER(U13(X1, X2, X3)) → U13¹(proper(X1), proper(X2), proper(X3))
PROPER(U13(X1, X2, X3)) → PROPER(X1)
PROPER(U13(X1, X2, X3)) → PROPER(X2)
PROPER(U13(X1, X2, X3)) → PROPER(X3)
PROPER(U14(X1, X2, X3)) → U14¹(proper(X1), proper(X2), proper(X3))
PROPER(U14(X1, X2, X3)) → PROPER(X1)
PROPER(U14(X1, X2, X3)) → PROPER(X2)
PROPER(U14(X1, X2, X3)) → PROPER(X3)
PROPER(U15(X1, X2)) → U15¹(proper(X1), proper(X2))
PROPER(U15(X1, X2)) → PROPER(X1)
PROPER(U15(X1, X2)) → PROPER(X2)
PROPER(isNat(X)) → ISNAT(proper(X))
PROPER(isNat(X)) → PROPER(X)
PROPER(U16(X)) → U16¹(proper(X))
PROPER(U16(X)) → PROPER(X)
PROPER(U21(X1, X2)) → U21¹(proper(X1), proper(X2))
PROPER(U21(X1, X2)) → PROPER(X1)
PROPER(U21(X1, X2)) → PROPER(X2)
PROPER(U22(X1, X2)) → U22¹(proper(X1), proper(X2))
PROPER(U22(X1, X2)) → PROPER(X1)
PROPER(U22(X1, X2)) → PROPER(X2)
PROPER(U23(X)) → U23¹(proper(X))
PROPER(U23(X)) → PROPER(X)
PROPER(U31(X1, X2)) → U31¹(proper(X1), proper(X2))
PROPER(U31(X1, X2)) → PROPER(X1)
PROPER(U31(X1, X2)) → PROPER(X2)
PROPER(U32(X)) → U32¹(proper(X))
PROPER(U32(X)) → PROPER(X)
PROPER(U41(X)) → U41¹(proper(X))
PROPER(U41(X)) → PROPER(X)
PROPER(U51(X1, X2)) → U51¹(proper(X1), proper(X2))
PROPER(U51(X1, X2)) → PROPER(X1)
PROPER(U51(X1, X2)) → PROPER(X2)
PROPER(U52(X1, X2)) → U52¹(proper(X1), proper(X2))
PROPER(U52(X1, X2)) → PROPER(X1)
PROPER(U52(X1, X2)) → PROPER(X2)
PROPER(U61(X1, X2, X3)) → U61¹(proper(X1), proper(X2), proper(X3))
PROPER(U61(X1, X2, X3)) → PROPER(X1)
PROPER(U61(X1, X2, X3)) → PROPER(X2)
PROPER(U61(X1, X2, X3)) → PROPER(X3)
PROPER(U62(X1, X2, X3)) → U62¹(proper(X1), proper(X2), proper(X3))
PROPER(U62(X1, X2, X3)) → PROPER(X1)
PROPER(U62(X1, X2, X3)) → PROPER(X2)
PROPER(U62(X1, X2, X3)) → PROPER(X3)
PROPER(U63(X1, X2, X3)) → U63¹(proper(X1), proper(X2), proper(X3))
PROPER(U63(X1, X2, X3)) → PROPER(X1)
PROPER(U63(X1, X2, X3)) → PROPER(X2)
PROPER(U63(X1, X2, X3)) → PROPER(X3)
PROPER(U64(X1, X2, X3)) → U64¹(proper(X1), proper(X2), proper(X3))
PROPER(U64(X1, X2, X3)) → PROPER(X1)
PROPER(U64(X1, X2, X3)) → PROPER(X2)
PROPER(U64(X1, X2, X3)) → PROPER(X3)
PROPER(s(X)) → S(proper(X))
PROPER(s(X)) → PROPER(X)
PROPER(plus(X1, X2)) → PLUS(proper(X1), proper(X2))
PROPER(plus(X1, X2)) → PROPER(X1)
PROPER(plus(X1, X2)) → PROPER(X2)
U11¹(ok(X1), ok(X2), ok(X3)) → U11¹(X1, X2, X3)
U12¹(ok(X1), ok(X2), ok(X3)) → U12¹(X1, X2, X3)
ISNATKIND(ok(X)) → ISNATKIND(X)
U13¹(ok(X1), ok(X2), ok(X3)) → U13¹(X1, X2, X3)
U14¹(ok(X1), ok(X2), ok(X3)) → U14¹(X1, X2, X3)
U15¹(ok(X1), ok(X2)) → U15¹(X1, X2)
ISNAT(ok(X)) → ISNAT(X)
U16¹(ok(X)) → U16¹(X)
U21¹(ok(X1), ok(X2)) → U21¹(X1, X2)
U22¹(ok(X1), ok(X2)) → U22¹(X1, X2)
U23¹(ok(X)) → U23¹(X)
U31¹(ok(X1), ok(X2)) → U31¹(X1, X2)
U32¹(ok(X)) → U32¹(X)
U41¹(ok(X)) → U41¹(X)
U51¹(ok(X1), ok(X2)) → U51¹(X1, X2)
U52¹(ok(X1), ok(X2)) → U52¹(X1, X2)
U61¹(ok(X1), ok(X2), ok(X3)) → U61¹(X1, X2, X3)
U62¹(ok(X1), ok(X2), ok(X3)) → U62¹(X1, X2, X3)
U63¹(ok(X1), ok(X2), ok(X3)) → U63¹(X1, X2, X3)
U64¹(ok(X1), ok(X2), ok(X3)) → U64¹(X1, X2, X3)
S(ok(X)) → S(X)
PLUS(ok(X1), ok(X2)) → PLUS(X1, X2)
TOP(mark(X)) → TOP(proper(X))
TOP(mark(X)) → PROPER(X)
TOP(ok(X)) → TOP(active(X))
TOP(ok(X)) → ACTIVE(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(3) DependencyGraphProof (EQUIVALENT transformation)

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

(4) Complex Obligation (AND)

(5) Obligation:

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

ISNAT(ok(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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.

ISNAT(ok(X)) → ISNAT(X)

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

Lexicographic Path Order [LPO].
Precedence:

proper₁ > U13₁ > ok₁ > top > mark
proper₁ > U14₁ > ok₁ > top > mark
proper₁ > U31₁ > ok₁ > top > mark
proper₁ > U52₁ > ok₁ > top > mark
proper₁ > U61₁ > ok₁ > top > mark
proper₁ > U64₁ > plus₁ > ok₁ > top > mark
proper₁ > 0 > tt > mark

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(7) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(8) PisEmptyProof (EQUIVALENT transformation)

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

(9) TRUE

(10) Obligation:

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

ISNATKIND(ok(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(11) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ISNATKIND(ok(X)) → ISNATKIND(X)

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

Lexicographic Path Order [LPO].
Precedence:

proper₁ > U13₁ > ok₁ > top > mark
proper₁ > U14₁ > ok₁ > top > mark
proper₁ > U31₁ > ok₁ > top > mark
proper₁ > U52₁ > ok₁ > top > mark
proper₁ > U61₁ > ok₁ > top > mark
proper₁ > U64₁ > plus₁ > ok₁ > top > mark
proper₁ > 0 > tt > mark

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(12) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(13) PisEmptyProof (EQUIVALENT transformation)

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

(14) TRUE

(15) 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(ok(X1), ok(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(16) 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)
PLUS(ok(X1), ok(X2)) → PLUS(X1, X2)

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

Lexicographic Path Order [LPO].
Precedence:

active₁ > U11₃ > U12₃ > U13₃ > mark₁
active₁ > U11₃ > U12₃ > U13₃ > ok₁
active₁ > U11₃ > isNatKind₁ > tt > U13₃ > mark₁
active₁ > U11₃ > isNatKind₁ > tt > U13₃ > ok₁
active₁ > U11₃ > isNatKind₁ > tt > U16₁ > mark₁
active₁ > U11₃ > isNatKind₁ > tt > U16₁ > ok₁
active₁ > U11₃ > isNatKind₁ > tt > U64₃ > mark₁
active₁ > U11₃ > isNatKind₁ > tt > U64₃ > ok₁
active₁ > U11₃ > isNatKind₁ > U41₁ > mark₁
active₁ > U11₃ > isNatKind₁ > U41₁ > ok₁
active₁ > U14₃ > mark₁
active₁ > U14₃ > ok₁
active₁ > U15₂ > U16₁ > mark₁
active₁ > U15₂ > U16₁ > ok₁
active₁ > U21₂ > U22₂ > isNat₁ > isNatKind₁ > tt > U13₃ > mark₁
active₁ > U21₂ > U22₂ > isNat₁ > isNatKind₁ > tt > U13₃ > ok₁
active₁ > U21₂ > U22₂ > isNat₁ > isNatKind₁ > tt > U16₁ > mark₁
active₁ > U21₂ > U22₂ > isNat₁ > isNatKind₁ > tt > U16₁ > ok₁
active₁ > U21₂ > U22₂ > isNat₁ > isNatKind₁ > tt > U64₃ > mark₁
active₁ > U21₂ > U22₂ > isNat₁ > isNatKind₁ > tt > U64₃ > ok₁
active₁ > U21₂ > U22₂ > isNat₁ > isNatKind₁ > U41₁ > mark₁
active₁ > U21₂ > U22₂ > isNat₁ > isNatKind₁ > U41₁ > ok₁
active₁ > U23₁ > tt > U13₃ > mark₁
active₁ > U23₁ > tt > U13₃ > ok₁
active₁ > U23₁ > tt > U16₁ > mark₁
active₁ > U23₁ > tt > U16₁ > ok₁
active₁ > U23₁ > tt > U64₃ > mark₁
active₁ > U23₁ > tt > U64₃ > ok₁
active₁ > U31₂ > isNatKind₁ > tt > U13₃ > mark₁
active₁ > U31₂ > isNatKind₁ > tt > U13₃ > ok₁
active₁ > U31₂ > isNatKind₁ > tt > U16₁ > mark₁
active₁ > U31₂ > isNatKind₁ > tt > U16₁ > ok₁
active₁ > U31₂ > isNatKind₁ > tt > U64₃ > mark₁
active₁ > U31₂ > isNatKind₁ > tt > U64₃ > ok₁
active₁ > U31₂ > isNatKind₁ > U41₁ > mark₁
active₁ > U31₂ > isNatKind₁ > U41₁ > ok₁
active₁ > U52₂ > mark₁
active₁ > U52₂ > ok₁
active₁ > U62₃ > isNat₁ > isNatKind₁ > tt > U13₃ > mark₁
active₁ > U62₃ > isNat₁ > isNatKind₁ > tt > U13₃ > ok₁
active₁ > U62₃ > isNat₁ > isNatKind₁ > tt > U16₁ > mark₁
active₁ > U62₃ > isNat₁ > isNatKind₁ > tt > U16₁ > ok₁
active₁ > U62₃ > isNat₁ > isNatKind₁ > tt > U64₃ > mark₁
active₁ > U62₃ > isNat₁ > isNatKind₁ > tt > U64₃ > ok₁
active₁ > U62₃ > isNat₁ > isNatKind₁ > U41₁ > mark₁
active₁ > U62₃ > isNat₁ > isNatKind₁ > U41₁ > ok₁
active₁ > U62₃ > U63₃ > isNatKind₁ > tt > U13₃ > mark₁
active₁ > U62₃ > U63₃ > isNatKind₁ > tt > U13₃ > ok₁
active₁ > U62₃ > U63₃ > isNatKind₁ > tt > U16₁ > mark₁
active₁ > U62₃ > U63₃ > isNatKind₁ > tt > U16₁ > ok₁
active₁ > U62₃ > U63₃ > isNatKind₁ > tt > U64₃ > mark₁
active₁ > U62₃ > U63₃ > isNatKind₁ > tt > U64₃ > ok₁
active₁ > U62₃ > U63₃ > isNatKind₁ > U41₁ > mark₁
active₁ > U62₃ > U63₃ > isNatKind₁ > U41₁ > ok₁
active₁ > plus₂ > isNatKind₁ > tt > U13₃ > mark₁
active₁ > plus₂ > isNatKind₁ > tt > U13₃ > ok₁
active₁ > plus₂ > isNatKind₁ > tt > U16₁ > mark₁
active₁ > plus₂ > isNatKind₁ > tt > U16₁ > ok₁
active₁ > plus₂ > isNatKind₁ > tt > U64₃ > mark₁
active₁ > plus₂ > isNatKind₁ > tt > U64₃ > ok₁
active₁ > plus₂ > isNatKind₁ > U41₁ > mark₁
active₁ > plus₂ > isNatKind₁ > U41₁ > ok₁
active₁ > plus₂ > U51₂ > mark₁
active₁ > plus₂ > U51₂ > ok₁
active₁ > plus₂ > U61₃ > mark₁
active₁ > plus₂ > U61₃ > ok₁
proper₁ > U11₃ > U12₃ > U13₃ > mark₁
proper₁ > U11₃ > U12₃ > U13₃ > ok₁
proper₁ > U11₃ > isNatKind₁ > tt > U13₃ > mark₁
proper₁ > U11₃ > isNatKind₁ > tt > U13₃ > ok₁
proper₁ > U11₃ > isNatKind₁ > tt > U16₁ > mark₁
proper₁ > U11₃ > isNatKind₁ > tt > U16₁ > ok₁
proper₁ > U11₃ > isNatKind₁ > tt > U64₃ > mark₁
proper₁ > U11₃ > isNatKind₁ > tt > U64₃ > ok₁
proper₁ > U11₃ > isNatKind₁ > U41₁ > mark₁
proper₁ > U11₃ > isNatKind₁ > U41₁ > ok₁
proper₁ > U14₃ > mark₁
proper₁ > U14₃ > ok₁
proper₁ > U15₂ > U16₁ > mark₁
proper₁ > U15₂ > U16₁ > ok₁
proper₁ > U21₂ > U22₂ > isNat₁ > isNatKind₁ > tt > U13₃ > mark₁
proper₁ > U21₂ > U22₂ > isNat₁ > isNatKind₁ > tt > U13₃ > ok₁
proper₁ > U21₂ > U22₂ > isNat₁ > isNatKind₁ > tt > U16₁ > mark₁
proper₁ > U21₂ > U22₂ > isNat₁ > isNatKind₁ > tt > U16₁ > ok₁
proper₁ > U21₂ > U22₂ > isNat₁ > isNatKind₁ > tt > U64₃ > mark₁
proper₁ > U21₂ > U22₂ > isNat₁ > isNatKind₁ > tt > U64₃ > ok₁
proper₁ > U21₂ > U22₂ > isNat₁ > isNatKind₁ > U41₁ > mark₁
proper₁ > U21₂ > U22₂ > isNat₁ > isNatKind₁ > U41₁ > ok₁
proper₁ > U23₁ > tt > U13₃ > mark₁
proper₁ > U23₁ > tt > U13₃ > ok₁
proper₁ > U23₁ > tt > U16₁ > mark₁
proper₁ > U23₁ > tt > U16₁ > ok₁
proper₁ > U23₁ > tt > U64₃ > mark₁
proper₁ > U23₁ > tt > U64₃ > ok₁
proper₁ > U31₂ > isNatKind₁ > tt > U13₃ > mark₁
proper₁ > U31₂ > isNatKind₁ > tt > U13₃ > ok₁
proper₁ > U31₂ > isNatKind₁ > tt > U16₁ > mark₁
proper₁ > U31₂ > isNatKind₁ > tt > U16₁ > ok₁
proper₁ > U31₂ > isNatKind₁ > tt > U64₃ > mark₁
proper₁ > U31₂ > isNatKind₁ > tt > U64₃ > ok₁
proper₁ > U31₂ > isNatKind₁ > U41₁ > mark₁
proper₁ > U31₂ > isNatKind₁ > U41₁ > ok₁
proper₁ > U52₂ > mark₁
proper₁ > U52₂ > ok₁
proper₁ > U62₃ > isNat₁ > isNatKind₁ > tt > U13₃ > mark₁
proper₁ > U62₃ > isNat₁ > isNatKind₁ > tt > U13₃ > ok₁
proper₁ > U62₃ > isNat₁ > isNatKind₁ > tt > U16₁ > mark₁
proper₁ > U62₃ > isNat₁ > isNatKind₁ > tt > U16₁ > ok₁
proper₁ > U62₃ > isNat₁ > isNatKind₁ > tt > U64₃ > mark₁
proper₁ > U62₃ > isNat₁ > isNatKind₁ > tt > U64₃ > ok₁
proper₁ > U62₃ > isNat₁ > isNatKind₁ > U41₁ > mark₁
proper₁ > U62₃ > isNat₁ > isNatKind₁ > U41₁ > ok₁
proper₁ > U62₃ > U63₃ > isNatKind₁ > tt > U13₃ > mark₁
proper₁ > U62₃ > U63₃ > isNatKind₁ > tt > U13₃ > ok₁
proper₁ > U62₃ > U63₃ > isNatKind₁ > tt > U16₁ > mark₁
proper₁ > U62₃ > U63₃ > isNatKind₁ > tt > U16₁ > ok₁
proper₁ > U62₃ > U63₃ > isNatKind₁ > tt > U64₃ > mark₁
proper₁ > U62₃ > U63₃ > isNatKind₁ > tt > U64₃ > ok₁
proper₁ > U62₃ > U63₃ > isNatKind₁ > U41₁ > mark₁
proper₁ > U62₃ > U63₃ > isNatKind₁ > U41₁ > ok₁
proper₁ > plus₂ > isNatKind₁ > tt > U13₃ > mark₁
proper₁ > plus₂ > isNatKind₁ > tt > U13₃ > ok₁
proper₁ > plus₂ > isNatKind₁ > tt > U16₁ > mark₁
proper₁ > plus₂ > isNatKind₁ > tt > U16₁ > ok₁
proper₁ > plus₂ > isNatKind₁ > tt > U64₃ > mark₁
proper₁ > plus₂ > isNatKind₁ > tt > U64₃ > ok₁
proper₁ > plus₂ > isNatKind₁ > U41₁ > mark₁
proper₁ > plus₂ > isNatKind₁ > U41₁ > ok₁
proper₁ > plus₂ > U51₂ > mark₁
proper₁ > plus₂ > U51₂ > ok₁
proper₁ > plus₂ > U61₃ > mark₁
proper₁ > plus₂ > U61₃ > ok₁
proper₁ > 0 > mark₁
proper₁ > 0 > ok₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(17) Obligation:

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

PLUS(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(18) 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: Combined order from the following AFS and order.
PLUS(x1, x2)  =  PLUS(x1, x2)
mark(x1)  =  mark(x1)
active(x1)  =  active(x1)
U11(x1, x2, x3)  =  U11(x1, x2, x3)
tt  =  tt
U12(x1, x2, x3)  =  U12(x1, x2, x3)
isNatKind(x1)  =  isNatKind
U13(x1, x2, x3)  =  U13(x1, x2, x3)
U14(x1, x2, x3)  =  U14(x1, x2, x3)
U15(x1, x2)  =  U15(x1, x2)
isNat(x1)  =  isNat(x1)
U16(x1)  =  U16(x1)
U21(x1, x2)  =  U21(x1, x2)
U22(x1, x2)  =  U22(x1, x2)
U23(x1)  =  U23(x1)
U31(x1, x2)  =  U31(x1)
U32(x1)  =  U32(x1)
U41(x1)  =  U41(x1)
U51(x1, x2)  =  U51(x1, x2)
U52(x1, x2)  =  U52(x1, x2)
U61(x1, x2, x3)  =  U61(x1, x2, x3)
U62(x1, x2, x3)  =  U62(x1, x2, x3)
U63(x1, x2, x3)  =  U63(x1, x2, x3)
U64(x1, x2, x3)  =  U64(x1, x2, x3)
s(x1)  =  s(x1)
plus(x1, x2)  =  plus(x1, x2)
0  =  0
proper(x1)  =  proper(x1)
ok(x1)  =  x1
top(x1)  =  top

Lexicographic Path Order [LPO].
Precedence:

PLUS₂ > mark₁
active₁ > U12₃ > isNatKind > tt > mark₁
active₁ > U12₃ > U13₃ > mark₁
active₁ > U14₃ > mark₁
active₁ > U15₂ > mark₁
active₁ > U16₁ > tt > mark₁
active₁ > U21₂ > isNatKind > tt > mark₁
active₁ > U21₂ > U22₂ > mark₁
active₁ > U23₁ > tt > mark₁
active₁ > U51₂ > isNatKind > tt > mark₁
active₁ > U52₂ > mark₁
active₁ > U63₃ > isNatKind > tt > mark₁
active₁ > U63₃ > U64₃ > mark₁
active₁ > s₁ > isNat₁ > U11₃ > mark₁
active₁ > s₁ > isNat₁ > isNatKind > tt > mark₁
active₁ > s₁ > U41₁ > tt > mark₁
active₁ > s₁ > U61₃ > isNatKind > tt > mark₁
active₁ > s₁ > U61₃ > U62₃ > mark₁
active₁ > plus₂ > U11₃ > mark₁
active₁ > plus₂ > U31₁ > isNatKind > tt > mark₁
active₁ > plus₂ > U31₁ > U32₁ > tt > mark₁
active₁ > plus₂ > U61₃ > isNatKind > tt > mark₁
active₁ > plus₂ > U61₃ > U62₃ > mark₁
proper₁ > U12₃ > isNatKind > tt > mark₁
proper₁ > U12₃ > U13₃ > mark₁
proper₁ > U14₃ > mark₁
proper₁ > U15₂ > mark₁
proper₁ > U16₁ > tt > mark₁
proper₁ > U21₂ > isNatKind > tt > mark₁
proper₁ > U21₂ > U22₂ > mark₁
proper₁ > U23₁ > tt > mark₁
proper₁ > U51₂ > isNatKind > tt > mark₁
proper₁ > U52₂ > mark₁
proper₁ > U63₃ > isNatKind > tt > mark₁
proper₁ > U63₃ > U64₃ > mark₁
proper₁ > s₁ > isNat₁ > U11₃ > mark₁
proper₁ > s₁ > isNat₁ > isNatKind > tt > mark₁
proper₁ > s₁ > U41₁ > tt > mark₁
proper₁ > s₁ > U61₃ > isNatKind > tt > mark₁
proper₁ > s₁ > U61₃ > U62₃ > mark₁
proper₁ > plus₂ > U11₃ > mark₁
proper₁ > plus₂ > U31₁ > isNatKind > tt > mark₁
proper₁ > plus₂ > U31₁ > U32₁ > tt > mark₁
proper₁ > plus₂ > U61₃ > isNatKind > tt > mark₁
proper₁ > plus₂ > U61₃ > U62₃ > mark₁
proper₁ > 0 > tt > mark₁
top > mark₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(19) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(20) PisEmptyProof (EQUIVALENT transformation)

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

(21) TRUE

(22) Obligation:

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

S(ok(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(23) 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: Combined order from the following AFS and order.
S(x1)  =  S(x1)
ok(x1)  =  x1
mark(x1)  =  mark(x1)
active(x1)  =  active(x1)
U11(x1, x2, x3)  =  U11(x1, x2, x3)
tt  =  tt
U12(x1, x2, x3)  =  U12(x1, x2, x3)
isNatKind(x1)  =  x1
U13(x1, x2, x3)  =  U13(x1, x2, x3)
U14(x1, x2, x3)  =  U14(x1, x2, x3)
U15(x1, x2)  =  U15(x1, x2)
isNat(x1)  =  isNat(x1)
U16(x1)  =  U16(x1)
U21(x1, x2)  =  U21(x1, x2)
U22(x1, x2)  =  U22(x1, x2)
U23(x1)  =  U23(x1)
U31(x1, x2)  =  U31(x1, x2)
U32(x1)  =  U32(x1)
U41(x1)  =  U41(x1)
U51(x1, x2)  =  U51(x1, x2)
U52(x1, x2)  =  U52(x1, x2)
U61(x1, x2, x3)  =  U61(x1, x2, x3)
U62(x1, x2, x3)  =  U62(x1, x2, x3)
U63(x1, x2, x3)  =  U63(x1, x2, x3)
U64(x1, x2, x3)  =  U64(x1, x2, x3)
s(x1)  =  x1
plus(x1, x2)  =  plus(x1, x2)
0  =  0
proper(x1)  =  proper(x1)
top(x1)  =  top

Lexicographic Path Order [LPO].
Precedence:

active₁ > tt > U13₃ > mark₁ > S₁
active₁ > tt > U14₃ > U15₂ > mark₁ > S₁
active₁ > tt > U16₁ > mark₁ > S₁
active₁ > tt > U22₂ > U23₁ > mark₁ > S₁
active₁ > tt > U52₂ > mark₁ > S₁
active₁ > tt > U63₃ > U64₃ > mark₁ > S₁
active₁ > tt > plus₂ > mark₁ > S₁
active₁ > U12₃ > U13₃ > mark₁ > S₁
active₁ > isNat₁ > U11₃ > mark₁ > S₁
active₁ > U21₂ > U22₂ > U23₁ > mark₁ > S₁
active₁ > U31₂ > mark₁ > S₁
active₁ > U32₁ > mark₁ > S₁
active₁ > U41₁ > mark₁ > S₁
active₁ > U51₂ > mark₁ > S₁
active₁ > U61₃ > mark₁ > S₁
active₁ > U62₃ > U63₃ > U64₃ > mark₁ > S₁
proper₁ > tt > U13₃ > mark₁ > S₁
proper₁ > tt > U14₃ > U15₂ > mark₁ > S₁
proper₁ > tt > U16₁ > mark₁ > S₁
proper₁ > tt > U22₂ > U23₁ > mark₁ > S₁
proper₁ > tt > U52₂ > mark₁ > S₁
proper₁ > tt > U63₃ > U64₃ > mark₁ > S₁
proper₁ > tt > plus₂ > mark₁ > S₁
proper₁ > U12₃ > U13₃ > mark₁ > S₁
proper₁ > isNat₁ > U11₃ > mark₁ > S₁
proper₁ > U21₂ > U22₂ > U23₁ > mark₁ > S₁
proper₁ > U31₂ > mark₁ > S₁
proper₁ > U32₁ > mark₁ > S₁
proper₁ > U41₁ > mark₁ > S₁
proper₁ > U51₂ > mark₁ > S₁
proper₁ > U61₃ > mark₁ > S₁
proper₁ > U62₃ > U63₃ > U64₃ > mark₁ > S₁
proper₁ > 0 > mark₁ > S₁
top > S₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(24) Obligation:

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

S(ok(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(25) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

S(ok(X)) → S(X)

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

Lexicographic Path Order [LPO].
Precedence:

proper₁ > U13₁ > ok₁ > top > mark
proper₁ > U14₁ > ok₁ > top > mark
proper₁ > U31₁ > ok₁ > top > mark
proper₁ > U52₁ > ok₁ > top > mark
proper₁ > U61₁ > ok₁ > top > mark
proper₁ > U64₁ > plus₁ > ok₁ > top > mark
proper₁ > 0 > tt > mark

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(26) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(27) PisEmptyProof (EQUIVALENT transformation)

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

(28) TRUE

(29) Obligation:

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

U64¹(ok(X1), ok(X2), ok(X3)) → U64¹(X1, X2, X3)
U64¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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¹(mark(X1), X2, X3) → U64¹(X1, X2, X3)

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

Lexicographic Path Order [LPO].
Precedence:

active₁ > U12₁ > isNatKind > tt > U22₁ > mark₁ > top > isNat
active₁ > U12₁ > isNatKind > tt > U62₃ > U63₃ > mark₁ > top > isNat
active₁ > U12₁ > isNatKind > tt > U64₃ > s₁ > mark₁ > top > isNat
active₁ > U12₁ > isNatKind > tt > plus₂ > U11₁ > mark₁ > top > isNat
active₁ > U16₁ > tt > U22₁ > mark₁ > top > isNat
active₁ > U16₁ > tt > U62₃ > U63₃ > mark₁ > top > isNat
active₁ > U16₁ > tt > U64₃ > s₁ > mark₁ > top > isNat
active₁ > U16₁ > tt > plus₂ > U11₁ > mark₁ > top > isNat
active₁ > U21₁ > isNatKind > tt > U22₁ > mark₁ > top > isNat
active₁ > U21₁ > isNatKind > tt > U62₃ > U63₃ > mark₁ > top > isNat
active₁ > U21₁ > isNatKind > tt > U64₃ > s₁ > mark₁ > top > isNat
active₁ > U21₁ > isNatKind > tt > plus₂ > U11₁ > mark₁ > top > isNat
active₁ > U51₂ > mark₁ > top > isNat
active₁ > U52₂ > mark₁ > top > isNat
active₁ > U61₃ > isNatKind > tt > U22₁ > mark₁ > top > isNat
active₁ > U61₃ > isNatKind > tt > U62₃ > U63₃ > mark₁ > top > isNat
active₁ > U61₃ > isNatKind > tt > U64₃ > s₁ > mark₁ > top > isNat
active₁ > U61₃ > isNatKind > tt > plus₂ > U11₁ > mark₁ > top > isNat
proper₁ > U12₁ > isNatKind > tt > U22₁ > mark₁ > top > isNat
proper₁ > U12₁ > isNatKind > tt > U62₃ > U63₃ > mark₁ > top > isNat
proper₁ > U12₁ > isNatKind > tt > U64₃ > s₁ > mark₁ > top > isNat
proper₁ > U12₁ > isNatKind > tt > plus₂ > U11₁ > mark₁ > top > isNat
proper₁ > U16₁ > tt > U22₁ > mark₁ > top > isNat
proper₁ > U16₁ > tt > U62₃ > U63₃ > mark₁ > top > isNat
proper₁ > U16₁ > tt > U64₃ > s₁ > mark₁ > top > isNat
proper₁ > U16₁ > tt > plus₂ > U11₁ > mark₁ > top > isNat
proper₁ > U21₁ > isNatKind > tt > U22₁ > mark₁ > top > isNat
proper₁ > U21₁ > isNatKind > tt > U62₃ > U63₃ > mark₁ > top > isNat
proper₁ > U21₁ > isNatKind > tt > U64₃ > s₁ > mark₁ > top > isNat
proper₁ > U21₁ > isNatKind > tt > plus₂ > U11₁ > mark₁ > top > isNat
proper₁ > U52₂ > mark₁ > top > isNat
proper₁ > U61₃ > isNatKind > tt > U22₁ > mark₁ > top > isNat
proper₁ > U61₃ > isNatKind > tt > U62₃ > U63₃ > mark₁ > top > isNat
proper₁ > U61₃ > isNatKind > tt > U64₃ > s₁ > mark₁ > top > isNat
proper₁ > U61₃ > isNatKind > tt > plus₂ > U11₁ > mark₁ > top > isNat
proper₁ > 0 > U51₂ > mark₁ > top > isNat

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(31) Obligation:

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

U64¹(ok(X1), ok(X2), ok(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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¹(ok(X1), ok(X2), ok(X3)) → U64¹(X1, X2, X3)

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

Lexicographic Path Order [LPO].
Precedence:

U64^1₂ > top
proper₁ > tt > isNat₁ > mark > U12₂ > U13₂ > isNatKind₁ > ok₁ > top
proper₁ > tt > isNat₁ > mark > U32₁ > ok₁ > top
proper₁ > tt > isNat₁ > mark > U41₁ > ok₁ > top
proper₁ > tt > isNat₁ > mark > U63₁ > isNatKind₁ > ok₁ > top
proper₁ > tt > isNat₁ > mark > s₁ > ok₁ > top
proper₁ > tt > plus₁ > mark > U12₂ > U13₂ > isNatKind₁ > ok₁ > top
proper₁ > tt > plus₁ > mark > U32₁ > ok₁ > top
proper₁ > tt > plus₁ > mark > U41₁ > ok₁ > top
proper₁ > tt > plus₁ > mark > U63₁ > isNatKind₁ > ok₁ > top
proper₁ > tt > plus₁ > mark > s₁ > ok₁ > top
proper₁ > U31₁ > mark > U12₂ > U13₂ > isNatKind₁ > ok₁ > top
proper₁ > U31₁ > mark > U32₁ > ok₁ > top
proper₁ > U31₁ > mark > U41₁ > ok₁ > top
proper₁ > U31₁ > mark > U63₁ > isNatKind₁ > ok₁ > top
proper₁ > U31₁ > mark > s₁ > ok₁ > top
proper₁ > U62₁ > active₁ > isNat₁ > mark > U12₂ > U13₂ > isNatKind₁ > ok₁ > top
proper₁ > U62₁ > active₁ > isNat₁ > mark > U32₁ > ok₁ > top
proper₁ > U62₁ > active₁ > isNat₁ > mark > U41₁ > ok₁ > top
proper₁ > U62₁ > active₁ > isNat₁ > mark > U63₁ > isNatKind₁ > ok₁ > top
proper₁ > U62₁ > active₁ > isNat₁ > mark > s₁ > ok₁ > top
proper₁ > U62₁ > active₁ > plus₁ > mark > U12₂ > U13₂ > isNatKind₁ > ok₁ > top
proper₁ > U62₁ > active₁ > plus₁ > mark > U32₁ > ok₁ > top
proper₁ > U62₁ > active₁ > plus₁ > mark > U41₁ > ok₁ > top
proper₁ > U62₁ > active₁ > plus₁ > mark > U63₁ > isNatKind₁ > ok₁ > top
proper₁ > U62₁ > active₁ > plus₁ > mark > s₁ > ok₁ > top
proper₁ > 0 > top

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(33) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(34) PisEmptyProof (EQUIVALENT transformation)

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

(35) TRUE

(36) Obligation:

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

U63¹(ok(X1), ok(X2), ok(X3)) → U63¹(X1, X2, X3)
U63¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(37) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

Lexicographic Path Order [LPO].
Precedence:

proper₁ > U13₂ > ok₁ > U63^1₂ > mark
proper₁ > U13₂ > ok₁ > top > mark
proper₁ > U14₁ > ok₁ > U63^1₂ > mark
proper₁ > U14₁ > ok₁ > top > mark
proper₁ > U15₂ > U16₁ > ok₁ > U63^1₂ > mark
proper₁ > U15₂ > U16₁ > ok₁ > top > mark
proper₁ > U15₂ > U16₁ > tt > mark
proper₁ > U21₁ > isNatKind₁ > ok₁ > U63^1₂ > mark
proper₁ > U21₁ > isNatKind₁ > ok₁ > top > mark
proper₁ > U21₁ > isNatKind₁ > tt > mark
proper₁ > U22₁ > ok₁ > U63^1₂ > mark
proper₁ > U22₁ > ok₁ > top > mark
proper₁ > U23₁ > ok₁ > U63^1₂ > mark
proper₁ > U23₁ > ok₁ > top > mark
proper₁ > U23₁ > tt > mark
proper₁ > U32₁ > ok₁ > U63^1₂ > mark
proper₁ > U32₁ > ok₁ > top > mark
proper₁ > U32₁ > tt > mark
proper₁ > U41₁ > ok₁ > U63^1₂ > mark
proper₁ > U41₁ > ok₁ > top > mark
proper₁ > U41₁ > tt > mark
proper₁ > U52₂ > ok₁ > U63^1₂ > mark
proper₁ > U52₂ > ok₁ > top > mark
proper₁ > U61₂ > isNatKind₁ > ok₁ > U63^1₂ > mark
proper₁ > U61₂ > isNatKind₁ > ok₁ > top > mark
proper₁ > U61₂ > isNatKind₁ > tt > mark
proper₁ > U63₂ > isNatKind₁ > ok₁ > U63^1₂ > mark
proper₁ > U63₂ > isNatKind₁ > ok₁ > top > mark
proper₁ > U63₂ > isNatKind₁ > tt > mark
proper₁ > plus₂ > U11₂ > ok₁ > U63^1₂ > mark
proper₁ > plus₂ > U11₂ > ok₁ > top > mark
proper₁ > plus₂ > isNatKind₁ > ok₁ > U63^1₂ > mark
proper₁ > plus₂ > isNatKind₁ > ok₁ > top > mark
proper₁ > plus₂ > isNatKind₁ > tt > mark
proper₁ > plus₂ > U51₂ > ok₁ > U63^1₂ > mark
proper₁ > plus₂ > U51₂ > ok₁ > top > mark
proper₁ > 0 > tt > mark

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(38) Obligation:

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

U63¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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¹(mark(X1), X2, X3) → U63¹(X1, X2, X3)

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

Lexicographic Path Order [LPO].
Precedence:

proper₁ > U15₁ > mark₁
proper₁ > U16₁ > tt > mark₁
proper₁ > U21₁ > isNatKind > tt > mark₁
proper₁ > U21₁ > U22₁ > mark₁
proper₁ > U23₁ > tt > mark₁
proper₁ > U51₂ > isNatKind > tt > mark₁
proper₁ > U52₂ > mark₁
proper₁ > U62₃ > U63₃ > mark₁
proper₁ > U64₃ > s₁ > U61₃ > isNatKind > tt > mark₁
proper₁ > plus₂ > isNat > U11₁ > mark₁
proper₁ > plus₂ > isNat > isNatKind > tt > mark₁
proper₁ > plus₂ > U61₃ > isNatKind > tt > mark₁
proper₁ > 0 > isNat > U11₁ > mark₁
proper₁ > 0 > isNat > isNatKind > tt > mark₁
top > active₁ > U15₁ > mark₁
top > active₁ > U16₁ > tt > mark₁
top > active₁ > U21₁ > isNatKind > tt > mark₁
top > active₁ > U21₁ > U22₁ > mark₁
top > active₁ > U23₁ > tt > mark₁
top > active₁ > U51₂ > isNatKind > tt > mark₁
top > active₁ > U52₂ > mark₁
top > active₁ > U62₃ > U63₃ > mark₁
top > active₁ > U64₃ > s₁ > U61₃ > isNatKind > tt > mark₁
top > active₁ > plus₂ > isNat > U11₁ > mark₁
top > active₁ > plus₂ > isNat > isNatKind > tt > mark₁
top > active₁ > plus₂ > U61₃ > isNatKind > tt > mark₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(40) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(41) PisEmptyProof (EQUIVALENT transformation)

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

(42) TRUE

(43) Obligation:

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

U62¹(ok(X1), ok(X2), ok(X3)) → U62¹(X1, X2, X3)
U62¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(44) 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: Combined order from the following AFS and order.
U62¹(x1, x2, x3)  =  x1
ok(x1)  =  x1
mark(x1)  =  mark(x1)
active(x1)  =  active(x1)
U11(x1, x2, x3)  =  x1
tt  =  tt
U12(x1, x2, x3)  =  x1
isNatKind(x1)  =  isNatKind
U13(x1, x2, x3)  =  U13(x1)
U14(x1, x2, x3)  =  U14(x1)
U15(x1, x2)  =  U15(x1)
isNat(x1)  =  isNat
U16(x1)  =  x1
U21(x1, x2)  =  x1
U22(x1, x2)  =  x1
U23(x1)  =  x1
U31(x1, x2)  =  x1
U32(x1)  =  x1
U41(x1)  =  U41(x1)
U51(x1, x2)  =  U51(x1, x2)
U52(x1, x2)  =  U52(x1, x2)
U61(x1, x2, x3)  =  U61(x1, x2, x3)
U62(x1, x2, x3)  =  U62(x1, x2, x3)
U63(x1, x2, x3)  =  U63(x1, x2, x3)
U64(x1, x2, x3)  =  U64(x1, x2, x3)
s(x1)  =  s(x1)
plus(x1, x2)  =  plus(x1, x2)
0  =  0
proper(x1)  =  x1
top(x1)  =  top

Lexicographic Path Order [LPO].
Precedence:

active₁ > U13₁ > mark₁ > top
active₁ > U13₁ > isNatKind > tt
active₁ > U14₁ > mark₁ > top
active₁ > U15₁ > mark₁ > top
active₁ > isNat > mark₁ > top
active₁ > isNat > isNatKind > tt
active₁ > U41₁ > mark₁ > top
active₁ > U41₁ > tt
active₁ > U52₂ > mark₁ > top
active₁ > U62₃ > mark₁ > top
active₁ > U63₃ > mark₁ > top
active₁ > U63₃ > isNatKind > tt
active₁ > U64₃ > s₁ > mark₁ > top
active₁ > U64₃ > s₁ > isNatKind > tt
active₁ > plus₂ > U51₂ > mark₁ > top
active₁ > plus₂ > U51₂ > isNatKind > tt
active₁ > plus₂ > U61₃ > mark₁ > top
active₁ > plus₂ > U61₃ > isNatKind > tt
0 > tt

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(45) Obligation:

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

U62¹(ok(X1), ok(X2), ok(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(46) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

Lexicographic Path Order [LPO].
Precedence:

U62^1₂ > ok₁
active₁ > tt > mark > U14₂ > ok₁
active₁ > tt > mark > U21₁ > ok₁
active₁ > tt > mark > U41₁ > ok₁
active₁ > tt > mark > U64₃ > s₁ > ok₁
active₁ > tt > mark > top > ok₁
active₁ > tt > isNat₁ > ok₁
active₁ > U12₁ > mark > U14₂ > ok₁
active₁ > U12₁ > mark > U21₁ > ok₁
active₁ > U12₁ > mark > U41₁ > ok₁
active₁ > U12₁ > mark > U64₃ > s₁ > ok₁
active₁ > U12₁ > mark > top > ok₁
active₁ > U13₁ > mark > U14₂ > ok₁
active₁ > U13₁ > mark > U21₁ > ok₁
active₁ > U13₁ > mark > U41₁ > ok₁
active₁ > U13₁ > mark > U64₃ > s₁ > ok₁
active₁ > U13₁ > mark > top > ok₁
active₁ > U31₁ > mark > U14₂ > ok₁
active₁ > U31₁ > mark > U21₁ > ok₁
active₁ > U31₁ > mark > U41₁ > ok₁
active₁ > U31₁ > mark > U64₃ > s₁ > ok₁
active₁ > U31₁ > mark > top > ok₁
active₁ > U32₁ > mark > U14₂ > ok₁
active₁ > U32₁ > mark > U21₁ > ok₁
active₁ > U32₁ > mark > U41₁ > ok₁
active₁ > U32₁ > mark > U64₃ > s₁ > ok₁
active₁ > U32₁ > mark > top > ok₁
active₁ > U62₁ > mark > U14₂ > ok₁
active₁ > U62₁ > mark > U21₁ > ok₁
active₁ > U62₁ > mark > U41₁ > ok₁
active₁ > U62₁ > mark > U64₃ > s₁ > ok₁
active₁ > U62₁ > mark > top > ok₁
active₁ > U62₁ > isNat₁ > ok₁
active₁ > U63₁ > mark > U14₂ > ok₁
active₁ > U63₁ > mark > U21₁ > ok₁
active₁ > U63₁ > mark > U41₁ > ok₁
active₁ > U63₁ > mark > U64₃ > s₁ > ok₁
active₁ > U63₁ > mark > top > ok₁
active₁ > plus₂ > mark > U14₂ > ok₁
active₁ > plus₂ > mark > U21₁ > ok₁
active₁ > plus₂ > mark > U41₁ > ok₁
active₁ > plus₂ > mark > U64₃ > s₁ > ok₁
active₁ > plus₂ > mark > top > ok₁
active₁ > plus₂ > isNat₁ > ok₁
proper₁ > tt > mark > U14₂ > ok₁
proper₁ > tt > mark > U21₁ > ok₁
proper₁ > tt > mark > U41₁ > ok₁
proper₁ > tt > mark > U64₃ > s₁ > ok₁
proper₁ > tt > mark > top > ok₁
proper₁ > tt > isNat₁ > ok₁
proper₁ > U12₁ > mark > U14₂ > ok₁
proper₁ > U12₁ > mark > U21₁ > ok₁
proper₁ > U12₁ > mark > U41₁ > ok₁
proper₁ > U12₁ > mark > U64₃ > s₁ > ok₁
proper₁ > U12₁ > mark > top > ok₁
proper₁ > U13₁ > mark > U14₂ > ok₁
proper₁ > U13₁ > mark > U21₁ > ok₁
proper₁ > U13₁ > mark > U41₁ > ok₁
proper₁ > U13₁ > mark > U64₃ > s₁ > ok₁
proper₁ > U13₁ > mark > top > ok₁
proper₁ > U31₁ > mark > U14₂ > ok₁
proper₁ > U31₁ > mark > U21₁ > ok₁
proper₁ > U31₁ > mark > U41₁ > ok₁
proper₁ > U31₁ > mark > U64₃ > s₁ > ok₁
proper₁ > U31₁ > mark > top > ok₁
proper₁ > U32₁ > mark > U14₂ > ok₁
proper₁ > U32₁ > mark > U21₁ > ok₁
proper₁ > U32₁ > mark > U41₁ > ok₁
proper₁ > U32₁ > mark > U64₃ > s₁ > ok₁
proper₁ > U32₁ > mark > top > ok₁
proper₁ > U62₁ > mark > U14₂ > ok₁
proper₁ > U62₁ > mark > U21₁ > ok₁
proper₁ > U62₁ > mark > U41₁ > ok₁
proper₁ > U62₁ > mark > U64₃ > s₁ > ok₁
proper₁ > U62₁ > mark > top > ok₁
proper₁ > U62₁ > isNat₁ > ok₁
proper₁ > U63₁ > mark > U14₂ > ok₁
proper₁ > U63₁ > mark > U21₁ > ok₁
proper₁ > U63₁ > mark > U41₁ > ok₁
proper₁ > U63₁ > mark > U64₃ > s₁ > ok₁
proper₁ > U63₁ > mark > top > ok₁
proper₁ > plus₂ > mark > U14₂ > ok₁
proper₁ > plus₂ > mark > U21₁ > ok₁
proper₁ > plus₂ > mark > U41₁ > ok₁
proper₁ > plus₂ > mark > U64₃ > s₁ > ok₁
proper₁ > plus₂ > mark > top > ok₁
proper₁ > plus₂ > isNat₁ > ok₁
proper₁ > 0 > ok₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(47) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(48) PisEmptyProof (EQUIVALENT transformation)

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

(49) TRUE

(50) Obligation:

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

U61¹(ok(X1), ok(X2), ok(X3)) → U61¹(X1, X2, X3)
U61¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(51) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

Lexicographic Path Order [LPO].
Precedence:

U61^1₁ > mark
proper₁ > isNatKind₁ > tt > U15₁ > isNat₁ > ok₁ > mark
proper₁ > isNatKind₁ > tt > U22₂ > isNat₁ > ok₁ > mark
proper₁ > isNatKind₁ > tt > U52₂ > ok₁ > mark
proper₁ > isNatKind₁ > tt > U62₁ > isNat₁ > ok₁ > mark
proper₁ > isNatKind₁ > tt > U62₁ > U63₂ > ok₁ > mark
proper₁ > isNatKind₁ > tt > U64₁ > ok₁ > mark
proper₁ > isNatKind₁ > U31₂ > ok₁ > mark
proper₁ > U21₂ > U22₂ > isNat₁ > ok₁ > mark
proper₁ > plus₁ > isNat₁ > ok₁ > mark
proper₁ > plus₁ > U31₂ > ok₁ > mark
proper₁ > plus₁ > U51₂ > ok₁ > mark
proper₁ > plus₁ > U61₂ > ok₁ > mark
proper₁ > 0 > isNat₁ > ok₁ > mark
top > mark

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(52) Obligation:

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

U61¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(53) 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: Combined order from the following AFS and order.
U61¹(x1, x2, x3)  =  x1
mark(x1)  =  mark(x1)
active(x1)  =  active(x1)
U11(x1, x2, x3)  =  U11(x1)
tt  =  tt
U12(x1, x2, x3)  =  U12(x1)
isNatKind(x1)  =  isNatKind
U13(x1, x2, x3)  =  x1
U14(x1, x2, x3)  =  x1
U15(x1, x2)  =  U15(x1)
isNat(x1)  =  isNat
U16(x1)  =  U16(x1)
U21(x1, x2)  =  U21(x1)
U22(x1, x2)  =  U22(x1)
U23(x1)  =  U23(x1)
U31(x1, x2)  =  U31(x1)
U32(x1)  =  x1
U41(x1)  =  U41(x1)
U51(x1, x2)  =  U51(x1, x2)
U52(x1, x2)  =  U52(x1, x2)
U61(x1, x2, x3)  =  U61(x1, x2, x3)
U62(x1, x2, x3)  =  U62(x1, x2, x3)
U63(x1, x2, x3)  =  U63(x1, x2, x3)
U64(x1, x2, x3)  =  U64(x1, x2, x3)
s(x1)  =  s(x1)
plus(x1, x2)  =  plus(x1, x2)
0  =  0
proper(x1)  =  proper(x1)
ok(x1)  =  x1
top(x1)  =  top

Lexicographic Path Order [LPO].
Precedence:

proper₁ > U12₁ > isNatKind > mark₁
proper₁ > U15₁ > mark₁
proper₁ > U16₁ > mark₁
proper₁ > U22₁ > mark₁
proper₁ > U23₁ > tt > mark₁
proper₁ > U31₁ > isNatKind > mark₁
proper₁ > U52₂ > mark₁
proper₁ > U62₃ > mark₁
proper₁ > U63₃ > U64₃ > plus₂ > U11₁ > isNatKind > mark₁
proper₁ > U63₃ > U64₃ > plus₂ > U51₂ > mark₁
proper₁ > U63₃ > U64₃ > plus₂ > U61₃ > isNatKind > mark₁
proper₁ > s₁ > isNat > U11₁ > isNatKind > mark₁
proper₁ > s₁ > isNat > tt > mark₁
proper₁ > s₁ > isNat > U21₁ > mark₁
proper₁ > s₁ > U41₁ > tt > mark₁
proper₁ > s₁ > U61₃ > isNatKind > mark₁
proper₁ > 0 > tt > mark₁
proper₁ > 0 > U51₂ > mark₁
top > active₁ > U12₁ > isNatKind > mark₁
top > active₁ > U15₁ > mark₁
top > active₁ > U16₁ > mark₁
top > active₁ > U22₁ > mark₁
top > active₁ > U23₁ > tt > mark₁
top > active₁ > U31₁ > isNatKind > mark₁
top > active₁ > U52₂ > mark₁
top > active₁ > U62₃ > mark₁
top > active₁ > U63₃ > U64₃ > plus₂ > U11₁ > isNatKind > mark₁
top > active₁ > U63₃ > U64₃ > plus₂ > U51₂ > mark₁
top > active₁ > U63₃ > U64₃ > plus₂ > U61₃ > isNatKind > mark₁
top > active₁ > s₁ > isNat > U11₁ > isNatKind > mark₁
top > active₁ > s₁ > isNat > tt > mark₁
top > active₁ > s₁ > isNat > U21₁ > mark₁
top > active₁ > s₁ > U41₁ > tt > mark₁
top > active₁ > s₁ > U61₃ > isNatKind > mark₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(54) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(55) PisEmptyProof (EQUIVALENT transformation)

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

(56) TRUE

(57) Obligation:

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

U52¹(ok(X1), ok(X2)) → U52¹(X1, X2)
U52¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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.

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

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

Lexicographic Path Order [LPO].
Precedence:

proper₁ > tt > mark > U16₁ > ok₁
proper₁ > tt > mark > U32₁ > ok₁
proper₁ > tt > mark > U41₁ > ok₁
proper₁ > tt > mark > U51₂ > ok₁
proper₁ > tt > mark > U64₃ > ok₁
proper₁ > U12₂ > mark > U16₁ > ok₁
proper₁ > U12₂ > mark > U32₁ > ok₁
proper₁ > U12₂ > mark > U41₁ > ok₁
proper₁ > U12₂ > mark > U51₂ > ok₁
proper₁ > U12₂ > mark > U64₃ > ok₁
proper₁ > U13₁ > U14₂ > mark > U16₁ > ok₁
proper₁ > U13₁ > U14₂ > mark > U32₁ > ok₁
proper₁ > U13₁ > U14₂ > mark > U41₁ > ok₁
proper₁ > U13₁ > U14₂ > mark > U51₂ > ok₁
proper₁ > U13₁ > U14₂ > mark > U64₃ > ok₁
proper₁ > U52₁ > mark > U16₁ > ok₁
proper₁ > U52₁ > mark > U32₁ > ok₁
proper₁ > U52₁ > mark > U41₁ > ok₁
proper₁ > U52₁ > mark > U51₂ > ok₁
proper₁ > U52₁ > mark > U64₃ > ok₁
proper₁ > U62₂ > mark > U16₁ > ok₁
proper₁ > U62₂ > mark > U32₁ > ok₁
proper₁ > U62₂ > mark > U41₁ > ok₁
proper₁ > U62₂ > mark > U51₂ > ok₁
proper₁ > U62₂ > mark > U64₃ > ok₁
proper₁ > s₁ > U61₃ > mark > U16₁ > ok₁
proper₁ > s₁ > U61₃ > mark > U32₁ > ok₁
proper₁ > s₁ > U61₃ > mark > U41₁ > ok₁
proper₁ > s₁ > U61₃ > mark > U51₂ > ok₁
proper₁ > s₁ > U61₃ > mark > U64₃ > ok₁
proper₁ > plus₁ > U61₃ > mark > U16₁ > ok₁
proper₁ > plus₁ > U61₃ > mark > U32₁ > ok₁
proper₁ > plus₁ > U61₃ > mark > U41₁ > ok₁
proper₁ > plus₁ > U61₃ > mark > U51₂ > ok₁
proper₁ > plus₁ > U61₃ > mark > U64₃ > ok₁
proper₁ > 0 > mark > U16₁ > ok₁
proper₁ > 0 > mark > U32₁ > ok₁
proper₁ > 0 > mark > U41₁ > ok₁
proper₁ > 0 > mark > U51₂ > ok₁
proper₁ > 0 > mark > U64₃ > ok₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(59) Obligation:

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

U52¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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.

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

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

Lexicographic Path Order [LPO].
Precedence:

active₁ > U11₁ > isNatKind > ok > U14₁ > mark₁
active₁ > U11₁ > isNatKind > ok > U51₂ > U52₂ > mark₁
active₁ > U11₁ > isNatKind > ok > U62₃ > mark₁
active₁ > U11₁ > isNatKind > ok > plus₂ > mark₁
active₁ > U11₁ > isNatKind > ok > top
active₁ > isNat > tt > isNatKind > ok > U14₁ > mark₁
active₁ > isNat > tt > isNatKind > ok > U51₂ > U52₂ > mark₁
active₁ > isNat > tt > isNatKind > ok > U62₃ > mark₁
active₁ > isNat > tt > isNatKind > ok > plus₂ > mark₁
active₁ > isNat > tt > isNatKind > ok > top
active₁ > U16₁ > tt > isNatKind > ok > U14₁ > mark₁
active₁ > U16₁ > tt > isNatKind > ok > U51₂ > U52₂ > mark₁
active₁ > U16₁ > tt > isNatKind > ok > U62₃ > mark₁
active₁ > U16₁ > tt > isNatKind > ok > plus₂ > mark₁
active₁ > U16₁ > tt > isNatKind > ok > top
active₁ > U23₁ > tt > isNatKind > ok > U14₁ > mark₁
active₁ > U23₁ > tt > isNatKind > ok > U51₂ > U52₂ > mark₁
active₁ > U23₁ > tt > isNatKind > ok > U62₃ > mark₁
active₁ > U23₁ > tt > isNatKind > ok > plus₂ > mark₁
active₁ > U23₁ > tt > isNatKind > ok > top
active₁ > U32₁ > tt > isNatKind > ok > U14₁ > mark₁
active₁ > U32₁ > tt > isNatKind > ok > U51₂ > U52₂ > mark₁
active₁ > U32₁ > tt > isNatKind > ok > U62₃ > mark₁
active₁ > U32₁ > tt > isNatKind > ok > plus₂ > mark₁
active₁ > U32₁ > tt > isNatKind > ok > top
active₁ > U61₃ > isNatKind > ok > U14₁ > mark₁
active₁ > U61₃ > isNatKind > ok > U51₂ > U52₂ > mark₁
active₁ > U61₃ > isNatKind > ok > U62₃ > mark₁
active₁ > U61₃ > isNatKind > ok > plus₂ > mark₁
active₁ > U61₃ > isNatKind > ok > top
active₁ > U63₃ > isNatKind > ok > U14₁ > mark₁
active₁ > U63₃ > isNatKind > ok > U51₂ > U52₂ > mark₁
active₁ > U63₃ > isNatKind > ok > U62₃ > mark₁
active₁ > U63₃ > isNatKind > ok > plus₂ > mark₁
active₁ > U63₃ > isNatKind > ok > top
active₁ > U64₃ > s₁ > isNatKind > ok > U14₁ > mark₁
active₁ > U64₃ > s₁ > isNatKind > ok > U51₂ > U52₂ > mark₁
active₁ > U64₃ > s₁ > isNatKind > ok > U62₃ > mark₁
active₁ > U64₃ > s₁ > isNatKind > ok > plus₂ > mark₁
active₁ > U64₃ > s₁ > isNatKind > ok > top
active₁ > U64₃ > s₁ > U41₁ > ok > U14₁ > mark₁
active₁ > U64₃ > s₁ > U41₁ > ok > U51₂ > U52₂ > mark₁
active₁ > U64₃ > s₁ > U41₁ > ok > U62₃ > mark₁
active₁ > U64₃ > s₁ > U41₁ > ok > plus₂ > mark₁
active₁ > U64₃ > s₁ > U41₁ > ok > top
0 > ok > U14₁ > mark₁
0 > ok > U51₂ > U52₂ > mark₁
0 > ok > U62₃ > mark₁
0 > ok > plus₂ > mark₁
0 > ok > top

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(61) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(62) PisEmptyProof (EQUIVALENT transformation)

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

(63) TRUE

(64) Obligation:

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

U51¹(ok(X1), ok(X2)) → U51¹(X1, X2)
U51¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(65) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

Lexicographic Path Order [LPO].
Precedence:

proper₁ > tt > mark > U16₁ > ok₁
proper₁ > tt > mark > U32₁ > ok₁
proper₁ > tt > mark > U41₁ > ok₁
proper₁ > tt > mark > U51₂ > ok₁
proper₁ > tt > mark > U64₃ > ok₁
proper₁ > U12₂ > mark > U16₁ > ok₁
proper₁ > U12₂ > mark > U32₁ > ok₁
proper₁ > U12₂ > mark > U41₁ > ok₁
proper₁ > U12₂ > mark > U51₂ > ok₁
proper₁ > U12₂ > mark > U64₃ > ok₁
proper₁ > U13₁ > U14₂ > mark > U16₁ > ok₁
proper₁ > U13₁ > U14₂ > mark > U32₁ > ok₁
proper₁ > U13₁ > U14₂ > mark > U41₁ > ok₁
proper₁ > U13₁ > U14₂ > mark > U51₂ > ok₁
proper₁ > U13₁ > U14₂ > mark > U64₃ > ok₁
proper₁ > U52₁ > mark > U16₁ > ok₁
proper₁ > U52₁ > mark > U32₁ > ok₁
proper₁ > U52₁ > mark > U41₁ > ok₁
proper₁ > U52₁ > mark > U51₂ > ok₁
proper₁ > U52₁ > mark > U64₃ > ok₁
proper₁ > U62₂ > mark > U16₁ > ok₁
proper₁ > U62₂ > mark > U32₁ > ok₁
proper₁ > U62₂ > mark > U41₁ > ok₁
proper₁ > U62₂ > mark > U51₂ > ok₁
proper₁ > U62₂ > mark > U64₃ > ok₁
proper₁ > s₁ > U61₃ > mark > U16₁ > ok₁
proper₁ > s₁ > U61₃ > mark > U32₁ > ok₁
proper₁ > s₁ > U61₃ > mark > U41₁ > ok₁
proper₁ > s₁ > U61₃ > mark > U51₂ > ok₁
proper₁ > s₁ > U61₃ > mark > U64₃ > ok₁
proper₁ > plus₁ > U61₃ > mark > U16₁ > ok₁
proper₁ > plus₁ > U61₃ > mark > U32₁ > ok₁
proper₁ > plus₁ > U61₃ > mark > U41₁ > ok₁
proper₁ > plus₁ > U61₃ > mark > U51₂ > ok₁
proper₁ > plus₁ > U61₃ > mark > U64₃ > ok₁
proper₁ > 0 > mark > U16₁ > ok₁
proper₁ > 0 > mark > U32₁ > ok₁
proper₁ > 0 > mark > U41₁ > ok₁
proper₁ > 0 > mark > U51₂ > ok₁
proper₁ > 0 > mark > U64₃ > ok₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(66) Obligation:

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

U51¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(67) 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: Combined order from the following AFS and order.
U51¹(x1, x2)  =  x1
mark(x1)  =  mark(x1)
active(x1)  =  active(x1)
U11(x1, x2, x3)  =  U11(x1)
tt  =  tt
U12(x1, x2, x3)  =  x1
isNatKind(x1)  =  isNatKind
U13(x1, x2, x3)  =  x1
U14(x1, x2, x3)  =  U14(x1)
U15(x1, x2)  =  x1
isNat(x1)  =  isNat
U16(x1)  =  U16(x1)
U21(x1, x2)  =  x1
U22(x1, x2)  =  x1
U23(x1)  =  U23(x1)
U31(x1, x2)  =  x1
U32(x1)  =  U32(x1)
U41(x1)  =  U41(x1)
U51(x1, x2)  =  U51(x1, x2)
U52(x1, x2)  =  U52(x1, x2)
U61(x1, x2, x3)  =  U61(x1, x2, x3)
U62(x1, x2, x3)  =  U62(x1, x2, x3)
U63(x1, x2, x3)  =  U63(x1, x2, x3)
U64(x1, x2, x3)  =  U64(x1, x2, x3)
s(x1)  =  s(x1)
plus(x1, x2)  =  plus(x1, x2)
0  =  0
proper(x1)  =  x1
ok(x1)  =  ok
top(x1)  =  top

Lexicographic Path Order [LPO].
Precedence:

active₁ > U11₁ > isNatKind > ok > U14₁ > mark₁
active₁ > U11₁ > isNatKind > ok > U51₂ > U52₂ > mark₁
active₁ > U11₁ > isNatKind > ok > U62₃ > mark₁
active₁ > U11₁ > isNatKind > ok > plus₂ > mark₁
active₁ > U11₁ > isNatKind > ok > top
active₁ > isNat > tt > isNatKind > ok > U14₁ > mark₁
active₁ > isNat > tt > isNatKind > ok > U51₂ > U52₂ > mark₁
active₁ > isNat > tt > isNatKind > ok > U62₃ > mark₁
active₁ > isNat > tt > isNatKind > ok > plus₂ > mark₁
active₁ > isNat > tt > isNatKind > ok > top
active₁ > U16₁ > tt > isNatKind > ok > U14₁ > mark₁
active₁ > U16₁ > tt > isNatKind > ok > U51₂ > U52₂ > mark₁
active₁ > U16₁ > tt > isNatKind > ok > U62₃ > mark₁
active₁ > U16₁ > tt > isNatKind > ok > plus₂ > mark₁
active₁ > U16₁ > tt > isNatKind > ok > top
active₁ > U23₁ > tt > isNatKind > ok > U14₁ > mark₁
active₁ > U23₁ > tt > isNatKind > ok > U51₂ > U52₂ > mark₁
active₁ > U23₁ > tt > isNatKind > ok > U62₃ > mark₁
active₁ > U23₁ > tt > isNatKind > ok > plus₂ > mark₁
active₁ > U23₁ > tt > isNatKind > ok > top
active₁ > U32₁ > tt > isNatKind > ok > U14₁ > mark₁
active₁ > U32₁ > tt > isNatKind > ok > U51₂ > U52₂ > mark₁
active₁ > U32₁ > tt > isNatKind > ok > U62₃ > mark₁
active₁ > U32₁ > tt > isNatKind > ok > plus₂ > mark₁
active₁ > U32₁ > tt > isNatKind > ok > top
active₁ > U61₃ > isNatKind > ok > U14₁ > mark₁
active₁ > U61₃ > isNatKind > ok > U51₂ > U52₂ > mark₁
active₁ > U61₃ > isNatKind > ok > U62₃ > mark₁
active₁ > U61₃ > isNatKind > ok > plus₂ > mark₁
active₁ > U61₃ > isNatKind > ok > top
active₁ > U63₃ > isNatKind > ok > U14₁ > mark₁
active₁ > U63₃ > isNatKind > ok > U51₂ > U52₂ > mark₁
active₁ > U63₃ > isNatKind > ok > U62₃ > mark₁
active₁ > U63₃ > isNatKind > ok > plus₂ > mark₁
active₁ > U63₃ > isNatKind > ok > top
active₁ > U64₃ > s₁ > isNatKind > ok > U14₁ > mark₁
active₁ > U64₃ > s₁ > isNatKind > ok > U51₂ > U52₂ > mark₁
active₁ > U64₃ > s₁ > isNatKind > ok > U62₃ > mark₁
active₁ > U64₃ > s₁ > isNatKind > ok > plus₂ > mark₁
active₁ > U64₃ > s₁ > isNatKind > ok > top
active₁ > U64₃ > s₁ > U41₁ > ok > U14₁ > mark₁
active₁ > U64₃ > s₁ > U41₁ > ok > U51₂ > U52₂ > mark₁
active₁ > U64₃ > s₁ > U41₁ > ok > U62₃ > mark₁
active₁ > U64₃ > s₁ > U41₁ > ok > plus₂ > mark₁
active₁ > U64₃ > s₁ > U41₁ > ok > top
0 > ok > U14₁ > mark₁
0 > ok > U51₂ > U52₂ > mark₁
0 > ok > U62₃ > mark₁
0 > ok > plus₂ > mark₁
0 > ok > top

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(68) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(69) PisEmptyProof (EQUIVALENT transformation)

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

(70) TRUE

(71) Obligation:

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

U41¹(ok(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(72) 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: Combined order from the following AFS and order.
U41¹(x1)  =  U41¹(x1)
ok(x1)  =  x1
mark(x1)  =  mark(x1)
active(x1)  =  active(x1)
U11(x1, x2, x3)  =  U11(x1, x2, x3)
tt  =  tt
U12(x1, x2, x3)  =  U12(x1, x2, x3)
isNatKind(x1)  =  x1
U13(x1, x2, x3)  =  U13(x1, x2, x3)
U14(x1, x2, x3)  =  U14(x1, x2, x3)
U15(x1, x2)  =  U15(x1, x2)
isNat(x1)  =  isNat(x1)
U16(x1)  =  U16(x1)
U21(x1, x2)  =  U21(x1, x2)
U22(x1, x2)  =  U22(x1, x2)
U23(x1)  =  U23(x1)
U31(x1, x2)  =  U31(x1, x2)
U32(x1)  =  U32(x1)
U41(x1)  =  U41(x1)
U51(x1, x2)  =  U51(x1, x2)
U52(x1, x2)  =  U52(x1, x2)
U61(x1, x2, x3)  =  U61(x1, x2, x3)
U62(x1, x2, x3)  =  U62(x1, x2, x3)
U63(x1, x2, x3)  =  U63(x1, x2, x3)
U64(x1, x2, x3)  =  U64(x1, x2, x3)
s(x1)  =  x1
plus(x1, x2)  =  plus(x1, x2)
0  =  0
proper(x1)  =  proper(x1)
top(x1)  =  top

Lexicographic Path Order [LPO].
Precedence:

active₁ > tt > U13₃ > mark₁ > U41^1₁
active₁ > tt > U14₃ > U15₂ > mark₁ > U41^1₁
active₁ > tt > U16₁ > mark₁ > U41^1₁
active₁ > tt > U22₂ > U23₁ > mark₁ > U41^1₁
active₁ > tt > U52₂ > mark₁ > U41^1₁
active₁ > tt > U63₃ > U64₃ > mark₁ > U41^1₁
active₁ > tt > plus₂ > mark₁ > U41^1₁
active₁ > U12₃ > U13₃ > mark₁ > U41^1₁
active₁ > isNat₁ > U11₃ > mark₁ > U41^1₁
active₁ > U21₂ > U22₂ > U23₁ > mark₁ > U41^1₁
active₁ > U31₂ > mark₁ > U41^1₁
active₁ > U32₁ > mark₁ > U41^1₁
active₁ > U41₁ > mark₁ > U41^1₁
active₁ > U51₂ > mark₁ > U41^1₁
active₁ > U61₃ > mark₁ > U41^1₁
active₁ > U62₃ > U63₃ > U64₃ > mark₁ > U41^1₁
proper₁ > tt > U13₃ > mark₁ > U41^1₁
proper₁ > tt > U14₃ > U15₂ > mark₁ > U41^1₁
proper₁ > tt > U16₁ > mark₁ > U41^1₁
proper₁ > tt > U22₂ > U23₁ > mark₁ > U41^1₁
proper₁ > tt > U52₂ > mark₁ > U41^1₁
proper₁ > tt > U63₃ > U64₃ > mark₁ > U41^1₁
proper₁ > tt > plus₂ > mark₁ > U41^1₁
proper₁ > U12₃ > U13₃ > mark₁ > U41^1₁
proper₁ > isNat₁ > U11₃ > mark₁ > U41^1₁
proper₁ > U21₂ > U22₂ > U23₁ > mark₁ > U41^1₁
proper₁ > U31₂ > mark₁ > U41^1₁
proper₁ > U32₁ > mark₁ > U41^1₁
proper₁ > U41₁ > mark₁ > U41^1₁
proper₁ > U51₂ > mark₁ > U41^1₁
proper₁ > U61₃ > mark₁ > U41^1₁
proper₁ > U62₃ > U63₃ > U64₃ > mark₁ > U41^1₁
proper₁ > 0 > mark₁ > U41^1₁
top > U41^1₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(73) Obligation:

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

U41¹(ok(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(74) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U41¹(ok(X)) → U41¹(X)

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

Lexicographic Path Order [LPO].
Precedence:

proper₁ > U13₁ > ok₁ > top > mark
proper₁ > U14₁ > ok₁ > top > mark
proper₁ > U31₁ > ok₁ > top > mark
proper₁ > U52₁ > ok₁ > top > mark
proper₁ > U61₁ > ok₁ > top > mark
proper₁ > U64₁ > plus₁ > ok₁ > top > mark
proper₁ > 0 > tt > mark

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(75) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(76) PisEmptyProof (EQUIVALENT transformation)

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

(77) TRUE

(78) Obligation:

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

U32¹(ok(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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.

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

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

Lexicographic Path Order [LPO].
Precedence:

active₁ > tt > U13₃ > mark₁ > U32^1₁
active₁ > tt > U14₃ > U15₂ > mark₁ > U32^1₁
active₁ > tt > U16₁ > mark₁ > U32^1₁
active₁ > tt > U22₂ > U23₁ > mark₁ > U32^1₁
active₁ > tt > U52₂ > mark₁ > U32^1₁
active₁ > tt > U63₃ > U64₃ > mark₁ > U32^1₁
active₁ > tt > plus₂ > mark₁ > U32^1₁
active₁ > U12₃ > U13₃ > mark₁ > U32^1₁
active₁ > isNat₁ > U11₃ > mark₁ > U32^1₁
active₁ > U21₂ > U22₂ > U23₁ > mark₁ > U32^1₁
active₁ > U31₂ > mark₁ > U32^1₁
active₁ > U32₁ > mark₁ > U32^1₁
active₁ > U41₁ > mark₁ > U32^1₁
active₁ > U51₂ > mark₁ > U32^1₁
active₁ > U61₃ > mark₁ > U32^1₁
active₁ > U62₃ > U63₃ > U64₃ > mark₁ > U32^1₁
proper₁ > tt > U13₃ > mark₁ > U32^1₁
proper₁ > tt > U14₃ > U15₂ > mark₁ > U32^1₁
proper₁ > tt > U16₁ > mark₁ > U32^1₁
proper₁ > tt > U22₂ > U23₁ > mark₁ > U32^1₁
proper₁ > tt > U52₂ > mark₁ > U32^1₁
proper₁ > tt > U63₃ > U64₃ > mark₁ > U32^1₁
proper₁ > tt > plus₂ > mark₁ > U32^1₁
proper₁ > U12₃ > U13₃ > mark₁ > U32^1₁
proper₁ > isNat₁ > U11₃ > mark₁ > U32^1₁
proper₁ > U21₂ > U22₂ > U23₁ > mark₁ > U32^1₁
proper₁ > U31₂ > mark₁ > U32^1₁
proper₁ > U32₁ > mark₁ > U32^1₁
proper₁ > U41₁ > mark₁ > U32^1₁
proper₁ > U51₂ > mark₁ > U32^1₁
proper₁ > U61₃ > mark₁ > U32^1₁
proper₁ > U62₃ > U63₃ > U64₃ > mark₁ > U32^1₁
proper₁ > 0 > mark₁ > U32^1₁
top > U32^1₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(80) Obligation:

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

U32¹(ok(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(81) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U32¹(ok(X)) → U32¹(X)

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

Lexicographic Path Order [LPO].
Precedence:

proper₁ > U13₁ > ok₁ > top > mark
proper₁ > U14₁ > ok₁ > top > mark
proper₁ > U31₁ > ok₁ > top > mark
proper₁ > U52₁ > ok₁ > top > mark
proper₁ > U61₁ > ok₁ > top > mark
proper₁ > U64₁ > plus₁ > ok₁ > top > mark
proper₁ > 0 > tt > mark

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(82) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(83) PisEmptyProof (EQUIVALENT transformation)

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

(84) TRUE

(85) Obligation:

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

U31¹(ok(X1), ok(X2)) → U31¹(X1, X2)
U31¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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.

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

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

Lexicographic Path Order [LPO].
Precedence:

tt > U13₁ > mark > U31^1₁
tt > U13₁ > mark > U12₂ > isNatKind₁ > ok₁
tt > U13₁ > mark > U14₁ > ok₁
tt > U13₁ > mark > U15₂ > U16₁ > ok₁
tt > U13₁ > mark > U23₁ > ok₁
tt > U13₁ > mark > U32₁ > ok₁
tt > U13₁ > mark > U41₁ > ok₁
tt > U13₁ > mark > U64₃ > ok₁
tt > U52₁ > mark > U31^1₁
tt > U52₁ > mark > U12₂ > isNatKind₁ > ok₁
tt > U52₁ > mark > U14₁ > ok₁
tt > U52₁ > mark > U15₂ > U16₁ > ok₁
tt > U52₁ > mark > U23₁ > ok₁
tt > U52₁ > mark > U32₁ > ok₁
tt > U52₁ > mark > U41₁ > ok₁
tt > U52₁ > mark > U64₃ > ok₁
tt > U62₂ > mark > U31^1₁
tt > U62₂ > mark > U12₂ > isNatKind₁ > ok₁
tt > U62₂ > mark > U14₁ > ok₁
tt > U62₂ > mark > U15₂ > U16₁ > ok₁
tt > U62₂ > mark > U23₁ > ok₁
tt > U62₂ > mark > U32₁ > ok₁
tt > U62₂ > mark > U41₁ > ok₁
tt > U62₂ > mark > U64₃ > ok₁
tt > s₁ > mark > U31^1₁
tt > s₁ > mark > U12₂ > isNatKind₁ > ok₁
tt > s₁ > mark > U14₁ > ok₁
tt > s₁ > mark > U15₂ > U16₁ > ok₁
tt > s₁ > mark > U23₁ > ok₁
tt > s₁ > mark > U32₁ > ok₁
tt > s₁ > mark > U41₁ > ok₁
tt > s₁ > mark > U64₃ > ok₁
tt > plus₁ > U11₃ > mark > U31^1₁
tt > plus₁ > U11₃ > mark > U12₂ > isNatKind₁ > ok₁
tt > plus₁ > U11₃ > mark > U14₁ > ok₁
tt > plus₁ > U11₃ > mark > U15₂ > U16₁ > ok₁
tt > plus₁ > U11₃ > mark > U23₁ > ok₁
tt > plus₁ > U11₃ > mark > U32₁ > ok₁
tt > plus₁ > U11₃ > mark > U41₁ > ok₁
tt > plus₁ > U11₃ > mark > U64₃ > ok₁
proper₁ > U13₁ > mark > U31^1₁
proper₁ > U13₁ > mark > U12₂ > isNatKind₁ > ok₁
proper₁ > U13₁ > mark > U14₁ > ok₁
proper₁ > U13₁ > mark > U15₂ > U16₁ > ok₁
proper₁ > U13₁ > mark > U23₁ > ok₁
proper₁ > U13₁ > mark > U32₁ > ok₁
proper₁ > U13₁ > mark > U41₁ > ok₁
proper₁ > U13₁ > mark > U64₃ > ok₁
proper₁ > U21₁ > mark > U31^1₁
proper₁ > U21₁ > mark > U12₂ > isNatKind₁ > ok₁
proper₁ > U21₁ > mark > U14₁ > ok₁
proper₁ > U21₁ > mark > U15₂ > U16₁ > ok₁
proper₁ > U21₁ > mark > U23₁ > ok₁
proper₁ > U21₁ > mark > U32₁ > ok₁
proper₁ > U21₁ > mark > U41₁ > ok₁
proper₁ > U21₁ > mark > U64₃ > ok₁
proper₁ > U51₁ > mark > U31^1₁
proper₁ > U51₁ > mark > U12₂ > isNatKind₁ > ok₁
proper₁ > U51₁ > mark > U14₁ > ok₁
proper₁ > U51₁ > mark > U15₂ > U16₁ > ok₁
proper₁ > U51₁ > mark > U23₁ > ok₁
proper₁ > U51₁ > mark > U32₁ > ok₁
proper₁ > U51₁ > mark > U41₁ > ok₁
proper₁ > U51₁ > mark > U64₃ > ok₁
proper₁ > U52₁ > mark > U31^1₁
proper₁ > U52₁ > mark > U12₂ > isNatKind₁ > ok₁
proper₁ > U52₁ > mark > U14₁ > ok₁
proper₁ > U52₁ > mark > U15₂ > U16₁ > ok₁
proper₁ > U52₁ > mark > U23₁ > ok₁
proper₁ > U52₁ > mark > U32₁ > ok₁
proper₁ > U52₁ > mark > U41₁ > ok₁
proper₁ > U52₁ > mark > U64₃ > ok₁
proper₁ > U62₂ > mark > U31^1₁
proper₁ > U62₂ > mark > U12₂ > isNatKind₁ > ok₁
proper₁ > U62₂ > mark > U14₁ > ok₁
proper₁ > U62₂ > mark > U15₂ > U16₁ > ok₁
proper₁ > U62₂ > mark > U23₁ > ok₁
proper₁ > U62₂ > mark > U32₁ > ok₁
proper₁ > U62₂ > mark > U41₁ > ok₁
proper₁ > U62₂ > mark > U64₃ > ok₁
proper₁ > s₁ > mark > U31^1₁
proper₁ > s₁ > mark > U12₂ > isNatKind₁ > ok₁
proper₁ > s₁ > mark > U14₁ > ok₁
proper₁ > s₁ > mark > U15₂ > U16₁ > ok₁
proper₁ > s₁ > mark > U23₁ > ok₁
proper₁ > s₁ > mark > U32₁ > ok₁
proper₁ > s₁ > mark > U41₁ > ok₁
proper₁ > s₁ > mark > U64₃ > ok₁
proper₁ > plus₁ > U11₃ > mark > U31^1₁
proper₁ > plus₁ > U11₃ > mark > U12₂ > isNatKind₁ > ok₁
proper₁ > plus₁ > U11₃ > mark > U14₁ > ok₁
proper₁ > plus₁ > U11₃ > mark > U15₂ > U16₁ > ok₁
proper₁ > plus₁ > U11₃ > mark > U23₁ > ok₁
proper₁ > plus₁ > U11₃ > mark > U32₁ > ok₁
proper₁ > plus₁ > U11₃ > mark > U41₁ > ok₁
proper₁ > plus₁ > U11₃ > mark > U64₃ > ok₁
proper₁ > 0 > mark > U31^1₁
proper₁ > 0 > mark > U12₂ > isNatKind₁ > ok₁
proper₁ > 0 > mark > U14₁ > ok₁
proper₁ > 0 > mark > U15₂ > U16₁ > ok₁
proper₁ > 0 > mark > U23₁ > ok₁
proper₁ > 0 > mark > U32₁ > ok₁
proper₁ > 0 > mark > U41₁ > ok₁
proper₁ > 0 > mark > U64₃ > ok₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(87) Obligation:

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

U31¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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.

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

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

Lexicographic Path Order [LPO].
Precedence:

U31^1₂ > mark₁
active₁ > U12₃ > isNatKind > tt > mark₁
active₁ > U12₃ > U13₃ > mark₁
active₁ > U14₃ > mark₁
active₁ > U15₂ > mark₁
active₁ > U16₁ > tt > mark₁
active₁ > U21₂ > isNatKind > tt > mark₁
active₁ > U21₂ > U22₂ > mark₁
active₁ > U23₁ > tt > mark₁
active₁ > U51₂ > isNatKind > tt > mark₁
active₁ > U52₂ > mark₁
active₁ > U63₃ > isNatKind > tt > mark₁
active₁ > U63₃ > U64₃ > mark₁
active₁ > s₁ > isNat₁ > U11₃ > mark₁
active₁ > s₁ > isNat₁ > isNatKind > tt > mark₁
active₁ > s₁ > U41₁ > tt > mark₁
active₁ > s₁ > U61₃ > isNatKind > tt > mark₁
active₁ > s₁ > U61₃ > U62₃ > mark₁
active₁ > plus₂ > U11₃ > mark₁
active₁ > plus₂ > U31₁ > isNatKind > tt > mark₁
active₁ > plus₂ > U31₁ > U32₁ > tt > mark₁
active₁ > plus₂ > U61₃ > isNatKind > tt > mark₁
active₁ > plus₂ > U61₃ > U62₃ > mark₁
proper₁ > U12₃ > isNatKind > tt > mark₁
proper₁ > U12₃ > U13₃ > mark₁
proper₁ > U14₃ > mark₁
proper₁ > U15₂ > mark₁
proper₁ > U16₁ > tt > mark₁
proper₁ > U21₂ > isNatKind > tt > mark₁
proper₁ > U21₂ > U22₂ > mark₁
proper₁ > U23₁ > tt > mark₁
proper₁ > U51₂ > isNatKind > tt > mark₁
proper₁ > U52₂ > mark₁
proper₁ > U63₃ > isNatKind > tt > mark₁
proper₁ > U63₃ > U64₃ > mark₁
proper₁ > s₁ > isNat₁ > U11₃ > mark₁
proper₁ > s₁ > isNat₁ > isNatKind > tt > mark₁
proper₁ > s₁ > U41₁ > tt > mark₁
proper₁ > s₁ > U61₃ > isNatKind > tt > mark₁
proper₁ > s₁ > U61₃ > U62₃ > mark₁
proper₁ > plus₂ > U11₃ > mark₁
proper₁ > plus₂ > U31₁ > isNatKind > tt > mark₁
proper₁ > plus₂ > U31₁ > U32₁ > tt > mark₁
proper₁ > plus₂ > U61₃ > isNatKind > tt > mark₁
proper₁ > plus₂ > U61₃ > U62₃ > mark₁
proper₁ > 0 > tt > mark₁
top > mark₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(89) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(90) PisEmptyProof (EQUIVALENT transformation)

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

(91) TRUE

(92) Obligation:

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

U23¹(ok(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(93) 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: Combined order from the following AFS and order.
U23¹(x1)  =  U23¹(x1)
ok(x1)  =  x1
mark(x1)  =  mark(x1)
active(x1)  =  active(x1)
U11(x1, x2, x3)  =  U11(x1, x2, x3)
tt  =  tt
U12(x1, x2, x3)  =  U12(x1, x2, x3)
isNatKind(x1)  =  x1
U13(x1, x2, x3)  =  U13(x1, x2, x3)
U14(x1, x2, x3)  =  U14(x1, x2, x3)
U15(x1, x2)  =  U15(x1, x2)
isNat(x1)  =  isNat(x1)
U16(x1)  =  U16(x1)
U21(x1, x2)  =  U21(x1, x2)
U22(x1, x2)  =  U22(x1, x2)
U23(x1)  =  U23(x1)
U31(x1, x2)  =  U31(x1, x2)
U32(x1)  =  U32(x1)
U41(x1)  =  U41(x1)
U51(x1, x2)  =  U51(x1, x2)
U52(x1, x2)  =  U52(x1, x2)
U61(x1, x2, x3)  =  U61(x1, x2, x3)
U62(x1, x2, x3)  =  U62(x1, x2, x3)
U63(x1, x2, x3)  =  U63(x1, x2, x3)
U64(x1, x2, x3)  =  U64(x1, x2, x3)
s(x1)  =  x1
plus(x1, x2)  =  plus(x1, x2)
0  =  0
proper(x1)  =  proper(x1)
top(x1)  =  top

Lexicographic Path Order [LPO].
Precedence:

active₁ > tt > U13₃ > mark₁ > U23^1₁
active₁ > tt > U14₃ > U15₂ > mark₁ > U23^1₁
active₁ > tt > U16₁ > mark₁ > U23^1₁
active₁ > tt > U22₂ > U23₁ > mark₁ > U23^1₁
active₁ > tt > U52₂ > mark₁ > U23^1₁
active₁ > tt > U63₃ > U64₃ > mark₁ > U23^1₁
active₁ > tt > plus₂ > mark₁ > U23^1₁
active₁ > U12₃ > U13₃ > mark₁ > U23^1₁
active₁ > isNat₁ > U11₃ > mark₁ > U23^1₁
active₁ > U21₂ > U22₂ > U23₁ > mark₁ > U23^1₁
active₁ > U31₂ > mark₁ > U23^1₁
active₁ > U32₁ > mark₁ > U23^1₁
active₁ > U41₁ > mark₁ > U23^1₁
active₁ > U51₂ > mark₁ > U23^1₁
active₁ > U61₃ > mark₁ > U23^1₁
active₁ > U62₃ > U63₃ > U64₃ > mark₁ > U23^1₁
proper₁ > tt > U13₃ > mark₁ > U23^1₁
proper₁ > tt > U14₃ > U15₂ > mark₁ > U23^1₁
proper₁ > tt > U16₁ > mark₁ > U23^1₁
proper₁ > tt > U22₂ > U23₁ > mark₁ > U23^1₁
proper₁ > tt > U52₂ > mark₁ > U23^1₁
proper₁ > tt > U63₃ > U64₃ > mark₁ > U23^1₁
proper₁ > tt > plus₂ > mark₁ > U23^1₁
proper₁ > U12₃ > U13₃ > mark₁ > U23^1₁
proper₁ > isNat₁ > U11₃ > mark₁ > U23^1₁
proper₁ > U21₂ > U22₂ > U23₁ > mark₁ > U23^1₁
proper₁ > U31₂ > mark₁ > U23^1₁
proper₁ > U32₁ > mark₁ > U23^1₁
proper₁ > U41₁ > mark₁ > U23^1₁
proper₁ > U51₂ > mark₁ > U23^1₁
proper₁ > U61₃ > mark₁ > U23^1₁
proper₁ > U62₃ > U63₃ > U64₃ > mark₁ > U23^1₁
proper₁ > 0 > mark₁ > U23^1₁
top > U23^1₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(94) Obligation:

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

U23¹(ok(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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.

U23¹(ok(X)) → U23¹(X)

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

Lexicographic Path Order [LPO].
Precedence:

proper₁ > U13₁ > ok₁ > top > mark
proper₁ > U14₁ > ok₁ > top > mark
proper₁ > U31₁ > ok₁ > top > mark
proper₁ > U52₁ > ok₁ > top > mark
proper₁ > U61₁ > ok₁ > top > mark
proper₁ > U64₁ > plus₁ > ok₁ > top > mark
proper₁ > 0 > tt > mark

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(96) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(97) PisEmptyProof (EQUIVALENT transformation)

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

(98) TRUE

(99) Obligation:

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

U22¹(ok(X1), ok(X2)) → U22¹(X1, X2)
U22¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(100) 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: Combined order from the following AFS and order.
U22¹(x1, x2)  =  x1
ok(x1)  =  x1
mark(x1)  =  mark(x1)
active(x1)  =  active(x1)
U11(x1, x2, x3)  =  x1
tt  =  tt
U12(x1, x2, x3)  =  U12(x1)
isNatKind(x1)  =  isNatKind
U13(x1, x2, x3)  =  U13(x1)
U14(x1, x2, x3)  =  U14(x1)
U15(x1, x2)  =  x1
isNat(x1)  =  isNat
U16(x1)  =  U16(x1)
U21(x1, x2)  =  x1
U22(x1, x2)  =  x1
U23(x1)  =  U23(x1)
U31(x1, x2)  =  U31(x1)
U32(x1)  =  x1
U41(x1)  =  U41(x1)
U51(x1, x2)  =  U51(x1, x2)
U52(x1, x2)  =  U52(x1, x2)
U61(x1, x2, x3)  =  U61(x1, x2, x3)
U62(x1, x2, x3)  =  U62(x1, x2, x3)
U63(x1, x2, x3)  =  U63(x1, x2, x3)
U64(x1, x2, x3)  =  U64(x1, x2, x3)
s(x1)  =  s(x1)
plus(x1, x2)  =  plus(x1, x2)
0  =  0
proper(x1)  =  x1
top(x1)  =  top

Lexicographic Path Order [LPO].
Precedence:

active₁ > U12₁ > isNatKind > tt > U14₁ > mark₁
active₁ > U12₁ > isNatKind > tt > isNat > mark₁
active₁ > U12₁ > isNatKind > tt > U62₃ > mark₁
active₁ > U12₁ > isNatKind > tt > U63₃ > mark₁
active₁ > U12₁ > isNatKind > tt > U64₃ > mark₁
active₁ > U12₁ > isNatKind > tt > s₁ > mark₁
active₁ > U12₁ > isNatKind > tt > plus₂ > mark₁
active₁ > U12₁ > isNatKind > U41₁ > mark₁
active₁ > U12₁ > U13₁ > U14₁ > mark₁
active₁ > U16₁ > tt > U14₁ > mark₁
active₁ > U16₁ > tt > isNat > mark₁
active₁ > U16₁ > tt > U62₃ > mark₁
active₁ > U16₁ > tt > U63₃ > mark₁
active₁ > U16₁ > tt > U64₃ > mark₁
active₁ > U16₁ > tt > s₁ > mark₁
active₁ > U16₁ > tt > plus₂ > mark₁
active₁ > U23₁ > tt > U14₁ > mark₁
active₁ > U23₁ > tt > isNat > mark₁
active₁ > U23₁ > tt > U62₃ > mark₁
active₁ > U23₁ > tt > U63₃ > mark₁
active₁ > U23₁ > tt > U64₃ > mark₁
active₁ > U23₁ > tt > s₁ > mark₁
active₁ > U23₁ > tt > plus₂ > mark₁
active₁ > U31₁ > isNatKind > tt > U14₁ > mark₁
active₁ > U31₁ > isNatKind > tt > isNat > mark₁
active₁ > U31₁ > isNatKind > tt > U62₃ > mark₁
active₁ > U31₁ > isNatKind > tt > U63₃ > mark₁
active₁ > U31₁ > isNatKind > tt > U64₃ > mark₁
active₁ > U31₁ > isNatKind > tt > s₁ > mark₁
active₁ > U31₁ > isNatKind > tt > plus₂ > mark₁
active₁ > U31₁ > isNatKind > U41₁ > mark₁
active₁ > U51₂ > U52₂ > mark₁
active₁ > U61₃ > mark₁
0 > mark₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(101) Obligation:

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

U22¹(ok(X1), ok(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(102) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

Lexicographic Path Order [LPO].
Precedence:

0 > tt > ok₁ > mark
0 > U51₂ > U52₂ > ok₁ > mark
proper₁ > U11₁ > ok₁ > mark
proper₁ > U12₂ > ok₁ > mark
proper₁ > isNatKind₁ > tt > ok₁ > mark
proper₁ > isNatKind₁ > U31₁ > ok₁ > mark
proper₁ > isNatKind₁ > U41₁ > ok₁ > mark
proper₁ > U14₂ > ok₁ > mark
proper₁ > U16₁ > tt > ok₁ > mark
proper₁ > U21₂ > ok₁ > mark
proper₁ > U22₂ > ok₁ > mark
proper₁ > U23₁ > ok₁ > mark
proper₁ > U32₁ > tt > ok₁ > mark
proper₁ > U51₂ > U52₂ > ok₁ > mark
proper₁ > U62₁ > ok₁ > mark
proper₁ > U63₁ > ok₁ > mark
top > mark

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(103) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(104) PisEmptyProof (EQUIVALENT transformation)

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

(105) TRUE

(106) Obligation:

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

U21¹(ok(X1), ok(X2)) → U21¹(X1, X2)
U21¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(107) 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: Combined order from the following AFS and order.
U21¹(x1, x2)  =  x1
ok(x1)  =  x1
mark(x1)  =  mark(x1)
active(x1)  =  active(x1)
U11(x1, x2, x3)  =  x1
tt  =  tt
U12(x1, x2, x3)  =  U12(x1)
isNatKind(x1)  =  isNatKind
U13(x1, x2, x3)  =  U13(x1)
U14(x1, x2, x3)  =  U14(x1)
U15(x1, x2)  =  x1
isNat(x1)  =  isNat
U16(x1)  =  U16(x1)
U21(x1, x2)  =  x1
U22(x1, x2)  =  x1
U23(x1)  =  U23(x1)
U31(x1, x2)  =  U31(x1)
U32(x1)  =  x1
U41(x1)  =  U41(x1)
U51(x1, x2)  =  U51(x1, x2)
U52(x1, x2)  =  U52(x1, x2)
U61(x1, x2, x3)  =  U61(x1, x2, x3)
U62(x1, x2, x3)  =  U62(x1, x2, x3)
U63(x1, x2, x3)  =  U63(x1, x2, x3)
U64(x1, x2, x3)  =  U64(x1, x2, x3)
s(x1)  =  s(x1)
plus(x1, x2)  =  plus(x1, x2)
0  =  0
proper(x1)  =  x1
top(x1)  =  top

Lexicographic Path Order [LPO].
Precedence:

active₁ > U12₁ > isNatKind > tt > U14₁ > mark₁
active₁ > U12₁ > isNatKind > tt > isNat > mark₁
active₁ > U12₁ > isNatKind > tt > U62₃ > mark₁
active₁ > U12₁ > isNatKind > tt > U63₃ > mark₁
active₁ > U12₁ > isNatKind > tt > U64₃ > mark₁
active₁ > U12₁ > isNatKind > tt > s₁ > mark₁
active₁ > U12₁ > isNatKind > tt > plus₂ > mark₁
active₁ > U12₁ > isNatKind > U41₁ > mark₁
active₁ > U12₁ > U13₁ > U14₁ > mark₁
active₁ > U16₁ > tt > U14₁ > mark₁
active₁ > U16₁ > tt > isNat > mark₁
active₁ > U16₁ > tt > U62₃ > mark₁
active₁ > U16₁ > tt > U63₃ > mark₁
active₁ > U16₁ > tt > U64₃ > mark₁
active₁ > U16₁ > tt > s₁ > mark₁
active₁ > U16₁ > tt > plus₂ > mark₁
active₁ > U23₁ > tt > U14₁ > mark₁
active₁ > U23₁ > tt > isNat > mark₁
active₁ > U23₁ > tt > U62₃ > mark₁
active₁ > U23₁ > tt > U63₃ > mark₁
active₁ > U23₁ > tt > U64₃ > mark₁
active₁ > U23₁ > tt > s₁ > mark₁
active₁ > U23₁ > tt > plus₂ > mark₁
active₁ > U31₁ > isNatKind > tt > U14₁ > mark₁
active₁ > U31₁ > isNatKind > tt > isNat > mark₁
active₁ > U31₁ > isNatKind > tt > U62₃ > mark₁
active₁ > U31₁ > isNatKind > tt > U63₃ > mark₁
active₁ > U31₁ > isNatKind > tt > U64₃ > mark₁
active₁ > U31₁ > isNatKind > tt > s₁ > mark₁
active₁ > U31₁ > isNatKind > tt > plus₂ > mark₁
active₁ > U31₁ > isNatKind > U41₁ > mark₁
active₁ > U51₂ > U52₂ > mark₁
active₁ > U61₃ > mark₁
0 > mark₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(108) Obligation:

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

U21¹(ok(X1), ok(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(109) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

Lexicographic Path Order [LPO].
Precedence:

0 > tt > ok₁ > mark
0 > U51₂ > U52₂ > ok₁ > mark
proper₁ > U11₁ > ok₁ > mark
proper₁ > U12₂ > ok₁ > mark
proper₁ > isNatKind₁ > tt > ok₁ > mark
proper₁ > isNatKind₁ > U31₁ > ok₁ > mark
proper₁ > isNatKind₁ > U41₁ > ok₁ > mark
proper₁ > U14₂ > ok₁ > mark
proper₁ > U16₁ > tt > ok₁ > mark
proper₁ > U21₂ > ok₁ > mark
proper₁ > U22₂ > ok₁ > mark
proper₁ > U23₁ > ok₁ > mark
proper₁ > U32₁ > tt > ok₁ > mark
proper₁ > U51₂ > U52₂ > ok₁ > mark
proper₁ > U62₁ > ok₁ > mark
proper₁ > U63₁ > ok₁ > mark
top > mark

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(110) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(111) PisEmptyProof (EQUIVALENT transformation)

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

(112) TRUE

(113) Obligation:

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

U16¹(ok(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(114) 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: Combined order from the following AFS and order.
U16¹(x1)  =  U16¹(x1)
ok(x1)  =  x1
mark(x1)  =  mark(x1)
active(x1)  =  active(x1)
U11(x1, x2, x3)  =  U11(x1, x2, x3)
tt  =  tt
U12(x1, x2, x3)  =  U12(x1, x2, x3)
isNatKind(x1)  =  x1
U13(x1, x2, x3)  =  U13(x1, x2, x3)
U14(x1, x2, x3)  =  U14(x1, x2, x3)
U15(x1, x2)  =  U15(x1, x2)
isNat(x1)  =  isNat(x1)
U16(x1)  =  U16(x1)
U21(x1, x2)  =  U21(x1, x2)
U22(x1, x2)  =  U22(x1, x2)
U23(x1)  =  U23(x1)
U31(x1, x2)  =  U31(x1, x2)
U32(x1)  =  U32(x1)
U41(x1)  =  U41(x1)
U51(x1, x2)  =  U51(x1, x2)
U52(x1, x2)  =  U52(x1, x2)
U61(x1, x2, x3)  =  U61(x1, x2, x3)
U62(x1, x2, x3)  =  U62(x1, x2, x3)
U63(x1, x2, x3)  =  U63(x1, x2, x3)
U64(x1, x2, x3)  =  U64(x1, x2, x3)
s(x1)  =  x1
plus(x1, x2)  =  plus(x1, x2)
0  =  0
proper(x1)  =  proper(x1)
top(x1)  =  top

Lexicographic Path Order [LPO].
Precedence:

active₁ > tt > U13₃ > mark₁ > U16^1₁
active₁ > tt > U14₃ > U15₂ > mark₁ > U16^1₁
active₁ > tt > U16₁ > mark₁ > U16^1₁
active₁ > tt > U22₂ > U23₁ > mark₁ > U16^1₁
active₁ > tt > U52₂ > mark₁ > U16^1₁
active₁ > tt > U63₃ > U64₃ > mark₁ > U16^1₁
active₁ > tt > plus₂ > mark₁ > U16^1₁
active₁ > U12₃ > U13₃ > mark₁ > U16^1₁
active₁ > isNat₁ > U11₃ > mark₁ > U16^1₁
active₁ > U21₂ > U22₂ > U23₁ > mark₁ > U16^1₁
active₁ > U31₂ > mark₁ > U16^1₁
active₁ > U32₁ > mark₁ > U16^1₁
active₁ > U41₁ > mark₁ > U16^1₁
active₁ > U51₂ > mark₁ > U16^1₁
active₁ > U61₃ > mark₁ > U16^1₁
active₁ > U62₃ > U63₃ > U64₃ > mark₁ > U16^1₁
proper₁ > tt > U13₃ > mark₁ > U16^1₁
proper₁ > tt > U14₃ > U15₂ > mark₁ > U16^1₁
proper₁ > tt > U16₁ > mark₁ > U16^1₁
proper₁ > tt > U22₂ > U23₁ > mark₁ > U16^1₁
proper₁ > tt > U52₂ > mark₁ > U16^1₁
proper₁ > tt > U63₃ > U64₃ > mark₁ > U16^1₁
proper₁ > tt > plus₂ > mark₁ > U16^1₁
proper₁ > U12₃ > U13₃ > mark₁ > U16^1₁
proper₁ > isNat₁ > U11₃ > mark₁ > U16^1₁
proper₁ > U21₂ > U22₂ > U23₁ > mark₁ > U16^1₁
proper₁ > U31₂ > mark₁ > U16^1₁
proper₁ > U32₁ > mark₁ > U16^1₁
proper₁ > U41₁ > mark₁ > U16^1₁
proper₁ > U51₂ > mark₁ > U16^1₁
proper₁ > U61₃ > mark₁ > U16^1₁
proper₁ > U62₃ > U63₃ > U64₃ > mark₁ > U16^1₁
proper₁ > 0 > mark₁ > U16^1₁
top > U16^1₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(115) Obligation:

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

U16¹(ok(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(116) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U16¹(ok(X)) → U16¹(X)

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

Lexicographic Path Order [LPO].
Precedence:

proper₁ > U13₁ > ok₁ > top > mark
proper₁ > U14₁ > ok₁ > top > mark
proper₁ > U31₁ > ok₁ > top > mark
proper₁ > U52₁ > ok₁ > top > mark
proper₁ > U61₁ > ok₁ > top > mark
proper₁ > U64₁ > plus₁ > ok₁ > top > mark
proper₁ > 0 > tt > mark

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(117) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(118) PisEmptyProof (EQUIVALENT transformation)

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

(119) TRUE

(120) Obligation:

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

U15¹(ok(X1), ok(X2)) → U15¹(X1, X2)
U15¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(121) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

Lexicographic Path Order [LPO].
Precedence:

0 > tt > U14₁ > mark > U15^1₁
0 > tt > U14₁ > mark > U12₂ > isNatKind₁ > ok₁
0 > tt > U14₁ > mark > U12₂ > U13₃ > ok₁
0 > tt > U14₁ > mark > U16₁ > ok₁
0 > tt > U14₁ > mark > U21₁ > ok₁
0 > tt > U14₁ > mark > U32₁ > ok₁
0 > tt > U14₁ > mark > U41₁ > ok₁
0 > tt > U14₁ > mark > U64₃ > ok₁
0 > tt > U15₂ > mark > U15^1₁
0 > tt > U15₂ > mark > U12₂ > isNatKind₁ > ok₁
0 > tt > U15₂ > mark > U12₂ > U13₃ > ok₁
0 > tt > U15₂ > mark > U16₁ > ok₁
0 > tt > U15₂ > mark > U21₁ > ok₁
0 > tt > U15₂ > mark > U32₁ > ok₁
0 > tt > U15₂ > mark > U41₁ > ok₁
0 > tt > U15₂ > mark > U64₃ > ok₁
0 > tt > U23₁ > mark > U15^1₁
0 > tt > U23₁ > mark > U12₂ > isNatKind₁ > ok₁
0 > tt > U23₁ > mark > U12₂ > U13₃ > ok₁
0 > tt > U23₁ > mark > U16₁ > ok₁
0 > tt > U23₁ > mark > U21₁ > ok₁
0 > tt > U23₁ > mark > U32₁ > ok₁
0 > tt > U23₁ > mark > U41₁ > ok₁
0 > tt > U23₁ > mark > U64₃ > ok₁
0 > tt > U52₁ > mark > U15^1₁
0 > tt > U52₁ > mark > U12₂ > isNatKind₁ > ok₁
0 > tt > U52₁ > mark > U12₂ > U13₃ > ok₁
0 > tt > U52₁ > mark > U16₁ > ok₁
0 > tt > U52₁ > mark > U21₁ > ok₁
0 > tt > U52₁ > mark > U32₁ > ok₁
0 > tt > U52₁ > mark > U41₁ > ok₁
0 > tt > U52₁ > mark > U64₃ > ok₁
0 > tt > U62₂ > mark > U15^1₁
0 > tt > U62₂ > mark > U12₂ > isNatKind₁ > ok₁
0 > tt > U62₂ > mark > U12₂ > U13₃ > ok₁
0 > tt > U62₂ > mark > U16₁ > ok₁
0 > tt > U62₂ > mark > U21₁ > ok₁
0 > tt > U62₂ > mark > U32₁ > ok₁
0 > tt > U62₂ > mark > U41₁ > ok₁
0 > tt > U62₂ > mark > U64₃ > ok₁
0 > tt > s₁ > mark > U15^1₁
0 > tt > s₁ > mark > U12₂ > isNatKind₁ > ok₁
0 > tt > s₁ > mark > U12₂ > U13₃ > ok₁
0 > tt > s₁ > mark > U16₁ > ok₁
0 > tt > s₁ > mark > U21₁ > ok₁
0 > tt > s₁ > mark > U32₁ > ok₁
0 > tt > s₁ > mark > U41₁ > ok₁
0 > tt > s₁ > mark > U64₃ > ok₁
0 > tt > plus₁ > mark > U15^1₁
0 > tt > plus₁ > mark > U12₂ > isNatKind₁ > ok₁
0 > tt > plus₁ > mark > U12₂ > U13₃ > ok₁
0 > tt > plus₁ > mark > U16₁ > ok₁
0 > tt > plus₁ > mark > U21₁ > ok₁
0 > tt > plus₁ > mark > U32₁ > ok₁
0 > tt > plus₁ > mark > U41₁ > ok₁
0 > tt > plus₁ > mark > U64₃ > ok₁
0 > U51₁ > mark > U15^1₁
0 > U51₁ > mark > U12₂ > isNatKind₁ > ok₁
0 > U51₁ > mark > U12₂ > U13₃ > ok₁
0 > U51₁ > mark > U16₁ > ok₁
0 > U51₁ > mark > U21₁ > ok₁
0 > U51₁ > mark > U32₁ > ok₁
0 > U51₁ > mark > U41₁ > ok₁
0 > U51₁ > mark > U64₃ > ok₁
proper₁ > U11₃ > mark > U15^1₁
proper₁ > U11₃ > mark > U12₂ > isNatKind₁ > ok₁
proper₁ > U11₃ > mark > U12₂ > U13₃ > ok₁
proper₁ > U11₃ > mark > U16₁ > ok₁
proper₁ > U11₃ > mark > U21₁ > ok₁
proper₁ > U11₃ > mark > U32₁ > ok₁
proper₁ > U11₃ > mark > U41₁ > ok₁
proper₁ > U11₃ > mark > U64₃ > ok₁
proper₁ > U14₁ > mark > U15^1₁
proper₁ > U14₁ > mark > U12₂ > isNatKind₁ > ok₁
proper₁ > U14₁ > mark > U12₂ > U13₃ > ok₁
proper₁ > U14₁ > mark > U16₁ > ok₁
proper₁ > U14₁ > mark > U21₁ > ok₁
proper₁ > U14₁ > mark > U32₁ > ok₁
proper₁ > U14₁ > mark > U41₁ > ok₁
proper₁ > U14₁ > mark > U64₃ > ok₁
proper₁ > U15₂ > mark > U15^1₁
proper₁ > U15₂ > mark > U12₂ > isNatKind₁ > ok₁
proper₁ > U15₂ > mark > U12₂ > U13₃ > ok₁
proper₁ > U15₂ > mark > U16₁ > ok₁
proper₁ > U15₂ > mark > U21₁ > ok₁
proper₁ > U15₂ > mark > U32₁ > ok₁
proper₁ > U15₂ > mark > U41₁ > ok₁
proper₁ > U15₂ > mark > U64₃ > ok₁
proper₁ > U23₁ > mark > U15^1₁
proper₁ > U23₁ > mark > U12₂ > isNatKind₁ > ok₁
proper₁ > U23₁ > mark > U12₂ > U13₃ > ok₁
proper₁ > U23₁ > mark > U16₁ > ok₁
proper₁ > U23₁ > mark > U21₁ > ok₁
proper₁ > U23₁ > mark > U32₁ > ok₁
proper₁ > U23₁ > mark > U41₁ > ok₁
proper₁ > U23₁ > mark > U64₃ > ok₁
proper₁ > U51₁ > mark > U15^1₁
proper₁ > U51₁ > mark > U12₂ > isNatKind₁ > ok₁
proper₁ > U51₁ > mark > U12₂ > U13₃ > ok₁
proper₁ > U51₁ > mark > U16₁ > ok₁
proper₁ > U51₁ > mark > U21₁ > ok₁
proper₁ > U51₁ > mark > U32₁ > ok₁
proper₁ > U51₁ > mark > U41₁ > ok₁
proper₁ > U51₁ > mark > U64₃ > ok₁
proper₁ > U52₁ > mark > U15^1₁
proper₁ > U52₁ > mark > U12₂ > isNatKind₁ > ok₁
proper₁ > U52₁ > mark > U12₂ > U13₃ > ok₁
proper₁ > U52₁ > mark > U16₁ > ok₁
proper₁ > U52₁ > mark > U21₁ > ok₁
proper₁ > U52₁ > mark > U32₁ > ok₁
proper₁ > U52₁ > mark > U41₁ > ok₁
proper₁ > U52₁ > mark > U64₃ > ok₁
proper₁ > U62₂ > mark > U15^1₁
proper₁ > U62₂ > mark > U12₂ > isNatKind₁ > ok₁
proper₁ > U62₂ > mark > U12₂ > U13₃ > ok₁
proper₁ > U62₂ > mark > U16₁ > ok₁
proper₁ > U62₂ > mark > U21₁ > ok₁
proper₁ > U62₂ > mark > U32₁ > ok₁
proper₁ > U62₂ > mark > U41₁ > ok₁
proper₁ > U62₂ > mark > U64₃ > ok₁
proper₁ > s₁ > mark > U15^1₁
proper₁ > s₁ > mark > U12₂ > isNatKind₁ > ok₁
proper₁ > s₁ > mark > U12₂ > U13₃ > ok₁
proper₁ > s₁ > mark > U16₁ > ok₁
proper₁ > s₁ > mark > U21₁ > ok₁
proper₁ > s₁ > mark > U32₁ > ok₁
proper₁ > s₁ > mark > U41₁ > ok₁
proper₁ > s₁ > mark > U64₃ > ok₁
proper₁ > plus₁ > mark > U15^1₁
proper₁ > plus₁ > mark > U12₂ > isNatKind₁ > ok₁
proper₁ > plus₁ > mark > U12₂ > U13₃ > ok₁
proper₁ > plus₁ > mark > U16₁ > ok₁
proper₁ > plus₁ > mark > U21₁ > ok₁
proper₁ > plus₁ > mark > U32₁ > ok₁
proper₁ > plus₁ > mark > U41₁ > ok₁
proper₁ > plus₁ > mark > U64₃ > ok₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(122) Obligation:

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

U15¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(123) 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: Combined order from the following AFS and order.
U15¹(x1, x2)  =  U15¹(x1)
mark(x1)  =  mark(x1)
active(x1)  =  active(x1)
U11(x1, x2, x3)  =  x1
tt  =  tt
U12(x1, x2, x3)  =  U12(x1)
isNatKind(x1)  =  isNatKind
U13(x1, x2, x3)  =  U13(x1)
U14(x1, x2, x3)  =  x1
U15(x1, x2)  =  U15(x1)
isNat(x1)  =  isNat
U16(x1)  =  U16(x1)
U21(x1, x2)  =  U21(x1)
U22(x1, x2)  =  U22(x1)
U23(x1)  =  U23(x1)
U31(x1, x2)  =  U31(x1)
U32(x1)  =  U32(x1)
U41(x1)  =  U41(x1)
U51(x1, x2)  =  U51(x1, x2)
U52(x1, x2)  =  U52(x1, x2)
U61(x1, x2, x3)  =  U61(x1, x2, x3)
U62(x1, x2, x3)  =  U62(x1, x2, x3)
U63(x1, x2, x3)  =  U63(x1, x2, x3)
U64(x1, x2, x3)  =  U64(x1, x2, x3)
s(x1)  =  s(x1)
plus(x1, x2)  =  plus(x1, x2)
0  =  0
proper(x1)  =  proper(x1)
ok(x1)  =  x1
top(x1)  =  top

Lexicographic Path Order [LPO].
Precedence:

active₁ > U12₁ > isNatKind > U41₁ > mark₁ > U15^1₁ > top
active₁ > U13₁ > isNatKind > U41₁ > mark₁ > U15^1₁ > top
active₁ > U15₁ > isNat > isNatKind > U41₁ > mark₁ > U15^1₁ > top
active₁ > U15₁ > U16₁ > mark₁ > U15^1₁ > top
active₁ > U21₁ > isNatKind > U41₁ > mark₁ > U15^1₁ > top
active₁ > U22₁ > mark₁ > U15^1₁ > top
active₁ > U23₁ > tt > isNatKind > U41₁ > mark₁ > U15^1₁ > top
active₁ > U23₁ > tt > U16₁ > mark₁ > U15^1₁ > top
active₁ > U23₁ > tt > U52₂ > mark₁ > U15^1₁ > top
active₁ > U23₁ > tt > U63₃ > mark₁ > U15^1₁ > top
active₁ > U23₁ > tt > U64₃ > mark₁ > U15^1₁ > top
active₁ > U23₁ > tt > s₁ > mark₁ > U15^1₁ > top
active₁ > U31₁ > isNatKind > U41₁ > mark₁ > U15^1₁ > top
active₁ > U32₁ > tt > isNatKind > U41₁ > mark₁ > U15^1₁ > top
active₁ > U32₁ > tt > U16₁ > mark₁ > U15^1₁ > top
active₁ > U32₁ > tt > U52₂ > mark₁ > U15^1₁ > top
active₁ > U32₁ > tt > U63₃ > mark₁ > U15^1₁ > top
active₁ > U32₁ > tt > U64₃ > mark₁ > U15^1₁ > top
active₁ > U32₁ > tt > s₁ > mark₁ > U15^1₁ > top
active₁ > U61₃ > U62₃ > isNat > isNatKind > U41₁ > mark₁ > U15^1₁ > top
active₁ > U61₃ > U62₃ > U63₃ > mark₁ > U15^1₁ > top
active₁ > plus₂ > isNat > isNatKind > U41₁ > mark₁ > U15^1₁ > top
active₁ > plus₂ > U51₂ > mark₁ > U15^1₁ > top
proper₁ > U12₁ > isNatKind > U41₁ > mark₁ > U15^1₁ > top
proper₁ > U13₁ > isNatKind > U41₁ > mark₁ > U15^1₁ > top
proper₁ > U15₁ > isNat > isNatKind > U41₁ > mark₁ > U15^1₁ > top
proper₁ > U15₁ > U16₁ > mark₁ > U15^1₁ > top
proper₁ > U21₁ > isNatKind > U41₁ > mark₁ > U15^1₁ > top
proper₁ > U22₁ > mark₁ > U15^1₁ > top
proper₁ > U23₁ > tt > isNatKind > U41₁ > mark₁ > U15^1₁ > top
proper₁ > U23₁ > tt > U16₁ > mark₁ > U15^1₁ > top
proper₁ > U23₁ > tt > U52₂ > mark₁ > U15^1₁ > top
proper₁ > U23₁ > tt > U63₃ > mark₁ > U15^1₁ > top
proper₁ > U23₁ > tt > U64₃ > mark₁ > U15^1₁ > top
proper₁ > U23₁ > tt > s₁ > mark₁ > U15^1₁ > top
proper₁ > U31₁ > isNatKind > U41₁ > mark₁ > U15^1₁ > top
proper₁ > U32₁ > tt > isNatKind > U41₁ > mark₁ > U15^1₁ > top
proper₁ > U32₁ > tt > U16₁ > mark₁ > U15^1₁ > top
proper₁ > U32₁ > tt > U52₂ > mark₁ > U15^1₁ > top
proper₁ > U32₁ > tt > U63₃ > mark₁ > U15^1₁ > top
proper₁ > U32₁ > tt > U64₃ > mark₁ > U15^1₁ > top
proper₁ > U32₁ > tt > s₁ > mark₁ > U15^1₁ > top
proper₁ > U61₃ > U62₃ > isNat > isNatKind > U41₁ > mark₁ > U15^1₁ > top
proper₁ > U61₃ > U62₃ > U63₃ > mark₁ > U15^1₁ > top
proper₁ > plus₂ > isNat > isNatKind > U41₁ > mark₁ > U15^1₁ > top
proper₁ > plus₂ > U51₂ > mark₁ > U15^1₁ > top
proper₁ > 0 > mark₁ > U15^1₁ > top

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(124) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(125) PisEmptyProof (EQUIVALENT transformation)

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

(126) TRUE

(127) Obligation:

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

U14¹(ok(X1), ok(X2), ok(X3)) → U14¹(X1, X2, X3)
U14¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(128) 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: Combined order from the following AFS and order.
U14¹(x1, x2, x3)  =  x1
ok(x1)  =  x1
mark(x1)  =  mark(x1)
active(x1)  =  active(x1)
U11(x1, x2, x3)  =  x1
tt  =  tt
U12(x1, x2, x3)  =  U12(x1)
isNatKind(x1)  =  isNatKind
U13(x1, x2, x3)  =  U13(x1)
U14(x1, x2, x3)  =  U14(x1)
U15(x1, x2)  =  x1
isNat(x1)  =  isNat
U16(x1)  =  U16(x1)
U21(x1, x2)  =  U21(x1)
U22(x1, x2)  =  U22(x1)
U23(x1)  =  U23(x1)
U31(x1, x2)  =  x1
U32(x1)  =  x1
U41(x1)  =  x1
U51(x1, x2)  =  U51(x1, x2)
U52(x1, x2)  =  U52(x1, x2)
U61(x1, x2, x3)  =  U61(x1, x2, x3)
U62(x1, x2, x3)  =  U62(x1, x2, x3)
U63(x1, x2, x3)  =  U63(x1, x2, x3)
U64(x1, x2, x3)  =  U64(x1, x2, x3)
s(x1)  =  s(x1)
plus(x1, x2)  =  plus(x1, x2)
0  =  0
proper(x1)  =  proper(x1)
top(x1)  =  top

Lexicographic Path Order [LPO].
Precedence:

active₁ > U12₁ > isNatKind > mark₁
active₁ > U12₁ > U13₁ > mark₁
active₁ > U14₁ > mark₁
active₁ > U16₁ > tt > isNatKind > mark₁
active₁ > U16₁ > tt > U13₁ > mark₁
active₁ > U16₁ > tt > U52₂ > mark₁
active₁ > U16₁ > tt > U62₃ > mark₁
active₁ > U16₁ > tt > U63₃ > mark₁
active₁ > U16₁ > tt > U64₃ > mark₁
active₁ > U21₁ > U22₁ > isNat > tt > isNatKind > mark₁
active₁ > U21₁ > U22₁ > isNat > tt > U13₁ > mark₁
active₁ > U21₁ > U22₁ > isNat > tt > U52₂ > mark₁
active₁ > U21₁ > U22₁ > isNat > tt > U62₃ > mark₁
active₁ > U21₁ > U22₁ > isNat > tt > U63₃ > mark₁
active₁ > U21₁ > U22₁ > isNat > tt > U64₃ > mark₁
active₁ > U21₁ > U22₁ > U23₁ > tt > isNatKind > mark₁
active₁ > U21₁ > U22₁ > U23₁ > tt > U13₁ > mark₁
active₁ > U21₁ > U22₁ > U23₁ > tt > U52₂ > mark₁
active₁ > U21₁ > U22₁ > U23₁ > tt > U62₃ > mark₁
active₁ > U21₁ > U22₁ > U23₁ > tt > U63₃ > mark₁
active₁ > U21₁ > U22₁ > U23₁ > tt > U64₃ > mark₁
active₁ > U51₂ > isNatKind > mark₁
active₁ > U51₂ > U52₂ > mark₁
active₁ > s₁ > isNat > tt > isNatKind > mark₁
active₁ > s₁ > isNat > tt > U13₁ > mark₁
active₁ > s₁ > isNat > tt > U52₂ > mark₁
active₁ > s₁ > isNat > tt > U62₃ > mark₁
active₁ > s₁ > isNat > tt > U63₃ > mark₁
active₁ > s₁ > isNat > tt > U64₃ > mark₁
active₁ > s₁ > U61₃ > U62₃ > mark₁
active₁ > plus₂ > isNatKind > mark₁
active₁ > plus₂ > U61₃ > U62₃ > mark₁
proper₁ > U12₁ > isNatKind > mark₁
proper₁ > U12₁ > U13₁ > mark₁
proper₁ > U14₁ > mark₁
proper₁ > U16₁ > tt > isNatKind > mark₁
proper₁ > U16₁ > tt > U13₁ > mark₁
proper₁ > U16₁ > tt > U52₂ > mark₁
proper₁ > U16₁ > tt > U62₃ > mark₁
proper₁ > U16₁ > tt > U63₃ > mark₁
proper₁ > U16₁ > tt > U64₃ > mark₁
proper₁ > U21₁ > U22₁ > isNat > tt > isNatKind > mark₁
proper₁ > U21₁ > U22₁ > isNat > tt > U13₁ > mark₁
proper₁ > U21₁ > U22₁ > isNat > tt > U52₂ > mark₁
proper₁ > U21₁ > U22₁ > isNat > tt > U62₃ > mark₁
proper₁ > U21₁ > U22₁ > isNat > tt > U63₃ > mark₁
proper₁ > U21₁ > U22₁ > isNat > tt > U64₃ > mark₁
proper₁ > U21₁ > U22₁ > U23₁ > tt > isNatKind > mark₁
proper₁ > U21₁ > U22₁ > U23₁ > tt > U13₁ > mark₁
proper₁ > U21₁ > U22₁ > U23₁ > tt > U52₂ > mark₁
proper₁ > U21₁ > U22₁ > U23₁ > tt > U62₃ > mark₁
proper₁ > U21₁ > U22₁ > U23₁ > tt > U63₃ > mark₁
proper₁ > U21₁ > U22₁ > U23₁ > tt > U64₃ > mark₁
proper₁ > U51₂ > isNatKind > mark₁
proper₁ > U51₂ > U52₂ > mark₁
proper₁ > s₁ > isNat > tt > isNatKind > mark₁
proper₁ > s₁ > isNat > tt > U13₁ > mark₁
proper₁ > s₁ > isNat > tt > U52₂ > mark₁
proper₁ > s₁ > isNat > tt > U62₃ > mark₁
proper₁ > s₁ > isNat > tt > U63₃ > mark₁
proper₁ > s₁ > isNat > tt > U64₃ > mark₁
proper₁ > s₁ > U61₃ > U62₃ > mark₁
proper₁ > plus₂ > isNatKind > mark₁
proper₁ > plus₂ > U61₃ > U62₃ > mark₁
proper₁ > 0 > mark₁
top > mark₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(129) Obligation:

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

U14¹(ok(X1), ok(X2), ok(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(130) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

Lexicographic Path Order [LPO].
Precedence:

proper₁ > tt > ok₁ > top
proper₁ > tt > mark > top
proper₁ > U12₁ > ok₁ > top
proper₁ > U12₁ > mark > top
proper₁ > isNatKind₁ > ok₁ > top
proper₁ > isNatKind₁ > mark > top
proper₁ > U13₁ > ok₁ > top
proper₁ > U13₁ > mark > top
proper₁ > isNat₁ > ok₁ > top
proper₁ > isNat₁ > mark > top
proper₁ > U21₁ > ok₁ > top
proper₁ > U21₁ > mark > top
proper₁ > U31₁ > ok₁ > top
proper₁ > U31₁ > mark > top
proper₁ > U32₁ > ok₁ > top
proper₁ > U32₁ > mark > top
proper₁ > U62₁ > ok₁ > top
proper₁ > U62₁ > mark > top
proper₁ > U63₁ > ok₁ > top
proper₁ > U63₁ > mark > top
proper₁ > U64₂ > ok₁ > top
proper₁ > U64₂ > mark > top
proper₁ > plus₁ > ok₁ > top
proper₁ > plus₁ > mark > top
proper₁ > 0 > mark > top

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(131) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(132) PisEmptyProof (EQUIVALENT transformation)

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

(133) TRUE

(134) Obligation:

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

U13¹(ok(X1), ok(X2), ok(X3)) → U13¹(X1, X2, X3)
U13¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(135) 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: Combined order from the following AFS and order.
U13¹(x1, x2, x3)  =  x1
ok(x1)  =  x1
mark(x1)  =  mark(x1)
active(x1)  =  active(x1)
U11(x1, x2, x3)  =  x1
tt  =  tt
U12(x1, x2, x3)  =  U12(x1)
isNatKind(x1)  =  isNatKind
U13(x1, x2, x3)  =  U13(x1)
U14(x1, x2, x3)  =  U14(x1)
U15(x1, x2)  =  x1
isNat(x1)  =  isNat
U16(x1)  =  U16(x1)
U21(x1, x2)  =  U21(x1)
U22(x1, x2)  =  U22(x1)
U23(x1)  =  U23(x1)
U31(x1, x2)  =  x1
U32(x1)  =  x1
U41(x1)  =  x1
U51(x1, x2)  =  U51(x1, x2)
U52(x1, x2)  =  U52(x1, x2)
U61(x1, x2, x3)  =  U61(x1, x2, x3)
U62(x1, x2, x3)  =  U62(x1, x2, x3)
U63(x1, x2, x3)  =  U63(x1, x2, x3)
U64(x1, x2, x3)  =  U64(x1, x2, x3)
s(x1)  =  s(x1)
plus(x1, x2)  =  plus(x1, x2)
0  =  0
proper(x1)  =  proper(x1)
top(x1)  =  top

Lexicographic Path Order [LPO].
Precedence:

active₁ > U12₁ > isNatKind > mark₁
active₁ > U12₁ > U13₁ > mark₁
active₁ > U14₁ > mark₁
active₁ > U16₁ > tt > isNatKind > mark₁
active₁ > U16₁ > tt > U13₁ > mark₁
active₁ > U16₁ > tt > U52₂ > mark₁
active₁ > U16₁ > tt > U62₃ > mark₁
active₁ > U16₁ > tt > U63₃ > mark₁
active₁ > U16₁ > tt > U64₃ > mark₁
active₁ > U21₁ > U22₁ > isNat > tt > isNatKind > mark₁
active₁ > U21₁ > U22₁ > isNat > tt > U13₁ > mark₁
active₁ > U21₁ > U22₁ > isNat > tt > U52₂ > mark₁
active₁ > U21₁ > U22₁ > isNat > tt > U62₃ > mark₁
active₁ > U21₁ > U22₁ > isNat > tt > U63₃ > mark₁
active₁ > U21₁ > U22₁ > isNat > tt > U64₃ > mark₁
active₁ > U21₁ > U22₁ > U23₁ > tt > isNatKind > mark₁
active₁ > U21₁ > U22₁ > U23₁ > tt > U13₁ > mark₁
active₁ > U21₁ > U22₁ > U23₁ > tt > U52₂ > mark₁
active₁ > U21₁ > U22₁ > U23₁ > tt > U62₃ > mark₁
active₁ > U21₁ > U22₁ > U23₁ > tt > U63₃ > mark₁
active₁ > U21₁ > U22₁ > U23₁ > tt > U64₃ > mark₁
active₁ > U51₂ > isNatKind > mark₁
active₁ > U51₂ > U52₂ > mark₁
active₁ > s₁ > isNat > tt > isNatKind > mark₁
active₁ > s₁ > isNat > tt > U13₁ > mark₁
active₁ > s₁ > isNat > tt > U52₂ > mark₁
active₁ > s₁ > isNat > tt > U62₃ > mark₁
active₁ > s₁ > isNat > tt > U63₃ > mark₁
active₁ > s₁ > isNat > tt > U64₃ > mark₁
active₁ > s₁ > U61₃ > U62₃ > mark₁
active₁ > plus₂ > isNatKind > mark₁
active₁ > plus₂ > U61₃ > U62₃ > mark₁
proper₁ > U12₁ > isNatKind > mark₁
proper₁ > U12₁ > U13₁ > mark₁
proper₁ > U14₁ > mark₁
proper₁ > U16₁ > tt > isNatKind > mark₁
proper₁ > U16₁ > tt > U13₁ > mark₁
proper₁ > U16₁ > tt > U52₂ > mark₁
proper₁ > U16₁ > tt > U62₃ > mark₁
proper₁ > U16₁ > tt > U63₃ > mark₁
proper₁ > U16₁ > tt > U64₃ > mark₁
proper₁ > U21₁ > U22₁ > isNat > tt > isNatKind > mark₁
proper₁ > U21₁ > U22₁ > isNat > tt > U13₁ > mark₁
proper₁ > U21₁ > U22₁ > isNat > tt > U52₂ > mark₁
proper₁ > U21₁ > U22₁ > isNat > tt > U62₃ > mark₁
proper₁ > U21₁ > U22₁ > isNat > tt > U63₃ > mark₁
proper₁ > U21₁ > U22₁ > isNat > tt > U64₃ > mark₁
proper₁ > U21₁ > U22₁ > U23₁ > tt > isNatKind > mark₁
proper₁ > U21₁ > U22₁ > U23₁ > tt > U13₁ > mark₁
proper₁ > U21₁ > U22₁ > U23₁ > tt > U52₂ > mark₁
proper₁ > U21₁ > U22₁ > U23₁ > tt > U62₃ > mark₁
proper₁ > U21₁ > U22₁ > U23₁ > tt > U63₃ > mark₁
proper₁ > U21₁ > U22₁ > U23₁ > tt > U64₃ > mark₁
proper₁ > U51₂ > isNatKind > mark₁
proper₁ > U51₂ > U52₂ > mark₁
proper₁ > s₁ > isNat > tt > isNatKind > mark₁
proper₁ > s₁ > isNat > tt > U13₁ > mark₁
proper₁ > s₁ > isNat > tt > U52₂ > mark₁
proper₁ > s₁ > isNat > tt > U62₃ > mark₁
proper₁ > s₁ > isNat > tt > U63₃ > mark₁
proper₁ > s₁ > isNat > tt > U64₃ > mark₁
proper₁ > s₁ > U61₃ > U62₃ > mark₁
proper₁ > plus₂ > isNatKind > mark₁
proper₁ > plus₂ > U61₃ > U62₃ > mark₁
proper₁ > 0 > mark₁
top > mark₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(136) Obligation:

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

U13¹(ok(X1), ok(X2), ok(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(137) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

Lexicographic Path Order [LPO].
Precedence:

proper₁ > tt > ok₁ > top
proper₁ > tt > mark > top
proper₁ > U12₁ > ok₁ > top
proper₁ > U12₁ > mark > top
proper₁ > isNatKind₁ > ok₁ > top
proper₁ > isNatKind₁ > mark > top
proper₁ > U13₁ > ok₁ > top
proper₁ > U13₁ > mark > top
proper₁ > isNat₁ > ok₁ > top
proper₁ > isNat₁ > mark > top
proper₁ > U21₁ > ok₁ > top
proper₁ > U21₁ > mark > top
proper₁ > U31₁ > ok₁ > top
proper₁ > U31₁ > mark > top
proper₁ > U32₁ > ok₁ > top
proper₁ > U32₁ > mark > top
proper₁ > U62₁ > ok₁ > top
proper₁ > U62₁ > mark > top
proper₁ > U63₁ > ok₁ > top
proper₁ > U63₁ > mark > top
proper₁ > U64₂ > ok₁ > top
proper₁ > U64₂ > mark > top
proper₁ > plus₁ > ok₁ > top
proper₁ > plus₁ > mark > top
proper₁ > 0 > mark > top

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(138) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(139) PisEmptyProof (EQUIVALENT transformation)

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

(140) TRUE

(141) Obligation:

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

U12¹(ok(X1), ok(X2), ok(X3)) → U12¹(X1, X2, X3)
U12¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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.

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

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

Lexicographic Path Order [LPO].
Precedence:

U12^1₁ > mark
proper₁ > isNatKind₁ > tt > U15₁ > isNat₁ > ok₁ > mark
proper₁ > isNatKind₁ > tt > U22₂ > isNat₁ > ok₁ > mark
proper₁ > isNatKind₁ > tt > U52₂ > ok₁ > mark
proper₁ > isNatKind₁ > tt > U62₁ > isNat₁ > ok₁ > mark
proper₁ > isNatKind₁ > tt > U62₁ > U63₂ > ok₁ > mark
proper₁ > isNatKind₁ > tt > U64₁ > ok₁ > mark
proper₁ > isNatKind₁ > U31₂ > ok₁ > mark
proper₁ > U21₂ > U22₂ > isNat₁ > ok₁ > mark
proper₁ > plus₁ > isNat₁ > ok₁ > mark
proper₁ > plus₁ > U31₂ > ok₁ > mark
proper₁ > plus₁ > U51₂ > ok₁ > mark
proper₁ > plus₁ > U61₂ > ok₁ > mark
proper₁ > 0 > isNat₁ > ok₁ > mark
top > mark

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(143) Obligation:

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

U12¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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.

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

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

Lexicographic Path Order [LPO].
Precedence:

proper₁ > U12₁ > isNatKind > mark₁
proper₁ > U15₁ > mark₁
proper₁ > U16₁ > mark₁
proper₁ > U22₁ > mark₁
proper₁ > U23₁ > tt > mark₁
proper₁ > U31₁ > isNatKind > mark₁
proper₁ > U52₂ > mark₁
proper₁ > U62₃ > mark₁
proper₁ > U63₃ > U64₃ > plus₂ > U11₁ > isNatKind > mark₁
proper₁ > U63₃ > U64₃ > plus₂ > U51₂ > mark₁
proper₁ > U63₃ > U64₃ > plus₂ > U61₃ > isNatKind > mark₁
proper₁ > s₁ > isNat > U11₁ > isNatKind > mark₁
proper₁ > s₁ > isNat > tt > mark₁
proper₁ > s₁ > isNat > U21₁ > mark₁
proper₁ > s₁ > U41₁ > tt > mark₁
proper₁ > s₁ > U61₃ > isNatKind > mark₁
proper₁ > 0 > tt > mark₁
proper₁ > 0 > U51₂ > mark₁
top > active₁ > U12₁ > isNatKind > mark₁
top > active₁ > U15₁ > mark₁
top > active₁ > U16₁ > mark₁
top > active₁ > U22₁ > mark₁
top > active₁ > U23₁ > tt > mark₁
top > active₁ > U31₁ > isNatKind > mark₁
top > active₁ > U52₂ > mark₁
top > active₁ > U62₃ > mark₁
top > active₁ > U63₃ > U64₃ > plus₂ > U11₁ > isNatKind > mark₁
top > active₁ > U63₃ > U64₃ > plus₂ > U51₂ > mark₁
top > active₁ > U63₃ > U64₃ > plus₂ > U61₃ > isNatKind > mark₁
top > active₁ > s₁ > isNat > U11₁ > isNatKind > mark₁
top > active₁ > s₁ > isNat > tt > mark₁
top > active₁ > s₁ > isNat > U21₁ > mark₁
top > active₁ > s₁ > U41₁ > tt > mark₁
top > active₁ > s₁ > U61₃ > isNatKind > mark₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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:

U11¹(ok(X1), ok(X2), ok(X3)) → U11¹(X1, X2, X3)
U11¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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.

U11¹(ok(X1), ok(X2), ok(X3)) → U11¹(X1, X2, X3)

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

Lexicographic Path Order [LPO].
Precedence:

active₁ > U11₃ > U12₃ > U13₃ > ok₁ > mark₁
active₁ > U11₃ > isNatKind₁ > tt > U13₃ > ok₁ > mark₁
active₁ > U11₃ > isNatKind₁ > tt > U52₂ > ok₁ > mark₁
active₁ > U11₃ > isNatKind₁ > tt > U62₃ > ok₁ > mark₁
active₁ > U11₃ > isNatKind₁ > U31₂ > ok₁ > mark₁
active₁ > U14₃ > U15₂ > U16₁ > tt > U13₃ > ok₁ > mark₁
active₁ > U14₃ > U15₂ > U16₁ > tt > U52₂ > ok₁ > mark₁
active₁ > U14₃ > U15₂ > U16₁ > tt > U62₃ > ok₁ > mark₁
active₁ > isNat₁ > isNatKind₁ > tt > U13₃ > ok₁ > mark₁
active₁ > isNat₁ > isNatKind₁ > tt > U52₂ > ok₁ > mark₁
active₁ > isNat₁ > isNatKind₁ > tt > U62₃ > ok₁ > mark₁
active₁ > isNat₁ > isNatKind₁ > U31₂ > ok₁ > mark₁
active₁ > isNat₁ > U21₂ > ok₁ > mark₁
active₁ > U22₂ > ok₁ > mark₁
active₁ > U23₁ > tt > U13₃ > ok₁ > mark₁
active₁ > U23₁ > tt > U52₂ > ok₁ > mark₁
active₁ > U23₁ > tt > U62₃ > ok₁ > mark₁
active₁ > U61₃ > isNatKind₁ > tt > U13₃ > ok₁ > mark₁
active₁ > U61₃ > isNatKind₁ > tt > U52₂ > ok₁ > mark₁
active₁ > U61₃ > isNatKind₁ > tt > U62₃ > ok₁ > mark₁
active₁ > U61₃ > isNatKind₁ > U31₂ > ok₁ > mark₁
active₁ > U63₃ > U64₃ > ok₁ > mark₁
active₁ > plus₂ > isNatKind₁ > tt > U13₃ > ok₁ > mark₁
active₁ > plus₂ > isNatKind₁ > tt > U52₂ > ok₁ > mark₁
active₁ > plus₂ > isNatKind₁ > tt > U62₃ > ok₁ > mark₁
active₁ > plus₂ > isNatKind₁ > U31₂ > ok₁ > mark₁
active₁ > plus₂ > U51₂ > U52₂ > ok₁ > mark₁
proper₁ > U11₃ > U12₃ > U13₃ > ok₁ > mark₁
proper₁ > U11₃ > isNatKind₁ > tt > U13₃ > ok₁ > mark₁
proper₁ > U11₃ > isNatKind₁ > tt > U52₂ > ok₁ > mark₁
proper₁ > U11₃ > isNatKind₁ > tt > U62₃ > ok₁ > mark₁
proper₁ > U11₃ > isNatKind₁ > U31₂ > ok₁ > mark₁
proper₁ > U14₃ > U15₂ > U16₁ > tt > U13₃ > ok₁ > mark₁
proper₁ > U14₃ > U15₂ > U16₁ > tt > U52₂ > ok₁ > mark₁
proper₁ > U14₃ > U15₂ > U16₁ > tt > U62₃ > ok₁ > mark₁
proper₁ > isNat₁ > isNatKind₁ > tt > U13₃ > ok₁ > mark₁
proper₁ > isNat₁ > isNatKind₁ > tt > U52₂ > ok₁ > mark₁
proper₁ > isNat₁ > isNatKind₁ > tt > U62₃ > ok₁ > mark₁
proper₁ > isNat₁ > isNatKind₁ > U31₂ > ok₁ > mark₁
proper₁ > isNat₁ > U21₂ > ok₁ > mark₁
proper₁ > U22₂ > ok₁ > mark₁
proper₁ > U23₁ > tt > U13₃ > ok₁ > mark₁
proper₁ > U23₁ > tt > U52₂ > ok₁ > mark₁
proper₁ > U23₁ > tt > U62₃ > ok₁ > mark₁
proper₁ > U61₃ > isNatKind₁ > tt > U13₃ > ok₁ > mark₁
proper₁ > U61₃ > isNatKind₁ > tt > U52₂ > ok₁ > mark₁
proper₁ > U61₃ > isNatKind₁ > tt > U62₃ > ok₁ > mark₁
proper₁ > U61₃ > isNatKind₁ > U31₂ > ok₁ > mark₁
proper₁ > U63₃ > U64₃ > ok₁ > mark₁
proper₁ > plus₂ > isNatKind₁ > tt > U13₃ > ok₁ > mark₁
proper₁ > plus₂ > isNatKind₁ > tt > U52₂ > ok₁ > mark₁
proper₁ > plus₂ > isNatKind₁ > tt > U62₃ > ok₁ > mark₁
proper₁ > plus₂ > isNatKind₁ > U31₂ > ok₁ > mark₁
proper₁ > plus₂ > U51₂ > U52₂ > ok₁ > mark₁
proper₁ > 0 > ok₁ > mark₁
top > mark₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(150) Obligation:

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

U11¹(mark(X1), 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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.

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

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

Lexicographic Path Order [LPO].
Precedence:

proper₁ > U15₁ > mark₁
proper₁ > U16₁ > tt > mark₁
proper₁ > U22₁ > mark₁
proper₁ > U31₁ > isNatKind > tt > mark₁
proper₁ > U52₂ > mark₁
proper₁ > U62₃ > isNat > U11₁ > mark₁
proper₁ > U62₃ > isNat > isNatKind > tt > mark₁
proper₁ > U62₃ > isNat > U21₁ > mark₁
proper₁ > U62₃ > U63₃ > isNatKind > tt > mark₁
proper₁ > U64₃ > s₁ > isNat > U11₁ > mark₁
proper₁ > U64₃ > s₁ > isNat > isNatKind > tt > mark₁
proper₁ > U64₃ > s₁ > isNat > U21₁ > mark₁
proper₁ > U64₃ > s₁ > U41₁ > tt > mark₁
proper₁ > U64₃ > s₁ > U61₃ > isNatKind > tt > mark₁
proper₁ > U64₃ > plus₂ > U11₁ > mark₁
proper₁ > U64₃ > plus₂ > U51₂ > mark₁
proper₁ > U64₃ > plus₂ > U61₃ > isNatKind > tt > mark₁
proper₁ > 0 > tt > mark₁
proper₁ > 0 > U51₂ > mark₁
top > active₁ > U15₁ > mark₁
top > active₁ > U16₁ > tt > mark₁
top > active₁ > U22₁ > mark₁
top > active₁ > U31₁ > isNatKind > tt > mark₁
top > active₁ > U52₂ > mark₁
top > active₁ > U62₃ > isNat > U11₁ > mark₁
top > active₁ > U62₃ > isNat > isNatKind > tt > mark₁
top > active₁ > U62₃ > isNat > U21₁ > mark₁
top > active₁ > U62₃ > U63₃ > isNatKind > tt > mark₁
top > active₁ > U64₃ > s₁ > isNat > U11₁ > mark₁
top > active₁ > U64₃ > s₁ > isNat > isNatKind > tt > mark₁
top > active₁ > U64₃ > s₁ > isNat > U21₁ > mark₁
top > active₁ > U64₃ > s₁ > U41₁ > tt > mark₁
top > active₁ > U64₃ > s₁ > U61₃ > isNatKind > tt > mark₁
top > active₁ > U64₃ > plus₂ > U11₁ > mark₁
top > active₁ > U64₃ > plus₂ > U51₂ > mark₁
top > active₁ > U64₃ > plus₂ > U61₃ > isNatKind > tt > mark₁

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(152) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(153) PisEmptyProof (EQUIVALENT transformation)

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

(154) TRUE

(155) Obligation:

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

PROPER(U11(X1, X2, X3)) → PROPER(X2)
PROPER(U11(X1, X2, X3)) → PROPER(X1)
PROPER(U11(X1, X2, X3)) → PROPER(X3)
PROPER(U12(X1, X2, X3)) → PROPER(X1)
PROPER(U12(X1, X2, X3)) → PROPER(X2)
PROPER(U12(X1, X2, X3)) → PROPER(X3)
PROPER(isNatKind(X)) → PROPER(X)
PROPER(U13(X1, X2, X3)) → PROPER(X1)
PROPER(U13(X1, X2, X3)) → PROPER(X2)
PROPER(U13(X1, X2, X3)) → PROPER(X3)
PROPER(U14(X1, X2, X3)) → PROPER(X1)
PROPER(U14(X1, X2, X3)) → PROPER(X2)
PROPER(U14(X1, X2, X3)) → PROPER(X3)
PROPER(U15(X1, X2)) → PROPER(X1)
PROPER(U15(X1, X2)) → PROPER(X2)
PROPER(isNat(X)) → PROPER(X)
PROPER(U16(X)) → PROPER(X)
PROPER(U21(X1, X2)) → PROPER(X1)
PROPER(U21(X1, X2)) → PROPER(X2)
PROPER(U22(X1, X2)) → PROPER(X1)
PROPER(U22(X1, X2)) → PROPER(X2)
PROPER(U23(X)) → PROPER(X)
PROPER(U31(X1, X2)) → PROPER(X1)
PROPER(U31(X1, X2)) → PROPER(X2)
PROPER(U32(X)) → PROPER(X)
PROPER(U41(X)) → PROPER(X)
PROPER(U51(X1, X2)) → PROPER(X1)
PROPER(U51(X1, X2)) → PROPER(X2)
PROPER(U52(X1, X2)) → PROPER(X1)
PROPER(U52(X1, X2)) → PROPER(X2)
PROPER(U61(X1, X2, X3)) → PROPER(X1)
PROPER(U61(X1, X2, X3)) → PROPER(X2)
PROPER(U61(X1, X2, X3)) → PROPER(X3)
PROPER(U62(X1, X2, X3)) → PROPER(X1)
PROPER(U62(X1, X2, X3)) → PROPER(X2)
PROPER(U62(X1, X2, X3)) → PROPER(X3)
PROPER(U63(X1, X2, X3)) → PROPER(X1)
PROPER(U63(X1, X2, X3)) → PROPER(X2)
PROPER(U63(X1, X2, X3)) → PROPER(X3)
PROPER(U64(X1, X2, X3)) → PROPER(X1)
PROPER(U64(X1, X2, X3)) → PROPER(X2)
PROPER(U64(X1, X2, X3)) → PROPER(X3)
PROPER(s(X)) → PROPER(X)
PROPER(plus(X1, X2)) → PROPER(X1)
PROPER(plus(X1, X2)) → PROPER(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(156) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(U11(X1, X2, X3)) → PROPER(X2)
PROPER(U11(X1, X2, X3)) → PROPER(X1)
PROPER(U11(X1, X2, X3)) → PROPER(X3)
PROPER(U12(X1, X2, X3)) → PROPER(X1)
PROPER(U12(X1, X2, X3)) → PROPER(X2)
PROPER(U12(X1, X2, X3)) → PROPER(X3)
PROPER(U13(X1, X2, X3)) → PROPER(X1)
PROPER(U13(X1, X2, X3)) → PROPER(X2)
PROPER(U13(X1, X2, X3)) → PROPER(X3)
PROPER(U14(X1, X2, X3)) → PROPER(X1)
PROPER(U14(X1, X2, X3)) → PROPER(X2)
PROPER(U14(X1, X2, X3)) → PROPER(X3)
PROPER(U15(X1, X2)) → PROPER(X1)
PROPER(U15(X1, X2)) → PROPER(X2)
PROPER(U21(X1, X2)) → PROPER(X1)
PROPER(U21(X1, X2)) → PROPER(X2)
PROPER(U22(X1, X2)) → PROPER(X1)
PROPER(U22(X1, X2)) → PROPER(X2)
PROPER(U31(X1, X2)) → PROPER(X1)
PROPER(U31(X1, X2)) → PROPER(X2)
PROPER(U51(X1, X2)) → PROPER(X1)
PROPER(U51(X1, X2)) → PROPER(X2)
PROPER(U52(X1, X2)) → PROPER(X1)
PROPER(U52(X1, X2)) → PROPER(X2)
PROPER(U61(X1, X2, X3)) → PROPER(X1)
PROPER(U61(X1, X2, X3)) → PROPER(X2)
PROPER(U61(X1, X2, X3)) → PROPER(X3)
PROPER(U62(X1, X2, X3)) → PROPER(X1)
PROPER(U62(X1, X2, X3)) → PROPER(X2)
PROPER(U62(X1, X2, X3)) → PROPER(X3)
PROPER(U63(X1, X2, X3)) → PROPER(X1)
PROPER(U63(X1, X2, X3)) → PROPER(X2)
PROPER(U63(X1, X2, X3)) → PROPER(X3)
PROPER(U64(X1, X2, X3)) → PROPER(X1)
PROPER(U64(X1, X2, X3)) → PROPER(X2)
PROPER(U64(X1, X2, X3)) → PROPER(X3)
PROPER(plus(X1, X2)) → PROPER(X1)
PROPER(plus(X1, X2)) → PROPER(X2)

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

Lexicographic Path Order [LPO].
Precedence:

PROPER₁ > mark
U31₂ > ok > U13₃ > U14₃ > mark
U31₂ > ok > U21₂ > mark
U31₂ > ok > U64₃ > mark
U31₂ > ok > plus₂ > U11₃ > mark
U61₃ > ok > U13₃ > U14₃ > mark
U61₃ > ok > U21₂ > mark
U61₃ > ok > U64₃ > mark
U61₃ > ok > plus₂ > U11₃ > mark
tt > U12₃ > ok > U13₃ > U14₃ > mark
tt > U12₃ > ok > U21₂ > mark
tt > U12₃ > ok > U64₃ > mark
tt > U12₃ > ok > plus₂ > U11₃ > mark
tt > U15₂ > ok > U13₃ > U14₃ > mark
tt > U15₂ > ok > U21₂ > mark
tt > U15₂ > ok > U64₃ > mark
tt > U15₂ > ok > plus₂ > U11₃ > mark
tt > U22₂ > ok > U13₃ > U14₃ > mark
tt > U22₂ > ok > U21₂ > mark
tt > U22₂ > ok > U64₃ > mark
tt > U22₂ > ok > plus₂ > U11₃ > mark
tt > U52₂ > mark
tt > U62₃ > ok > U13₃ > U14₃ > mark
tt > U62₃ > ok > U21₂ > mark
tt > U62₃ > ok > U64₃ > mark
tt > U62₃ > ok > plus₂ > U11₃ > mark
tt > U63₃ > ok > U13₃ > U14₃ > mark
tt > U63₃ > ok > U21₂ > mark
tt > U63₃ > ok > U64₃ > mark
tt > U63₃ > ok > plus₂ > U11₃ > mark
0 > U51₂ > U52₂ > mark
0 > U51₂ > ok > U13₃ > U14₃ > mark
0 > U51₂ > ok > U21₂ > mark
0 > U51₂ > ok > U64₃ > mark
0 > U51₂ > ok > plus₂ > U11₃ > mark
top > mark

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(157) Obligation:

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

PROPER(isNatKind(X)) → PROPER(X)
PROPER(isNat(X)) → PROPER(X)
PROPER(U16(X)) → PROPER(X)
PROPER(U23(X)) → PROPER(X)
PROPER(U32(X)) → PROPER(X)
PROPER(U41(X)) → PROPER(X)
PROPER(s(X)) → PROPER(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(158) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(U32(X)) → PROPER(X)

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

Lexicographic Path Order [LPO].
Precedence:

active₁ > U32₁ > mark
active₁ > U15₁ > mark
active₁ > U21₁ > mark
active₁ > U31 > mark
active₁ > U63 > mark
proper₁ > tt > U32₁ > mark
proper₁ > tt > U15₁ > mark
proper₁ > tt > U63 > mark
proper₁ > U21₁ > mark
proper₁ > U31 > mark
proper₁ > 0 > mark
top > mark

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(159) Obligation:

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

PROPER(isNatKind(X)) → PROPER(X)
PROPER(isNat(X)) → PROPER(X)
PROPER(U16(X)) → PROPER(X)
PROPER(U23(X)) → PROPER(X)
PROPER(U41(X)) → PROPER(X)
PROPER(s(X)) → PROPER(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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.

PROPER(isNatKind(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)

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

Lexicographic Path Order [LPO].
Precedence:

PROPER₁ > mark
active₁ > s₁ > ok₁ > top > mark
active₁ > U11₂ > isNatKind₁ > tt > mark
active₁ > U11₂ > isNatKind₁ > U31₂ > ok₁ > top > mark
active₁ > U11₂ > U12₃ > ok₁ > top > mark
active₁ > U13₁ > ok₁ > top > mark
active₁ > U15₂ > ok₁ > top > mark
active₁ > U21₂ > isNatKind₁ > tt > mark
active₁ > U21₂ > isNatKind₁ > U31₂ > ok₁ > top > mark
active₁ > U21₂ > U22₁ > ok₁ > top > mark
active₁ > U32₁ > tt > mark
active₁ > U32₁ > ok₁ > top > mark
active₁ > U51₂ > ok₁ > top > mark
active₁ > U52₁ > ok₁ > top > mark
active₁ > U61₃ > ok₁ > top > mark
active₁ > U62₃ > ok₁ > top > mark
active₁ > U63₁ > isNatKind₁ > tt > mark
active₁ > U63₁ > isNatKind₁ > U31₂ > ok₁ > top > mark
proper₁ > s₁ > ok₁ > top > mark
proper₁ > U11₂ > isNatKind₁ > tt > mark
proper₁ > U11₂ > isNatKind₁ > U31₂ > ok₁ > top > mark
proper₁ > U11₂ > U12₃ > ok₁ > top > mark
proper₁ > U13₁ > ok₁ > top > mark
proper₁ > U15₂ > ok₁ > top > mark
proper₁ > U21₂ > isNatKind₁ > tt > mark
proper₁ > U21₂ > isNatKind₁ > U31₂ > ok₁ > top > mark
proper₁ > U21₂ > U22₁ > ok₁ > top > mark
proper₁ > U32₁ > tt > mark
proper₁ > U32₁ > ok₁ > top > mark
proper₁ > U52₁ > ok₁ > top > mark
proper₁ > U61₃ > ok₁ > top > mark
proper₁ > U62₃ > ok₁ > top > mark
proper₁ > U63₁ > isNatKind₁ > tt > mark
proper₁ > U63₁ > isNatKind₁ > U31₂ > ok₁ > top > mark
proper₁ > 0 > tt > mark
proper₁ > 0 > U51₂ > ok₁ > top > mark

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(161) Obligation:

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

PROPER(isNat(X)) → PROPER(X)
PROPER(U16(X)) → PROPER(X)
PROPER(U23(X)) → PROPER(X)
PROPER(U41(X)) → PROPER(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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.

PROPER(U23(X)) → PROPER(X)

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

Lexicographic Path Order [LPO].
Precedence:

PROPER₁ > mark
tt > U23₁ > ok > mark
tt > U12₃ > ok > mark
tt > U22₂ > mark
tt > U62₂ > ok > mark
U13 > active₁ > U23₁ > ok > mark
U13 > active₁ > U12₃ > ok > mark
U13 > active₁ > U21₁ > U22₂ > mark
U13 > active₁ > U21₁ > ok > mark
U13 > active₁ > U61₂ > mark
U13 > active₁ > U62₂ > ok > mark
U51 > active₁ > U23₁ > ok > mark
U51 > active₁ > U12₃ > ok > mark
U51 > active₁ > U21₁ > U22₂ > mark
U51 > active₁ > U21₁ > ok > mark
U51 > active₁ > U61₂ > mark
U51 > active₁ > U62₂ > ok > mark
U63₁ > active₁ > U23₁ > ok > mark
U63₁ > active₁ > U12₃ > ok > mark
U63₁ > active₁ > U21₁ > U22₂ > mark
U63₁ > active₁ > U21₁ > ok > mark
U63₁ > active₁ > U61₂ > mark
U63₁ > active₁ > U62₂ > ok > mark
0 > ok > mark
top > active₁ > U23₁ > ok > mark
top > active₁ > U12₃ > ok > mark
top > active₁ > U21₁ > U22₂ > mark
top > active₁ > U21₁ > ok > mark
top > active₁ > U61₂ > mark
top > active₁ > U62₂ > ok > mark

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(163) Obligation:

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

PROPER(isNat(X)) → PROPER(X)
PROPER(U16(X)) → PROPER(X)
PROPER(U41(X)) → PROPER(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(164) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(isNat(X)) → PROPER(X)

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

Lexicographic Path Order [LPO].
Precedence:

0 > tt > mark > proper₁ > isNat₁ > PROPER₁
0 > tt > mark > proper₁ > isNat₁ > isNatKind₁
0 > tt > mark > proper₁ > isNat₁ > ok
top > active > U13 > mark > proper₁ > isNat₁ > PROPER₁
top > active > U13 > mark > proper₁ > isNat₁ > isNatKind₁
top > active > U13 > mark > proper₁ > isNat₁ > ok
top > active > U15 > mark > proper₁ > isNat₁ > PROPER₁
top > active > U15 > mark > proper₁ > isNat₁ > isNatKind₁
top > active > U15 > mark > proper₁ > isNat₁ > ok
top > active > U22 > U23 > tt > mark > proper₁ > isNat₁ > PROPER₁
top > active > U22 > U23 > tt > mark > proper₁ > isNat₁ > isNatKind₁
top > active > U22 > U23 > tt > mark > proper₁ > isNat₁ > ok
top > active > U52 > mark > proper₁ > isNat₁ > PROPER₁
top > active > U52 > mark > proper₁ > isNat₁ > isNatKind₁
top > active > U52 > mark > proper₁ > isNat₁ > ok
top > active > U63 > mark > proper₁ > isNat₁ > PROPER₁
top > active > U63 > mark > proper₁ > isNat₁ > isNatKind₁
top > active > U63 > mark > proper₁ > isNat₁ > ok
top > active > U64 > plus > mark > proper₁ > isNat₁ > PROPER₁
top > active > U64 > plus > mark > proper₁ > isNat₁ > isNatKind₁
top > active > U64 > plus > mark > proper₁ > isNat₁ > ok

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(165) Obligation:

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

PROPER(U16(X)) → PROPER(X)
PROPER(U41(X)) → PROPER(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(166) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(U16(X)) → PROPER(X)

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

Lexicographic Path Order [LPO].
Precedence:

isNat > proper₁ > U13₁ > mark > U16₁ > PROPER₁
isNat > proper₁ > U13₁ > mark > U16₁ > tt > isNatKind
isNat > proper₁ > U13₁ > mark > U16₁ > tt > U14₂
isNat > proper₁ > U13₁ > mark > U16₁ > tt > U15₂
isNat > proper₁ > U13₁ > mark > U16₁ > tt > U52₂
isNat > proper₁ > U13₁ > mark > U23₁ > tt > isNatKind
isNat > proper₁ > U13₁ > mark > U23₁ > tt > U14₂
isNat > proper₁ > U13₁ > mark > U23₁ > tt > U15₂
isNat > proper₁ > U13₁ > mark > U23₁ > tt > U52₂
isNat > proper₁ > U22₂ > U23₁ > tt > isNatKind
isNat > proper₁ > U22₂ > U23₁ > tt > U14₂
isNat > proper₁ > U22₂ > U23₁ > tt > U15₂
isNat > proper₁ > U22₂ > U23₁ > tt > U52₂
isNat > proper₁ > U31 > U32₁ > mark > U16₁ > PROPER₁
isNat > proper₁ > U31 > U32₁ > mark > U16₁ > tt > isNatKind
isNat > proper₁ > U31 > U32₁ > mark > U16₁ > tt > U14₂
isNat > proper₁ > U31 > U32₁ > mark > U16₁ > tt > U15₂
isNat > proper₁ > U31 > U32₁ > mark > U16₁ > tt > U52₂
isNat > proper₁ > U31 > U32₁ > mark > U23₁ > tt > isNatKind
isNat > proper₁ > U31 > U32₁ > mark > U23₁ > tt > U14₂
isNat > proper₁ > U31 > U32₁ > mark > U23₁ > tt > U15₂
isNat > proper₁ > U31 > U32₁ > mark > U23₁ > tt > U52₂
isNat > proper₁ > U51₁ > mark > U16₁ > PROPER₁
isNat > proper₁ > U51₁ > mark > U16₁ > tt > isNatKind
isNat > proper₁ > U51₁ > mark > U16₁ > tt > U14₂
isNat > proper₁ > U51₁ > mark > U16₁ > tt > U15₂
isNat > proper₁ > U51₁ > mark > U16₁ > tt > U52₂
isNat > proper₁ > U51₁ > mark > U23₁ > tt > isNatKind
isNat > proper₁ > U51₁ > mark > U23₁ > tt > U14₂
isNat > proper₁ > U51₁ > mark > U23₁ > tt > U15₂
isNat > proper₁ > U51₁ > mark > U23₁ > tt > U52₂
isNat > proper₁ > U61₁ > mark > U16₁ > PROPER₁
isNat > proper₁ > U61₁ > mark > U16₁ > tt > isNatKind
isNat > proper₁ > U61₁ > mark > U16₁ > tt > U14₂
isNat > proper₁ > U61₁ > mark > U16₁ > tt > U15₂
isNat > proper₁ > U61₁ > mark > U16₁ > tt > U52₂
isNat > proper₁ > U61₁ > mark > U23₁ > tt > isNatKind
isNat > proper₁ > U61₁ > mark > U23₁ > tt > U14₂
isNat > proper₁ > U61₁ > mark > U23₁ > tt > U15₂
isNat > proper₁ > U61₁ > mark > U23₁ > tt > U52₂
isNat > proper₁ > U64₁ > mark > U16₁ > PROPER₁
isNat > proper₁ > U64₁ > mark > U16₁ > tt > isNatKind
isNat > proper₁ > U64₁ > mark > U16₁ > tt > U14₂
isNat > proper₁ > U64₁ > mark > U16₁ > tt > U15₂
isNat > proper₁ > U64₁ > mark > U16₁ > tt > U52₂
isNat > proper₁ > U64₁ > mark > U23₁ > tt > isNatKind
isNat > proper₁ > U64₁ > mark > U23₁ > tt > U14₂
isNat > proper₁ > U64₁ > mark > U23₁ > tt > U15₂
isNat > proper₁ > U64₁ > mark > U23₁ > tt > U52₂
isNat > proper₁ > plus₁ > mark > U16₁ > PROPER₁
isNat > proper₁ > plus₁ > mark > U16₁ > tt > isNatKind
isNat > proper₁ > plus₁ > mark > U16₁ > tt > U14₂
isNat > proper₁ > plus₁ > mark > U16₁ > tt > U15₂
isNat > proper₁ > plus₁ > mark > U16₁ > tt > U52₂
isNat > proper₁ > plus₁ > mark > U23₁ > tt > isNatKind
isNat > proper₁ > plus₁ > mark > U23₁ > tt > U14₂
isNat > proper₁ > plus₁ > mark > U23₁ > tt > U15₂
isNat > proper₁ > plus₁ > mark > U23₁ > tt > U52₂
U63 > active₁ > U13₁ > mark > U16₁ > PROPER₁
U63 > active₁ > U13₁ > mark > U16₁ > tt > isNatKind
U63 > active₁ > U13₁ > mark > U16₁ > tt > U14₂
U63 > active₁ > U13₁ > mark > U16₁ > tt > U15₂
U63 > active₁ > U13₁ > mark > U16₁ > tt > U52₂
U63 > active₁ > U13₁ > mark > U23₁ > tt > isNatKind
U63 > active₁ > U13₁ > mark > U23₁ > tt > U14₂
U63 > active₁ > U13₁ > mark > U23₁ > tt > U15₂
U63 > active₁ > U13₁ > mark > U23₁ > tt > U52₂
U63 > active₁ > U22₂ > U23₁ > tt > isNatKind
U63 > active₁ > U22₂ > U23₁ > tt > U14₂
U63 > active₁ > U22₂ > U23₁ > tt > U15₂
U63 > active₁ > U22₂ > U23₁ > tt > U52₂
U63 > active₁ > U31 > U32₁ > mark > U16₁ > PROPER₁
U63 > active₁ > U31 > U32₁ > mark > U16₁ > tt > isNatKind
U63 > active₁ > U31 > U32₁ > mark > U16₁ > tt > U14₂
U63 > active₁ > U31 > U32₁ > mark > U16₁ > tt > U15₂
U63 > active₁ > U31 > U32₁ > mark > U16₁ > tt > U52₂
U63 > active₁ > U31 > U32₁ > mark > U23₁ > tt > isNatKind
U63 > active₁ > U31 > U32₁ > mark > U23₁ > tt > U14₂
U63 > active₁ > U31 > U32₁ > mark > U23₁ > tt > U15₂
U63 > active₁ > U31 > U32₁ > mark > U23₁ > tt > U52₂
U63 > active₁ > U51₁ > mark > U16₁ > PROPER₁
U63 > active₁ > U51₁ > mark > U16₁ > tt > isNatKind
U63 > active₁ > U51₁ > mark > U16₁ > tt > U14₂
U63 > active₁ > U51₁ > mark > U16₁ > tt > U15₂
U63 > active₁ > U51₁ > mark > U16₁ > tt > U52₂
U63 > active₁ > U51₁ > mark > U23₁ > tt > isNatKind
U63 > active₁ > U51₁ > mark > U23₁ > tt > U14₂
U63 > active₁ > U51₁ > mark > U23₁ > tt > U15₂
U63 > active₁ > U51₁ > mark > U23₁ > tt > U52₂
U63 > active₁ > U61₁ > mark > U16₁ > PROPER₁
U63 > active₁ > U61₁ > mark > U16₁ > tt > isNatKind
U63 > active₁ > U61₁ > mark > U16₁ > tt > U14₂
U63 > active₁ > U61₁ > mark > U16₁ > tt > U15₂
U63 > active₁ > U61₁ > mark > U16₁ > tt > U52₂
U63 > active₁ > U61₁ > mark > U23₁ > tt > isNatKind
U63 > active₁ > U61₁ > mark > U23₁ > tt > U14₂
U63 > active₁ > U61₁ > mark > U23₁ > tt > U15₂
U63 > active₁ > U61₁ > mark > U23₁ > tt > U52₂
U63 > active₁ > U64₁ > mark > U16₁ > PROPER₁
U63 > active₁ > U64₁ > mark > U16₁ > tt > isNatKind
U63 > active₁ > U64₁ > mark > U16₁ > tt > U14₂
U63 > active₁ > U64₁ > mark > U16₁ > tt > U15₂
U63 > active₁ > U64₁ > mark > U16₁ > tt > U52₂
U63 > active₁ > U64₁ > mark > U23₁ > tt > isNatKind
U63 > active₁ > U64₁ > mark > U23₁ > tt > U14₂
U63 > active₁ > U64₁ > mark > U23₁ > tt > U15₂
U63 > active₁ > U64₁ > mark > U23₁ > tt > U52₂
U63 > active₁ > plus₁ > mark > U16₁ > PROPER₁
U63 > active₁ > plus₁ > mark > U16₁ > tt > isNatKind
U63 > active₁ > plus₁ > mark > U16₁ > tt > U14₂
U63 > active₁ > plus₁ > mark > U16₁ > tt > U15₂
U63 > active₁ > plus₁ > mark > U16₁ > tt > U52₂
U63 > active₁ > plus₁ > mark > U23₁ > tt > isNatKind
U63 > active₁ > plus₁ > mark > U23₁ > tt > U14₂
U63 > active₁ > plus₁ > mark > U23₁ > tt > U15₂
U63 > active₁ > plus₁ > mark > U23₁ > tt > U52₂
U63 > proper₁ > U13₁ > mark > U16₁ > PROPER₁
U63 > proper₁ > U13₁ > mark > U16₁ > tt > isNatKind
U63 > proper₁ > U13₁ > mark > U16₁ > tt > U14₂
U63 > proper₁ > U13₁ > mark > U16₁ > tt > U15₂
U63 > proper₁ > U13₁ > mark > U16₁ > tt > U52₂
U63 > proper₁ > U13₁ > mark > U23₁ > tt > isNatKind
U63 > proper₁ > U13₁ > mark > U23₁ > tt > U14₂
U63 > proper₁ > U13₁ > mark > U23₁ > tt > U15₂
U63 > proper₁ > U13₁ > mark > U23₁ > tt > U52₂
U63 > proper₁ > U22₂ > U23₁ > tt > isNatKind
U63 > proper₁ > U22₂ > U23₁ > tt > U14₂
U63 > proper₁ > U22₂ > U23₁ > tt > U15₂
U63 > proper₁ > U22₂ > U23₁ > tt > U52₂
U63 > proper₁ > U31 > U32₁ > mark > U16₁ > PROPER₁
U63 > proper₁ > U31 > U32₁ > mark > U16₁ > tt > isNatKind
U63 > proper₁ > U31 > U32₁ > mark > U16₁ > tt > U14₂
U63 > proper₁ > U31 > U32₁ > mark > U16₁ > tt > U15₂
U63 > proper₁ > U31 > U32₁ > mark > U16₁ > tt > U52₂
U63 > proper₁ > U31 > U32₁ > mark > U23₁ > tt > isNatKind
U63 > proper₁ > U31 > U32₁ > mark > U23₁ > tt > U14₂
U63 > proper₁ > U31 > U32₁ > mark > U23₁ > tt > U15₂
U63 > proper₁ > U31 > U32₁ > mark > U23₁ > tt > U52₂
U63 > proper₁ > U51₁ > mark > U16₁ > PROPER₁
U63 > proper₁ > U51₁ > mark > U16₁ > tt > isNatKind
U63 > proper₁ > U51₁ > mark > U16₁ > tt > U14₂
U63 > proper₁ > U51₁ > mark > U16₁ > tt > U15₂
U63 > proper₁ > U51₁ > mark > U16₁ > tt > U52₂
U63 > proper₁ > U51₁ > mark > U23₁ > tt > isNatKind
U63 > proper₁ > U51₁ > mark > U23₁ > tt > U14₂
U63 > proper₁ > U51₁ > mark > U23₁ > tt > U15₂
U63 > proper₁ > U51₁ > mark > U23₁ > tt > U52₂
U63 > proper₁ > U61₁ > mark > U16₁ > PROPER₁
U63 > proper₁ > U61₁ > mark > U16₁ > tt > isNatKind
U63 > proper₁ > U61₁ > mark > U16₁ > tt > U14₂
U63 > proper₁ > U61₁ > mark > U16₁ > tt > U15₂
U63 > proper₁ > U61₁ > mark > U16₁ > tt > U52₂
U63 > proper₁ > U61₁ > mark > U23₁ > tt > isNatKind
U63 > proper₁ > U61₁ > mark > U23₁ > tt > U14₂
U63 > proper₁ > U61₁ > mark > U23₁ > tt > U15₂
U63 > proper₁ > U61₁ > mark > U23₁ > tt > U52₂
U63 > proper₁ > U64₁ > mark > U16₁ > PROPER₁
U63 > proper₁ > U64₁ > mark > U16₁ > tt > isNatKind
U63 > proper₁ > U64₁ > mark > U16₁ > tt > U14₂
U63 > proper₁ > U64₁ > mark > U16₁ > tt > U15₂
U63 > proper₁ > U64₁ > mark > U16₁ > tt > U52₂
U63 > proper₁ > U64₁ > mark > U23₁ > tt > isNatKind
U63 > proper₁ > U64₁ > mark > U23₁ > tt > U14₂
U63 > proper₁ > U64₁ > mark > U23₁ > tt > U15₂
U63 > proper₁ > U64₁ > mark > U23₁ > tt > U52₂
U63 > proper₁ > plus₁ > mark > U16₁ > PROPER₁
U63 > proper₁ > plus₁ > mark > U16₁ > tt > isNatKind
U63 > proper₁ > plus₁ > mark > U16₁ > tt > U14₂
U63 > proper₁ > plus₁ > mark > U16₁ > tt > U15₂
U63 > proper₁ > plus₁ > mark > U16₁ > tt > U52₂
U63 > proper₁ > plus₁ > mark > U23₁ > tt > isNatKind
U63 > proper₁ > plus₁ > mark > U23₁ > tt > U14₂
U63 > proper₁ > plus₁ > mark > U23₁ > tt > U15₂
U63 > proper₁ > plus₁ > mark > U23₁ > tt > U52₂
0 > U51₁ > mark > U16₁ > PROPER₁
0 > U51₁ > mark > U16₁ > tt > isNatKind
0 > U51₁ > mark > U16₁ > tt > U14₂
0 > U51₁ > mark > U16₁ > tt > U15₂
0 > U51₁ > mark > U16₁ > tt > U52₂
0 > U51₁ > mark > U23₁ > tt > isNatKind
0 > U51₁ > mark > U23₁ > tt > U14₂
0 > U51₁ > mark > U23₁ > tt > U15₂
0 > U51₁ > mark > U23₁ > tt > U52₂
top > active₁ > U13₁ > mark > U16₁ > PROPER₁
top > active₁ > U13₁ > mark > U16₁ > tt > isNatKind
top > active₁ > U13₁ > mark > U16₁ > tt > U14₂
top > active₁ > U13₁ > mark > U16₁ > tt > U15₂
top > active₁ > U13₁ > mark > U16₁ > tt > U52₂
top > active₁ > U13₁ > mark > U23₁ > tt > isNatKind
top > active₁ > U13₁ > mark > U23₁ > tt > U14₂
top > active₁ > U13₁ > mark > U23₁ > tt > U15₂
top > active₁ > U13₁ > mark > U23₁ > tt > U52₂
top > active₁ > U22₂ > U23₁ > tt > isNatKind
top > active₁ > U22₂ > U23₁ > tt > U14₂
top > active₁ > U22₂ > U23₁ > tt > U15₂
top > active₁ > U22₂ > U23₁ > tt > U52₂
top > active₁ > U31 > U32₁ > mark > U16₁ > PROPER₁
top > active₁ > U31 > U32₁ > mark > U16₁ > tt > isNatKind
top > active₁ > U31 > U32₁ > mark > U16₁ > tt > U14₂
top > active₁ > U31 > U32₁ > mark > U16₁ > tt > U15₂
top > active₁ > U31 > U32₁ > mark > U16₁ > tt > U52₂
top > active₁ > U31 > U32₁ > mark > U23₁ > tt > isNatKind
top > active₁ > U31 > U32₁ > mark > U23₁ > tt > U14₂
top > active₁ > U31 > U32₁ > mark > U23₁ > tt > U15₂
top > active₁ > U31 > U32₁ > mark > U23₁ > tt > U52₂
top > active₁ > U51₁ > mark > U16₁ > PROPER₁
top > active₁ > U51₁ > mark > U16₁ > tt > isNatKind
top > active₁ > U51₁ > mark > U16₁ > tt > U14₂
top > active₁ > U51₁ > mark > U16₁ > tt > U15₂
top > active₁ > U51₁ > mark > U16₁ > tt > U52₂
top > active₁ > U51₁ > mark > U23₁ > tt > isNatKind
top > active₁ > U51₁ > mark > U23₁ > tt > U14₂
top > active₁ > U51₁ > mark > U23₁ > tt > U15₂
top > active₁ > U51₁ > mark > U23₁ > tt > U52₂
top > active₁ > U61₁ > mark > U16₁ > PROPER₁
top > active₁ > U61₁ > mark > U16₁ > tt > isNatKind
top > active₁ > U61₁ > mark > U16₁ > tt > U14₂
top > active₁ > U61₁ > mark > U16₁ > tt > U15₂
top > active₁ > U61₁ > mark > U16₁ > tt > U52₂
top > active₁ > U61₁ > mark > U23₁ > tt > isNatKind
top > active₁ > U61₁ > mark > U23₁ > tt > U14₂
top > active₁ > U61₁ > mark > U23₁ > tt > U15₂
top > active₁ > U61₁ > mark > U23₁ > tt > U52₂
top > active₁ > U64₁ > mark > U16₁ > PROPER₁
top > active₁ > U64₁ > mark > U16₁ > tt > isNatKind
top > active₁ > U64₁ > mark > U16₁ > tt > U14₂
top > active₁ > U64₁ > mark > U16₁ > tt > U15₂
top > active₁ > U64₁ > mark > U16₁ > tt > U52₂
top > active₁ > U64₁ > mark > U23₁ > tt > isNatKind
top > active₁ > U64₁ > mark > U23₁ > tt > U14₂
top > active₁ > U64₁ > mark > U23₁ > tt > U15₂
top > active₁ > U64₁ > mark > U23₁ > tt > U52₂
top > active₁ > plus₁ > mark > U16₁ > PROPER₁
top > active₁ > plus₁ > mark > U16₁ > tt > isNatKind
top > active₁ > plus₁ > mark > U16₁ > tt > U14₂
top > active₁ > plus₁ > mark > U16₁ > tt > U15₂
top > active₁ > plus₁ > mark > U16₁ > tt > U52₂
top > active₁ > plus₁ > mark > U23₁ > tt > isNatKind
top > active₁ > plus₁ > mark > U23₁ > tt > U14₂
top > active₁ > plus₁ > mark > U23₁ > tt > U15₂
top > active₁ > plus₁ > mark > U23₁ > tt > U52₂
top > proper₁ > U13₁ > mark > U16₁ > PROPER₁
top > proper₁ > U13₁ > mark > U16₁ > tt > isNatKind
top > proper₁ > U13₁ > mark > U16₁ > tt > U14₂
top > proper₁ > U13₁ > mark > U16₁ > tt > U15₂
top > proper₁ > U13₁ > mark > U16₁ > tt > U52₂
top > proper₁ > U13₁ > mark > U23₁ > tt > isNatKind
top > proper₁ > U13₁ > mark > U23₁ > tt > U14₂
top > proper₁ > U13₁ > mark > U23₁ > tt > U15₂
top > proper₁ > U13₁ > mark > U23₁ > tt > U52₂
top > proper₁ > U22₂ > U23₁ > tt > isNatKind
top > proper₁ > U22₂ > U23₁ > tt > U14₂
top > proper₁ > U22₂ > U23₁ > tt > U15₂
top > proper₁ > U22₂ > U23₁ > tt > U52₂
top > proper₁ > U31 > U32₁ > mark > U16₁ > PROPER₁
top > proper₁ > U31 > U32₁ > mark > U16₁ > tt > isNatKind
top > proper₁ > U31 > U32₁ > mark > U16₁ > tt > U14₂
top > proper₁ > U31 > U32₁ > mark > U16₁ > tt > U15₂
top > proper₁ > U31 > U32₁ > mark > U16₁ > tt > U52₂
top > proper₁ > U31 > U32₁ > mark > U23₁ > tt > isNatKind
top > proper₁ > U31 > U32₁ > mark > U23₁ > tt > U14₂
top > proper₁ > U31 > U32₁ > mark > U23₁ > tt > U15₂
top > proper₁ > U31 > U32₁ > mark > U23₁ > tt > U52₂
top > proper₁ > U51₁ > mark > U16₁ > PROPER₁
top > proper₁ > U51₁ > mark > U16₁ > tt > isNatKind
top > proper₁ > U51₁ > mark > U16₁ > tt > U14₂
top > proper₁ > U51₁ > mark > U16₁ > tt > U15₂
top > proper₁ > U51₁ > mark > U16₁ > tt > U52₂
top > proper₁ > U51₁ > mark > U23₁ > tt > isNatKind
top > proper₁ > U51₁ > mark > U23₁ > tt > U14₂
top > proper₁ > U51₁ > mark > U23₁ > tt > U15₂
top > proper₁ > U51₁ > mark > U23₁ > tt > U52₂
top > proper₁ > U61₁ > mark > U16₁ > PROPER₁
top > proper₁ > U61₁ > mark > U16₁ > tt > isNatKind
top > proper₁ > U61₁ > mark > U16₁ > tt > U14₂
top > proper₁ > U61₁ > mark > U16₁ > tt > U15₂
top > proper₁ > U61₁ > mark > U16₁ > tt > U52₂
top > proper₁ > U61₁ > mark > U23₁ > tt > isNatKind
top > proper₁ > U61₁ > mark > U23₁ > tt > U14₂
top > proper₁ > U61₁ > mark > U23₁ > tt > U15₂
top > proper₁ > U61₁ > mark > U23₁ > tt > U52₂
top > proper₁ > U64₁ > mark > U16₁ > PROPER₁
top > proper₁ > U64₁ > mark > U16₁ > tt > isNatKind
top > proper₁ > U64₁ > mark > U16₁ > tt > U14₂
top > proper₁ > U64₁ > mark > U16₁ > tt > U15₂
top > proper₁ > U64₁ > mark > U16₁ > tt > U52₂
top > proper₁ > U64₁ > mark > U23₁ > tt > isNatKind
top > proper₁ > U64₁ > mark > U23₁ > tt > U14₂
top > proper₁ > U64₁ > mark > U23₁ > tt > U15₂
top > proper₁ > U64₁ > mark > U23₁ > tt > U52₂
top > proper₁ > plus₁ > mark > U16₁ > PROPER₁
top > proper₁ > plus₁ > mark > U16₁ > tt > isNatKind
top > proper₁ > plus₁ > mark > U16₁ > tt > U14₂
top > proper₁ > plus₁ > mark > U16₁ > tt > U15₂
top > proper₁ > plus₁ > mark > U16₁ > tt > U52₂
top > proper₁ > plus₁ > mark > U23₁ > tt > isNatKind
top > proper₁ > plus₁ > mark > U23₁ > tt > U14₂
top > proper₁ > plus₁ > mark > U23₁ > tt > U15₂
top > proper₁ > plus₁ > mark > U23₁ > tt > U52₂

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(167) Obligation:

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

PROPER(U41(X)) → PROPER(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(168) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(U41(X)) → PROPER(X)

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

Lexicographic Path Order [LPO].
Precedence:

active₁ > U41₁ > tt > U14₂ > mark
active₁ > U41₁ > tt > U52₂ > mark
active₁ > U12₂ > mark
active₁ > s₁ > isNat > tt > U14₂ > mark
active₁ > s₁ > isNat > tt > U52₂ > mark
active₁ > plus > isNat > tt > U14₂ > mark
active₁ > plus > isNat > tt > U52₂ > mark
0 > mark
top > mark

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(169) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(170) PisEmptyProof (EQUIVALENT transformation)

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

(171) TRUE

(172) Obligation:

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

ACTIVE(U12(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U11(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U13(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U14(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U15(X1, X2)) → ACTIVE(X1)
ACTIVE(U16(X)) → ACTIVE(X)
ACTIVE(U21(X1, X2)) → ACTIVE(X1)
ACTIVE(U22(X1, X2)) → ACTIVE(X1)
ACTIVE(U23(X)) → ACTIVE(X)
ACTIVE(U31(X1, X2)) → ACTIVE(X1)
ACTIVE(U32(X)) → ACTIVE(X)
ACTIVE(U41(X)) → ACTIVE(X)
ACTIVE(U51(X1, X2)) → ACTIVE(X1)
ACTIVE(U52(X1, X2)) → ACTIVE(X1)
ACTIVE(U61(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U62(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U63(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U64(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(plus(X1, X2)) → ACTIVE(X1)
ACTIVE(plus(X1, X2)) → ACTIVE(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(173) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U12(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U13(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U14(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U15(X1, X2)) → ACTIVE(X1)
ACTIVE(U16(X)) → ACTIVE(X)
ACTIVE(U21(X1, X2)) → ACTIVE(X1)
ACTIVE(U22(X1, X2)) → ACTIVE(X1)
ACTIVE(U23(X)) → ACTIVE(X)
ACTIVE(U31(X1, X2)) → ACTIVE(X1)
ACTIVE(U32(X)) → ACTIVE(X)
ACTIVE(U41(X)) → ACTIVE(X)
ACTIVE(U51(X1, X2)) → ACTIVE(X1)
ACTIVE(U61(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U62(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U63(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U64(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(plus(X1, X2)) → ACTIVE(X1)
ACTIVE(plus(X1, X2)) → ACTIVE(X2)

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

Lexicographic Path Order [LPO].
Precedence:

proper₁ > U12₁ > mark > U15₁ > ACTIVE₁ > top
proper₁ > U12₁ > mark > U32₁ > ACTIVE₁ > top
proper₁ > U12₁ > mark > U61₁ > ACTIVE₁ > top
proper₁ > U12₁ > mark > plus₂ > top
proper₁ > U13₁ > U14₁ > mark > U15₁ > ACTIVE₁ > top
proper₁ > U13₁ > U14₁ > mark > U32₁ > ACTIVE₁ > top
proper₁ > U13₁ > U14₁ > mark > U61₁ > ACTIVE₁ > top
proper₁ > U13₁ > U14₁ > mark > plus₂ > top
proper₁ > U22₁ > mark > U15₁ > ACTIVE₁ > top
proper₁ > U22₁ > mark > U32₁ > ACTIVE₁ > top
proper₁ > U22₁ > mark > U61₁ > ACTIVE₁ > top
proper₁ > U22₁ > mark > plus₂ > top
proper₁ > U23₁ > tt > U16₁ > mark > U15₁ > ACTIVE₁ > top
proper₁ > U23₁ > tt > U16₁ > mark > U32₁ > ACTIVE₁ > top
proper₁ > U23₁ > tt > U16₁ > mark > U61₁ > ACTIVE₁ > top
proper₁ > U23₁ > tt > U16₁ > mark > plus₂ > top
proper₁ > U31₂ > mark > U15₁ > ACTIVE₁ > top
proper₁ > U31₂ > mark > U32₁ > ACTIVE₁ > top
proper₁ > U31₂ > mark > U61₁ > ACTIVE₁ > top
proper₁ > U31₂ > mark > plus₂ > top
proper₁ > U51₁ > mark > U15₁ > ACTIVE₁ > top
proper₁ > U51₁ > mark > U32₁ > ACTIVE₁ > top
proper₁ > U51₁ > mark > U61₁ > ACTIVE₁ > top
proper₁ > U51₁ > mark > plus₂ > top
proper₁ > U62₁ > U63₁ > mark > U15₁ > ACTIVE₁ > top
proper₁ > U62₁ > U63₁ > mark > U32₁ > ACTIVE₁ > top
proper₁ > U62₁ > U63₁ > mark > U61₁ > ACTIVE₁ > top
proper₁ > U62₁ > U63₁ > mark > plus₂ > top
proper₁ > U62₁ > isNat > U21₁ > mark > U15₁ > ACTIVE₁ > top
proper₁ > U62₁ > isNat > U21₁ > mark > U32₁ > ACTIVE₁ > top
proper₁ > U62₁ > isNat > U21₁ > mark > U61₁ > ACTIVE₁ > top
proper₁ > U62₁ > isNat > U21₁ > mark > plus₂ > top
proper₁ > U62₁ > isNat > tt > U16₁ > mark > U15₁ > ACTIVE₁ > top
proper₁ > U62₁ > isNat > tt > U16₁ > mark > U32₁ > ACTIVE₁ > top
proper₁ > U62₁ > isNat > tt > U16₁ > mark > U61₁ > ACTIVE₁ > top
proper₁ > U62₁ > isNat > tt > U16₁ > mark > plus₂ > top
proper₁ > U64₁ > s₁ > U21₁ > mark > U15₁ > ACTIVE₁ > top
proper₁ > U64₁ > s₁ > U21₁ > mark > U32₁ > ACTIVE₁ > top
proper₁ > U64₁ > s₁ > U21₁ > mark > U61₁ > ACTIVE₁ > top
proper₁ > U64₁ > s₁ > U21₁ > mark > plus₂ > top
proper₁ > U64₁ > s₁ > U41₁ > mark > U15₁ > ACTIVE₁ > top
proper₁ > U64₁ > s₁ > U41₁ > mark > U32₁ > ACTIVE₁ > top
proper₁ > U64₁ > s₁ > U41₁ > mark > U61₁ > ACTIVE₁ > top
proper₁ > U64₁ > s₁ > U41₁ > mark > plus₂ > top
proper₁ > isNatKind > U41₁ > mark > U15₁ > ACTIVE₁ > top
proper₁ > isNatKind > U41₁ > mark > U32₁ > ACTIVE₁ > top
proper₁ > isNatKind > U41₁ > mark > U61₁ > ACTIVE₁ > top
proper₁ > isNatKind > U41₁ > mark > plus₂ > top
proper₁ > isNatKind > tt > U16₁ > mark > U15₁ > ACTIVE₁ > top
proper₁ > isNatKind > tt > U16₁ > mark > U32₁ > ACTIVE₁ > top
proper₁ > isNatKind > tt > U16₁ > mark > U61₁ > ACTIVE₁ > top
proper₁ > isNatKind > tt > U16₁ > mark > plus₂ > top
proper₁ > 0 > mark > U15₁ > ACTIVE₁ > top
proper₁ > 0 > mark > U32₁ > ACTIVE₁ > top
proper₁ > 0 > mark > U61₁ > ACTIVE₁ > top
proper₁ > 0 > mark > plus₂ > top

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(174) Obligation:

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

ACTIVE(U11(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U52(X1, X2)) → ACTIVE(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(175) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U52(X1, X2)) → ACTIVE(X1)

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

Lexicographic Path Order [LPO].
Precedence:

active₁ > U12₂ > mark
active₁ > U13₂ > mark
active₁ > U15₁ > U16₁ > tt > mark
active₁ > U22 > mark
active₁ > U31 > isNatKind > tt > mark
active₁ > U41₁ > tt > mark
active₁ > U51₂ > U52₁ > mark
active₁ > U51₂ > isNatKind > tt > mark
active₁ > U61 > isNatKind > tt > mark
active₁ > U61 > U62₁ > mark
active₁ > U64₂ > plus₂ > mark
0 > tt > mark
top > mark

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(176) Obligation:

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

ACTIVE(U11(X1, X2, X3)) → ACTIVE(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(177) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U11(X1, X2, X3)) → ACTIVE(X1)

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

Lexicographic Path Order [LPO].
Precedence:

U12 > active₁ > U31 > proper₁ > U11₃ > ACTIVE₁
U12 > active₁ > U31 > proper₁ > U11₃ > mark
U12 > active₁ > U31 > proper₁ > U11₃ > ok
U12 > active₁ > U31 > proper₁ > tt > U14₁ > isNat > ok
U12 > active₁ > U31 > proper₁ > tt > U16 > mark
U12 > active₁ > U31 > proper₁ > tt > U16 > ok
U12 > active₁ > U31 > proper₁ > tt > U22 > mark
U12 > active₁ > U31 > proper₁ > tt > U22 > isNat > ok
U12 > active₁ > U31 > proper₁ > tt > U62 > mark
U12 > active₁ > U31 > proper₁ > tt > U62 > isNat > ok
U12 > active₁ > U31 > proper₁ > tt > plus₂ > mark
U12 > active₁ > U31 > proper₁ > tt > plus₂ > isNat > ok
U12 > active₁ > U31 > proper₁ > U13₁ > mark
U12 > active₁ > U31 > proper₁ > U13₁ > U14₁ > isNat > ok
U12 > active₁ > U31 > proper₁ > U15 > isNat > ok
U12 > active₁ > U31 > proper₁ > U15 > U16 > mark
U12 > active₁ > U31 > proper₁ > U15 > U16 > ok
U12 > active₁ > U31 > proper₁ > U41 > mark
U12 > active₁ > U31 > proper₁ > U41 > ok
U12 > active₁ > U31 > proper₁ > U51 > mark
U12 > active₁ > U31 > proper₁ > U51 > ok
U12 > active₁ > U31 > proper₁ > U61₁ > U62 > mark
U12 > active₁ > U31 > proper₁ > U61₁ > U62 > isNat > ok
U12 > active₁ > U31 > proper₁ > U64 > plus₂ > mark
U12 > active₁ > U31 > proper₁ > U64 > plus₂ > isNat > ok
U12 > active₁ > U31 > proper₁ > 0
U12 > active₁ > U52 > proper₁ > U11₃ > ACTIVE₁
U12 > active₁ > U52 > proper₁ > U11₃ > mark
U12 > active₁ > U52 > proper₁ > U11₃ > ok
U12 > active₁ > U52 > proper₁ > tt > U14₁ > isNat > ok
U12 > active₁ > U52 > proper₁ > tt > U16 > mark
U12 > active₁ > U52 > proper₁ > tt > U16 > ok
U12 > active₁ > U52 > proper₁ > tt > U22 > mark
U12 > active₁ > U52 > proper₁ > tt > U22 > isNat > ok
U12 > active₁ > U52 > proper₁ > tt > U62 > mark
U12 > active₁ > U52 > proper₁ > tt > U62 > isNat > ok
U12 > active₁ > U52 > proper₁ > tt > plus₂ > mark
U12 > active₁ > U52 > proper₁ > tt > plus₂ > isNat > ok
U12 > active₁ > U52 > proper₁ > U13₁ > mark
U12 > active₁ > U52 > proper₁ > U13₁ > U14₁ > isNat > ok
U12 > active₁ > U52 > proper₁ > U15 > isNat > ok
U12 > active₁ > U52 > proper₁ > U15 > U16 > mark
U12 > active₁ > U52 > proper₁ > U15 > U16 > ok
U12 > active₁ > U52 > proper₁ > U41 > mark
U12 > active₁ > U52 > proper₁ > U41 > ok
U12 > active₁ > U52 > proper₁ > U51 > mark
U12 > active₁ > U52 > proper₁ > U51 > ok
U12 > active₁ > U52 > proper₁ > U61₁ > U62 > mark
U12 > active₁ > U52 > proper₁ > U61₁ > U62 > isNat > ok
U12 > active₁ > U52 > proper₁ > U64 > plus₂ > mark
U12 > active₁ > U52 > proper₁ > U64 > plus₂ > isNat > ok
U12 > active₁ > U52 > proper₁ > 0
U32 > active₁ > U31 > proper₁ > U11₃ > ACTIVE₁
U32 > active₁ > U31 > proper₁ > U11₃ > mark
U32 > active₁ > U31 > proper₁ > U11₃ > ok
U32 > active₁ > U31 > proper₁ > tt > U14₁ > isNat > ok
U32 > active₁ > U31 > proper₁ > tt > U16 > mark
U32 > active₁ > U31 > proper₁ > tt > U16 > ok
U32 > active₁ > U31 > proper₁ > tt > U22 > mark
U32 > active₁ > U31 > proper₁ > tt > U22 > isNat > ok
U32 > active₁ > U31 > proper₁ > tt > U62 > mark
U32 > active₁ > U31 > proper₁ > tt > U62 > isNat > ok
U32 > active₁ > U31 > proper₁ > tt > plus₂ > mark
U32 > active₁ > U31 > proper₁ > tt > plus₂ > isNat > ok
U32 > active₁ > U31 > proper₁ > U13₁ > mark
U32 > active₁ > U31 > proper₁ > U13₁ > U14₁ > isNat > ok
U32 > active₁ > U31 > proper₁ > U15 > isNat > ok
U32 > active₁ > U31 > proper₁ > U15 > U16 > mark
U32 > active₁ > U31 > proper₁ > U15 > U16 > ok
U32 > active₁ > U31 > proper₁ > U41 > mark
U32 > active₁ > U31 > proper₁ > U41 > ok
U32 > active₁ > U31 > proper₁ > U51 > mark
U32 > active₁ > U31 > proper₁ > U51 > ok
U32 > active₁ > U31 > proper₁ > U61₁ > U62 > mark
U32 > active₁ > U31 > proper₁ > U61₁ > U62 > isNat > ok
U32 > active₁ > U31 > proper₁ > U64 > plus₂ > mark
U32 > active₁ > U31 > proper₁ > U64 > plus₂ > isNat > ok
U32 > active₁ > U31 > proper₁ > 0
U32 > active₁ > U52 > proper₁ > U11₃ > ACTIVE₁
U32 > active₁ > U52 > proper₁ > U11₃ > mark
U32 > active₁ > U52 > proper₁ > U11₃ > ok
U32 > active₁ > U52 > proper₁ > tt > U14₁ > isNat > ok
U32 > active₁ > U52 > proper₁ > tt > U16 > mark
U32 > active₁ > U52 > proper₁ > tt > U16 > ok
U32 > active₁ > U52 > proper₁ > tt > U22 > mark
U32 > active₁ > U52 > proper₁ > tt > U22 > isNat > ok
U32 > active₁ > U52 > proper₁ > tt > U62 > mark
U32 > active₁ > U52 > proper₁ > tt > U62 > isNat > ok
U32 > active₁ > U52 > proper₁ > tt > plus₂ > mark
U32 > active₁ > U52 > proper₁ > tt > plus₂ > isNat > ok
U32 > active₁ > U52 > proper₁ > U13₁ > mark
U32 > active₁ > U52 > proper₁ > U13₁ > U14₁ > isNat > ok
U32 > active₁ > U52 > proper₁ > U15 > isNat > ok
U32 > active₁ > U52 > proper₁ > U15 > U16 > mark
U32 > active₁ > U52 > proper₁ > U15 > U16 > ok
U32 > active₁ > U52 > proper₁ > U41 > mark
U32 > active₁ > U52 > proper₁ > U41 > ok
U32 > active₁ > U52 > proper₁ > U51 > mark
U32 > active₁ > U52 > proper₁ > U51 > ok
U32 > active₁ > U52 > proper₁ > U61₁ > U62 > mark
U32 > active₁ > U52 > proper₁ > U61₁ > U62 > isNat > ok
U32 > active₁ > U52 > proper₁ > U64 > plus₂ > mark
U32 > active₁ > U52 > proper₁ > U64 > plus₂ > isNat > ok
U32 > active₁ > U52 > proper₁ > 0
U63 > proper₁ > U11₃ > ACTIVE₁
U63 > proper₁ > U11₃ > mark
U63 > proper₁ > U11₃ > ok
U63 > proper₁ > tt > U14₁ > isNat > ok
U63 > proper₁ > tt > U16 > mark
U63 > proper₁ > tt > U16 > ok
U63 > proper₁ > tt > U22 > mark
U63 > proper₁ > tt > U22 > isNat > ok
U63 > proper₁ > tt > U62 > mark
U63 > proper₁ > tt > U62 > isNat > ok
U63 > proper₁ > tt > plus₂ > mark
U63 > proper₁ > tt > plus₂ > isNat > ok
U63 > proper₁ > U13₁ > mark
U63 > proper₁ > U13₁ > U14₁ > isNat > ok
U63 > proper₁ > U15 > isNat > ok
U63 > proper₁ > U15 > U16 > mark
U63 > proper₁ > U15 > U16 > ok
U63 > proper₁ > U41 > mark
U63 > proper₁ > U41 > ok
U63 > proper₁ > U51 > mark
U63 > proper₁ > U51 > ok
U63 > proper₁ > U61₁ > U62 > mark
U63 > proper₁ > U61₁ > U62 > isNat > ok
U63 > proper₁ > U64 > plus₂ > mark
U63 > proper₁ > U64 > plus₂ > isNat > ok
U63 > proper₁ > 0
top > active₁ > U31 > proper₁ > U11₃ > ACTIVE₁
top > active₁ > U31 > proper₁ > U11₃ > mark
top > active₁ > U31 > proper₁ > U11₃ > ok
top > active₁ > U31 > proper₁ > tt > U14₁ > isNat > ok
top > active₁ > U31 > proper₁ > tt > U16 > mark
top > active₁ > U31 > proper₁ > tt > U16 > ok
top > active₁ > U31 > proper₁ > tt > U22 > mark
top > active₁ > U31 > proper₁ > tt > U22 > isNat > ok
top > active₁ > U31 > proper₁ > tt > U62 > mark
top > active₁ > U31 > proper₁ > tt > U62 > isNat > ok
top > active₁ > U31 > proper₁ > tt > plus₂ > mark
top > active₁ > U31 > proper₁ > tt > plus₂ > isNat > ok
top > active₁ > U31 > proper₁ > U13₁ > mark
top > active₁ > U31 > proper₁ > U13₁ > U14₁ > isNat > ok
top > active₁ > U31 > proper₁ > U15 > isNat > ok
top > active₁ > U31 > proper₁ > U15 > U16 > mark
top > active₁ > U31 > proper₁ > U15 > U16 > ok
top > active₁ > U31 > proper₁ > U41 > mark
top > active₁ > U31 > proper₁ > U41 > ok
top > active₁ > U31 > proper₁ > U51 > mark
top > active₁ > U31 > proper₁ > U51 > ok
top > active₁ > U31 > proper₁ > U61₁ > U62 > mark
top > active₁ > U31 > proper₁ > U61₁ > U62 > isNat > ok
top > active₁ > U31 > proper₁ > U64 > plus₂ > mark
top > active₁ > U31 > proper₁ > U64 > plus₂ > isNat > ok
top > active₁ > U31 > proper₁ > 0
top > active₁ > U52 > proper₁ > U11₃ > ACTIVE₁
top > active₁ > U52 > proper₁ > U11₃ > mark
top > active₁ > U52 > proper₁ > U11₃ > ok
top > active₁ > U52 > proper₁ > tt > U14₁ > isNat > ok
top > active₁ > U52 > proper₁ > tt > U16 > mark
top > active₁ > U52 > proper₁ > tt > U16 > ok
top > active₁ > U52 > proper₁ > tt > U22 > mark
top > active₁ > U52 > proper₁ > tt > U22 > isNat > ok
top > active₁ > U52 > proper₁ > tt > U62 > mark
top > active₁ > U52 > proper₁ > tt > U62 > isNat > ok
top > active₁ > U52 > proper₁ > tt > plus₂ > mark
top > active₁ > U52 > proper₁ > tt > plus₂ > isNat > ok
top > active₁ > U52 > proper₁ > U13₁ > mark
top > active₁ > U52 > proper₁ > U13₁ > U14₁ > isNat > ok
top > active₁ > U52 > proper₁ > U15 > isNat > ok
top > active₁ > U52 > proper₁ > U15 > U16 > mark
top > active₁ > U52 > proper₁ > U15 > U16 > ok
top > active₁ > U52 > proper₁ > U41 > mark
top > active₁ > U52 > proper₁ > U41 > ok
top > active₁ > U52 > proper₁ > U51 > mark
top > active₁ > U52 > proper₁ > U51 > ok
top > active₁ > U52 > proper₁ > U61₁ > U62 > mark
top > active₁ > U52 > proper₁ > U61₁ > U62 > isNat > ok
top > active₁ > U52 > proper₁ > U64 > plus₂ > mark
top > active₁ > U52 > proper₁ > U64 > plus₂ > isNat > ok
top > active₁ > U52 > proper₁ > 0

The following usable rules [FROCOS05] were oriented:

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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(178) 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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(179) PisEmptyProof (EQUIVALENT transformation)

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

(180) TRUE

(181) Obligation:

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

TOP(ok(X)) → TOP(active(X))
TOP(mark(X)) → TOP(proper(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))
active(U11(X1, X2, X3)) → U11(active(X1), X2, X3)
active(U12(X1, X2, X3)) → U12(active(X1), X2, X3)
active(U13(X1, X2, X3)) → U13(active(X1), X2, X3)
active(U14(X1, X2, X3)) → U14(active(X1), X2, X3)
active(U15(X1, X2)) → U15(active(X1), X2)
active(U16(X)) → U16(active(X))
active(U21(X1, X2)) → U21(active(X1), X2)
active(U22(X1, X2)) → U22(active(X1), X2)
active(U23(X)) → U23(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U32(X)) → U32(active(X))
active(U41(X)) → U41(active(X))
active(U51(X1, X2)) → U51(active(X1), X2)
active(U52(X1, X2)) → U52(active(X1), X2)
active(U61(X1, X2, X3)) → U61(active(X1), X2, X3)
active(U62(X1, X2, X3)) → U62(active(X1), X2, X3)
active(U63(X1, X2, X3)) → U63(active(X1), X2, X3)
active(U64(X1, X2, X3)) → U64(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
U11(mark(X1), X2, X3) → mark(U11(X1, X2, X3))
U12(mark(X1), X2, X3) → mark(U12(X1, X2, X3))
U13(mark(X1), X2, X3) → mark(U13(X1, X2, X3))
U14(mark(X1), X2, X3) → mark(U14(X1, X2, X3))
U15(mark(X1), X2) → mark(U15(X1, X2))
U16(mark(X)) → mark(U16(X))
U21(mark(X1), X2) → mark(U21(X1, X2))
U22(mark(X1), X2) → mark(U22(X1, X2))
U23(mark(X)) → mark(U23(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U32(mark(X)) → mark(U32(X))
U41(mark(X)) → mark(U41(X))
U51(mark(X1), X2) → mark(U51(X1, X2))
U52(mark(X1), X2) → mark(U52(X1, X2))
U61(mark(X1), X2, X3) → mark(U61(X1, X2, X3))
U62(mark(X1), X2, X3) → mark(U62(X1, X2, X3))
U63(mark(X1), X2, X3) → mark(U63(X1, X2, X3))
U64(mark(X1), X2, X3) → mark(U64(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
proper(U11(X1, X2, X3)) → U11(proper(X1), proper(X2), proper(X3))
proper(tt) → ok(tt)
proper(U12(X1, X2, X3)) → U12(proper(X1), proper(X2), proper(X3))
proper(isNatKind(X)) → isNatKind(proper(X))
proper(U13(X1, X2, X3)) → U13(proper(X1), proper(X2), proper(X3))
proper(U14(X1, X2, X3)) → U14(proper(X1), proper(X2), proper(X3))
proper(U15(X1, X2)) → U15(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(U16(X)) → U16(proper(X))
proper(U21(X1, X2)) → U21(proper(X1), proper(X2))
proper(U22(X1, X2)) → U22(proper(X1), proper(X2))
proper(U23(X)) → U23(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U32(X)) → U32(proper(X))
proper(U41(X)) → U41(proper(X))
proper(U51(X1, X2)) → U51(proper(X1), proper(X2))
proper(U52(X1, X2)) → U52(proper(X1), proper(X2))
proper(U61(X1, X2, X3)) → U61(proper(X1), proper(X2), proper(X3))
proper(U62(X1, X2, X3)) → U62(proper(X1), proper(X2), proper(X3))
proper(U63(X1, X2, X3)) → U63(proper(X1), proper(X2), proper(X3))
proper(U64(X1, X2, X3)) → U64(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2), ok(X3)) → ok(U11(X1, X2, X3))
U12(ok(X1), ok(X2), ok(X3)) → ok(U12(X1, X2, X3))
isNatKind(ok(X)) → ok(isNatKind(X))
U13(ok(X1), ok(X2), ok(X3)) → ok(U13(X1, X2, X3))
U14(ok(X1), ok(X2), ok(X3)) → ok(U14(X1, X2, X3))
U15(ok(X1), ok(X2)) → ok(U15(X1, X2))
isNat(ok(X)) → ok(isNat(X))
U16(ok(X)) → ok(U16(X))
U21(ok(X1), ok(X2)) → ok(U21(X1, X2))
U22(ok(X1), ok(X2)) → ok(U22(X1, X2))
U23(ok(X)) → ok(U23(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U32(ok(X)) → ok(U32(X))
U41(ok(X)) → ok(U41(X))
U51(ok(X1), ok(X2)) → ok(U51(X1, X2))
U52(ok(X1), ok(X2)) → ok(U52(X1, X2))
U61(ok(X1), ok(X2), ok(X3)) → ok(U61(X1, X2, X3))
U62(ok(X1), ok(X2), ok(X3)) → ok(U62(X1, X2, X3))
U63(ok(X1), ok(X2), ok(X3)) → ok(U63(X1, X2, X3))
U64(ok(X1), ok(X2), ok(X3)) → ok(U64(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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