/export/starexec/sandbox/solver/bin/starexec_run_Default /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: natsFrom(N) -> cons(N,n__natsFrom(s(N))) 2: fst(pair(XS,YS)) -> XS 3: snd(pair(XS,YS)) -> YS 4: splitAt(0(),XS) -> pair(nil(),XS) 5: splitAt(s(N),cons(X,XS)) -> u(splitAt(N,activate(XS)),N,X,activate(XS)) 6: u(pair(YS,ZS),N,X,XS) -> pair(cons(activate(X),YS),ZS) 7: head(cons(N,XS)) -> N 8: tail(cons(N,XS)) -> activate(XS) 9: sel(N,XS) -> head(afterNth(N,XS)) 10: take(N,XS) -> fst(splitAt(N,XS)) 11: afterNth(N,XS) -> snd(splitAt(N,XS)) 12: natsFrom(X) -> n__natsFrom(X) 13: activate(n__natsFrom(X)) -> natsFrom(X) 14: activate(X) -> X Number of strict rules: 14 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #u(pair(YS,ZS),N,X,XS) -> #activate(X) #2: #activate(n__natsFrom(X)) -> #natsFrom(X) #3: #sel(N,XS) -> #head(afterNth(N,XS)) #4: #sel(N,XS) -> #afterNth(N,XS) #5: #afterNth(N,XS) -> #snd(splitAt(N,XS)) #6: #afterNth(N,XS) -> #splitAt(N,XS) #7: #take(N,XS) -> #fst(splitAt(N,XS)) #8: #take(N,XS) -> #splitAt(N,XS) #9: #splitAt(s(N),cons(X,XS)) -> #u(splitAt(N,activate(XS)),N,X,activate(XS)) #10: #splitAt(s(N),cons(X,XS)) -> #splitAt(N,activate(XS)) #11: #splitAt(s(N),cons(X,XS)) -> #activate(XS) #12: #splitAt(s(N),cons(X,XS)) -> #activate(XS) #13: #tail(cons(N,XS)) -> #activate(XS) Number of SCCs: 1, DPs: 1 SCC { #10 } POLO(Sum)... succeeded. s w: x1 + 1 #take w: 0 u w: 0 activate w: x1 + 2 take w: 0 #u w: 0 pair w: 0 fst w: 0 #activate w: 0 natsFrom w: x1 + 3 #head w: 0 splitAt w: 0 #fst w: 0 n__natsFrom w: x1 + 1 tail w: 0 0 w: 0 #sel w: 0 sel w: 0 afterNth w: 0 nil w: 0 #tail w: 0 #splitAt w: x1 #afterNth w: 0 head w: 0 #snd w: 0 cons w: x2 + 1 #natsFrom w: 0 snd w: 0 USABLE RULES: { 1 12..14 } Removed DPs: #10 Number of SCCs: 0, DPs: 0