YES Input TRS: 1: a__from(X) -> cons(mark(X),from(s(X))) 2: a__length(nil()) -> 0() 3: a__length(cons(X,Y)) -> s(a__length1(Y)) 4: a__length1(X) -> a__length(X) 5: mark(from(X)) -> a__from(mark(X)) 6: mark(length(X)) -> a__length(X) 7: mark(length1(X)) -> a__length1(X) 8: mark(cons(X1,X2)) -> cons(mark(X1),X2) 9: mark(s(X)) -> s(mark(X)) 10: mark(nil()) -> nil() 11: mark(0()) -> 0() 12: a__from(X) -> from(X) 13: a__length(X) -> length(X) 14: a__length1(X) -> length1(X) Number of strict rules: 14 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #mark(length(X)) -> #a__length(X) #2: #mark(s(X)) -> #mark(X) #3: #mark(length1(X)) -> #a__length1(X) #4: #mark(from(X)) -> #a__from(mark(X)) #5: #mark(from(X)) -> #mark(X) #6: #a__length(cons(X,Y)) -> #a__length1(Y) #7: #a__from(X) -> #mark(X) #8: #mark(cons(X1,X2)) -> #mark(X1) #9: #a__length1(X) -> #a__length(X) Number of SCCs: 2, DPs: 7 SCC { #6 #9 } POLO(Sum)... succeeded. #a__length1 w: x1 + 1 s w: 0 #a__from w: 0 a__from w: 0 length1 w: 0 a__length1 w: 0 #mark w: 0 0 w: 0 from w: 0 nil w: 0 mark w: 0 #a__length w: x1 cons w: x2 + 2 length w: 0 a__length w: 0 USABLE RULES: { } Removed DPs: #6 #9 Number of SCCs: 1, DPs: 5 SCC { #2 #4 #5 #7 #8 } POLO(Sum)... succeeded. #a__length1 w: 1 s w: x1 #a__from w: x1 + 1 a__from w: x1 + 38141 length1 w: 1 a__length1 w: 1144 #mark w: x1 0 w: 282 from w: x1 + 38141 nil w: 1 mark w: x1 + 38139 #a__length w: 0 cons w: x1 + 1 length w: 1090 a__length w: 1144 USABLE RULES: { 1..14 } Removed DPs: #4 #5 #7 #8 Number of SCCs: 1, DPs: 1 SCC { #2 } POLO(Sum)... succeeded. #a__length1 w: 1 s w: x1 + 1 #a__from w: x1 + 1 a__from w: 50350 length1 w: x1 + 917 a__length1 w: x1 + 1324 #mark w: x1 0 w: 51861 from w: 50349 nil w: 50537 mark w: x1 + 25907 #a__length w: 0 cons w: x2 + 1 length w: x1 + 458 a__length w: x1 + 1324 USABLE RULES: { 1..14 } Removed DPs: #2 Number of SCCs: 0, DPs: 0