Termination proof of /tmp/tmpuu1FJv/LengthOfFiniteLists_nokinds

Termination of the following Term Rewriting System could be disproven:

Generalized rewrite system (where rules with free variables on rhs are allowed):
The TRS R consists of the following rules:

U11(tt) → s(length(L))
and(tt) → X
zeros → cons(0)
isNat → tt
isNat → isNatList
isNat → isNat
isNatIList → isNatList
isNatIList → tt
isNatIList → and(isNat)
isNatList → tt
isNatList → and(isNat)
length(nil) → 0
length(cons(N)) → U11(and(isNatList))

↳ GTRS

  ↳ CritRuleProof

Generalized rewrite system (where rules with free variables on rhs are allowed):
The TRS R consists of the following rules:

U11(tt) → s(length(L))
and(tt) → X
zeros → cons(0)
isNat → tt
isNat → isNatList
isNat → isNat
isNatIList → isNatList
isNatIList → tt
isNatIList → and(isNat)
isNatList → tt
isNatList → and(isNat)
length(nil) → 0
length(cons(N)) → U11(and(isNatList))

The rule U11(tt) → s(length(L)) contains free variables in its right-hand side. Hence the TRS is not-terminating.