YES Input TRS: 1: a__from(X) -> cons(mark(X),from(s(X))) 2: a__after(0(),XS) -> mark(XS) 3: a__after(s(N),cons(X,XS)) -> a__after(mark(N),mark(XS)) 4: mark(from(X)) -> a__from(mark(X)) 5: mark(after(X1,X2)) -> a__after(mark(X1),mark(X2)) 6: mark(cons(X1,X2)) -> cons(mark(X1),X2) 7: mark(s(X)) -> s(mark(X)) 8: mark(0()) -> 0() 9: a__from(X) -> from(X) 10: a__after(X1,X2) -> after(X1,X2) Number of strict rules: 10 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #a__after(0(),XS) -> #mark(XS) #2: #mark(cons(X1,X2)) -> #mark(X1) #3: #mark(s(X)) -> #mark(X) #4: #mark(after(X1,X2)) -> #a__after(mark(X1),mark(X2)) #5: #mark(after(X1,X2)) -> #mark(X1) #6: #mark(after(X1,X2)) -> #mark(X2) #7: #a__after(s(N),cons(X,XS)) -> #a__after(mark(N),mark(XS)) #8: #a__after(s(N),cons(X,XS)) -> #mark(N) #9: #a__after(s(N),cons(X,XS)) -> #mark(XS) #10: #a__from(X) -> #mark(X) #11: #mark(from(X)) -> #a__from(mark(X)) #12: #mark(from(X)) -> #mark(X) Number of SCCs: 1, DPs: 12 SCC { #1..12 } POLO(Sum)... POLO(max)... succeeded. s w: x1 #a__from w: x1 + 5854 a__from w: x1 + 41065 after w: max(x1 + 71680, x2 + 30614) #a__after w: max(x1 + 46918, x2 + 5854) a__after w: max(x1 + 71680, x2 + 30614) #mark w: x1 + 5853 0 w: 0 from w: x1 + 41065 mark w: x1 cons w: max(x1 + 41065, x2) USABLE RULES: { 1..10 } Removed DPs: #1 #2 #4..6 #8..12 Number of SCCs: 2, DPs: 2 SCC { #3 } POLO(Sum)... succeeded. s w: x1 + 1 #a__from w: 0 a__from w: x1 + 1 after w: x2 + 2 #a__after w: 0 a__after w: x1 + 1 #mark w: x1 0 w: 3 from w: x1 + 21657 mark w: 2 cons w: x1 + x2 + 1 USABLE RULES: { } Removed DPs: #3 Number of SCCs: 1, DPs: 1 SCC { #7 } POLO(Sum)... succeeded. s w: x1 + 2 #a__from w: 0 a__from w: 35103 after w: x2 + 1 #a__after w: x1 a__after w: x2 + 1 #mark w: 0 0 w: 47421 from w: 35102 mark w: x1 + 1 cons w: x2 + 1 USABLE RULES: { 1..10 } Removed DPs: #7 Number of SCCs: 0, DPs: 0