MAYBE 0.00/0.02 The problem does not contain well-formed TRSs: 0.00/0.02 Strict Trs: 0.00/0.02 { U61(tt()) -> s(length(L)) 0.00/0.02 , length(cons(N)) -> U61(and(and(isNatList()))) 0.00/0.02 , length(nil()) -> 0() 0.00/0.02 , and(tt()) -> X 0.00/0.02 , zeros() -> cons(0()) 0.00/0.02 , U11(tt()) -> U12(isNatList()) 0.00/0.02 , U12(tt()) -> tt() 0.00/0.02 , isNatList() -> tt() 0.00/0.02 , isNatList() -> U51(and(isNatKind())) 0.00/0.02 , U21(tt()) -> U22(isNat()) 0.00/0.02 , U22(tt()) -> tt() 0.00/0.02 , isNat() -> tt() 0.00/0.02 , isNat() -> U11(isNatIListKind()) 0.00/0.02 , isNat() -> U21(isNatKind()) 0.00/0.02 , U31(tt()) -> U32(isNatList()) 0.00/0.02 , U32(tt()) -> tt() 0.00/0.02 , U41(tt()) -> U42(isNat()) 0.00/0.02 , U42(tt()) -> U43(isNatIList()) 0.00/0.02 , U43(tt()) -> tt() 0.00/0.02 , isNatIList() -> tt() 0.00/0.02 , isNatIList() -> U31(isNatIListKind()) 0.00/0.02 , isNatIList() -> U41(and(isNatKind())) 0.00/0.02 , U51(tt()) -> U52(isNat()) 0.00/0.02 , U52(tt()) -> U53(isNatList()) 0.00/0.02 , U53(tt()) -> tt() 0.00/0.02 , isNatIListKind() -> tt() 0.00/0.02 , isNatIListKind() -> and(isNatKind()) 0.00/0.02 , isNatKind() -> tt() 0.00/0.02 , isNatKind() -> isNatIListKind() 0.00/0.02 , isNatKind() -> isNatKind() } 0.00/0.02 StartTerms: basic terms 0.00/0.02 Strategy: innermost 0.00/0.02 EOF