/export/starexec/sandbox2/solver/bin/starexec_run_default /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Input TRS: 1: a__from(X) -> cons(mark(X),from(s(X))) 2: a__head(cons(X,XS)) -> mark(X) 3: a__2nd(cons(X,XS)) -> a__head(mark(XS)) 4: a__take(0(),XS) -> nil() 5: a__take(s(N),cons(X,XS)) -> cons(mark(X),take(N,XS)) 6: a__sel(0(),cons(X,XS)) -> mark(X) 7: a__sel(s(N),cons(X,XS)) -> a__sel(mark(N),mark(XS)) 8: mark(from(X)) -> a__from(mark(X)) 9: mark(head(X)) -> a__head(mark(X)) 10: mark(2nd(X)) -> a__2nd(mark(X)) 11: mark(take(X1,X2)) -> a__take(mark(X1),mark(X2)) 12: mark(sel(X1,X2)) -> a__sel(mark(X1),mark(X2)) 13: mark(cons(X1,X2)) -> cons(mark(X1),X2) 14: mark(s(X)) -> s(mark(X)) 15: mark(0()) -> 0() 16: mark(nil()) -> nil() 17: a__from(X) -> from(X) 18: a__head(X) -> head(X) 19: a__2nd(X) -> 2nd(X) 20: a__take(X1,X2) -> take(X1,X2) 21: a__sel(X1,X2) -> sel(X1,X2) Number of strict rules: 21 Direct poly ... failed. Freezing ... failed. Dependency Pairs: #1: #a__head(cons(X,XS)) -> #mark(X) #2: #a__sel(0(),cons(X,XS)) -> #mark(X) #3: #mark(cons(X1,X2)) -> #mark(X1) #4: #mark(head(X)) -> #a__head(mark(X)) #5: #mark(head(X)) -> #mark(X) #6: #mark(take(X1,X2)) -> #a__take(mark(X1),mark(X2)) #7: #mark(take(X1,X2)) -> #mark(X1) #8: #mark(take(X1,X2)) -> #mark(X2) #9: #mark(sel(X1,X2)) -> #a__sel(mark(X1),mark(X2)) #10: #mark(sel(X1,X2)) -> #mark(X1) #11: #mark(sel(X1,X2)) -> #mark(X2) #12: #mark(s(X)) -> #mark(X) #13: #a__sel(s(N),cons(X,XS)) -> #a__sel(mark(N),mark(XS)) #14: #a__sel(s(N),cons(X,XS)) -> #mark(N) #15: #a__sel(s(N),cons(X,XS)) -> #mark(XS) #16: #mark(2nd(X)) -> #a__2nd(mark(X)) #17: #mark(2nd(X)) -> #mark(X) #18: #a__take(s(N),cons(X,XS)) -> #mark(X) #19: #a__2nd(cons(X,XS)) -> #a__head(mark(XS)) #20: #a__2nd(cons(X,XS)) -> #mark(XS) #21: #a__from(X) -> #mark(X) #22: #mark(from(X)) -> #a__from(mark(X)) #23: #mark(from(X)) -> #mark(X) Number of SCCs: 1, DPs: 23 SCC { #1..23 } Sum... Max... succeeded. s(x1) w: (x1) #a__head(x1) w: (9227 + x1) #a__from(x1) w: (9229 + x1) a__from(x1) w: (9229 + x1) take(x1,x2) w: (max{167 + x2, x1}) 2nd(x1) w: (1144 + x1) a__2nd(x1) w: (1144 + x1) #a__take(x1,x2) w: (max{x2, 8946 + x1}) #a__2nd(x1) w: (9229 + x1) #mark(x1) w: (9228 + x1) 0() w: (0) from(x1) w: (9229 + x1) sel(x1,x2) w: (max{28103 + x2, 28101 + x1}) nil() w: (46) #a__sel(x1,x2) w: (max{37330 + x2, 9228 + x1}) mark(x1) w: (x1) a__sel(x1,x2) w: (max{28103 + x2, 28101 + x1}) head(x1) w: (x1) cons(x1,x2) w: (max{x2, 9229 + x1}) a__take(x1,x2) w: (max{167 + x2, x1}) a__head(x1) w: (x1) USABLE RULES: { 1..21 } Removed DPs: #1..4 #6 #8..11 #15..23 Number of SCCs: 2, DPs: 4 SCC { #13 } Sum... Max... QLPOpS... NegMaxSum... succeeded. s(x1) w: (max{0, 3 + x1}) #a__head(x1) w: (0) #a__from(x1) w: (0) a__from(x1) w: (max{0, 30209 + x1}) take(x1,x2) w: (max{0, 4 + x2}) 2nd(x1) w: (max{0, 28189 + x1}) a__2nd(x1) w: (max{0, 28189 + x1}) #a__take(x1,x2) w: (0) #a__2nd(x1) w: (0) #mark(x1) w: (0) 0() w: (1) from(x1) w: (max{0, 30209 + x1}) sel(x1,x2) w: (max{0, 1 + x2 + x1}) nil() w: (1) #a__sel(x1,x2) w: (max{0, 34725 + x1}) mark(x1) w: (max{0, x1}) a__sel(x1,x2) w: (max{0, 1 + x2 + x1}) head(x1) w: (max{0, 28186 + x1}) cons(x1,x2) w: (max{0, -3 + x2, 28886 + x1}) a__take(x1,x2) w: (max{0, 4 + x2}) a__head(x1) w: (max{0, 28186 + x1}) USABLE RULES: { 1..21 } Removed DPs: #13 Number of SCCs: 1, DPs: 3 SCC { #5 #7 #12 } Sum... succeeded. s(x1) w: (13710 + x1) #a__head(x1) w: (2) #a__from(x1) w: (2) a__from(x1) w: (17890) take(x1,x2) w: (3 + x1) 2nd(x1) w: (1 + x1) a__2nd(x1) w: (0) #a__take(x1,x2) w: (2) #a__2nd(x1) w: (2) #mark(x1) w: (2 + x1) 0() w: (17890) from(x1) w: (17891) sel(x1,x2) w: (17889 + x2 + x1) nil() w: (17893) #a__sel(x1,x2) w: (0) mark(x1) w: (17889) a__sel(x1,x2) w: (17888) head(x1) w: (17889 + x1) cons(x1,x2) w: (17891) a__take(x1,x2) w: (2 + x1) a__head(x1) w: (17888) USABLE RULES: { } Removed DPs: #5 #7 #12 Number of SCCs: 0, DPs: 0