Input TRS: 1: zeros -> cons(0,n__zeros) 2: U11(tt,L) -> s(length(activate(L))) 3: and(tt,X) -> activate(X) 4: isNat(n__0) -> tt 5: isNat(n__length(V1)) -> isNatList(activate(V1)) 6: isNat(n__s(V1)) -> isNat(activate(V1)) 7: isNatIList(V) -> isNatList(activate(V)) 8: isNatIList(n__zeros) -> tt 9: isNatIList(n__cons(V1,V2)) -> and(isNat(activate(V1)),n__isNatIList(activate(V2))) 10: isNatList(n__nil) -> tt 11: isNatList(n__cons(V1,V2)) -> and(isNat(activate(V1)),n__isNatList(activate(V2))) 12: length(nil) -> 0 13: length(cons(N,L)) -> U11(and(isNatList(activate(L)),n__isNat(N)),activate(L)) 14: zeros -> n__zeros 15: 0 -> n__0 16: length(X) -> n__length(X) 17: s(X) -> n__s(X) 18: cons(X1,X2) -> n__cons(X1,X2) 19: isNatIList(X) -> n__isNatIList(X) 20: nil -> n__nil 21: isNatList(X) -> n__isNatList(X) 22: isNat(X) -> n__isNat(X) 23: activate(n__zeros) -> zeros 24: activate(n__0) -> 0 25: activate(n__length(X)) -> length(X) 26: activate(n__s(X)) -> s(X) 27: activate(n__cons(X1,X2)) -> cons(X1,X2) 28: activate(n__isNatIList(X)) -> isNatIList(X) 29: activate(n__nil) -> nil 30: activate(n__isNatList(X)) -> isNatList(X) 31: activate(n__isNat(X)) -> isNat(X) 32: activate(X) -> X Dependency Pairs: #1: #zeros -> #cons(0,n__zeros) #2: #zeros -> #0 #3: #U11(tt,L) -> #s(length(activate(L))) #4: #U11(tt,L) -> #length(activate(L)) #5: #U11(tt,L) -> #activate(L) #6: #and(tt,X) -> #activate(X) #7: #isNat(n__length(V1)) -> #isNatList(activate(V1)) #8: #isNat(n__length(V1)) -> #activate(V1) #9: #isNat(n__s(V1)) -> #isNat(activate(V1)) #10: #isNat(n__s(V1)) -> #activate(V1) #11: #isNatIList(V) -> #isNatList(activate(V)) #12: #isNatIList(V) -> #activate(V) #13: #isNatIList(n__cons(V1,V2)) -> #and(isNat(activate(V1)),n__isNatIList(activate(V2))) #14: #isNatIList(n__cons(V1,V2)) -> #isNat(activate(V1)) #15: #isNatIList(n__cons(V1,V2)) -> #activate(V1) #16: #isNatIList(n__cons(V1,V2)) -> #activate(V2) #17: #isNatList(n__cons(V1,V2)) -> #and(isNat(activate(V1)),n__isNatList(activate(V2))) #18: #isNatList(n__cons(V1,V2)) -> #isNat(activate(V1)) #19: #isNatList(n__cons(V1,V2)) -> #activate(V1) #20: #isNatList(n__cons(V1,V2)) -> #activate(V2) #21: #length(nil) -> #0 #22: #length(cons(N,L)) -> #U11(and(isNatList(activate(L)),n__isNat(N)),activate(L)) #23: #length(cons(N,L)) -> #and(isNatList(activate(L)),n__isNat(N)) #24: #length(cons(N,L)) -> #isNatList(activate(L)) #25: #length(cons(N,L)) -> #activate(L) #26: #length(cons(N,L)) -> #activate(L) #27: #activate(n__zeros) -> #zeros #28: #activate(n__0) -> #0 #29: #activate(n__length(X)) -> #length(X) #30: #activate(n__s(X)) -> #s(X) #31: #activate(n__cons(X1,X2)) -> #cons(X1,X2) #32: #activate(n__isNatIList(X)) -> #isNatIList(X) #33: #activate(n__nil) -> #nil #34: #activate(n__isNatList(X)) -> #isNatList(X) #35: #activate(n__isNat(X)) -> #isNat(X) Number of SCCs: 1 SCC { #4 #5 #6 #7 #8 #9 #10 #11 #12 #13 #14 #15 #16 #17 #18 #19 #20 #22 #23 #24 #25 #26 #29 #32 #34 #35 } QKBOPS(sum)... failed.