Termination w.r.t. Q proof of /tmp/tmp1Qr7Nk/LengthOfFiniteLists_complete-noand

Termination w.r.t. Q of the following Term Rewriting System could not be shown:

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

zeros → cons(0, n__zeros)
U11(tt, V1) → U12(isNatIListKind(activate(V1)), activate(V1))
U12(tt, V1) → U13(isNatList(activate(V1)))
U13(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V) → U32(isNatIListKind(activate(V)), activate(V))
U32(tt, V) → U33(isNatList(activate(V)))
U33(tt) → tt
U41(tt, V1, V2) → U42(isNatKind(activate(V1)), activate(V1), activate(V2))
U42(tt, V1, V2) → U43(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U43(tt, V1, V2) → U44(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U44(tt, V1, V2) → U45(isNat(activate(V1)), activate(V2))
U45(tt, V2) → U46(isNatIList(activate(V2)))
U46(tt) → tt
U51(tt, V2) → U52(isNatIListKind(activate(V2)))
U52(tt) → tt
U61(tt) → tt
U71(tt) → tt
U81(tt, V1, V2) → U82(isNatKind(activate(V1)), activate(V1), activate(V2))
U82(tt, V1, V2) → U83(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U83(tt, V1, V2) → U84(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U84(tt, V1, V2) → U85(isNat(activate(V1)), activate(V2))
U85(tt, V2) → U86(isNatList(activate(V2)))
U86(tt) → tt
U91(tt, L, N) → U92(isNatIListKind(activate(L)), activate(L), activate(N))
U92(tt, L, N) → U93(isNat(activate(N)), activate(L), activate(N))
U93(tt, L, N) → U94(isNatKind(activate(N)), activate(L))
U94(tt, L) → s(length(activate(L)))
isNat(n__0) → tt
isNat(n__length(V1)) → U11(isNatIListKind(activate(V1)), activate(V1))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatIList(V) → U31(isNatIListKind(activate(V)), activate(V))
isNatIList(n__zeros) → tt
isNatIList(n__cons(V1, V2)) → U41(isNatKind(activate(V1)), activate(V1), activate(V2))
isNatIListKind(n__nil) → tt
isNatIListKind(n__zeros) → tt
isNatIListKind(n__cons(V1, V2)) → U51(isNatKind(activate(V1)), activate(V2))
isNatKind(n__0) → tt
isNatKind(n__length(V1)) → U61(isNatIListKind(activate(V1)))
isNatKind(n__s(V1)) → U71(isNatKind(activate(V1)))
isNatList(n__nil) → tt
isNatList(n__cons(V1, V2)) → U81(isNatKind(activate(V1)), activate(V1), activate(V2))
length(nil) → 0
length(cons(N, L)) → U91(isNatList(activate(L)), activate(L), N)
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
nil → n__nil
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__nil) → nil
activate(X) → X

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

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

zeros → cons(0, n__zeros)
U11(tt, V1) → U12(isNatIListKind(activate(V1)), activate(V1))
U12(tt, V1) → U13(isNatList(activate(V1)))
U13(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V) → U32(isNatIListKind(activate(V)), activate(V))
U32(tt, V) → U33(isNatList(activate(V)))
U33(tt) → tt
U41(tt, V1, V2) → U42(isNatKind(activate(V1)), activate(V1), activate(V2))
U42(tt, V1, V2) → U43(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U43(tt, V1, V2) → U44(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U44(tt, V1, V2) → U45(isNat(activate(V1)), activate(V2))
U45(tt, V2) → U46(isNatIList(activate(V2)))
U46(tt) → tt
U51(tt, V2) → U52(isNatIListKind(activate(V2)))
U52(tt) → tt
U61(tt) → tt
U71(tt) → tt
U81(tt, V1, V2) → U82(isNatKind(activate(V1)), activate(V1), activate(V2))
U82(tt, V1, V2) → U83(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U83(tt, V1, V2) → U84(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U84(tt, V1, V2) → U85(isNat(activate(V1)), activate(V2))
U85(tt, V2) → U86(isNatList(activate(V2)))
U86(tt) → tt
U91(tt, L, N) → U92(isNatIListKind(activate(L)), activate(L), activate(N))
U92(tt, L, N) → U93(isNat(activate(N)), activate(L), activate(N))
U93(tt, L, N) → U94(isNatKind(activate(N)), activate(L))
U94(tt, L) → s(length(activate(L)))
isNat(n__0) → tt
isNat(n__length(V1)) → U11(isNatIListKind(activate(V1)), activate(V1))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatIList(V) → U31(isNatIListKind(activate(V)), activate(V))
isNatIList(n__zeros) → tt
isNatIList(n__cons(V1, V2)) → U41(isNatKind(activate(V1)), activate(V1), activate(V2))
isNatIListKind(n__nil) → tt
isNatIListKind(n__zeros) → tt
isNatIListKind(n__cons(V1, V2)) → U51(isNatKind(activate(V1)), activate(V2))
isNatKind(n__0) → tt
isNatKind(n__length(V1)) → U61(isNatIListKind(activate(V1)))
isNatKind(n__s(V1)) → U71(isNatKind(activate(V1)))
isNatList(n__nil) → tt
isNatList(n__cons(V1, V2)) → U81(isNatKind(activate(V1)), activate(V1), activate(V2))
length(nil) → 0
length(cons(N, L)) → U91(isNatList(activate(L)), activate(L), N)
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
nil → n__nil
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__nil) → nil
activate(X) → X

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

U92¹(tt, L, N) → ACTIVATE(L)
ISNATILIST(V) → ACTIVATE(V)
U81¹(tt, V1, V2) → ISNATKIND(activate(V1))
ACTIVATE(n__0) → 0¹
U94¹(tt, L) → S(length(activate(L)))
ISNATKIND(n__s(V1)) → ISNATKIND(activate(V1))
ISNATKIND(n__length(V1)) → ACTIVATE(V1)
ISNATILIST(n__cons(V1, V2)) → ISNATKIND(activate(V1))
U51¹(tt, V2) → ISNATILISTKIND(activate(V2))
U93¹(tt, L, N) → ACTIVATE(N)
ISNAT(n__length(V1)) → U11¹(isNatIListKind(activate(V1)), activate(V1))
ISNATKIND(n__length(V1)) → ISNATILISTKIND(activate(V1))
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V1)
ACTIVATE(n__s(X)) → S(activate(X))
ACTIVATE(n__cons(X1, X2)) → CONS(activate(X1), X2)
U43¹(tt, V1, V2) → ACTIVATE(V2)
U12¹(tt, V1) → U13¹(isNatList(activate(V1)))
U31¹(tt, V) → U32¹(isNatIListKind(activate(V)), activate(V))
U43¹(tt, V1, V2) → ACTIVATE(V1)
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V2)
U22¹(tt, V1) → U23¹(isNat(activate(V1)))
U45¹(tt, V2) → U46¹(isNatIList(activate(V2)))
U12¹(tt, V1) → ISNATLIST(activate(V1))
U83¹(tt, V1, V2) → ISNATILISTKIND(activate(V2))
U91¹(tt, L, N) → ACTIVATE(N)
U91¹(tt, L, N) → ACTIVATE(L)
U92¹(tt, L, N) → U93¹(isNat(activate(N)), activate(L), activate(N))
ACTIVATE(n__cons(X1, X2)) → ACTIVATE(X1)
U43¹(tt, V1, V2) → ISNATILISTKIND(activate(V2))
ISNATILISTKIND(n__cons(V1, V2)) → ACTIVATE(V1)
U82¹(tt, V1, V2) → ISNATILISTKIND(activate(V2))
U11¹(tt, V1) → ACTIVATE(V1)
U32¹(tt, V) → ISNATLIST(activate(V))
U92¹(tt, L, N) → ACTIVATE(N)
U91¹(tt, L, N) → U92¹(isNatIListKind(activate(L)), activate(L), activate(N))
ISNATILISTKIND(n__cons(V1, V2)) → ACTIVATE(V2)
U82¹(tt, V1, V2) → U83¹(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U82¹(tt, V1, V2) → ACTIVATE(V2)
U41¹(tt, V1, V2) → ACTIVATE(V1)
U22¹(tt, V1) → ISNAT(activate(V1))
ISNATLIST(n__cons(V1, V2)) → U81¹(isNatKind(activate(V1)), activate(V1), activate(V2))
U22¹(tt, V1) → ACTIVATE(V1)
U84¹(tt, V1, V2) → U85¹(isNat(activate(V1)), activate(V2))
U84¹(tt, V1, V2) → ISNAT(activate(V1))
U31¹(tt, V) → ISNATILISTKIND(activate(V))
U51¹(tt, V2) → U52¹(isNatIListKind(activate(V2)))
U21¹(tt, V1) → ACTIVATE(V1)
U32¹(tt, V) → ACTIVATE(V)
ZEROS → CONS(0, n__zeros)
U42¹(tt, V1, V2) → ACTIVATE(V2)
U44¹(tt, V1, V2) → ACTIVATE(V1)
U43¹(tt, V1, V2) → U44¹(isNatIListKind(activate(V2)), activate(V1), activate(V2))
ISNATKIND(n__length(V1)) → U61¹(isNatIListKind(activate(V1)))
U21¹(tt, V1) → ISNATKIND(activate(V1))
ISNATILIST(n__cons(V1, V2)) → ACTIVATE(V2)
U45¹(tt, V2) → ACTIVATE(V2)
ACTIVATE(n__s(X)) → ACTIVATE(X)
U41¹(tt, V1, V2) → ISNATKIND(activate(V1))
U45¹(tt, V2) → ISNATILIST(activate(V2))
U82¹(tt, V1, V2) → ACTIVATE(V1)
U41¹(tt, V1, V2) → U42¹(isNatKind(activate(V1)), activate(V1), activate(V2))
U42¹(tt, V1, V2) → ISNATILISTKIND(activate(V2))
U83¹(tt, V1, V2) → ACTIVATE(V1)
ISNATILIST(n__cons(V1, V2)) → ACTIVATE(V1)
ISNATILISTKIND(n__cons(V1, V2)) → ISNATKIND(activate(V1))
ISNATLIST(n__cons(V1, V2)) → ISNATKIND(activate(V1))
ACTIVATE(n__zeros) → ZEROS
LENGTH(nil) → 0¹
U93¹(tt, L, N) → ISNATKIND(activate(N))
U81¹(tt, V1, V2) → ACTIVATE(V2)
U92¹(tt, L, N) → ISNAT(activate(N))
U44¹(tt, V1, V2) → U45¹(isNat(activate(V1)), activate(V2))
U93¹(tt, L, N) → ACTIVATE(L)
ACTIVATE(n__nil) → NIL
U42¹(tt, V1, V2) → ACTIVATE(V1)
ISNAT(n__s(V1)) → ACTIVATE(V1)
LENGTH(cons(N, L)) → ISNATLIST(activate(L))
U11¹(tt, V1) → U12¹(isNatIListKind(activate(V1)), activate(V1))
U21¹(tt, V1) → U22¹(isNatKind(activate(V1)), activate(V1))
U85¹(tt, V2) → ISNATLIST(activate(V2))
U94¹(tt, L) → LENGTH(activate(L))
ISNATILIST(V) → ISNATILISTKIND(activate(V))
ISNAT(n__s(V1)) → U21¹(isNatKind(activate(V1)), activate(V1))
ISNATILIST(n__cons(V1, V2)) → U41¹(isNatKind(activate(V1)), activate(V1), activate(V2))
U93¹(tt, L, N) → U94¹(isNatKind(activate(N)), activate(L))
ISNAT(n__s(V1)) → ISNATKIND(activate(V1))
U12¹(tt, V1) → ACTIVATE(V1)
U42¹(tt, V1, V2) → U43¹(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U85¹(tt, V2) → U86¹(isNatList(activate(V2)))
ISNATILISTKIND(n__cons(V1, V2)) → U51¹(isNatKind(activate(V1)), activate(V2))
U51¹(tt, V2) → ACTIVATE(V2)
ISNAT(n__length(V1)) → ISNATILISTKIND(activate(V1))
U31¹(tt, V) → ACTIVATE(V)
U84¹(tt, V1, V2) → ACTIVATE(V2)
U91¹(tt, L, N) → ISNATILISTKIND(activate(L))
U81¹(tt, V1, V2) → U82¹(isNatKind(activate(V1)), activate(V1), activate(V2))
ISNATKIND(n__s(V1)) → ACTIVATE(V1)
U81¹(tt, V1, V2) → ACTIVATE(V1)
U41¹(tt, V1, V2) → ACTIVATE(V2)
U83¹(tt, V1, V2) → U84¹(isNatIListKind(activate(V2)), activate(V1), activate(V2))
ISNATKIND(n__s(V1)) → U71¹(isNatKind(activate(V1)))
LENGTH(cons(N, L)) → U91¹(isNatList(activate(L)), activate(L), N)
U11¹(tt, V1) → ISNATILISTKIND(activate(V1))
U94¹(tt, L) → ACTIVATE(L)
LENGTH(cons(N, L)) → ACTIVATE(L)
ACTIVATE(n__length(X)) → LENGTH(activate(X))
U83¹(tt, V1, V2) → ACTIVATE(V2)
U32¹(tt, V) → U33¹(isNatList(activate(V)))
U44¹(tt, V1, V2) → ACTIVATE(V2)
U84¹(tt, V1, V2) → ACTIVATE(V1)
ISNATILIST(V) → U31¹(isNatIListKind(activate(V)), activate(V))
U85¹(tt, V2) → ACTIVATE(V2)
U44¹(tt, V1, V2) → ISNAT(activate(V1))
ZEROS → 0¹
ISNAT(n__length(V1)) → ACTIVATE(V1)
ACTIVATE(n__length(X)) → ACTIVATE(X)

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, V1) → U12(isNatIListKind(activate(V1)), activate(V1))
U12(tt, V1) → U13(isNatList(activate(V1)))
U13(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V) → U32(isNatIListKind(activate(V)), activate(V))
U32(tt, V) → U33(isNatList(activate(V)))
U33(tt) → tt
U41(tt, V1, V2) → U42(isNatKind(activate(V1)), activate(V1), activate(V2))
U42(tt, V1, V2) → U43(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U43(tt, V1, V2) → U44(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U44(tt, V1, V2) → U45(isNat(activate(V1)), activate(V2))
U45(tt, V2) → U46(isNatIList(activate(V2)))
U46(tt) → tt
U51(tt, V2) → U52(isNatIListKind(activate(V2)))
U52(tt) → tt
U61(tt) → tt
U71(tt) → tt
U81(tt, V1, V2) → U82(isNatKind(activate(V1)), activate(V1), activate(V2))
U82(tt, V1, V2) → U83(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U83(tt, V1, V2) → U84(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U84(tt, V1, V2) → U85(isNat(activate(V1)), activate(V2))
U85(tt, V2) → U86(isNatList(activate(V2)))
U86(tt) → tt
U91(tt, L, N) → U92(isNatIListKind(activate(L)), activate(L), activate(N))
U92(tt, L, N) → U93(isNat(activate(N)), activate(L), activate(N))
U93(tt, L, N) → U94(isNatKind(activate(N)), activate(L))
U94(tt, L) → s(length(activate(L)))
isNat(n__0) → tt
isNat(n__length(V1)) → U11(isNatIListKind(activate(V1)), activate(V1))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatIList(V) → U31(isNatIListKind(activate(V)), activate(V))
isNatIList(n__zeros) → tt
isNatIList(n__cons(V1, V2)) → U41(isNatKind(activate(V1)), activate(V1), activate(V2))
isNatIListKind(n__nil) → tt
isNatIListKind(n__zeros) → tt
isNatIListKind(n__cons(V1, V2)) → U51(isNatKind(activate(V1)), activate(V2))
isNatKind(n__0) → tt
isNatKind(n__length(V1)) → U61(isNatIListKind(activate(V1)))
isNatKind(n__s(V1)) → U71(isNatKind(activate(V1)))
isNatList(n__nil) → tt
isNatList(n__cons(V1, V2)) → U81(isNatKind(activate(V1)), activate(V1), activate(V2))
length(nil) → 0
length(cons(N, L)) → U91(isNatList(activate(L)), activate(L), N)
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
nil → n__nil
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__nil) → nil
activate(X) → X

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

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

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

U92¹(tt, L, N) → ACTIVATE(L)
ISNATILIST(V) → ACTIVATE(V)
U81¹(tt, V1, V2) → ISNATKIND(activate(V1))
ACTIVATE(n__0) → 0¹
U94¹(tt, L) → S(length(activate(L)))
ISNATKIND(n__s(V1)) → ISNATKIND(activate(V1))
ISNATKIND(n__length(V1)) → ACTIVATE(V1)
ISNATILIST(n__cons(V1, V2)) → ISNATKIND(activate(V1))
U51¹(tt, V2) → ISNATILISTKIND(activate(V2))
U93¹(tt, L, N) → ACTIVATE(N)
ISNAT(n__length(V1)) → U11¹(isNatIListKind(activate(V1)), activate(V1))
ISNATKIND(n__length(V1)) → ISNATILISTKIND(activate(V1))
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V1)
ACTIVATE(n__s(X)) → S(activate(X))
ACTIVATE(n__cons(X1, X2)) → CONS(activate(X1), X2)
U43¹(tt, V1, V2) → ACTIVATE(V2)
U12¹(tt, V1) → U13¹(isNatList(activate(V1)))
U31¹(tt, V) → U32¹(isNatIListKind(activate(V)), activate(V))
U43¹(tt, V1, V2) → ACTIVATE(V1)
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V2)
U22¹(tt, V1) → U23¹(isNat(activate(V1)))
U45¹(tt, V2) → U46¹(isNatIList(activate(V2)))
U12¹(tt, V1) → ISNATLIST(activate(V1))
U83¹(tt, V1, V2) → ISNATILISTKIND(activate(V2))
U91¹(tt, L, N) → ACTIVATE(N)
U91¹(tt, L, N) → ACTIVATE(L)
U92¹(tt, L, N) → U93¹(isNat(activate(N)), activate(L), activate(N))
ACTIVATE(n__cons(X1, X2)) → ACTIVATE(X1)
U43¹(tt, V1, V2) → ISNATILISTKIND(activate(V2))
ISNATILISTKIND(n__cons(V1, V2)) → ACTIVATE(V1)
U82¹(tt, V1, V2) → ISNATILISTKIND(activate(V2))
U11¹(tt, V1) → ACTIVATE(V1)
U32¹(tt, V) → ISNATLIST(activate(V))
U92¹(tt, L, N) → ACTIVATE(N)
U91¹(tt, L, N) → U92¹(isNatIListKind(activate(L)), activate(L), activate(N))
ISNATILISTKIND(n__cons(V1, V2)) → ACTIVATE(V2)
U82¹(tt, V1, V2) → U83¹(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U82¹(tt, V1, V2) → ACTIVATE(V2)
U41¹(tt, V1, V2) → ACTIVATE(V1)
U22¹(tt, V1) → ISNAT(activate(V1))
ISNATLIST(n__cons(V1, V2)) → U81¹(isNatKind(activate(V1)), activate(V1), activate(V2))
U22¹(tt, V1) → ACTIVATE(V1)
U84¹(tt, V1, V2) → U85¹(isNat(activate(V1)), activate(V2))
U84¹(tt, V1, V2) → ISNAT(activate(V1))
U31¹(tt, V) → ISNATILISTKIND(activate(V))
U51¹(tt, V2) → U52¹(isNatIListKind(activate(V2)))
U21¹(tt, V1) → ACTIVATE(V1)
U32¹(tt, V) → ACTIVATE(V)
ZEROS → CONS(0, n__zeros)
U42¹(tt, V1, V2) → ACTIVATE(V2)
U44¹(tt, V1, V2) → ACTIVATE(V1)
U43¹(tt, V1, V2) → U44¹(isNatIListKind(activate(V2)), activate(V1), activate(V2))
ISNATKIND(n__length(V1)) → U61¹(isNatIListKind(activate(V1)))
U21¹(tt, V1) → ISNATKIND(activate(V1))
ISNATILIST(n__cons(V1, V2)) → ACTIVATE(V2)
U45¹(tt, V2) → ACTIVATE(V2)
ACTIVATE(n__s(X)) → ACTIVATE(X)
U41¹(tt, V1, V2) → ISNATKIND(activate(V1))
U45¹(tt, V2) → ISNATILIST(activate(V2))
U82¹(tt, V1, V2) → ACTIVATE(V1)
U41¹(tt, V1, V2) → U42¹(isNatKind(activate(V1)), activate(V1), activate(V2))
U42¹(tt, V1, V2) → ISNATILISTKIND(activate(V2))
U83¹(tt, V1, V2) → ACTIVATE(V1)
ISNATILIST(n__cons(V1, V2)) → ACTIVATE(V1)
ISNATILISTKIND(n__cons(V1, V2)) → ISNATKIND(activate(V1))
ISNATLIST(n__cons(V1, V2)) → ISNATKIND(activate(V1))
ACTIVATE(n__zeros) → ZEROS
LENGTH(nil) → 0¹
U93¹(tt, L, N) → ISNATKIND(activate(N))
U81¹(tt, V1, V2) → ACTIVATE(V2)
U92¹(tt, L, N) → ISNAT(activate(N))
U44¹(tt, V1, V2) → U45¹(isNat(activate(V1)), activate(V2))
U93¹(tt, L, N) → ACTIVATE(L)
ACTIVATE(n__nil) → NIL
U42¹(tt, V1, V2) → ACTIVATE(V1)
ISNAT(n__s(V1)) → ACTIVATE(V1)
LENGTH(cons(N, L)) → ISNATLIST(activate(L))
U11¹(tt, V1) → U12¹(isNatIListKind(activate(V1)), activate(V1))
U21¹(tt, V1) → U22¹(isNatKind(activate(V1)), activate(V1))
U85¹(tt, V2) → ISNATLIST(activate(V2))
U94¹(tt, L) → LENGTH(activate(L))
ISNATILIST(V) → ISNATILISTKIND(activate(V))
ISNAT(n__s(V1)) → U21¹(isNatKind(activate(V1)), activate(V1))
ISNATILIST(n__cons(V1, V2)) → U41¹(isNatKind(activate(V1)), activate(V1), activate(V2))
U93¹(tt, L, N) → U94¹(isNatKind(activate(N)), activate(L))
ISNAT(n__s(V1)) → ISNATKIND(activate(V1))
U12¹(tt, V1) → ACTIVATE(V1)
U42¹(tt, V1, V2) → U43¹(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U85¹(tt, V2) → U86¹(isNatList(activate(V2)))
ISNATILISTKIND(n__cons(V1, V2)) → U51¹(isNatKind(activate(V1)), activate(V2))
U51¹(tt, V2) → ACTIVATE(V2)
ISNAT(n__length(V1)) → ISNATILISTKIND(activate(V1))
U31¹(tt, V) → ACTIVATE(V)
U84¹(tt, V1, V2) → ACTIVATE(V2)
U91¹(tt, L, N) → ISNATILISTKIND(activate(L))
U81¹(tt, V1, V2) → U82¹(isNatKind(activate(V1)), activate(V1), activate(V2))
ISNATKIND(n__s(V1)) → ACTIVATE(V1)
U81¹(tt, V1, V2) → ACTIVATE(V1)
U41¹(tt, V1, V2) → ACTIVATE(V2)
U83¹(tt, V1, V2) → U84¹(isNatIListKind(activate(V2)), activate(V1), activate(V2))
ISNATKIND(n__s(V1)) → U71¹(isNatKind(activate(V1)))
LENGTH(cons(N, L)) → U91¹(isNatList(activate(L)), activate(L), N)
U11¹(tt, V1) → ISNATILISTKIND(activate(V1))
U94¹(tt, L) → ACTIVATE(L)
LENGTH(cons(N, L)) → ACTIVATE(L)
ACTIVATE(n__length(X)) → LENGTH(activate(X))
U83¹(tt, V1, V2) → ACTIVATE(V2)
U32¹(tt, V) → U33¹(isNatList(activate(V)))
U44¹(tt, V1, V2) → ACTIVATE(V2)
U84¹(tt, V1, V2) → ACTIVATE(V1)
ISNATILIST(V) → U31¹(isNatIListKind(activate(V)), activate(V))
U85¹(tt, V2) → ACTIVATE(V2)
U44¹(tt, V1, V2) → ISNAT(activate(V1))
ZEROS → 0¹
ISNAT(n__length(V1)) → ACTIVATE(V1)
ACTIVATE(n__length(X)) → ACTIVATE(X)

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, V1) → U12(isNatIListKind(activate(V1)), activate(V1))
U12(tt, V1) → U13(isNatList(activate(V1)))
U13(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V) → U32(isNatIListKind(activate(V)), activate(V))
U32(tt, V) → U33(isNatList(activate(V)))
U33(tt) → tt
U41(tt, V1, V2) → U42(isNatKind(activate(V1)), activate(V1), activate(V2))
U42(tt, V1, V2) → U43(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U43(tt, V1, V2) → U44(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U44(tt, V1, V2) → U45(isNat(activate(V1)), activate(V2))
U45(tt, V2) → U46(isNatIList(activate(V2)))
U46(tt) → tt
U51(tt, V2) → U52(isNatIListKind(activate(V2)))
U52(tt) → tt
U61(tt) → tt
U71(tt) → tt
U81(tt, V1, V2) → U82(isNatKind(activate(V1)), activate(V1), activate(V2))
U82(tt, V1, V2) → U83(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U83(tt, V1, V2) → U84(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U84(tt, V1, V2) → U85(isNat(activate(V1)), activate(V2))
U85(tt, V2) → U86(isNatList(activate(V2)))
U86(tt) → tt
U91(tt, L, N) → U92(isNatIListKind(activate(L)), activate(L), activate(N))
U92(tt, L, N) → U93(isNat(activate(N)), activate(L), activate(N))
U93(tt, L, N) → U94(isNatKind(activate(N)), activate(L))
U94(tt, L) → s(length(activate(L)))
isNat(n__0) → tt
isNat(n__length(V1)) → U11(isNatIListKind(activate(V1)), activate(V1))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatIList(V) → U31(isNatIListKind(activate(V)), activate(V))
isNatIList(n__zeros) → tt
isNatIList(n__cons(V1, V2)) → U41(isNatKind(activate(V1)), activate(V1), activate(V2))
isNatIListKind(n__nil) → tt
isNatIListKind(n__zeros) → tt
isNatIListKind(n__cons(V1, V2)) → U51(isNatKind(activate(V1)), activate(V2))
isNatKind(n__0) → tt
isNatKind(n__length(V1)) → U61(isNatIListKind(activate(V1)))
isNatKind(n__s(V1)) → U71(isNatKind(activate(V1)))
isNatList(n__nil) → tt
isNatList(n__cons(V1, V2)) → U81(isNatKind(activate(V1)), activate(V1), activate(V2))
length(nil) → 0
length(cons(N, L)) → U91(isNatList(activate(L)), activate(L), N)
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
nil → n__nil
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__nil) → nil
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 2 SCCs with 41 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

          ↳ QDP

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

U92¹(tt, L, N) → ACTIVATE(L)
U81¹(tt, V1, V2) → ISNATKIND(activate(V1))
U21¹(tt, V1) → ISNATKIND(activate(V1))
ACTIVATE(n__s(X)) → ACTIVATE(X)
U82¹(tt, V1, V2) → ACTIVATE(V1)
U83¹(tt, V1, V2) → ACTIVATE(V1)
ISNATILISTKIND(n__cons(V1, V2)) → ISNATKIND(activate(V1))
ISNATKIND(n__s(V1)) → ISNATKIND(activate(V1))
ISNATKIND(n__length(V1)) → ACTIVATE(V1)
U51¹(tt, V2) → ISNATILISTKIND(activate(V2))
ISNATLIST(n__cons(V1, V2)) → ISNATKIND(activate(V1))
U93¹(tt, L, N) → ACTIVATE(N)
ISNAT(n__length(V1)) → U11¹(isNatIListKind(activate(V1)), activate(V1))
ISNATKIND(n__length(V1)) → ISNATILISTKIND(activate(V1))
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V1)
U93¹(tt, L, N) → ISNATKIND(activate(N))
U81¹(tt, V1, V2) → ACTIVATE(V2)
U92¹(tt, L, N) → ISNAT(activate(N))
U93¹(tt, L, N) → ACTIVATE(L)
ISNAT(n__s(V1)) → ACTIVATE(V1)
LENGTH(cons(N, L)) → ISNATLIST(activate(L))
U11¹(tt, V1) → U12¹(isNatIListKind(activate(V1)), activate(V1))
U21¹(tt, V1) → U22¹(isNatKind(activate(V1)), activate(V1))
U85¹(tt, V2) → ISNATLIST(activate(V2))
U94¹(tt, L) → LENGTH(activate(L))
ISNAT(n__s(V1)) → U21¹(isNatKind(activate(V1)), activate(V1))
U93¹(tt, L, N) → U94¹(isNatKind(activate(N)), activate(L))
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V2)
ISNAT(n__s(V1)) → ISNATKIND(activate(V1))
U12¹(tt, V1) → ACTIVATE(V1)
U91¹(tt, L, N) → ACTIVATE(N)
U83¹(tt, V1, V2) → ISNATILISTKIND(activate(V2))
U12¹(tt, V1) → ISNATLIST(activate(V1))
U91¹(tt, L, N) → ACTIVATE(L)
ISNATILISTKIND(n__cons(V1, V2)) → U51¹(isNatKind(activate(V1)), activate(V2))
U51¹(tt, V2) → ACTIVATE(V2)
ISNAT(n__length(V1)) → ISNATILISTKIND(activate(V1))
U92¹(tt, L, N) → U93¹(isNat(activate(N)), activate(L), activate(N))
U84¹(tt, V1, V2) → ACTIVATE(V2)
U91¹(tt, L, N) → ISNATILISTKIND(activate(L))
ACTIVATE(n__cons(X1, X2)) → ACTIVATE(X1)
U81¹(tt, V1, V2) → U82¹(isNatKind(activate(V1)), activate(V1), activate(V2))
ISNATKIND(n__s(V1)) → ACTIVATE(V1)
U81¹(tt, V1, V2) → ACTIVATE(V1)
U83¹(tt, V1, V2) → U84¹(isNatIListKind(activate(V2)), activate(V1), activate(V2))
ISNATILISTKIND(n__cons(V1, V2)) → ACTIVATE(V1)
U82¹(tt, V1, V2) → ISNATILISTKIND(activate(V2))
U11¹(tt, V1) → ACTIVATE(V1)
U92¹(tt, L, N) → ACTIVATE(N)
LENGTH(cons(N, L)) → U91¹(isNatList(activate(L)), activate(L), N)
U91¹(tt, L, N) → U92¹(isNatIListKind(activate(L)), activate(L), activate(N))
ISNATILISTKIND(n__cons(V1, V2)) → ACTIVATE(V2)
U11¹(tt, V1) → ISNATILISTKIND(activate(V1))
U94¹(tt, L) → ACTIVATE(L)
U82¹(tt, V1, V2) → U83¹(isNatIListKind(activate(V2)), activate(V1), activate(V2))
LENGTH(cons(N, L)) → ACTIVATE(L)
U82¹(tt, V1, V2) → ACTIVATE(V2)
ACTIVATE(n__length(X)) → LENGTH(activate(X))
U22¹(tt, V1) → ISNAT(activate(V1))
ISNATLIST(n__cons(V1, V2)) → U81¹(isNatKind(activate(V1)), activate(V1), activate(V2))
U84¹(tt, V1, V2) → U85¹(isNat(activate(V1)), activate(V2))
U22¹(tt, V1) → ACTIVATE(V1)
U83¹(tt, V1, V2) → ACTIVATE(V2)
U84¹(tt, V1, V2) → ISNAT(activate(V1))
U21¹(tt, V1) → ACTIVATE(V1)
U84¹(tt, V1, V2) → ACTIVATE(V1)
U85¹(tt, V2) → ACTIVATE(V2)
ISNAT(n__length(V1)) → ACTIVATE(V1)
ACTIVATE(n__length(X)) → ACTIVATE(X)

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, V1) → U12(isNatIListKind(activate(V1)), activate(V1))
U12(tt, V1) → U13(isNatList(activate(V1)))
U13(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V) → U32(isNatIListKind(activate(V)), activate(V))
U32(tt, V) → U33(isNatList(activate(V)))
U33(tt) → tt
U41(tt, V1, V2) → U42(isNatKind(activate(V1)), activate(V1), activate(V2))
U42(tt, V1, V2) → U43(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U43(tt, V1, V2) → U44(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U44(tt, V1, V2) → U45(isNat(activate(V1)), activate(V2))
U45(tt, V2) → U46(isNatIList(activate(V2)))
U46(tt) → tt
U51(tt, V2) → U52(isNatIListKind(activate(V2)))
U52(tt) → tt
U61(tt) → tt
U71(tt) → tt
U81(tt, V1, V2) → U82(isNatKind(activate(V1)), activate(V1), activate(V2))
U82(tt, V1, V2) → U83(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U83(tt, V1, V2) → U84(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U84(tt, V1, V2) → U85(isNat(activate(V1)), activate(V2))
U85(tt, V2) → U86(isNatList(activate(V2)))
U86(tt) → tt
U91(tt, L, N) → U92(isNatIListKind(activate(L)), activate(L), activate(N))
U92(tt, L, N) → U93(isNat(activate(N)), activate(L), activate(N))
U93(tt, L, N) → U94(isNatKind(activate(N)), activate(L))
U94(tt, L) → s(length(activate(L)))
isNat(n__0) → tt
isNat(n__length(V1)) → U11(isNatIListKind(activate(V1)), activate(V1))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatIList(V) → U31(isNatIListKind(activate(V)), activate(V))
isNatIList(n__zeros) → tt
isNatIList(n__cons(V1, V2)) → U41(isNatKind(activate(V1)), activate(V1), activate(V2))
isNatIListKind(n__nil) → tt
isNatIListKind(n__zeros) → tt
isNatIListKind(n__cons(V1, V2)) → U51(isNatKind(activate(V1)), activate(V2))
isNatKind(n__0) → tt
isNatKind(n__length(V1)) → U61(isNatIListKind(activate(V1)))
isNatKind(n__s(V1)) → U71(isNatKind(activate(V1)))
isNatList(n__nil) → tt
isNatList(n__cons(V1, V2)) → U81(isNatKind(activate(V1)), activate(V1), activate(V2))
length(nil) → 0
length(cons(N, L)) → U91(isNatList(activate(L)), activate(L), N)
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
nil → n__nil
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__nil) → nil
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

ISNATKIND(n__length(V1)) → ACTIVATE(V1)
ISNAT(n__length(V1)) → U11¹(isNatIListKind(activate(V1)), activate(V1))
ISNATKIND(n__length(V1)) → ISNATILISTKIND(activate(V1))
U11¹(tt, V1) → U12¹(isNatIListKind(activate(V1)), activate(V1))
U12¹(tt, V1) → ACTIVATE(V1)
U12¹(tt, V1) → ISNATLIST(activate(V1))
ISNAT(n__length(V1)) → ISNATILISTKIND(activate(V1))
U11¹(tt, V1) → ACTIVATE(V1)
U11¹(tt, V1) → ISNATILISTKIND(activate(V1))
ACTIVATE(n__length(X)) → LENGTH(activate(X))
ISNAT(n__length(V1)) → ACTIVATE(V1)
ACTIVATE(n__length(X)) → ACTIVATE(X)

The remaining pairs can at least be oriented weakly.

U92¹(tt, L, N) → ACTIVATE(L)
U81¹(tt, V1, V2) → ISNATKIND(activate(V1))
U21¹(tt, V1) → ISNATKIND(activate(V1))
ACTIVATE(n__s(X)) → ACTIVATE(X)
U82¹(tt, V1, V2) → ACTIVATE(V1)
U83¹(tt, V1, V2) → ACTIVATE(V1)
ISNATILISTKIND(n__cons(V1, V2)) → ISNATKIND(activate(V1))
ISNATKIND(n__s(V1)) → ISNATKIND(activate(V1))
U51¹(tt, V2) → ISNATILISTKIND(activate(V2))
ISNATLIST(n__cons(V1, V2)) → ISNATKIND(activate(V1))
U93¹(tt, L, N) → ACTIVATE(N)
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V1)
U93¹(tt, L, N) → ISNATKIND(activate(N))
U81¹(tt, V1, V2) → ACTIVATE(V2)
U92¹(tt, L, N) → ISNAT(activate(N))
U93¹(tt, L, N) → ACTIVATE(L)
ISNAT(n__s(V1)) → ACTIVATE(V1)
LENGTH(cons(N, L)) → ISNATLIST(activate(L))
U21¹(tt, V1) → U22¹(isNatKind(activate(V1)), activate(V1))
U85¹(tt, V2) → ISNATLIST(activate(V2))
U94¹(tt, L) → LENGTH(activate(L))
ISNAT(n__s(V1)) → U21¹(isNatKind(activate(V1)), activate(V1))
U93¹(tt, L, N) → U94¹(isNatKind(activate(N)), activate(L))
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V2)
ISNAT(n__s(V1)) → ISNATKIND(activate(V1))
U91¹(tt, L, N) → ACTIVATE(N)
U83¹(tt, V1, V2) → ISNATILISTKIND(activate(V2))
U91¹(tt, L, N) → ACTIVATE(L)
ISNATILISTKIND(n__cons(V1, V2)) → U51¹(isNatKind(activate(V1)), activate(V2))
U51¹(tt, V2) → ACTIVATE(V2)
U92¹(tt, L, N) → U93¹(isNat(activate(N)), activate(L), activate(N))
U84¹(tt, V1, V2) → ACTIVATE(V2)
U91¹(tt, L, N) → ISNATILISTKIND(activate(L))
ACTIVATE(n__cons(X1, X2)) → ACTIVATE(X1)
U81¹(tt, V1, V2) → U82¹(isNatKind(activate(V1)), activate(V1), activate(V2))
ISNATKIND(n__s(V1)) → ACTIVATE(V1)
U81¹(tt, V1, V2) → ACTIVATE(V1)
U83¹(tt, V1, V2) → U84¹(isNatIListKind(activate(V2)), activate(V1), activate(V2))
ISNATILISTKIND(n__cons(V1, V2)) → ACTIVATE(V1)
U82¹(tt, V1, V2) → ISNATILISTKIND(activate(V2))
U92¹(tt, L, N) → ACTIVATE(N)
LENGTH(cons(N, L)) → U91¹(isNatList(activate(L)), activate(L), N)
U91¹(tt, L, N) → U92¹(isNatIListKind(activate(L)), activate(L), activate(N))
ISNATILISTKIND(n__cons(V1, V2)) → ACTIVATE(V2)
U94¹(tt, L) → ACTIVATE(L)
U82¹(tt, V1, V2) → U83¹(isNatIListKind(activate(V2)), activate(V1), activate(V2))
LENGTH(cons(N, L)) → ACTIVATE(L)
U82¹(tt, V1, V2) → ACTIVATE(V2)
U22¹(tt, V1) → ISNAT(activate(V1))
ISNATLIST(n__cons(V1, V2)) → U81¹(isNatKind(activate(V1)), activate(V1), activate(V2))
U84¹(tt, V1, V2) → U85¹(isNat(activate(V1)), activate(V2))
U22¹(tt, V1) → ACTIVATE(V1)
U83¹(tt, V1, V2) → ACTIVATE(V2)
U84¹(tt, V1, V2) → ISNAT(activate(V1))
U21¹(tt, V1) → ACTIVATE(V1)
U84¹(tt, V1, V2) → ACTIVATE(V1)
U85¹(tt, V2) → ACTIVATE(V2)

Used ordering: Polynomial interpretation [25,35]:

POL(U51¹(x₁, x₂)) = (4)x_2
POL(U12¹(x₁, x₂)) = 3 + (4)x_2
POL(ISNATILISTKIND(x₁)) = (4)x_1
POL(U83¹(x₁, x₂, x₃)) = (4)x_2 + (4)x_3
POL(U12(x₁, x₂)) = 0
POL(U84¹(x₁, x₂, x₃)) = (4)x_2 + (4)x_3
POL(n__s(x₁)) = x_1
POL(n__nil) = 0
POL(U51(x₁, x₂)) = 0
POL(U23(x₁)) = 0
POL(tt) = 0
POL(U93(x₁, x₂, x₃)) = 2 + x_2 + (4)x_3
POL(U82¹(x₁, x₂, x₃)) = (4)x_2 + (4)x_3
POL(ACTIVATE(x₁)) = (4)x_1
POL(nil) = 0
POL(LENGTH(x₁)) = (4)x_1
POL(n__length(x₁)) = 2 + x_1
POL(U22(x₁, x₂)) = 0
POL(isNatKind(x₁)) = 0
POL(ISNAT(x₁)) = (4)x_1
POL(U93¹(x₁, x₂, x₃)) = (4)x_2 + (4)x_3
POL(U86(x₁)) = 0
POL(length(x₁)) = 2 + x_1
POL(U91¹(x₁, x₂, x₃)) = (4)x_2 + (4)x_3
POL(U82(x₁, x₂, x₃)) = 0
POL(U22¹(x₁, x₂)) = (4)x_2
POL(U21¹(x₁, x₂)) = (4)x_2
POL(activate(x₁)) = x_1
POL(U21(x₁, x₂)) = 0
POL(isNatIListKind(x₁)) = 0
POL(U92¹(x₁, x₂, x₃)) = (4)x_2 + (4)x_3
POL(ISNATLIST(x₁)) = (4)x_1
POL(U85¹(x₁, x₂)) = (4)x_2
POL(U11¹(x₁, x₂)) = 4 + (4)x_2
POL(isNatList(x₁)) = 0
POL(zeros) = 0
POL(U52(x₁)) = 0
POL(U81¹(x₁, x₂, x₃)) = (4)x_2 + (4)x_3
POL(U85(x₁, x₂)) = 0
POL(s(x₁)) = x_1
POL(isNat(x₁)) = 0
POL(U71(x₁)) = 0
POL(U83(x₁, x₂, x₃)) = 0
POL(U61(x₁)) = 0
POL(ISNATKIND(x₁)) = (4)x_1
POL(U81(x₁, x₂, x₃)) = 0
POL(n__zeros) = 0
POL(n__cons(x₁, x₂)) = (4)x_1 + x_2
POL(U11(x₁, x₂)) = 0
POL(0) = 0
POL(U94(x₁, x₂)) = 2 + x_2
POL(U91(x₁, x₂, x₃)) = 2 + x_2 + (4)x_3
POL(cons(x₁, x₂)) = (4)x_1 + x_2
POL(n__0) = 0
POL(U13(x₁)) = 0
POL(U92(x₁, x₂, x₃)) = 2 + x_2 + (4)x_3
POL(U94¹(x₁, x₂)) = (4)x_2
POL(U84(x₁, x₂, x₃)) = 0

The value of delta used in the strict ordering is 1.
The following usable rules [17] were oriented:

U81(tt, V1, V2) → U82(isNatKind(activate(V1)), activate(V1), activate(V2))
U71(tt) → tt
U83(tt, V1, V2) → U84(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U82(tt, V1, V2) → U83(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U85(tt, V2) → U86(isNatList(activate(V2)))
U84(tt, V1, V2) → U85(isNat(activate(V1)), activate(V2))
U91(tt, L, N) → U92(isNatIListKind(activate(L)), activate(L), activate(N))
U86(tt) → tt
U51(tt, V2) → U52(isNatIListKind(activate(V2)))
U61(tt) → tt
U52(tt) → tt
isNatIListKind(n__cons(V1, V2)) → U51(isNatKind(activate(V1)), activate(V2))
isNatKind(n__length(V1)) → U61(isNatIListKind(activate(V1)))
isNatKind(n__s(V1)) → U71(isNatKind(activate(V1)))
U92(tt, L, N) → U93(isNat(activate(N)), activate(L), activate(N))
U93(tt, L, N) → U94(isNatKind(activate(N)), activate(L))
U94(tt, L) → s(length(activate(L)))
isNat(n__length(V1)) → U11(isNatIListKind(activate(V1)), activate(V1))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
activate(n__length(X)) → length(activate(X))
activate(n__0) → 0
activate(n__zeros) → zeros
nil → n__nil
activate(X) → X
activate(n__nil) → nil
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__s(X)) → s(activate(X))
zeros → n__zeros
length(cons(N, L)) → U91(isNatList(activate(L)), activate(L), N)
length(nil) → 0
isNatList(n__cons(V1, V2)) → U81(isNatKind(activate(V1)), activate(V1), activate(V2))
cons(X1, X2) → n__cons(X1, X2)
s(X) → n__s(X)
length(X) → n__length(X)
0 → n__0
U12(tt, V1) → U13(isNatList(activate(V1)))
U11(tt, V1) → U12(isNatIListKind(activate(V1)), activate(V1))
zeros → cons(0, n__zeros)
U23(tt) → tt
U22(tt, V1) → U23(isNat(activate(V1)))
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U13(tt) → tt

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ DependencyGraphProof

          ↳ QDP

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

U92¹(tt, L, N) → ACTIVATE(L)
U81¹(tt, V1, V2) → ISNATKIND(activate(V1))
U21¹(tt, V1) → ISNATKIND(activate(V1))
ACTIVATE(n__s(X)) → ACTIVATE(X)
U82¹(tt, V1, V2) → ACTIVATE(V1)
U83¹(tt, V1, V2) → ACTIVATE(V1)
ISNATILISTKIND(n__cons(V1, V2)) → ISNATKIND(activate(V1))
ISNATKIND(n__s(V1)) → ISNATKIND(activate(V1))
U51¹(tt, V2) → ISNATILISTKIND(activate(V2))
ISNATLIST(n__cons(V1, V2)) → ISNATKIND(activate(V1))
U93¹(tt, L, N) → ACTIVATE(N)
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V1)
U93¹(tt, L, N) → ISNATKIND(activate(N))
U81¹(tt, V1, V2) → ACTIVATE(V2)
U92¹(tt, L, N) → ISNAT(activate(N))
U93¹(tt, L, N) → ACTIVATE(L)
ISNAT(n__s(V1)) → ACTIVATE(V1)
LENGTH(cons(N, L)) → ISNATLIST(activate(L))
U21¹(tt, V1) → U22¹(isNatKind(activate(V1)), activate(V1))
U85¹(tt, V2) → ISNATLIST(activate(V2))
U94¹(tt, L) → LENGTH(activate(L))
ISNAT(n__s(V1)) → U21¹(isNatKind(activate(V1)), activate(V1))
U93¹(tt, L, N) → U94¹(isNatKind(activate(N)), activate(L))
ISNATLIST(n__cons(V1, V2)) → ACTIVATE(V2)
ISNAT(n__s(V1)) → ISNATKIND(activate(V1))
U91¹(tt, L, N) → ACTIVATE(N)
U83¹(tt, V1, V2) → ISNATILISTKIND(activate(V2))
U91¹(tt, L, N) → ACTIVATE(L)
ISNATILISTKIND(n__cons(V1, V2)) → U51¹(isNatKind(activate(V1)), activate(V2))
U51¹(tt, V2) → ACTIVATE(V2)
U92¹(tt, L, N) → U93¹(isNat(activate(N)), activate(L), activate(N))
U84¹(tt, V1, V2) → ACTIVATE(V2)
U91¹(tt, L, N) → ISNATILISTKIND(activate(L))
ACTIVATE(n__cons(X1, X2)) → ACTIVATE(X1)
U81¹(tt, V1, V2) → U82¹(isNatKind(activate(V1)), activate(V1), activate(V2))
ISNATKIND(n__s(V1)) → ACTIVATE(V1)
U81¹(tt, V1, V2) → ACTIVATE(V1)
U83¹(tt, V1, V2) → U84¹(isNatIListKind(activate(V2)), activate(V1), activate(V2))
ISNATILISTKIND(n__cons(V1, V2)) → ACTIVATE(V1)
U82¹(tt, V1, V2) → ISNATILISTKIND(activate(V2))
U92¹(tt, L, N) → ACTIVATE(N)
LENGTH(cons(N, L)) → U91¹(isNatList(activate(L)), activate(L), N)
U91¹(tt, L, N) → U92¹(isNatIListKind(activate(L)), activate(L), activate(N))
ISNATILISTKIND(n__cons(V1, V2)) → ACTIVATE(V2)
U94¹(tt, L) → ACTIVATE(L)
U82¹(tt, V1, V2) → U83¹(isNatIListKind(activate(V2)), activate(V1), activate(V2))
LENGTH(cons(N, L)) → ACTIVATE(L)
U82¹(tt, V1, V2) → ACTIVATE(V2)
U22¹(tt, V1) → ISNAT(activate(V1))
ISNATLIST(n__cons(V1, V2)) → U81¹(isNatKind(activate(V1)), activate(V1), activate(V2))
U22¹(tt, V1) → ACTIVATE(V1)
U84¹(tt, V1, V2) → U85¹(isNat(activate(V1)), activate(V2))
U84¹(tt, V1, V2) → ISNAT(activate(V1))
U83¹(tt, V1, V2) → ACTIVATE(V2)
U21¹(tt, V1) → ACTIVATE(V1)
U84¹(tt, V1, V2) → ACTIVATE(V1)
U85¹(tt, V2) → ACTIVATE(V2)

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, V1) → U12(isNatIListKind(activate(V1)), activate(V1))
U12(tt, V1) → U13(isNatList(activate(V1)))
U13(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V) → U32(isNatIListKind(activate(V)), activate(V))
U32(tt, V) → U33(isNatList(activate(V)))
U33(tt) → tt
U41(tt, V1, V2) → U42(isNatKind(activate(V1)), activate(V1), activate(V2))
U42(tt, V1, V2) → U43(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U43(tt, V1, V2) → U44(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U44(tt, V1, V2) → U45(isNat(activate(V1)), activate(V2))
U45(tt, V2) → U46(isNatIList(activate(V2)))
U46(tt) → tt
U51(tt, V2) → U52(isNatIListKind(activate(V2)))
U52(tt) → tt
U61(tt) → tt
U71(tt) → tt
U81(tt, V1, V2) → U82(isNatKind(activate(V1)), activate(V1), activate(V2))
U82(tt, V1, V2) → U83(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U83(tt, V1, V2) → U84(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U84(tt, V1, V2) → U85(isNat(activate(V1)), activate(V2))
U85(tt, V2) → U86(isNatList(activate(V2)))
U86(tt) → tt
U91(tt, L, N) → U92(isNatIListKind(activate(L)), activate(L), activate(N))
U92(tt, L, N) → U93(isNat(activate(N)), activate(L), activate(N))
U93(tt, L, N) → U94(isNatKind(activate(N)), activate(L))
U94(tt, L) → s(length(activate(L)))
isNat(n__0) → tt
isNat(n__length(V1)) → U11(isNatIListKind(activate(V1)), activate(V1))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatIList(V) → U31(isNatIListKind(activate(V)), activate(V))
isNatIList(n__zeros) → tt
isNatIList(n__cons(V1, V2)) → U41(isNatKind(activate(V1)), activate(V1), activate(V2))
isNatIListKind(n__nil) → tt
isNatIListKind(n__zeros) → tt
isNatIListKind(n__cons(V1, V2)) → U51(isNatKind(activate(V1)), activate(V2))
isNatKind(n__0) → tt
isNatKind(n__length(V1)) → U61(isNatIListKind(activate(V1)))
isNatKind(n__s(V1)) → U71(isNatKind(activate(V1)))
isNatList(n__nil) → tt
isNatList(n__cons(V1, V2)) → U81(isNatKind(activate(V1)), activate(V1), activate(V2))
length(nil) → 0
length(cons(N, L)) → U91(isNatList(activate(L)), activate(L), N)
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
nil → n__nil
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__nil) → nil
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 6 SCCs with 38 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ DependencyGraphProof

                  ↳ AND

                    ↳ QDP

                      ↳ QDPOrderProof

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

          ↳ QDP

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

ACTIVATE(n__cons(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n__s(X)) → ACTIVATE(X)

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, V1) → U12(isNatIListKind(activate(V1)), activate(V1))
U12(tt, V1) → U13(isNatList(activate(V1)))
U13(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V) → U32(isNatIListKind(activate(V)), activate(V))
U32(tt, V) → U33(isNatList(activate(V)))
U33(tt) → tt
U41(tt, V1, V2) → U42(isNatKind(activate(V1)), activate(V1), activate(V2))
U42(tt, V1, V2) → U43(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U43(tt, V1, V2) → U44(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U44(tt, V1, V2) → U45(isNat(activate(V1)), activate(V2))
U45(tt, V2) → U46(isNatIList(activate(V2)))
U46(tt) → tt
U51(tt, V2) → U52(isNatIListKind(activate(V2)))
U52(tt) → tt
U61(tt) → tt
U71(tt) → tt
U81(tt, V1, V2) → U82(isNatKind(activate(V1)), activate(V1), activate(V2))
U82(tt, V1, V2) → U83(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U83(tt, V1, V2) → U84(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U84(tt, V1, V2) → U85(isNat(activate(V1)), activate(V2))
U85(tt, V2) → U86(isNatList(activate(V2)))
U86(tt) → tt
U91(tt, L, N) → U92(isNatIListKind(activate(L)), activate(L), activate(N))
U92(tt, L, N) → U93(isNat(activate(N)), activate(L), activate(N))
U93(tt, L, N) → U94(isNatKind(activate(N)), activate(L))
U94(tt, L) → s(length(activate(L)))
isNat(n__0) → tt
isNat(n__length(V1)) → U11(isNatIListKind(activate(V1)), activate(V1))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatIList(V) → U31(isNatIListKind(activate(V)), activate(V))
isNatIList(n__zeros) → tt
isNatIList(n__cons(V1, V2)) → U41(isNatKind(activate(V1)), activate(V1), activate(V2))
isNatIListKind(n__nil) → tt
isNatIListKind(n__zeros) → tt
isNatIListKind(n__cons(V1, V2)) → U51(isNatKind(activate(V1)), activate(V2))
isNatKind(n__0) → tt
isNatKind(n__length(V1)) → U61(isNatIListKind(activate(V1)))
isNatKind(n__s(V1)) → U71(isNatKind(activate(V1)))
isNatList(n__nil) → tt
isNatList(n__cons(V1, V2)) → U81(isNatKind(activate(V1)), activate(V1), activate(V2))
length(nil) → 0
length(cons(N, L)) → U91(isNatList(activate(L)), activate(L), N)
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
nil → n__nil
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__nil) → nil
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

ACTIVATE(n__cons(X1, X2)) → ACTIVATE(X1)
ACTIVATE(n__s(X)) → ACTIVATE(X)

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [25,35]:

POL(n__cons(x₁, x₂)) = 4 + (4)x_1
POL(n__s(x₁)) = 4 + x_1
POL(ACTIVATE(x₁)) = (4)x_1

The value of delta used in the strict ordering is 16.
The following usable rules [17] were oriented: none

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ DependencyGraphProof

                  ↳ AND

                    ↳ QDP

                      ↳ QDPOrderProof

                        ↳ QDP

                          ↳ PisEmptyProof

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

          ↳ QDP

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

zeros → cons(0, n__zeros)
U11(tt, V1) → U12(isNatIListKind(activate(V1)), activate(V1))
U12(tt, V1) → U13(isNatList(activate(V1)))
U13(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V) → U32(isNatIListKind(activate(V)), activate(V))
U32(tt, V) → U33(isNatList(activate(V)))
U33(tt) → tt
U41(tt, V1, V2) → U42(isNatKind(activate(V1)), activate(V1), activate(V2))
U42(tt, V1, V2) → U43(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U43(tt, V1, V2) → U44(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U44(tt, V1, V2) → U45(isNat(activate(V1)), activate(V2))
U45(tt, V2) → U46(isNatIList(activate(V2)))
U46(tt) → tt
U51(tt, V2) → U52(isNatIListKind(activate(V2)))
U52(tt) → tt
U61(tt) → tt
U71(tt) → tt
U81(tt, V1, V2) → U82(isNatKind(activate(V1)), activate(V1), activate(V2))
U82(tt, V1, V2) → U83(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U83(tt, V1, V2) → U84(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U84(tt, V1, V2) → U85(isNat(activate(V1)), activate(V2))
U85(tt, V2) → U86(isNatList(activate(V2)))
U86(tt) → tt
U91(tt, L, N) → U92(isNatIListKind(activate(L)), activate(L), activate(N))
U92(tt, L, N) → U93(isNat(activate(N)), activate(L), activate(N))
U93(tt, L, N) → U94(isNatKind(activate(N)), activate(L))
U94(tt, L) → s(length(activate(L)))
isNat(n__0) → tt
isNat(n__length(V1)) → U11(isNatIListKind(activate(V1)), activate(V1))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatIList(V) → U31(isNatIListKind(activate(V)), activate(V))
isNatIList(n__zeros) → tt
isNatIList(n__cons(V1, V2)) → U41(isNatKind(activate(V1)), activate(V1), activate(V2))
isNatIListKind(n__nil) → tt
isNatIListKind(n__zeros) → tt
isNatIListKind(n__cons(V1, V2)) → U51(isNatKind(activate(V1)), activate(V2))
isNatKind(n__0) → tt
isNatKind(n__length(V1)) → U61(isNatIListKind(activate(V1)))
isNatKind(n__s(V1)) → U71(isNatKind(activate(V1)))
isNatList(n__nil) → tt
isNatList(n__cons(V1, V2)) → U81(isNatKind(activate(V1)), activate(V1), activate(V2))
length(nil) → 0
length(cons(N, L)) → U91(isNatList(activate(L)), activate(L), N)
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
nil → n__nil
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__nil) → nil
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ DependencyGraphProof

                  ↳ AND

                    ↳ QDP

                    ↳ QDP

                      ↳ QDPOrderProof

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

          ↳ QDP

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

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

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, V1) → U12(isNatIListKind(activate(V1)), activate(V1))
U12(tt, V1) → U13(isNatList(activate(V1)))
U13(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V) → U32(isNatIListKind(activate(V)), activate(V))
U32(tt, V) → U33(isNatList(activate(V)))
U33(tt) → tt
U41(tt, V1, V2) → U42(isNatKind(activate(V1)), activate(V1), activate(V2))
U42(tt, V1, V2) → U43(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U43(tt, V1, V2) → U44(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U44(tt, V1, V2) → U45(isNat(activate(V1)), activate(V2))
U45(tt, V2) → U46(isNatIList(activate(V2)))
U46(tt) → tt
U51(tt, V2) → U52(isNatIListKind(activate(V2)))
U52(tt) → tt
U61(tt) → tt
U71(tt) → tt
U81(tt, V1, V2) → U82(isNatKind(activate(V1)), activate(V1), activate(V2))
U82(tt, V1, V2) → U83(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U83(tt, V1, V2) → U84(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U84(tt, V1, V2) → U85(isNat(activate(V1)), activate(V2))
U85(tt, V2) → U86(isNatList(activate(V2)))
U86(tt) → tt
U91(tt, L, N) → U92(isNatIListKind(activate(L)), activate(L), activate(N))
U92(tt, L, N) → U93(isNat(activate(N)), activate(L), activate(N))
U93(tt, L, N) → U94(isNatKind(activate(N)), activate(L))
U94(tt, L) → s(length(activate(L)))
isNat(n__0) → tt
isNat(n__length(V1)) → U11(isNatIListKind(activate(V1)), activate(V1))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatIList(V) → U31(isNatIListKind(activate(V)), activate(V))
isNatIList(n__zeros) → tt
isNatIList(n__cons(V1, V2)) → U41(isNatKind(activate(V1)), activate(V1), activate(V2))
isNatIListKind(n__nil) → tt
isNatIListKind(n__zeros) → tt
isNatIListKind(n__cons(V1, V2)) → U51(isNatKind(activate(V1)), activate(V2))
isNatKind(n__0) → tt
isNatKind(n__length(V1)) → U61(isNatIListKind(activate(V1)))
isNatKind(n__s(V1)) → U71(isNatKind(activate(V1)))
isNatList(n__nil) → tt
isNatList(n__cons(V1, V2)) → U81(isNatKind(activate(V1)), activate(V1), activate(V2))
length(nil) → 0
length(cons(N, L)) → U91(isNatList(activate(L)), activate(L), N)
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
nil → n__nil
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__nil) → nil
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

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

The remaining pairs can at least be oriented weakly.
none
Used ordering: Polynomial interpretation [25,35]:

POL(U82(x₁, x₂, x₃)) = (4)x_3
POL(activate(x₁)) = x_1
POL(U12(x₁, x₂)) = 2
POL(n__nil) = 1
POL(n__s(x₁)) = 2 + x_1
POL(U51(x₁, x₂)) = 4
POL(isNatIListKind(x₁)) = 4
POL(U21(x₁, x₂)) = 2
POL(U23(x₁)) = 2
POL(tt) = 2
POL(U93(x₁, x₂, x₃)) = 2 + x_2
POL(isNatList(x₁)) = (2)x_1
POL(zeros) = 0
POL(U52(x₁)) = 2
POL(U85(x₁, x₂)) = (4)x_2
POL(s(x₁)) = 2 + x_1
POL(isNat(x₁)) = 2
POL(U71(x₁)) = 2
POL(nil) = 1
POL(U83(x₁, x₂, x₃)) = (4)x_3
POL(U61(x₁)) = 2
POL(n__length(x₁)) = x_1
POL(U22(x₁, x₂)) = 2
POL(ISNATKIND(x₁)) = (4)x_1
POL(U81(x₁, x₂, x₃)) = (4)x_3
POL(n__zeros) = 0
POL(n__cons(x₁, x₂)) = (3)x_2
POL(isNatKind(x₁)) = 4
POL(U11(x₁, x₂)) = 2
POL(0) = 0
POL(U94(x₁, x₂)) = 2 + x_2
POL(U91(x₁, x₂, x₃)) = x_1 + x_2
POL(cons(x₁, x₂)) = (3)x_2
POL(n__0) = 0
POL(U86(x₁)) = (2)x_1
POL(U13(x₁)) = 2
POL(U92(x₁, x₂, x₃)) = 2 + x_2
POL(U84(x₁, x₂, x₃)) = (4)x_3
POL(length(x₁)) = x_1

The value of delta used in the strict ordering is 8.
The following usable rules [17] were oriented:

U81(tt, V1, V2) → U82(isNatKind(activate(V1)), activate(V1), activate(V2))
U71(tt) → tt
U83(tt, V1, V2) → U84(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U82(tt, V1, V2) → U83(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U85(tt, V2) → U86(isNatList(activate(V2)))
U84(tt, V1, V2) → U85(isNat(activate(V1)), activate(V2))
U91(tt, L, N) → U92(isNatIListKind(activate(L)), activate(L), activate(N))
U86(tt) → tt
U51(tt, V2) → U52(isNatIListKind(activate(V2)))
U61(tt) → tt
U52(tt) → tt
isNatIListKind(n__cons(V1, V2)) → U51(isNatKind(activate(V1)), activate(V2))
isNatKind(n__length(V1)) → U61(isNatIListKind(activate(V1)))
isNatKind(n__s(V1)) → U71(isNatKind(activate(V1)))
isNatList(n__nil) → tt
U92(tt, L, N) → U93(isNat(activate(N)), activate(L), activate(N))
U93(tt, L, N) → U94(isNatKind(activate(N)), activate(L))
U94(tt, L) → s(length(activate(L)))
isNat(n__length(V1)) → U11(isNatIListKind(activate(V1)), activate(V1))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
activate(n__length(X)) → length(activate(X))
activate(n__0) → 0
activate(n__zeros) → zeros
nil → n__nil
activate(X) → X
activate(n__nil) → nil
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__s(X)) → s(activate(X))
zeros → n__zeros
length(cons(N, L)) → U91(isNatList(activate(L)), activate(L), N)
length(nil) → 0
isNatList(n__cons(V1, V2)) → U81(isNatKind(activate(V1)), activate(V1), activate(V2))
cons(X1, X2) → n__cons(X1, X2)
s(X) → n__s(X)
length(X) → n__length(X)
0 → n__0
U12(tt, V1) → U13(isNatList(activate(V1)))
U11(tt, V1) → U12(isNatIListKind(activate(V1)), activate(V1))
zeros → cons(0, n__zeros)
U23(tt) → tt
U22(tt, V1) → U23(isNat(activate(V1)))
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U13(tt) → tt

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ DependencyGraphProof

                  ↳ AND

                    ↳ QDP

                    ↳ QDP

                      ↳ QDPOrderProof

                        ↳ QDP

                          ↳ PisEmptyProof

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

          ↳ QDP

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

zeros → cons(0, n__zeros)
U11(tt, V1) → U12(isNatIListKind(activate(V1)), activate(V1))
U12(tt, V1) → U13(isNatList(activate(V1)))
U13(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V) → U32(isNatIListKind(activate(V)), activate(V))
U32(tt, V) → U33(isNatList(activate(V)))
U33(tt) → tt
U41(tt, V1, V2) → U42(isNatKind(activate(V1)), activate(V1), activate(V2))
U42(tt, V1, V2) → U43(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U43(tt, V1, V2) → U44(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U44(tt, V1, V2) → U45(isNat(activate(V1)), activate(V2))
U45(tt, V2) → U46(isNatIList(activate(V2)))
U46(tt) → tt
U51(tt, V2) → U52(isNatIListKind(activate(V2)))
U52(tt) → tt
U61(tt) → tt
U71(tt) → tt
U81(tt, V1, V2) → U82(isNatKind(activate(V1)), activate(V1), activate(V2))
U82(tt, V1, V2) → U83(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U83(tt, V1, V2) → U84(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U84(tt, V1, V2) → U85(isNat(activate(V1)), activate(V2))
U85(tt, V2) → U86(isNatList(activate(V2)))
U86(tt) → tt
U91(tt, L, N) → U92(isNatIListKind(activate(L)), activate(L), activate(N))
U92(tt, L, N) → U93(isNat(activate(N)), activate(L), activate(N))
U93(tt, L, N) → U94(isNatKind(activate(N)), activate(L))
U94(tt, L) → s(length(activate(L)))
isNat(n__0) → tt
isNat(n__length(V1)) → U11(isNatIListKind(activate(V1)), activate(V1))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatIList(V) → U31(isNatIListKind(activate(V)), activate(V))
isNatIList(n__zeros) → tt
isNatIList(n__cons(V1, V2)) → U41(isNatKind(activate(V1)), activate(V1), activate(V2))
isNatIListKind(n__nil) → tt
isNatIListKind(n__zeros) → tt
isNatIListKind(n__cons(V1, V2)) → U51(isNatKind(activate(V1)), activate(V2))
isNatKind(n__0) → tt
isNatKind(n__length(V1)) → U61(isNatIListKind(activate(V1)))
isNatKind(n__s(V1)) → U71(isNatKind(activate(V1)))
isNatList(n__nil) → tt
isNatList(n__cons(V1, V2)) → U81(isNatKind(activate(V1)), activate(V1), activate(V2))
length(nil) → 0
length(cons(N, L)) → U91(isNatList(activate(L)), activate(L), N)
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
nil → n__nil
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__nil) → nil
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ DependencyGraphProof

                  ↳ AND

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

          ↳ QDP

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

ISNATILISTKIND(n__cons(V1, V2)) → U51¹(isNatKind(activate(V1)), activate(V2))
U51¹(tt, V2) → ISNATILISTKIND(activate(V2))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, V1) → U12(isNatIListKind(activate(V1)), activate(V1))
U12(tt, V1) → U13(isNatList(activate(V1)))
U13(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V) → U32(isNatIListKind(activate(V)), activate(V))
U32(tt, V) → U33(isNatList(activate(V)))
U33(tt) → tt
U41(tt, V1, V2) → U42(isNatKind(activate(V1)), activate(V1), activate(V2))
U42(tt, V1, V2) → U43(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U43(tt, V1, V2) → U44(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U44(tt, V1, V2) → U45(isNat(activate(V1)), activate(V2))
U45(tt, V2) → U46(isNatIList(activate(V2)))
U46(tt) → tt
U51(tt, V2) → U52(isNatIListKind(activate(V2)))
U52(tt) → tt
U61(tt) → tt
U71(tt) → tt
U81(tt, V1, V2) → U82(isNatKind(activate(V1)), activate(V1), activate(V2))
U82(tt, V1, V2) → U83(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U83(tt, V1, V2) → U84(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U84(tt, V1, V2) → U85(isNat(activate(V1)), activate(V2))
U85(tt, V2) → U86(isNatList(activate(V2)))
U86(tt) → tt
U91(tt, L, N) → U92(isNatIListKind(activate(L)), activate(L), activate(N))
U92(tt, L, N) → U93(isNat(activate(N)), activate(L), activate(N))
U93(tt, L, N) → U94(isNatKind(activate(N)), activate(L))
U94(tt, L) → s(length(activate(L)))
isNat(n__0) → tt
isNat(n__length(V1)) → U11(isNatIListKind(activate(V1)), activate(V1))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatIList(V) → U31(isNatIListKind(activate(V)), activate(V))
isNatIList(n__zeros) → tt
isNatIList(n__cons(V1, V2)) → U41(isNatKind(activate(V1)), activate(V1), activate(V2))
isNatIListKind(n__nil) → tt
isNatIListKind(n__zeros) → tt
isNatIListKind(n__cons(V1, V2)) → U51(isNatKind(activate(V1)), activate(V2))
isNatKind(n__0) → tt
isNatKind(n__length(V1)) → U61(isNatIListKind(activate(V1)))
isNatKind(n__s(V1)) → U71(isNatKind(activate(V1)))
isNatList(n__nil) → tt
isNatList(n__cons(V1, V2)) → U81(isNatKind(activate(V1)), activate(V1), activate(V2))
length(nil) → 0
length(cons(N, L)) → U91(isNatList(activate(L)), activate(L), N)
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
nil → n__nil
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__nil) → nil
activate(X) → X

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

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ DependencyGraphProof

                  ↳ AND

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

                      ↳ QDPOrderProof

                    ↳ QDP

                    ↳ QDP

          ↳ QDP

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

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

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, V1) → U12(isNatIListKind(activate(V1)), activate(V1))
U12(tt, V1) → U13(isNatList(activate(V1)))
U13(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V) → U32(isNatIListKind(activate(V)), activate(V))
U32(tt, V) → U33(isNatList(activate(V)))
U33(tt) → tt
U41(tt, V1, V2) → U42(isNatKind(activate(V1)), activate(V1), activate(V2))
U42(tt, V1, V2) → U43(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U43(tt, V1, V2) → U44(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U44(tt, V1, V2) → U45(isNat(activate(V1)), activate(V2))
U45(tt, V2) → U46(isNatIList(activate(V2)))
U46(tt) → tt
U51(tt, V2) → U52(isNatIListKind(activate(V2)))
U52(tt) → tt
U61(tt) → tt
U71(tt) → tt
U81(tt, V1, V2) → U82(isNatKind(activate(V1)), activate(V1), activate(V2))
U82(tt, V1, V2) → U83(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U83(tt, V1, V2) → U84(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U84(tt, V1, V2) → U85(isNat(activate(V1)), activate(V2))
U85(tt, V2) → U86(isNatList(activate(V2)))
U86(tt) → tt
U91(tt, L, N) → U92(isNatIListKind(activate(L)), activate(L), activate(N))
U92(tt, L, N) → U93(isNat(activate(N)), activate(L), activate(N))
U93(tt, L, N) → U94(isNatKind(activate(N)), activate(L))
U94(tt, L) → s(length(activate(L)))
isNat(n__0) → tt
isNat(n__length(V1)) → U11(isNatIListKind(activate(V1)), activate(V1))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatIList(V) → U31(isNatIListKind(activate(V)), activate(V))
isNatIList(n__zeros) → tt
isNatIList(n__cons(V1, V2)) → U41(isNatKind(activate(V1)), activate(V1), activate(V2))
isNatIListKind(n__nil) → tt
isNatIListKind(n__zeros) → tt
isNatIListKind(n__cons(V1, V2)) → U51(isNatKind(activate(V1)), activate(V2))
isNatKind(n__0) → tt
isNatKind(n__length(V1)) → U61(isNatIListKind(activate(V1)))
isNatKind(n__s(V1)) → U71(isNatKind(activate(V1)))
isNatList(n__nil) → tt
isNatList(n__cons(V1, V2)) → U81(isNatKind(activate(V1)), activate(V1), activate(V2))
length(nil) → 0
length(cons(N, L)) → U91(isNatList(activate(L)), activate(L), N)
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
nil → n__nil
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__nil) → nil
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

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

The remaining pairs can at least be oriented weakly.

U22¹(tt, V1) → ISNAT(activate(V1))

Used ordering: Polynomial interpretation [25,35]:

POL(U82(x₁, x₂, x₃)) = x_3
POL(U22¹(x₁, x₂)) = 1 + (2)x_2
POL(U21¹(x₁, x₂)) = (2)x_1 + (2)x_2
POL(activate(x₁)) = x_1
POL(U12(x₁, x₂)) = 4 + x_2
POL(n__nil) = 4
POL(n__s(x₁)) = 4 + x_1
POL(U51(x₁, x₂)) = 4
POL(isNatIListKind(x₁)) = 4
POL(U21(x₁, x₂)) = (4)x_1 + (3)x_2
POL(U23(x₁)) = 3 + x_1
POL(tt) = 4
POL(U93(x₁, x₂, x₃)) = 4 + (4)x_2
POL(isNatList(x₁)) = x_1
POL(zeros) = 0
POL(U52(x₁)) = 4
POL(U85(x₁, x₂)) = x_2
POL(s(x₁)) = 4 + x_1
POL(isNat(x₁)) = 4 + (3)x_1
POL(U71(x₁)) = 4
POL(nil) = 4
POL(U83(x₁, x₂, x₃)) = x_3
POL(U61(x₁)) = 4
POL(n__length(x₁)) = (4)x_1
POL(U22(x₁, x₂)) = 1 + (2)x_1 + (3)x_2
POL(U81(x₁, x₂, x₃)) = (2)x_3
POL(n__zeros) = 0
POL(n__cons(x₁, x₂)) = (2)x_2
POL(isNatKind(x₁)) = 4
POL(U11(x₁, x₂)) = 4 + (4)x_2
POL(0) = 0
POL(ISNAT(x₁)) = 1 + (2)x_1
POL(U94(x₁, x₂)) = 4 + (4)x_2
POL(U91(x₁, x₂, x₃)) = (2)x_1 + (4)x_2
POL(cons(x₁, x₂)) = (2)x_2
POL(n__0) = 0
POL(U86(x₁)) = x_1
POL(U13(x₁)) = 4
POL(U92(x₁, x₂, x₃)) = 4 + (4)x_2
POL(U84(x₁, x₂, x₃)) = x_3
POL(length(x₁)) = (4)x_1

The value of delta used in the strict ordering is 1.
The following usable rules [17] were oriented:

U81(tt, V1, V2) → U82(isNatKind(activate(V1)), activate(V1), activate(V2))
U71(tt) → tt
U83(tt, V1, V2) → U84(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U82(tt, V1, V2) → U83(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U85(tt, V2) → U86(isNatList(activate(V2)))
U84(tt, V1, V2) → U85(isNat(activate(V1)), activate(V2))
U91(tt, L, N) → U92(isNatIListKind(activate(L)), activate(L), activate(N))
U86(tt) → tt
U51(tt, V2) → U52(isNatIListKind(activate(V2)))
U61(tt) → tt
U52(tt) → tt
isNatIListKind(n__cons(V1, V2)) → U51(isNatKind(activate(V1)), activate(V2))
isNatKind(n__0) → tt
isNatKind(n__length(V1)) → U61(isNatIListKind(activate(V1)))
isNatKind(n__s(V1)) → U71(isNatKind(activate(V1)))
isNatList(n__nil) → tt
U92(tt, L, N) → U93(isNat(activate(N)), activate(L), activate(N))
U93(tt, L, N) → U94(isNatKind(activate(N)), activate(L))
U94(tt, L) → s(length(activate(L)))
isNat(n__0) → tt
isNat(n__length(V1)) → U11(isNatIListKind(activate(V1)), activate(V1))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
activate(n__length(X)) → length(activate(X))
activate(n__0) → 0
activate(n__zeros) → zeros
nil → n__nil
activate(X) → X
activate(n__nil) → nil
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__s(X)) → s(activate(X))
zeros → n__zeros
length(cons(N, L)) → U91(isNatList(activate(L)), activate(L), N)
length(nil) → 0
isNatList(n__cons(V1, V2)) → U81(isNatKind(activate(V1)), activate(V1), activate(V2))
cons(X1, X2) → n__cons(X1, X2)
s(X) → n__s(X)
length(X) → n__length(X)
0 → n__0
U12(tt, V1) → U13(isNatList(activate(V1)))
U11(tt, V1) → U12(isNatIListKind(activate(V1)), activate(V1))
zeros → cons(0, n__zeros)
U23(tt) → tt
U22(tt, V1) → U23(isNat(activate(V1)))
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U13(tt) → tt

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ DependencyGraphProof

                  ↳ AND

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

                      ↳ QDPOrderProof

                        ↳ QDP

                          ↳ DependencyGraphProof

                    ↳ QDP

                    ↳ QDP

          ↳ QDP

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

U22¹(tt, V1) → ISNAT(activate(V1))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, V1) → U12(isNatIListKind(activate(V1)), activate(V1))
U12(tt, V1) → U13(isNatList(activate(V1)))
U13(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V) → U32(isNatIListKind(activate(V)), activate(V))
U32(tt, V) → U33(isNatList(activate(V)))
U33(tt) → tt
U41(tt, V1, V2) → U42(isNatKind(activate(V1)), activate(V1), activate(V2))
U42(tt, V1, V2) → U43(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U43(tt, V1, V2) → U44(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U44(tt, V1, V2) → U45(isNat(activate(V1)), activate(V2))
U45(tt, V2) → U46(isNatIList(activate(V2)))
U46(tt) → tt
U51(tt, V2) → U52(isNatIListKind(activate(V2)))
U52(tt) → tt
U61(tt) → tt
U71(tt) → tt
U81(tt, V1, V2) → U82(isNatKind(activate(V1)), activate(V1), activate(V2))
U82(tt, V1, V2) → U83(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U83(tt, V1, V2) → U84(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U84(tt, V1, V2) → U85(isNat(activate(V1)), activate(V2))
U85(tt, V2) → U86(isNatList(activate(V2)))
U86(tt) → tt
U91(tt, L, N) → U92(isNatIListKind(activate(L)), activate(L), activate(N))
U92(tt, L, N) → U93(isNat(activate(N)), activate(L), activate(N))
U93(tt, L, N) → U94(isNatKind(activate(N)), activate(L))
U94(tt, L) → s(length(activate(L)))
isNat(n__0) → tt
isNat(n__length(V1)) → U11(isNatIListKind(activate(V1)), activate(V1))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatIList(V) → U31(isNatIListKind(activate(V)), activate(V))
isNatIList(n__zeros) → tt
isNatIList(n__cons(V1, V2)) → U41(isNatKind(activate(V1)), activate(V1), activate(V2))
isNatIListKind(n__nil) → tt
isNatIListKind(n__zeros) → tt
isNatIListKind(n__cons(V1, V2)) → U51(isNatKind(activate(V1)), activate(V2))
isNatKind(n__0) → tt
isNatKind(n__length(V1)) → U61(isNatIListKind(activate(V1)))
isNatKind(n__s(V1)) → U71(isNatKind(activate(V1)))
isNatList(n__nil) → tt
isNatList(n__cons(V1, V2)) → U81(isNatKind(activate(V1)), activate(V1), activate(V2))
length(nil) → 0
length(cons(N, L)) → U91(isNatList(activate(L)), activate(L), N)
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
nil → n__nil
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__nil) → nil
activate(X) → X

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 0 SCCs with 1 less node.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ DependencyGraphProof

                  ↳ AND

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

          ↳ QDP

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

U85¹(tt, V2) → ISNATLIST(activate(V2))
U82¹(tt, V1, V2) → U83¹(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U81¹(tt, V1, V2) → U82¹(isNatKind(activate(V1)), activate(V1), activate(V2))
ISNATLIST(n__cons(V1, V2)) → U81¹(isNatKind(activate(V1)), activate(V1), activate(V2))
U84¹(tt, V1, V2) → U85¹(isNat(activate(V1)), activate(V2))
U83¹(tt, V1, V2) → U84¹(isNatIListKind(activate(V2)), activate(V1), activate(V2))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, V1) → U12(isNatIListKind(activate(V1)), activate(V1))
U12(tt, V1) → U13(isNatList(activate(V1)))
U13(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V) → U32(isNatIListKind(activate(V)), activate(V))
U32(tt, V) → U33(isNatList(activate(V)))
U33(tt) → tt
U41(tt, V1, V2) → U42(isNatKind(activate(V1)), activate(V1), activate(V2))
U42(tt, V1, V2) → U43(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U43(tt, V1, V2) → U44(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U44(tt, V1, V2) → U45(isNat(activate(V1)), activate(V2))
U45(tt, V2) → U46(isNatIList(activate(V2)))
U46(tt) → tt
U51(tt, V2) → U52(isNatIListKind(activate(V2)))
U52(tt) → tt
U61(tt) → tt
U71(tt) → tt
U81(tt, V1, V2) → U82(isNatKind(activate(V1)), activate(V1), activate(V2))
U82(tt, V1, V2) → U83(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U83(tt, V1, V2) → U84(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U84(tt, V1, V2) → U85(isNat(activate(V1)), activate(V2))
U85(tt, V2) → U86(isNatList(activate(V2)))
U86(tt) → tt
U91(tt, L, N) → U92(isNatIListKind(activate(L)), activate(L), activate(N))
U92(tt, L, N) → U93(isNat(activate(N)), activate(L), activate(N))
U93(tt, L, N) → U94(isNatKind(activate(N)), activate(L))
U94(tt, L) → s(length(activate(L)))
isNat(n__0) → tt
isNat(n__length(V1)) → U11(isNatIListKind(activate(V1)), activate(V1))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatIList(V) → U31(isNatIListKind(activate(V)), activate(V))
isNatIList(n__zeros) → tt
isNatIList(n__cons(V1, V2)) → U41(isNatKind(activate(V1)), activate(V1), activate(V2))
isNatIListKind(n__nil) → tt
isNatIListKind(n__zeros) → tt
isNatIListKind(n__cons(V1, V2)) → U51(isNatKind(activate(V1)), activate(V2))
isNatKind(n__0) → tt
isNatKind(n__length(V1)) → U61(isNatIListKind(activate(V1)))
isNatKind(n__s(V1)) → U71(isNatKind(activate(V1)))
isNatList(n__nil) → tt
isNatList(n__cons(V1, V2)) → U81(isNatKind(activate(V1)), activate(V1), activate(V2))
length(nil) → 0
length(cons(N, L)) → U91(isNatList(activate(L)), activate(L), N)
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
nil → n__nil
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__nil) → nil
activate(X) → X

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

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

            ↳ QDPOrderProof

              ↳ QDP

                ↳ DependencyGraphProof

                  ↳ AND

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

                    ↳ QDP

          ↳ QDP

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

U94¹(tt, L) → LENGTH(activate(L))
U93¹(tt, L, N) → U94¹(isNatKind(activate(N)), activate(L))
LENGTH(cons(N, L)) → U91¹(isNatList(activate(L)), activate(L), N)
U91¹(tt, L, N) → U92¹(isNatIListKind(activate(L)), activate(L), activate(N))
U92¹(tt, L, N) → U93¹(isNat(activate(N)), activate(L), activate(N))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, V1) → U12(isNatIListKind(activate(V1)), activate(V1))
U12(tt, V1) → U13(isNatList(activate(V1)))
U13(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V) → U32(isNatIListKind(activate(V)), activate(V))
U32(tt, V) → U33(isNatList(activate(V)))
U33(tt) → tt
U41(tt, V1, V2) → U42(isNatKind(activate(V1)), activate(V1), activate(V2))
U42(tt, V1, V2) → U43(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U43(tt, V1, V2) → U44(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U44(tt, V1, V2) → U45(isNat(activate(V1)), activate(V2))
U45(tt, V2) → U46(isNatIList(activate(V2)))
U46(tt) → tt
U51(tt, V2) → U52(isNatIListKind(activate(V2)))
U52(tt) → tt
U61(tt) → tt
U71(tt) → tt
U81(tt, V1, V2) → U82(isNatKind(activate(V1)), activate(V1), activate(V2))
U82(tt, V1, V2) → U83(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U83(tt, V1, V2) → U84(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U84(tt, V1, V2) → U85(isNat(activate(V1)), activate(V2))
U85(tt, V2) → U86(isNatList(activate(V2)))
U86(tt) → tt
U91(tt, L, N) → U92(isNatIListKind(activate(L)), activate(L), activate(N))
U92(tt, L, N) → U93(isNat(activate(N)), activate(L), activate(N))
U93(tt, L, N) → U94(isNatKind(activate(N)), activate(L))
U94(tt, L) → s(length(activate(L)))
isNat(n__0) → tt
isNat(n__length(V1)) → U11(isNatIListKind(activate(V1)), activate(V1))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatIList(V) → U31(isNatIListKind(activate(V)), activate(V))
isNatIList(n__zeros) → tt
isNatIList(n__cons(V1, V2)) → U41(isNatKind(activate(V1)), activate(V1), activate(V2))
isNatIListKind(n__nil) → tt
isNatIListKind(n__zeros) → tt
isNatIListKind(n__cons(V1, V2)) → U51(isNatKind(activate(V1)), activate(V2))
isNatKind(n__0) → tt
isNatKind(n__length(V1)) → U61(isNatIListKind(activate(V1)))
isNatKind(n__s(V1)) → U71(isNatKind(activate(V1)))
isNatList(n__nil) → tt
isNatList(n__cons(V1, V2)) → U81(isNatKind(activate(V1)), activate(V1), activate(V2))
length(nil) → 0
length(cons(N, L)) → U91(isNatList(activate(L)), activate(L), N)
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
nil → n__nil
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__nil) → nil
activate(X) → X

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

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ AND

          ↳ QDP

          ↳ QDP

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

U43¹(tt, V1, V2) → U44¹(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U42¹(tt, V1, V2) → U43¹(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U41¹(tt, V1, V2) → U42¹(isNatKind(activate(V1)), activate(V1), activate(V2))
U44¹(tt, V1, V2) → U45¹(isNat(activate(V1)), activate(V2))
ISNATILIST(n__cons(V1, V2)) → U41¹(isNatKind(activate(V1)), activate(V1), activate(V2))
U45¹(tt, V2) → ISNATILIST(activate(V2))

The TRS R consists of the following rules:

zeros → cons(0, n__zeros)
U11(tt, V1) → U12(isNatIListKind(activate(V1)), activate(V1))
U12(tt, V1) → U13(isNatList(activate(V1)))
U13(tt) → tt
U21(tt, V1) → U22(isNatKind(activate(V1)), activate(V1))
U22(tt, V1) → U23(isNat(activate(V1)))
U23(tt) → tt
U31(tt, V) → U32(isNatIListKind(activate(V)), activate(V))
U32(tt, V) → U33(isNatList(activate(V)))
U33(tt) → tt
U41(tt, V1, V2) → U42(isNatKind(activate(V1)), activate(V1), activate(V2))
U42(tt, V1, V2) → U43(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U43(tt, V1, V2) → U44(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U44(tt, V1, V2) → U45(isNat(activate(V1)), activate(V2))
U45(tt, V2) → U46(isNatIList(activate(V2)))
U46(tt) → tt
U51(tt, V2) → U52(isNatIListKind(activate(V2)))
U52(tt) → tt
U61(tt) → tt
U71(tt) → tt
U81(tt, V1, V2) → U82(isNatKind(activate(V1)), activate(V1), activate(V2))
U82(tt, V1, V2) → U83(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U83(tt, V1, V2) → U84(isNatIListKind(activate(V2)), activate(V1), activate(V2))
U84(tt, V1, V2) → U85(isNat(activate(V1)), activate(V2))
U85(tt, V2) → U86(isNatList(activate(V2)))
U86(tt) → tt
U91(tt, L, N) → U92(isNatIListKind(activate(L)), activate(L), activate(N))
U92(tt, L, N) → U93(isNat(activate(N)), activate(L), activate(N))
U93(tt, L, N) → U94(isNatKind(activate(N)), activate(L))
U94(tt, L) → s(length(activate(L)))
isNat(n__0) → tt
isNat(n__length(V1)) → U11(isNatIListKind(activate(V1)), activate(V1))
isNat(n__s(V1)) → U21(isNatKind(activate(V1)), activate(V1))
isNatIList(V) → U31(isNatIListKind(activate(V)), activate(V))
isNatIList(n__zeros) → tt
isNatIList(n__cons(V1, V2)) → U41(isNatKind(activate(V1)), activate(V1), activate(V2))
isNatIListKind(n__nil) → tt
isNatIListKind(n__zeros) → tt
isNatIListKind(n__cons(V1, V2)) → U51(isNatKind(activate(V1)), activate(V2))
isNatKind(n__0) → tt
isNatKind(n__length(V1)) → U61(isNatIListKind(activate(V1)))
isNatKind(n__s(V1)) → U71(isNatKind(activate(V1)))
isNatList(n__nil) → tt
isNatList(n__cons(V1, V2)) → U81(isNatKind(activate(V1)), activate(V1), activate(V2))
length(nil) → 0
length(cons(N, L)) → U91(isNatList(activate(L)), activate(L), N)
zeros → n__zeros
0 → n__0
length(X) → n__length(X)
s(X) → n__s(X)
cons(X1, X2) → n__cons(X1, X2)
nil → n__nil
activate(n__zeros) → zeros
activate(n__0) → 0
activate(n__length(X)) → length(activate(X))
activate(n__s(X)) → s(activate(X))
activate(n__cons(X1, X2)) → cons(activate(X1), X2)
activate(n__nil) → nil
activate(X) → X

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