MAYBE Time: 0.131949 TRS: { mark cons(X1, X2) -> active cons(mark X1, X2), mark recip X -> active recip mark X, mark sqr X -> active sqr mark X, mark terms X -> active terms mark X, mark s X -> active s mark X, mark 0() -> active 0(), mark add(X1, X2) -> active add(mark X1, mark X2), mark dbl X -> active dbl mark X, mark nil() -> active nil(), mark first(X1, X2) -> active first(mark X1, mark X2), mark half X -> active half mark X, cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), recip mark X -> recip X, recip active X -> recip X, sqr mark X -> sqr X, sqr active X -> sqr X, terms mark X -> terms X, terms active X -> terms X, s mark X -> s X, s active X -> s X, active sqr s X -> mark s add(sqr X, dbl X), active sqr 0() -> mark 0(), active terms N -> mark cons(recip sqr N, terms s N), active add(s X, Y) -> mark s add(X, Y), active add(0(), X) -> mark X, active dbl s X -> mark s s dbl X, active dbl 0() -> mark 0(), active first(s X, cons(Y, Z)) -> mark cons(Y, first(X, Z)), active first(0(), X) -> mark nil(), active half s s X -> mark s half X, active half s 0() -> mark 0(), active half 0() -> mark 0(), active half dbl X -> mark X, add(X1, mark X2) -> add(X1, X2), add(X1, active X2) -> add(X1, X2), add(mark X1, X2) -> add(X1, X2), add(active X1, X2) -> add(X1, X2), dbl mark X -> dbl X, dbl active X -> dbl X, first(X1, mark X2) -> first(X1, X2), first(X1, active X2) -> first(X1, X2), first(mark X1, X2) -> first(X1, X2), first(active X1, X2) -> first(X1, X2), half mark X -> half X, half active X -> half X} DP: DP: { mark# cons(X1, X2) -> mark# X1, mark# cons(X1, X2) -> cons#(mark X1, X2), mark# cons(X1, X2) -> active# cons(mark X1, X2), mark# recip X -> mark# X, mark# recip X -> recip# mark X, mark# recip X -> active# recip mark X, mark# sqr X -> mark# X, mark# sqr X -> sqr# mark X, mark# sqr X -> active# sqr mark X, mark# terms X -> mark# X, mark# terms X -> terms# mark X, mark# terms X -> active# terms mark X, mark# s X -> mark# X, mark# s X -> s# mark X, mark# s X -> active# s mark X, mark# 0() -> active# 0(), mark# add(X1, X2) -> mark# X1, mark# add(X1, X2) -> mark# X2, mark# add(X1, X2) -> active# add(mark X1, mark X2), mark# add(X1, X2) -> add#(mark X1, mark X2), mark# dbl X -> mark# X, mark# dbl X -> active# dbl mark X, mark# dbl X -> dbl# mark X, mark# nil() -> active# nil(), mark# first(X1, X2) -> mark# X1, mark# first(X1, X2) -> mark# X2, mark# first(X1, X2) -> active# first(mark X1, mark X2), mark# first(X1, X2) -> first#(mark X1, mark X2), mark# half X -> mark# X, mark# half X -> active# half mark X, mark# half X -> half# mark X, cons#(X1, mark X2) -> cons#(X1, X2), cons#(X1, active X2) -> cons#(X1, X2), cons#(mark X1, X2) -> cons#(X1, X2), cons#(active X1, X2) -> cons#(X1, X2), recip# mark X -> recip# X, recip# active X -> recip# X, sqr# mark X -> sqr# X, sqr# active X -> sqr# X, terms# mark X -> terms# X, terms# active X -> terms# X, s# mark X -> s# X, s# active X -> s# X, active# sqr s X -> mark# s add(sqr X, dbl X), active# sqr s X -> sqr# X, active# sqr s X -> s# add(sqr X, dbl X), active# sqr s X -> add#(sqr X, dbl X), active# sqr s X -> dbl# X, active# sqr 0() -> mark# 0(), active# terms N -> mark# cons(recip sqr N, terms s N), active# terms N -> cons#(recip sqr N, terms s N), active# terms N -> recip# sqr N, active# terms N -> sqr# N, active# terms N -> terms# s N, active# terms N -> s# N, active# add(s X, Y) -> mark# s add(X, Y), active# add(s X, Y) -> s# add(X, Y), active# add(s X, Y) -> add#(X, Y), active# add(0(), X) -> mark# X, active# dbl s X -> mark# s s dbl X, active# dbl s X -> s# s dbl X, active# dbl s X -> s# dbl X, active# dbl s X -> dbl# X, active# dbl 0() -> mark# 0(), active# first(s X, cons(Y, Z)) -> mark# cons(Y, first(X, Z)), active# first(s X, cons(Y, Z)) -> cons#(Y, first(X, Z)), active# first(s X, cons(Y, Z)) -> first#(X, Z), active# first(0(), X) -> mark# nil(), active# half s s X -> mark# s half X, active# half s s X -> s# half X, active# half s s X -> half# X, active# half s 0() -> mark# 0(), active# half 0() -> mark# 0(), active# half dbl X -> mark# X, add#(X1, mark X2) -> add#(X1, X2), add#(X1, active X2) -> add#(X1, X2), add#(mark X1, X2) -> add#(X1, X2), add#(active X1, X2) -> add#(X1, X2), dbl# mark X -> dbl# X, dbl# active X -> dbl# X, first#(X1, mark X2) -> first#(X1, X2), first#(X1, active X2) -> first#(X1, X2), first#(mark X1, X2) -> first#(X1, X2), first#(active X1, X2) -> first#(X1, X2), half# mark X -> half# X, half# active X -> half# X} TRS: { mark cons(X1, X2) -> active cons(mark X1, X2), mark recip X -> active recip mark X, mark sqr X -> active sqr mark X, mark terms X -> active terms mark X, mark s X -> active s mark X, mark 0() -> active 0(), mark add(X1, X2) -> active add(mark X1, mark X2), mark dbl X -> active dbl mark X, mark nil() -> active nil(), mark first(X1, X2) -> active first(mark X1, mark X2), mark half X -> active half mark X, cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), recip mark X -> recip X, recip active X -> recip X, sqr mark X -> sqr X, sqr active X -> sqr X, terms mark X -> terms X, terms active X -> terms X, s mark X -> s X, s active X -> s X, active sqr s X -> mark s add(sqr X, dbl X), active sqr 0() -> mark 0(), active terms N -> mark cons(recip sqr N, terms s N), active add(s X, Y) -> mark s add(X, Y), active add(0(), X) -> mark X, active dbl s X -> mark s s dbl X, active dbl 0() -> mark 0(), active first(s X, cons(Y, Z)) -> mark cons(Y, first(X, Z)), active first(0(), X) -> mark nil(), active half s s X -> mark s half X, active half s 0() -> mark 0(), active half 0() -> mark 0(), active half dbl X -> mark X, add(X1, mark X2) -> add(X1, X2), add(X1, active X2) -> add(X1, X2), add(mark X1, X2) -> add(X1, X2), add(active X1, X2) -> add(X1, X2), dbl mark X -> dbl X, dbl active X -> dbl X, first(X1, mark X2) -> first(X1, X2), first(X1, active X2) -> first(X1, X2), first(mark X1, X2) -> first(X1, X2), first(active X1, X2) -> first(X1, X2), half mark X -> half X, half active X -> half X} UR: { mark cons(X1, X2) -> active cons(mark X1, X2), mark recip X -> active recip mark X, mark sqr X -> active sqr mark X, mark terms X -> active terms mark X, mark s X -> active s mark X, mark 0() -> active 0(), mark add(X1, X2) -> active add(mark X1, mark X2), mark dbl X -> active dbl mark X, mark nil() -> active nil(), mark first(X1, X2) -> active first(mark X1, mark X2), mark half X -> active half mark X, cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), recip mark X -> recip X, recip active X -> recip X, sqr mark X -> sqr X, sqr active X -> sqr X, terms mark X -> terms X, terms active X -> terms X, s mark X -> s X, s active X -> s X, active sqr s X -> mark s add(sqr X, dbl X), active sqr 0() -> mark 0(), active terms N -> mark cons(recip sqr N, terms s N), active add(s X, Y) -> mark s add(X, Y), active add(0(), X) -> mark X, active dbl s X -> mark s s dbl X, active dbl 0() -> mark 0(), active first(s X, cons(Y, Z)) -> mark cons(Y, first(X, Z)), active first(0(), X) -> mark nil(), active half s s X -> mark s half X, active half s 0() -> mark 0(), active half 0() -> mark 0(), active half dbl X -> mark X, add(X1, mark X2) -> add(X1, X2), add(X1, active X2) -> add(X1, X2), add(mark X1, X2) -> add(X1, X2), add(active X1, X2) -> add(X1, X2), dbl mark X -> dbl X, dbl active X -> dbl X, first(X1, mark X2) -> first(X1, X2), first(X1, active X2) -> first(X1, X2), first(mark X1, X2) -> first(X1, X2), first(active X1, X2) -> first(X1, X2), half mark X -> half X, half active X -> half X, a(x, y) -> x, a(x, y) -> y} EDG: { (active# terms N -> sqr# N, sqr# active X -> sqr# X) (active# terms N -> sqr# N, sqr# mark X -> sqr# X) (active# dbl s X -> mark# s s dbl X, mark# s X -> active# s mark X) (active# dbl s X -> mark# s s dbl X, mark# s X -> s# mark X) (active# dbl s X -> mark# s s dbl X, mark# s X -> mark# X) (mark# sqr X -> active# sqr mark X, active# sqr 0() -> mark# 0()) (mark# sqr X -> active# sqr mark X, active# sqr s X -> dbl# X) (mark# sqr X -> active# sqr mark X, active# sqr s X -> add#(sqr X, dbl X)) (mark# sqr X -> active# sqr mark X, active# sqr s X -> s# add(sqr X, dbl X)) (mark# sqr X -> active# sqr mark X, active# sqr s X -> sqr# X) (mark# sqr X -> active# sqr mark X, active# sqr s X -> mark# s add(sqr X, dbl X)) (mark# half X -> active# half mark X, active# half dbl X -> mark# X) (mark# half X -> active# half mark X, active# half 0() -> mark# 0()) (mark# half X -> active# half mark X, active# half s 0() -> mark# 0()) (mark# half X -> active# half mark X, active# half s s X -> half# X) (mark# half X -> active# half mark X, active# half s s X -> s# half X) (mark# half X -> active# half mark X, active# half s s X -> mark# s half X) (active# add(s X, Y) -> mark# s add(X, Y), mark# s X -> active# s mark X) (active# add(s X, Y) -> mark# s add(X, Y), mark# s X -> s# mark X) (active# add(s X, Y) -> mark# s add(X, Y), mark# s X -> mark# X) (active# half s s X -> mark# s half X, mark# s X -> active# s mark X) (active# half s s X -> mark# s half X, mark# s X -> s# mark X) (active# half s s X -> mark# s half X, mark# s X -> mark# X) (active# dbl 0() -> mark# 0(), mark# 0() -> active# 0()) (active# half s 0() -> mark# 0(), mark# 0() -> active# 0()) (mark# add(X1, X2) -> active# add(mark X1, mark X2), active# add(0(), X) -> mark# X) (mark# add(X1, X2) -> active# add(mark X1, mark X2), active# add(s X, Y) -> add#(X, Y)) (mark# add(X1, X2) -> active# add(mark X1, mark X2), active# add(s X, Y) -> s# add(X, Y)) (mark# add(X1, X2) -> active# add(mark X1, mark X2), active# add(s X, Y) -> mark# s add(X, Y)) (mark# recip X -> mark# X, mark# half X -> half# mark X) (mark# recip X -> mark# X, mark# half X -> active# half mark X) (mark# recip X -> mark# X, mark# half X -> mark# X) (mark# recip X -> mark# X, mark# first(X1, X2) -> first#(mark X1, mark X2)) (mark# recip X -> mark# X, mark# first(X1, X2) -> active# first(mark X1, mark X2)) (mark# recip X -> mark# X, mark# first(X1, X2) -> mark# X2) (mark# recip X -> mark# X, mark# first(X1, X2) -> mark# X1) (mark# recip X -> mark# X, mark# nil() -> active# nil()) (mark# recip X -> mark# X, mark# dbl X -> dbl# mark X) (mark# recip X -> mark# X, mark# dbl X -> active# dbl mark X) (mark# recip X -> mark# X, mark# dbl X -> mark# X) (mark# recip X -> mark# X, mark# add(X1, X2) -> add#(mark X1, mark X2)) (mark# recip X -> mark# X, mark# add(X1, X2) -> active# add(mark X1, mark X2)) (mark# recip X -> mark# X, mark# add(X1, X2) -> mark# X2) (mark# recip X -> mark# X, mark# add(X1, X2) -> mark# X1) (mark# recip X -> mark# X, mark# 0() -> active# 0()) (mark# recip X -> mark# X, mark# s X -> active# s mark X) (mark# recip X -> mark# X, mark# s X -> s# mark X) (mark# recip X -> mark# X, mark# s X -> mark# X) (mark# recip X -> mark# X, mark# terms X -> active# terms mark X) (mark# recip X -> mark# X, mark# terms X -> terms# mark X) (mark# recip X -> mark# X, mark# terms X -> mark# X) (mark# recip X -> mark# X, mark# sqr X -> active# sqr mark X) (mark# recip X -> mark# X, mark# sqr X -> sqr# mark X) (mark# recip X -> mark# X, mark# sqr X -> mark# X) (mark# recip X -> mark# X, mark# recip X -> active# recip mark X) (mark# recip X -> mark# X, mark# recip X -> recip# mark X) (mark# recip X -> mark# X, mark# recip X -> mark# X) (mark# recip X -> mark# X, mark# cons(X1, X2) -> active# cons(mark X1, X2)) (mark# recip X -> mark# X, mark# cons(X1, X2) -> cons#(mark X1, X2)) (mark# recip X -> mark# X, mark# cons(X1, X2) -> mark# X1) (mark# terms X -> mark# X, mark# half X -> half# mark X) (mark# terms X -> mark# X, mark# half X -> active# half mark X) (mark# terms X -> mark# X, mark# half X -> mark# X) (mark# terms X -> mark# X, mark# first(X1, X2) -> first#(mark X1, mark X2)) (mark# terms X -> mark# X, mark# first(X1, X2) -> active# first(mark X1, mark X2)) (mark# terms X -> mark# X, mark# first(X1, X2) -> mark# X2) (mark# terms X -> mark# X, mark# first(X1, X2) -> mark# X1) (mark# terms X -> mark# X, mark# nil() -> active# nil()) (mark# terms X -> mark# X, mark# dbl X -> dbl# mark X) (mark# terms X -> mark# X, mark# dbl X -> active# dbl mark X) (mark# terms X -> mark# X, mark# dbl X -> mark# X) (mark# terms X -> mark# X, mark# add(X1, X2) -> add#(mark X1, mark X2)) (mark# terms X -> mark# X, mark# add(X1, X2) -> active# add(mark X1, mark X2)) (mark# terms X -> mark# X, mark# add(X1, X2) -> mark# X2) (mark# terms X -> mark# X, mark# add(X1, X2) -> mark# X1) (mark# terms X -> mark# X, mark# 0() -> active# 0()) (mark# terms X -> mark# X, mark# s X -> active# s mark X) (mark# terms X -> mark# X, mark# s X -> s# mark X) (mark# terms X -> mark# X, mark# s X -> mark# X) (mark# terms X -> mark# X, mark# terms X -> active# terms mark X) (mark# terms X -> mark# X, mark# terms X -> terms# mark X) (mark# terms X -> mark# X, mark# terms X -> mark# X) (mark# terms X -> mark# X, mark# sqr X -> active# sqr mark X) (mark# terms X -> mark# X, mark# sqr X -> sqr# mark X) (mark# terms X -> mark# X, mark# sqr X -> mark# X) (mark# terms X -> mark# X, mark# recip X -> active# recip mark X) (mark# terms X -> mark# X, mark# recip X -> recip# mark X) (mark# terms X -> mark# X, mark# recip X -> mark# X) (mark# terms X -> mark# X, mark# cons(X1, X2) -> active# cons(mark X1, X2)) (mark# terms X -> mark# X, mark# cons(X1, X2) -> cons#(mark X1, X2)) (mark# terms X -> mark# X, mark# cons(X1, X2) -> mark# X1) (mark# dbl X -> mark# X, mark# half X -> half# mark X) (mark# dbl X -> mark# X, mark# half X -> active# half mark X) (mark# dbl X -> mark# X, mark# half X -> mark# X) (mark# dbl X -> mark# X, mark# first(X1, X2) -> first#(mark X1, mark X2)) (mark# dbl X -> mark# X, mark# first(X1, X2) -> active# first(mark X1, mark X2)) (mark# dbl X -> mark# X, mark# first(X1, X2) -> mark# X2) (mark# dbl X -> mark# X, mark# first(X1, X2) -> mark# X1) (mark# dbl X -> mark# X, mark# nil() -> active# nil()) (mark# dbl X -> mark# X, mark# dbl X -> dbl# mark X) (mark# dbl X -> mark# X, mark# dbl X -> active# dbl mark X) (mark# dbl X -> mark# X, mark# dbl X -> mark# X) (mark# dbl X -> mark# X, mark# add(X1, X2) -> add#(mark X1, mark X2)) (mark# dbl X -> mark# X, mark# add(X1, X2) -> active# add(mark X1, mark X2)) (mark# dbl X -> mark# X, mark# add(X1, X2) -> mark# X2) (mark# dbl X -> mark# X, mark# add(X1, X2) -> mark# X1) (mark# dbl X -> mark# X, mark# 0() -> active# 0()) (mark# dbl X -> mark# X, mark# s X -> active# s mark X) (mark# dbl X -> mark# X, mark# s X -> s# mark X) (mark# dbl X -> mark# X, mark# s X -> mark# X) (mark# dbl X -> mark# X, mark# terms X -> active# terms mark X) (mark# dbl X -> mark# X, mark# terms X -> terms# mark X) (mark# dbl X -> mark# X, mark# terms X -> mark# X) (mark# dbl X -> mark# X, mark# sqr X -> active# sqr mark X) (mark# dbl X -> mark# X, mark# sqr X -> sqr# mark X) (mark# dbl X -> mark# X, mark# sqr X -> mark# X) (mark# dbl X -> mark# X, mark# recip X -> active# recip mark X) (mark# dbl X -> mark# X, mark# recip X -> recip# mark X) (mark# dbl X -> mark# X, mark# recip X -> mark# X) (mark# dbl X -> mark# X, mark# cons(X1, X2) -> active# cons(mark X1, X2)) (mark# dbl X -> mark# X, mark# cons(X1, X2) -> cons#(mark X1, X2)) (mark# dbl X -> mark# X, mark# cons(X1, X2) -> mark# X1) (recip# mark X -> recip# X, recip# active X -> recip# X) (recip# mark X -> recip# X, recip# mark X -> recip# X) (sqr# mark X -> sqr# X, sqr# active X -> sqr# X) (sqr# mark X -> sqr# X, sqr# mark X -> sqr# X) (terms# mark X -> terms# X, terms# active X -> terms# X) (terms# mark X -> terms# X, terms# mark X -> terms# X) (s# mark X -> s# X, s# active X -> s# X) (s# mark X -> s# X, s# mark X -> s# X) (active# sqr s X -> sqr# X, sqr# active X -> sqr# X) (active# sqr s X -> sqr# X, sqr# mark X -> sqr# X) (active# add(0(), X) -> mark# X, mark# half X -> half# mark X) (active# add(0(), X) -> mark# X, mark# half X -> active# half mark X) (active# add(0(), X) -> mark# X, mark# half X -> mark# X) (active# add(0(), X) -> mark# X, mark# first(X1, X2) -> first#(mark X1, mark X2)) (active# add(0(), X) -> mark# X, mark# first(X1, X2) -> active# first(mark X1, mark X2)) (active# add(0(), X) -> mark# X, mark# first(X1, X2) -> mark# X2) (active# add(0(), X) -> mark# X, mark# first(X1, X2) -> mark# X1) (active# add(0(), X) -> mark# X, mark# nil() -> active# nil()) (active# add(0(), X) -> mark# X, mark# dbl X -> dbl# mark X) (active# add(0(), X) -> mark# X, mark# dbl X -> active# dbl mark X) (active# add(0(), X) -> mark# X, mark# dbl X -> mark# X) (active# add(0(), X) -> mark# X, mark# add(X1, X2) -> add#(mark X1, mark X2)) (active# add(0(), X) -> mark# X, mark# add(X1, X2) -> active# add(mark X1, mark X2)) (active# add(0(), X) -> mark# X, mark# add(X1, X2) -> mark# X2) (active# add(0(), X) -> mark# X, mark# add(X1, X2) -> mark# X1) (active# add(0(), X) -> mark# X, mark# 0() -> active# 0()) (active# add(0(), X) -> mark# X, mark# s X -> active# s mark X) (active# add(0(), X) -> mark# X, mark# s X -> s# mark X) (active# add(0(), X) -> mark# X, mark# s X -> mark# X) (active# add(0(), X) -> mark# X, mark# terms X -> active# terms mark X) (active# add(0(), X) -> mark# X, mark# terms X -> terms# mark X) (active# add(0(), X) -> mark# X, mark# terms X -> mark# X) (active# add(0(), X) -> mark# X, mark# sqr X -> active# sqr mark X) (active# add(0(), X) -> mark# X, mark# sqr X -> sqr# mark X) (active# add(0(), X) -> mark# X, mark# sqr X -> mark# X) (active# add(0(), X) -> mark# X, mark# recip X -> active# recip mark X) (active# add(0(), X) -> mark# X, mark# recip X -> recip# mark X) (active# add(0(), X) -> mark# X, mark# recip X -> mark# X) (active# add(0(), X) -> mark# X, mark# cons(X1, X2) -> active# cons(mark X1, X2)) (active# add(0(), X) -> mark# X, mark# cons(X1, X2) -> cons#(mark X1, X2)) (active# add(0(), X) -> mark# X, mark# cons(X1, X2) -> mark# X1) (active# half s s X -> half# X, half# active X -> half# X) (active# half s s X -> half# X, half# mark X -> half# X) (dbl# mark X -> dbl# X, dbl# active X -> dbl# X) (dbl# mark X -> dbl# X, dbl# mark X -> dbl# X) (half# mark X -> half# X, half# active X -> half# X) (half# mark X -> half# X, half# mark X -> half# X) (mark# cons(X1, X2) -> cons#(mark X1, X2), cons#(active X1, X2) -> cons#(X1, X2)) (mark# cons(X1, X2) -> cons#(mark X1, X2), cons#(mark X1, X2) -> cons#(X1, X2)) (mark# cons(X1, X2) -> cons#(mark X1, X2), cons#(X1, active X2) -> cons#(X1, X2)) (mark# cons(X1, X2) -> cons#(mark X1, X2), cons#(X1, mark X2) -> cons#(X1, X2)) (mark# first(X1, X2) -> first#(mark X1, mark X2), first#(active X1, X2) -> first#(X1, X2)) (mark# first(X1, X2) -> first#(mark X1, mark X2), first#(mark X1, X2) -> first#(X1, X2)) (mark# first(X1, X2) -> first#(mark X1, mark X2), first#(X1, active X2) -> first#(X1, X2)) (mark# first(X1, X2) -> first#(mark X1, mark X2), first#(X1, mark X2) -> first#(X1, X2)) (mark# cons(X1, X2) -> mark# X1, mark# half X -> half# mark X) (mark# cons(X1, X2) -> mark# X1, mark# half X -> active# half mark X) (mark# cons(X1, X2) -> mark# X1, mark# half X -> mark# X) (mark# cons(X1, X2) -> mark# X1, mark# first(X1, X2) -> first#(mark X1, mark X2)) (mark# cons(X1, X2) -> mark# X1, mark# first(X1, X2) -> active# first(mark X1, mark X2)) (mark# cons(X1, X2) -> mark# X1, mark# first(X1, X2) -> mark# X2) (mark# cons(X1, X2) -> mark# X1, mark# first(X1, X2) -> mark# X1) (mark# cons(X1, X2) -> mark# X1, mark# nil() -> active# nil()) (mark# cons(X1, X2) -> mark# X1, mark# dbl X -> dbl# mark X) (mark# cons(X1, X2) -> mark# X1, mark# dbl X -> active# dbl mark X) (mark# cons(X1, X2) -> mark# X1, mark# dbl X -> mark# X) (mark# cons(X1, X2) -> mark# X1, mark# add(X1, X2) -> add#(mark X1, mark X2)) (mark# cons(X1, X2) -> mark# X1, mark# add(X1, X2) -> active# add(mark X1, mark X2)) (mark# cons(X1, X2) -> mark# X1, mark# add(X1, X2) -> mark# X2) (mark# cons(X1, X2) -> mark# X1, mark# add(X1, X2) -> mark# X1) (mark# cons(X1, X2) -> mark# X1, mark# 0() -> active# 0()) (mark# cons(X1, X2) -> mark# X1, mark# s X -> active# s mark X) (mark# cons(X1, X2) -> mark# X1, mark# s X -> s# mark X) (mark# cons(X1, X2) -> mark# X1, mark# s X -> mark# X) (mark# cons(X1, X2) -> mark# X1, mark# terms X -> active# terms mark X) (mark# cons(X1, X2) -> mark# X1, mark# terms X -> terms# mark X) (mark# cons(X1, X2) -> mark# X1, mark# terms X -> mark# X) (mark# cons(X1, X2) -> mark# X1, mark# sqr X -> active# sqr mark X) (mark# cons(X1, X2) -> mark# X1, mark# sqr X -> sqr# mark X) (mark# cons(X1, X2) -> mark# X1, mark# sqr X -> mark# X) (mark# cons(X1, X2) -> mark# X1, mark# recip X -> active# recip mark X) (mark# cons(X1, X2) -> mark# X1, mark# recip X -> recip# mark X) (mark# cons(X1, X2) -> mark# X1, mark# recip X -> mark# X) (mark# cons(X1, X2) -> mark# X1, mark# cons(X1, X2) -> active# cons(mark X1, X2)) (mark# cons(X1, X2) -> mark# X1, mark# cons(X1, X2) -> cons#(mark X1, X2)) (mark# cons(X1, X2) -> mark# X1, mark# cons(X1, X2) -> mark# X1) (mark# first(X1, X2) -> mark# X1, mark# half X -> half# mark X) (mark# first(X1, X2) -> mark# X1, mark# half X -> active# half mark X) (mark# first(X1, X2) -> mark# X1, mark# half X -> mark# X) (mark# first(X1, X2) -> mark# X1, mark# first(X1, X2) -> first#(mark X1, mark X2)) (mark# first(X1, X2) -> mark# X1, mark# first(X1, X2) -> active# first(mark X1, mark X2)) (mark# first(X1, X2) -> mark# X1, mark# first(X1, X2) -> mark# X2) (mark# first(X1, X2) -> mark# X1, mark# first(X1, X2) -> mark# X1) (mark# first(X1, X2) -> mark# X1, mark# nil() -> active# nil()) (mark# first(X1, X2) -> mark# X1, mark# dbl X -> dbl# mark X) (mark# first(X1, X2) -> mark# X1, mark# dbl X -> active# dbl mark X) (mark# first(X1, X2) -> mark# X1, mark# dbl X -> mark# X) (mark# first(X1, X2) -> mark# X1, mark# add(X1, X2) -> add#(mark X1, mark X2)) (mark# first(X1, X2) -> mark# X1, mark# add(X1, X2) -> active# add(mark X1, mark X2)) (mark# first(X1, X2) -> mark# X1, mark# add(X1, X2) -> mark# X2) (mark# first(X1, X2) -> mark# X1, mark# add(X1, X2) -> mark# X1) (mark# first(X1, X2) -> mark# X1, mark# 0() -> active# 0()) (mark# first(X1, X2) -> mark# X1, mark# s X -> active# s mark X) (mark# first(X1, X2) -> mark# X1, mark# s X -> s# mark X) (mark# first(X1, X2) -> mark# X1, mark# s X -> mark# X) (mark# first(X1, X2) -> mark# X1, mark# terms X -> active# terms mark X) (mark# first(X1, X2) -> mark# X1, mark# terms X -> terms# mark X) (mark# first(X1, X2) -> mark# X1, mark# terms X -> mark# X) (mark# first(X1, X2) -> mark# X1, mark# sqr X -> active# sqr mark X) (mark# first(X1, X2) -> mark# X1, mark# sqr X -> sqr# mark X) (mark# first(X1, X2) -> mark# X1, mark# sqr X -> mark# X) (mark# first(X1, X2) -> mark# X1, mark# recip X -> active# recip mark X) (mark# first(X1, X2) -> mark# X1, mark# recip X -> recip# mark X) (mark# first(X1, X2) -> mark# X1, mark# recip X -> mark# X) (mark# first(X1, X2) -> mark# X1, mark# cons(X1, X2) -> active# cons(mark X1, X2)) (mark# first(X1, X2) -> mark# X1, mark# cons(X1, X2) -> cons#(mark X1, X2)) (mark# first(X1, X2) -> mark# X1, mark# cons(X1, X2) -> mark# X1) (cons#(X1, active X2) -> cons#(X1, X2), cons#(active X1, X2) -> cons#(X1, X2)) (cons#(X1, active X2) -> cons#(X1, X2), cons#(mark X1, X2) -> cons#(X1, X2)) (cons#(X1, active X2) -> cons#(X1, X2), cons#(X1, active X2) -> cons#(X1, X2)) (cons#(X1, active X2) -> cons#(X1, X2), cons#(X1, mark X2) -> cons#(X1, X2)) (cons#(active X1, X2) -> cons#(X1, X2), cons#(active X1, X2) -> cons#(X1, X2)) (cons#(active X1, X2) -> cons#(X1, X2), cons#(mark X1, X2) -> cons#(X1, X2)) (cons#(active X1, X2) -> cons#(X1, X2), cons#(X1, active X2) -> cons#(X1, X2)) (cons#(active X1, X2) -> cons#(X1, X2), cons#(X1, mark X2) -> cons#(X1, X2)) (add#(X1, active X2) -> add#(X1, X2), add#(active X1, X2) -> add#(X1, X2)) (add#(X1, active X2) -> add#(X1, X2), add#(mark X1, X2) -> add#(X1, X2)) (add#(X1, active X2) -> add#(X1, X2), add#(X1, active X2) -> add#(X1, X2)) (add#(X1, active X2) -> add#(X1, X2), add#(X1, mark X2) -> add#(X1, X2)) (add#(active X1, X2) -> add#(X1, X2), add#(active X1, X2) -> add#(X1, X2)) (add#(active X1, X2) -> add#(X1, X2), add#(mark X1, X2) -> add#(X1, X2)) (add#(active X1, X2) -> add#(X1, X2), add#(X1, active X2) -> add#(X1, X2)) (add#(active X1, X2) -> add#(X1, X2), add#(X1, mark X2) -> add#(X1, X2)) (first#(X1, active X2) -> first#(X1, X2), first#(active X1, X2) -> first#(X1, X2)) (first#(X1, active X2) -> first#(X1, X2), first#(mark X1, X2) -> first#(X1, X2)) (first#(X1, active X2) -> first#(X1, X2), first#(X1, active X2) -> first#(X1, X2)) (first#(X1, active X2) -> first#(X1, X2), first#(X1, mark X2) -> first#(X1, X2)) (first#(active X1, X2) -> first#(X1, X2), first#(active X1, X2) -> first#(X1, X2)) (first#(active X1, X2) -> first#(X1, X2), first#(mark X1, X2) -> first#(X1, X2)) (first#(active X1, X2) -> first#(X1, X2), first#(X1, active X2) -> first#(X1, X2)) (first#(active X1, X2) -> first#(X1, X2), first#(X1, mark X2) -> first#(X1, X2)) (mark# sqr X -> sqr# mark X, sqr# active X -> sqr# X) (mark# sqr X -> sqr# mark X, sqr# mark X -> sqr# X) (mark# s X -> s# mark X, s# active X -> s# X) (mark# s X -> s# mark X, s# mark X -> s# X) (mark# half X -> half# mark X, half# active X -> half# X) (mark# half X -> half# mark X, half# mark X -> half# X) (active# add(s X, Y) -> add#(X, Y), add#(active X1, X2) -> add#(X1, X2)) (active# add(s X, Y) -> add#(X, Y), add#(mark X1, X2) -> add#(X1, X2)) (active# add(s X, Y) -> add#(X, Y), add#(X1, active X2) -> add#(X1, X2)) (active# add(s X, Y) -> add#(X, Y), add#(X1, mark X2) -> add#(X1, X2)) (mark# first(X1, X2) -> mark# X2, mark# half X -> half# mark X) (mark# first(X1, X2) -> mark# X2, mark# half X -> active# half mark X) (mark# first(X1, X2) -> mark# X2, mark# half X -> mark# X) (mark# first(X1, X2) -> mark# X2, mark# first(X1, X2) -> first#(mark X1, mark X2)) (mark# first(X1, X2) -> mark# X2, mark# first(X1, X2) -> active# first(mark X1, mark X2)) (mark# first(X1, X2) -> mark# X2, mark# first(X1, X2) -> mark# X2) (mark# first(X1, X2) -> mark# X2, mark# first(X1, X2) -> mark# X1) (mark# first(X1, X2) -> mark# X2, mark# nil() -> active# nil()) (mark# first(X1, X2) -> mark# X2, mark# dbl X -> dbl# mark X) (mark# first(X1, X2) -> mark# X2, mark# dbl X -> active# dbl mark X) (mark# first(X1, X2) -> mark# X2, mark# dbl X -> mark# X) (mark# first(X1, X2) -> mark# X2, mark# add(X1, X2) -> add#(mark X1, mark X2)) (mark# first(X1, X2) -> mark# X2, mark# add(X1, X2) -> active# add(mark X1, mark X2)) (mark# first(X1, X2) -> mark# X2, mark# add(X1, X2) -> mark# X2) (mark# first(X1, X2) -> mark# X2, mark# add(X1, X2) -> mark# X1) (mark# first(X1, X2) -> mark# X2, mark# 0() -> active# 0()) (mark# first(X1, X2) -> mark# X2, mark# s X -> active# s mark X) (mark# first(X1, X2) -> mark# X2, mark# s X -> s# mark X) (mark# first(X1, X2) -> mark# X2, mark# s X -> mark# X) (mark# first(X1, X2) -> mark# X2, mark# terms X -> active# terms mark X) (mark# first(X1, X2) -> mark# X2, mark# terms X -> terms# mark X) (mark# first(X1, X2) -> mark# X2, mark# terms X -> mark# X) (mark# first(X1, X2) -> mark# X2, mark# sqr X -> active# sqr mark X) (mark# first(X1, X2) -> mark# X2, mark# sqr X -> sqr# mark X) (mark# first(X1, X2) -> mark# X2, mark# sqr X -> mark# X) (mark# first(X1, X2) -> mark# X2, mark# recip X -> active# recip mark X) (mark# first(X1, X2) -> mark# X2, mark# recip X -> recip# mark X) (mark# first(X1, X2) -> mark# X2, mark# recip X -> mark# X) (mark# first(X1, X2) -> mark# X2, mark# cons(X1, X2) -> active# cons(mark X1, X2)) (mark# first(X1, X2) -> mark# X2, mark# cons(X1, X2) -> cons#(mark X1, X2)) (mark# first(X1, X2) -> mark# X2, mark# cons(X1, X2) -> mark# X1) (mark# add(X1, X2) -> mark# X2, mark# cons(X1, X2) -> mark# X1) (mark# add(X1, X2) -> mark# X2, mark# cons(X1, X2) -> cons#(mark X1, X2)) (mark# add(X1, X2) -> mark# X2, mark# cons(X1, X2) -> active# cons(mark X1, X2)) (mark# add(X1, X2) -> mark# X2, mark# recip X -> mark# X) (mark# add(X1, X2) -> mark# X2, mark# recip X -> recip# mark X) (mark# add(X1, X2) -> mark# X2, mark# recip X -> active# recip mark X) (mark# add(X1, X2) -> mark# X2, mark# sqr X -> mark# X) (mark# add(X1, X2) -> mark# X2, mark# sqr X -> sqr# mark X) (mark# add(X1, X2) -> mark# X2, mark# sqr X -> active# sqr mark X) (mark# add(X1, X2) -> mark# X2, mark# terms X -> mark# X) (mark# add(X1, X2) -> mark# X2, mark# terms X -> terms# mark X) (mark# add(X1, X2) -> mark# X2, mark# terms X -> active# terms mark X) (mark# add(X1, X2) -> mark# X2, mark# s X -> mark# X) (mark# add(X1, X2) -> mark# X2, mark# s X -> s# mark X) (mark# add(X1, X2) -> mark# X2, mark# s X -> active# s mark X) (mark# add(X1, X2) -> mark# X2, mark# 0() -> active# 0()) (mark# add(X1, X2) -> mark# X2, mark# add(X1, X2) -> mark# X1) (mark# add(X1, X2) -> mark# X2, mark# add(X1, X2) -> mark# X2) (mark# add(X1, X2) -> mark# X2, mark# add(X1, X2) -> active# add(mark X1, mark X2)) (mark# add(X1, X2) -> mark# X2, mark# add(X1, X2) -> add#(mark X1, mark X2)) (mark# add(X1, X2) -> mark# X2, mark# dbl X -> mark# X) (mark# add(X1, X2) -> mark# X2, mark# dbl X -> active# dbl mark X) (mark# add(X1, X2) -> mark# X2, mark# dbl X -> dbl# mark X) (mark# add(X1, X2) -> mark# X2, mark# nil() -> active# nil()) (mark# add(X1, X2) -> mark# X2, mark# first(X1, X2) -> mark# X1) (mark# add(X1, X2) -> mark# X2, mark# first(X1, X2) -> mark# X2) (mark# add(X1, X2) -> mark# X2, mark# first(X1, X2) -> active# first(mark X1, mark X2)) (mark# add(X1, X2) -> mark# X2, mark# first(X1, X2) -> first#(mark X1, mark X2)) (mark# add(X1, X2) -> mark# X2, mark# half X -> mark# X) (mark# add(X1, X2) -> mark# X2, mark# half X -> active# half mark X) (mark# add(X1, X2) -> mark# X2, mark# half X -> half# mark X) (active# first(s X, cons(Y, Z)) -> first#(X, Z), first#(X1, mark X2) -> first#(X1, X2)) (active# first(s X, cons(Y, Z)) -> first#(X, Z), first#(X1, active X2) -> first#(X1, X2)) (active# first(s X, cons(Y, Z)) -> first#(X, Z), first#(mark X1, X2) -> first#(X1, X2)) (active# first(s X, cons(Y, Z)) -> first#(X, Z), first#(active X1, X2) -> first#(X1, X2)) (mark# dbl X -> dbl# mark X, dbl# mark X -> dbl# X) (mark# dbl X -> dbl# mark X, dbl# active X -> dbl# X) (mark# terms X -> terms# mark X, terms# mark X -> terms# X) (mark# terms X -> terms# mark X, terms# active X -> terms# X) (mark# recip X -> recip# mark X, recip# mark X -> recip# X) (mark# recip X -> recip# mark X, recip# active X -> recip# X) (first#(mark X1, X2) -> first#(X1, X2), first#(X1, mark X2) -> first#(X1, X2)) (first#(mark X1, X2) -> first#(X1, X2), first#(X1, active X2) -> first#(X1, X2)) (first#(mark X1, X2) -> first#(X1, X2), first#(mark X1, X2) -> first#(X1, X2)) (first#(mark X1, X2) -> first#(X1, X2), first#(active X1, X2) -> first#(X1, X2)) (first#(X1, mark X2) -> first#(X1, X2), first#(X1, mark X2) -> first#(X1, X2)) (first#(X1, mark X2) -> first#(X1, X2), first#(X1, active X2) -> first#(X1, X2)) (first#(X1, mark X2) -> first#(X1, X2), first#(mark X1, X2) -> first#(X1, X2)) (first#(X1, mark X2) -> first#(X1, X2), first#(active X1, X2) -> first#(X1, X2)) (add#(mark X1, X2) -> add#(X1, X2), add#(X1, mark X2) -> add#(X1, X2)) (add#(mark X1, X2) -> add#(X1, X2), add#(X1, active X2) -> add#(X1, X2)) (add#(mark X1, X2) -> add#(X1, X2), add#(mark X1, X2) -> add#(X1, X2)) (add#(mark X1, X2) -> add#(X1, X2), add#(active X1, X2) -> add#(X1, X2)) (add#(X1, mark X2) -> add#(X1, X2), add#(X1, mark X2) -> add#(X1, X2)) (add#(X1, mark X2) -> add#(X1, X2), add#(X1, active X2) -> add#(X1, X2)) (add#(X1, mark X2) -> add#(X1, X2), add#(mark X1, X2) -> add#(X1, X2)) (add#(X1, mark X2) -> add#(X1, X2), add#(active X1, X2) -> add#(X1, X2)) (cons#(mark X1, X2) -> cons#(X1, X2), cons#(X1, mark X2) -> cons#(X1, X2)) (cons#(mark X1, X2) -> cons#(X1, X2), cons#(X1, active X2) -> cons#(X1, X2)) (cons#(mark X1, X2) -> cons#(X1, X2), cons#(mark X1, X2) -> cons#(X1, X2)) (cons#(mark X1, X2) -> cons#(X1, X2), cons#(active X1, X2) -> cons#(X1, X2)) (cons#(X1, mark X2) -> cons#(X1, X2), cons#(X1, mark X2) -> cons#(X1, X2)) (cons#(X1, mark X2) -> cons#(X1, X2), cons#(X1, active X2) -> cons#(X1, X2)) (cons#(X1, mark X2) -> cons#(X1, X2), cons#(mark X1, X2) -> cons#(X1, X2)) (cons#(X1, mark X2) -> cons#(X1, X2), cons#(active X1, X2) -> cons#(X1, X2)) (mark# add(X1, X2) -> mark# X1, mark# cons(X1, X2) -> mark# X1) (mark# add(X1, X2) -> mark# X1, mark# cons(X1, X2) -> cons#(mark X1, X2)) (mark# add(X1, X2) -> mark# X1, mark# cons(X1, X2) -> active# cons(mark X1, X2)) (mark# add(X1, X2) -> mark# X1, mark# recip X -> mark# X) (mark# add(X1, X2) -> mark# X1, mark# recip X -> recip# mark X) (mark# add(X1, X2) -> mark# X1, mark# recip X -> active# recip mark X) (mark# add(X1, X2) -> mark# X1, mark# sqr X -> mark# X) (mark# add(X1, X2) -> mark# X1, mark# sqr X -> sqr# mark X) (mark# add(X1, X2) -> mark# X1, mark# sqr X -> active# sqr mark X) (mark# add(X1, X2) -> mark# X1, mark# terms X -> mark# X) (mark# add(X1, X2) -> mark# X1, mark# terms X -> terms# mark X) (mark# add(X1, X2) -> mark# X1, mark# terms X -> active# terms mark X) (mark# add(X1, X2) -> mark# X1, mark# s X -> mark# X) (mark# add(X1, X2) -> mark# X1, mark# s X -> s# mark X) (mark# add(X1, X2) -> mark# X1, mark# s X -> active# s mark X) (mark# add(X1, X2) -> mark# X1, mark# 0() -> active# 0()) (mark# add(X1, X2) -> mark# X1, mark# add(X1, X2) -> mark# X1) (mark# add(X1, X2) -> mark# X1, mark# add(X1, X2) -> mark# X2) (mark# add(X1, X2) -> mark# X1, mark# add(X1, X2) -> active# add(mark X1, mark X2)) (mark# add(X1, X2) -> mark# X1, mark# add(X1, X2) -> add#(mark X1, mark X2)) (mark# add(X1, X2) -> mark# X1, mark# dbl X -> mark# X) (mark# add(X1, X2) -> mark# X1, mark# dbl X -> active# dbl mark X) (mark# add(X1, X2) -> mark# X1, mark# dbl X -> dbl# mark X) (mark# add(X1, X2) -> mark# X1, mark# nil() -> active# nil()) (mark# add(X1, X2) -> mark# X1, mark# first(X1, X2) -> mark# X1) (mark# add(X1, X2) -> mark# X1, mark# first(X1, X2) -> mark# X2) (mark# add(X1, X2) -> mark# X1, mark# first(X1, X2) -> active# first(mark X1, mark X2)) (mark# add(X1, X2) -> mark# X1, mark# first(X1, X2) -> first#(mark X1, mark X2)) (mark# add(X1, X2) -> mark# X1, mark# half X -> mark# X) (mark# add(X1, X2) -> mark# X1, mark# half X -> active# half mark X) (mark# add(X1, X2) -> mark# X1, mark# half X -> half# mark X) (mark# add(X1, X2) -> add#(mark X1, mark X2), add#(X1, mark X2) -> add#(X1, X2)) (mark# add(X1, X2) -> add#(mark X1, mark X2), add#(X1, active X2) -> add#(X1, X2)) (mark# add(X1, X2) -> add#(mark X1, mark X2), add#(mark X1, X2) -> add#(X1, X2)) (mark# add(X1, X2) -> add#(mark X1, mark X2), add#(active X1, X2) -> add#(X1, X2)) (half# active X -> half# X, half# mark X -> half# X) (half# active X -> half# X, half# active X -> half# X) (dbl# active X -> dbl# X, dbl# mark X -> dbl# X) (dbl# active X -> dbl# X, dbl# active X -> dbl# X) (active# half dbl X -> mark# X, mark# cons(X1, X2) -> mark# X1) (active# half dbl X -> mark# X, mark# cons(X1, X2) -> cons#(mark X1, X2)) (active# half dbl X -> mark# X, mark# cons(X1, X2) -> active# cons(mark X1, X2)) (active# half dbl X -> mark# X, mark# recip X -> mark# X) (active# half dbl X -> mark# X, mark# recip X -> recip# mark X) (active# half dbl X -> mark# X, mark# recip X -> active# recip mark X) (active# half dbl X -> mark# X, mark# sqr X -> mark# X) (active# half dbl X -> mark# X, mark# sqr X -> sqr# mark X) (active# half dbl X -> mark# X, mark# sqr X -> active# sqr mark X) (active# half dbl X -> mark# X, mark# terms X -> mark# X) (active# half dbl X -> mark# X, mark# terms X -> terms# mark X) (active# half dbl X -> mark# X, mark# terms X -> active# terms mark X) (active# half dbl X -> mark# X, mark# s X -> mark# X) (active# half dbl X -> mark# X, mark# s X -> s# mark X) (active# half dbl X -> mark# X, mark# s X -> active# s mark X) (active# half dbl X -> mark# X, mark# 0() -> active# 0()) (active# half dbl X -> mark# X, mark# add(X1, X2) -> mark# X1) (active# half dbl X -> mark# X, mark# add(X1, X2) -> mark# X2) (active# half dbl X -> mark# X, mark# add(X1, X2) -> active# add(mark X1, mark X2)) (active# half dbl X -> mark# X, mark# add(X1, X2) -> add#(mark X1, mark X2)) (active# half dbl X -> mark# X, mark# dbl X -> mark# X) (active# half dbl X -> mark# X, mark# dbl X -> active# dbl mark X) (active# half dbl X -> mark# X, mark# dbl X -> dbl# mark X) (active# half dbl X -> mark# X, mark# nil() -> active# nil()) (active# half dbl X -> mark# X, mark# first(X1, X2) -> mark# X1) (active# half dbl X -> mark# X, mark# first(X1, X2) -> mark# X2) (active# half dbl X -> mark# X, mark# first(X1, X2) -> active# first(mark X1, mark X2)) (active# half dbl X -> mark# X, mark# first(X1, X2) -> first#(mark X1, mark X2)) (active# half dbl X -> mark# X, mark# half X -> mark# X) (active# half dbl X -> mark# X, mark# half X -> active# half mark X) (active# half dbl X -> mark# X, mark# half X -> half# mark X) (active# dbl s X -> dbl# X, dbl# mark X -> dbl# X) (active# dbl s X -> dbl# X, dbl# active X -> dbl# X) (active# sqr s X -> dbl# X, dbl# mark X -> dbl# X) (active# sqr s X -> dbl# X, dbl# active X -> dbl# X) (s# active X -> s# X, s# mark X -> s# X) (s# active X -> s# X, s# active X -> s# X) (terms# active X -> terms# X, terms# mark X -> terms# X) (terms# active X -> terms# X, terms# active X -> terms# X) (sqr# active X -> sqr# X, sqr# mark X -> sqr# X) (sqr# active X -> sqr# X, sqr# active X -> sqr# X) (recip# active X -> recip# X, recip# mark X -> recip# X) (recip# active X -> recip# X, recip# active X -> recip# X) (mark# half X -> mark# X, mark# cons(X1, X2) -> mark# X1) (mark# half X -> mark# X, mark# cons(X1, X2) -> cons#(mark X1, X2)) (mark# half X -> mark# X, mark# cons(X1, X2) -> active# cons(mark X1, X2)) (mark# half X -> mark# X, mark# recip X -> mark# X) (mark# half X -> mark# X, mark# recip X -> recip# mark X) (mark# half X -> mark# X, mark# recip X -> active# recip mark X) (mark# half X -> mark# X, mark# sqr X -> mark# X) (mark# half X -> mark# X, mark# sqr X -> sqr# mark X) (mark# half X -> mark# X, mark# sqr X -> active# sqr mark X) (mark# half X -> mark# X, mark# terms X -> mark# X) (mark# half X -> mark# X, mark# terms X -> terms# mark X) (mark# half X -> mark# X, mark# terms X -> active# terms mark X) (mark# half X -> mark# X, mark# s X -> mark# X) (mark# half X -> mark# X, mark# s X -> s# mark X) (mark# half X -> mark# X, mark# s X -> active# s mark X) (mark# half X -> mark# X, mark# 0() -> active# 0()) (mark# half X -> mark# X, mark# add(X1, X2) -> mark# X1) (mark# half X -> mark# X, mark# add(X1, X2) -> mark# X2) (mark# half X -> mark# X, mark# add(X1, X2) -> active# add(mark X1, mark X2)) (mark# half X -> mark# X, mark# add(X1, X2) -> add#(mark X1, mark X2)) (mark# half X -> mark# X, mark# dbl X -> mark# X) (mark# half X -> mark# X, mark# dbl X -> active# dbl mark X) (mark# half X -> mark# X, mark# dbl X -> dbl# mark X) (mark# half X -> mark# X, mark# nil() -> active# nil()) (mark# half X -> mark# X, mark# first(X1, X2) -> mark# X1) (mark# half X -> mark# X, mark# first(X1, X2) -> mark# X2) (mark# half X -> mark# X, mark# first(X1, X2) -> active# first(mark X1, mark X2)) (mark# half X -> mark# X, mark# first(X1, X2) -> first#(mark X1, mark X2)) (mark# half X -> mark# X, mark# half X -> mark# X) (mark# half X -> mark# X, mark# half X -> active# half mark X) (mark# half X -> mark# X, mark# half X -> half# mark X) (mark# s X -> mark# X, mark# cons(X1, X2) -> mark# X1) (mark# s X -> mark# X, mark# cons(X1, X2) -> cons#(mark X1, X2)) (mark# s X -> mark# X, mark# cons(X1, X2) -> active# cons(mark X1, X2)) (mark# s X -> mark# X, mark# recip X -> mark# X) (mark# s X -> mark# X, mark# recip X -> recip# mark X) (mark# s X -> mark# X, mark# recip X -> active# recip mark X) (mark# s X -> mark# X, mark# sqr X -> mark# X) (mark# s X -> mark# X, mark# sqr X -> sqr# mark X) (mark# s X -> mark# X, mark# sqr X -> active# sqr mark X) (mark# s X -> mark# X, mark# terms X -> mark# X) (mark# s X -> mark# X, mark# terms X -> terms# mark X) (mark# s X -> mark# X, mark# terms X -> active# terms mark X) (mark# s X -> mark# X, mark# s X -> mark# X) (mark# s X -> mark# X, mark# s X -> s# mark X) (mark# s X -> mark# X, mark# s X -> active# s mark X) (mark# s X -> mark# X, mark# 0() -> active# 0()) (mark# s X -> mark# X, mark# add(X1, X2) -> mark# X1) (mark# s X -> mark# X, mark# add(X1, X2) -> mark# X2) (mark# s X -> mark# X, mark# add(X1, X2) -> active# add(mark X1, mark X2)) (mark# s X -> mark# X, mark# add(X1, X2) -> add#(mark X1, mark X2)) (mark# s X -> mark# X, mark# dbl X -> mark# X) (mark# s X -> mark# X, mark# dbl X -> active# dbl mark X) (mark# s X -> mark# X, mark# dbl X -> dbl# mark X) (mark# s X -> mark# X, mark# nil() -> active# nil()) (mark# s X -> mark# X, mark# first(X1, X2) -> mark# X1) (mark# s X -> mark# X, mark# first(X1, X2) -> mark# X2) (mark# s X -> mark# X, mark# first(X1, X2) -> active# first(mark X1, mark X2)) (mark# s X -> mark# X, mark# first(X1, X2) -> first#(mark X1, mark X2)) (mark# s X -> mark# X, mark# half X -> mark# X) (mark# s X -> mark# X, mark# half X -> active# half mark X) (mark# s X -> mark# X, mark# half X -> half# mark X) (mark# sqr X -> mark# X, mark# cons(X1, X2) -> mark# X1) (mark# sqr X -> mark# X, mark# cons(X1, X2) -> cons#(mark X1, X2)) (mark# sqr X -> mark# X, mark# cons(X1, X2) -> active# cons(mark X1, X2)) (mark# sqr X -> mark# X, mark# recip X -> mark# X) (mark# sqr X -> mark# X, mark# recip X -> recip# mark X) (mark# sqr X -> mark# X, mark# recip X -> active# recip mark X) (mark# sqr X -> mark# X, mark# sqr X -> mark# X) (mark# sqr X -> mark# X, mark# sqr X -> sqr# mark X) (mark# sqr X -> mark# X, mark# sqr X -> active# sqr mark X) (mark# sqr X -> mark# X, mark# terms X -> mark# X) (mark# sqr X -> mark# X, mark# terms X -> terms# mark X) (mark# sqr X -> mark# X, mark# terms X -> active# terms mark X) (mark# sqr X -> mark# X, mark# s X -> mark# X) (mark# sqr X -> mark# X, mark# s X -> s# mark X) (mark# sqr X -> mark# X, mark# s X -> active# s mark X) (mark# sqr X -> mark# X, mark# 0() -> active# 0()) (mark# sqr X -> mark# X, mark# add(X1, X2) -> mark# X1) (mark# sqr X -> mark# X, mark# add(X1, X2) -> mark# X2) (mark# sqr X -> mark# X, mark# add(X1, X2) -> active# add(mark X1, mark X2)) (mark# sqr X -> mark# X, mark# add(X1, X2) -> add#(mark X1, mark X2)) (mark# sqr X -> mark# X, mark# dbl X -> mark# X) (mark# sqr X -> mark# X, mark# dbl X -> active# dbl mark X) (mark# sqr X -> mark# X, mark# dbl X -> dbl# mark X) (mark# sqr X -> mark# X, mark# nil() -> active# nil()) (mark# sqr X -> mark# X, mark# first(X1, X2) -> mark# X1) (mark# sqr X -> mark# X, mark# first(X1, X2) -> mark# X2) (mark# sqr X -> mark# X, mark# first(X1, X2) -> active# first(mark X1, mark X2)) (mark# sqr X -> mark# X, mark# first(X1, X2) -> first#(mark X1, mark X2)) (mark# sqr X -> mark# X, mark# half X -> mark# X) (mark# sqr X -> mark# X, mark# half X -> active# half mark X) (mark# sqr X -> mark# X, mark# half X -> half# mark X) (active# terms N -> mark# cons(recip sqr N, terms s N), mark# cons(X1, X2) -> mark# X1) (active# terms N -> mark# cons(recip sqr N, terms s N), mark# cons(X1, X2) -> cons#(mark X1, X2)) (active# terms N -> mark# cons(recip sqr N, terms s N), mark# cons(X1, X2) -> active# cons(mark X1, X2)) (mark# first(X1, X2) -> active# first(mark X1, mark X2), active# first(s X, cons(Y, Z)) -> mark# cons(Y, first(X, Z))) (mark# first(X1, X2) -> active# first(mark X1, mark X2), active# first(s X, cons(Y, Z)) -> cons#(Y, first(X, Z))) (mark# first(X1, X2) -> active# first(mark X1, mark X2), active# first(s X, cons(Y, Z)) -> first#(X, Z)) (mark# first(X1, X2) -> active# first(mark X1, mark X2), active# first(0(), X) -> mark# nil()) (active# half 0() -> mark# 0(), mark# 0() -> active# 0()) (active# first(0(), X) -> mark# nil(), mark# nil() -> active# nil()) (active# sqr 0() -> mark# 0(), mark# 0() -> active# 0()) (active# sqr s X -> mark# s add(sqr X, dbl X), mark# s X -> mark# X) (active# sqr s X -> mark# s add(sqr X, dbl X), mark# s X -> s# mark X) (active# sqr s X -> mark# s add(sqr X, dbl X), mark# s X -> active# s mark X) (mark# dbl X -> active# dbl mark X, active# dbl s X -> mark# s s dbl X) (mark# dbl X -> active# dbl mark X, active# dbl s X -> s# s dbl X) (mark# dbl X -> active# dbl mark X, active# dbl s X -> s# dbl X) (mark# dbl X -> active# dbl mark X, active# dbl s X -> dbl# X) (mark# dbl X -> active# dbl mark X, active# dbl 0() -> mark# 0()) (mark# terms X -> active# terms mark X, active# terms N -> mark# cons(recip sqr N, terms s N)) (mark# terms X -> active# terms mark X, active# terms N -> cons#(recip sqr N, terms s N)) (mark# terms X -> active# terms mark X, active# terms N -> recip# sqr N) (mark# terms X -> active# terms mark X, active# terms N -> sqr# N) (mark# terms X -> active# terms mark X, active# terms N -> terms# s N) (mark# terms X -> active# terms mark X, active# terms N -> s# N) (active# first(s X, cons(Y, Z)) -> cons#(Y, first(X, Z)), cons#(mark X1, X2) -> cons#(X1, X2)) (active# first(s X, cons(Y, Z)) -> cons#(Y, first(X, Z)), cons#(active X1, X2) -> cons#(X1, X2)) (active# terms N -> s# N, s# mark X -> s# X) (active# terms N -> s# N, s# active X -> s# X) (active# first(s X, cons(Y, Z)) -> mark# cons(Y, first(X, Z)), mark# cons(X1, X2) -> mark# X1) (active# first(s X, cons(Y, Z)) -> mark# cons(Y, first(X, Z)), mark# cons(X1, X2) -> cons#(mark X1, X2)) (active# first(s X, cons(Y, Z)) -> mark# cons(Y, first(X, Z)), mark# cons(X1, X2) -> active# cons(mark X1, X2)) } STATUS: arrows: 0.922255 SCCS (10): Scc: { mark# cons(X1, X2) -> mark# X1, mark# recip X -> mark# X, mark# sqr X -> mark# X, mark# sqr X -> active# sqr mark X, mark# terms X -> mark# X, mark# terms X -> active# terms mark X, mark# s X -> mark# X, mark# add(X1, X2) -> mark# X1, mark# add(X1, X2) -> mark# X2, mark# add(X1, X2) -> active# add(mark X1, mark X2), mark# dbl X -> mark# X, mark# dbl X -> active# dbl mark X, mark# first(X1, X2) -> mark# X1, mark# first(X1, X2) -> mark# X2, mark# first(X1, X2) -> active# first(mark X1, mark X2), mark# half X -> mark# X, mark# half X -> active# half mark X, active# sqr s X -> mark# s add(sqr X, dbl X), active# terms N -> mark# cons(recip sqr N, terms s N), active# add(s X, Y) -> mark# s add(X, Y), active# add(0(), X) -> mark# X, active# dbl s X -> mark# s s dbl X, active# first(s X, cons(Y, Z)) -> mark# cons(Y, first(X, Z)), active# half s s X -> mark# s half X, active# half dbl X -> mark# X} Scc: { half# mark X -> half# X, half# active X -> half# X} Scc: { first#(X1, mark X2) -> first#(X1, X2), first#(X1, active X2) -> first#(X1, X2), first#(mark X1, X2) -> first#(X1, X2), first#(active X1, X2) -> first#(X1, X2)} Scc: { dbl# mark X -> dbl# X, dbl# active X -> dbl# X} Scc: { add#(X1, mark X2) -> add#(X1, X2), add#(X1, active X2) -> add#(X1, X2), add#(mark X1, X2) -> add#(X1, X2), add#(active X1, X2) -> add#(X1, X2)} Scc: { s# mark X -> s# X, s# active X -> s# X} Scc: { terms# mark X -> terms# X, terms# active X -> terms# X} Scc: { sqr# mark X -> sqr# X, sqr# active X -> sqr# X} Scc: { recip# mark X -> recip# X, recip# active X -> recip# X} Scc: { cons#(X1, mark X2) -> cons#(X1, X2), cons#(X1, active X2) -> cons#(X1, X2), cons#(mark X1, X2) -> cons#(X1, X2), cons#(active X1, X2) -> cons#(X1, X2)} SCC (25): Strict: { mark# cons(X1, X2) -> mark# X1, mark# recip X -> mark# X, mark# sqr X -> mark# X, mark# sqr X -> active# sqr mark X, mark# terms X -> mark# X, mark# terms X -> active# terms mark X, mark# s X -> mark# X, mark# add(X1, X2) -> mark# X1, mark# add(X1, X2) -> mark# X2, mark# add(X1, X2) -> active# add(mark X1, mark X2), mark# dbl X -> mark# X, mark# dbl X -> active# dbl mark X, mark# first(X1, X2) -> mark# X1, mark# first(X1, X2) -> mark# X2, mark# first(X1, X2) -> active# first(mark X1, mark X2), mark# half X -> mark# X, mark# half X -> active# half mark X, active# sqr s X -> mark# s add(sqr X, dbl X), active# terms N -> mark# cons(recip sqr N, terms s N), active# add(s X, Y) -> mark# s add(X, Y), active# add(0(), X) -> mark# X, active# dbl s X -> mark# s s dbl X, active# first(s X, cons(Y, Z)) -> mark# cons(Y, first(X, Z)), active# half s s X -> mark# s half X, active# half dbl X -> mark# X} Weak: { mark cons(X1, X2) -> active cons(mark X1, X2), mark recip X -> active recip mark X, mark sqr X -> active sqr mark X, mark terms X -> active terms mark X, mark s X -> active s mark X, mark 0() -> active 0(), mark add(X1, X2) -> active add(mark X1, mark X2), mark dbl X -> active dbl mark X, mark nil() -> active nil(), mark first(X1, X2) -> active first(mark X1, mark X2), mark half X -> active half mark X, cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), recip mark X -> recip X, recip active X -> recip X, sqr mark X -> sqr X, sqr active X -> sqr X, terms mark X -> terms X, terms active X -> terms X, s mark X -> s X, s active X -> s X, active sqr s X -> mark s add(sqr X, dbl X), active sqr 0() -> mark 0(), active terms N -> mark cons(recip sqr N, terms s N), active add(s X, Y) -> mark s add(X, Y), active add(0(), X) -> mark X, active dbl s X -> mark s s dbl X, active dbl 0() -> mark 0(), active first(s X, cons(Y, Z)) -> mark cons(Y, first(X, Z)), active first(0(), X) -> mark nil(), active half s s X -> mark s half X, active half s 0() -> mark 0(), active half 0() -> mark 0(), active half dbl X -> mark X, add(X1, mark X2) -> add(X1, X2), add(X1, active X2) -> add(X1, X2), add(mark X1, X2) -> add(X1, X2), add(active X1, X2) -> add(X1, X2), dbl mark X -> dbl X, dbl active X -> dbl X, first(X1, mark X2) -> first(X1, X2), first(X1, active X2) -> first(X1, X2), first(mark X1, X2) -> first(X1, X2), first(active X1, X2) -> first(X1, X2), half mark X -> half X, half active X -> half X} Open SCC (2): Strict: { half# mark X -> half# X, half# active X -> half# X} Weak: { mark cons(X1, X2) -> active cons(mark X1, X2), mark recip X -> active recip mark X, mark sqr X -> active sqr mark X, mark terms X -> active terms mark X, mark s X -> active s mark X, mark 0() -> active 0(), mark add(X1, X2) -> active add(mark X1, mark X2), mark dbl X -> active dbl mark X, mark nil() -> active nil(), mark first(X1, X2) -> active first(mark X1, mark X2), mark half X -> active half mark X, cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), recip mark X -> recip X, recip active X -> recip X, sqr mark X -> sqr X, sqr active X -> sqr X, terms mark X -> terms X, terms active X -> terms X, s mark X -> s X, s active X -> s X, active sqr s X -> mark s add(sqr X, dbl X), active sqr 0() -> mark 0(), active terms N -> mark cons(recip sqr N, terms s N), active add(s X, Y) -> mark s add(X, Y), active add(0(), X) -> mark X, active dbl s X -> mark s s dbl X, active dbl 0() -> mark 0(), active first(s X, cons(Y, Z)) -> mark cons(Y, first(X, Z)), active first(0(), X) -> mark nil(), active half s s X -> mark s half X, active half s 0() -> mark 0(), active half 0() -> mark 0(), active half dbl X -> mark X, add(X1, mark X2) -> add(X1, X2), add(X1, active X2) -> add(X1, X2), add(mark X1, X2) -> add(X1, X2), add(active X1, X2) -> add(X1, X2), dbl mark X -> dbl X, dbl active X -> dbl X, first(X1, mark X2) -> first(X1, X2), first(X1, active X2) -> first(X1, X2), first(mark X1, X2) -> first(X1, X2), first(active X1, X2) -> first(X1, X2), half mark X -> half X, half active X -> half X} Open SCC (4): Strict: { first#(X1, mark X2) -> first#(X1, X2), first#(X1, active X2) -> first#(X1, X2), first#(mark X1, X2) -> first#(X1, X2), first#(active X1, X2) -> first#(X1, X2)} Weak: { mark cons(X1, X2) -> active cons(mark X1, X2), mark recip X -> active recip mark X, mark sqr X -> active sqr mark X, mark terms X -> active terms mark X, mark s X -> active s mark X, mark 0() -> active 0(), mark add(X1, X2) -> active add(mark X1, mark X2), mark dbl X -> active dbl mark X, mark nil() -> active nil(), mark first(X1, X2) -> active first(mark X1, mark X2), mark half X -> active half mark X, cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), recip mark X -> recip X, recip active X -> recip X, sqr mark X -> sqr X, sqr active X -> sqr X, terms mark X -> terms X, terms active X -> terms X, s mark X -> s X, s active X -> s X, active sqr s X -> mark s add(sqr X, dbl X), active sqr 0() -> mark 0(), active terms N -> mark cons(recip sqr N, terms s N), active add(s X, Y) -> mark s add(X, Y), active add(0(), X) -> mark X, active dbl s X -> mark s s dbl X, active dbl 0() -> mark 0(), active first(s X, cons(Y, Z)) -> mark cons(Y, first(X, Z)), active first(0(), X) -> mark nil(), active half s s X -> mark s half X, active half s 0() -> mark 0(), active half 0() -> mark 0(), active half dbl X -> mark X, add(X1, mark X2) -> add(X1, X2), add(X1, active X2) -> add(X1, X2), add(mark X1, X2) -> add(X1, X2), add(active X1, X2) -> add(X1, X2), dbl mark X -> dbl X, dbl active X -> dbl X, first(X1, mark X2) -> first(X1, X2), first(X1, active X2) -> first(X1, X2), first(mark X1, X2) -> first(X1, X2), first(active X1, X2) -> first(X1, X2), half mark X -> half X, half active X -> half X} Open SCC (2): Strict: { dbl# mark X -> dbl# X, dbl# active X -> dbl# X} Weak: { mark cons(X1, X2) -> active cons(mark X1, X2), mark recip X -> active recip mark X, mark sqr X -> active sqr mark X, mark terms X -> active terms mark X, mark s X -> active s mark X, mark 0() -> active 0(), mark add(X1, X2) -> active add(mark X1, mark X2), mark dbl X -> active dbl mark X, mark nil() -> active nil(), mark first(X1, X2) -> active first(mark X1, mark X2), mark half X -> active half mark X, cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), recip mark X -> recip X, recip active X -> recip X, sqr mark X -> sqr X, sqr active X -> sqr X, terms mark X -> terms X, terms active X -> terms X, s mark X -> s X, s active X -> s X, active sqr s X -> mark s add(sqr X, dbl X), active sqr 0() -> mark 0(), active terms N -> mark cons(recip sqr N, terms s N), active add(s X, Y) -> mark s add(X, Y), active add(0(), X) -> mark X, active dbl s X -> mark s s dbl X, active dbl 0() -> mark 0(), active first(s X, cons(Y, Z)) -> mark cons(Y, first(X, Z)), active first(0(), X) -> mark nil(), active half s s X -> mark s half X, active half s 0() -> mark 0(), active half 0() -> mark 0(), active half dbl X -> mark X, add(X1, mark X2) -> add(X1, X2), add(X1, active X2) -> add(X1, X2), add(mark X1, X2) -> add(X1, X2), add(active X1, X2) -> add(X1, X2), dbl mark X -> dbl X, dbl active X -> dbl X, first(X1, mark X2) -> first(X1, X2), first(X1, active X2) -> first(X1, X2), first(mark X1, X2) -> first(X1, X2), first(active X1, X2) -> first(X1, X2), half mark X -> half X, half active X -> half X} Open SCC (4): Strict: { add#(X1, mark X2) -> add#(X1, X2), add#(X1, active X2) -> add#(X1, X2), add#(mark X1, X2) -> add#(X1, X2), add#(active X1, X2) -> add#(X1, X2)} Weak: { mark cons(X1, X2) -> active cons(mark X1, X2), mark recip X -> active recip mark X, mark sqr X -> active sqr mark X, mark terms X -> active terms mark X, mark s X -> active s mark X, mark 0() -> active 0(), mark add(X1, X2) -> active add(mark X1, mark X2), mark dbl X -> active dbl mark X, mark nil() -> active nil(), mark first(X1, X2) -> active first(mark X1, mark X2), mark half X -> active half mark X, cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), recip mark X -> recip X, recip active X -> recip X, sqr mark X -> sqr X, sqr active X -> sqr X, terms mark X -> terms X, terms active X -> terms X, s mark X -> s X, s active X -> s X, active sqr s X -> mark s add(sqr X, dbl X), active sqr 0() -> mark 0(), active terms N -> mark cons(recip sqr N, terms s N), active add(s X, Y) -> mark s add(X, Y), active add(0(), X) -> mark X, active dbl s X -> mark s s dbl X, active dbl 0() -> mark 0(), active first(s X, cons(Y, Z)) -> mark cons(Y, first(X, Z)), active first(0(), X) -> mark nil(), active half s s X -> mark s half X, active half s 0() -> mark 0(), active half 0() -> mark 0(), active half dbl X -> mark X, add(X1, mark X2) -> add(X1, X2), add(X1, active X2) -> add(X1, X2), add(mark X1, X2) -> add(X1, X2), add(active X1, X2) -> add(X1, X2), dbl mark X -> dbl X, dbl active X -> dbl X, first(X1, mark X2) -> first(X1, X2), first(X1, active X2) -> first(X1, X2), first(mark X1, X2) -> first(X1, X2), first(active X1, X2) -> first(X1, X2), half mark X -> half X, half active X -> half X} Open SCC (2): Strict: { s# mark X -> s# X, s# active X -> s# X} Weak: { mark cons(X1, X2) -> active cons(mark X1, X2), mark recip X -> active recip mark X, mark sqr X -> active sqr mark X, mark terms X -> active terms mark X, mark s X -> active s mark X, mark 0() -> active 0(), mark add(X1, X2) -> active add(mark X1, mark X2), mark dbl X -> active dbl mark X, mark nil() -> active nil(), mark first(X1, X2) -> active first(mark X1, mark X2), mark half X -> active half mark X, cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), recip mark X -> recip X, recip active X -> recip X, sqr mark X -> sqr X, sqr active X -> sqr X, terms mark X -> terms X, terms active X -> terms X, s mark X -> s X, s active X -> s X, active sqr s X -> mark s add(sqr X, dbl X), active sqr 0() -> mark 0(), active terms N -> mark cons(recip sqr N, terms s N), active add(s X, Y) -> mark s add(X, Y), active add(0(), X) -> mark X, active dbl s X -> mark s s dbl X, active dbl 0() -> mark 0(), active first(s X, cons(Y, Z)) -> mark cons(Y, first(X, Z)), active first(0(), X) -> mark nil(), active half s s X -> mark s half X, active half s 0() -> mark 0(), active half 0() -> mark 0(), active half dbl X -> mark X, add(X1, mark X2) -> add(X1, X2), add(X1, active X2) -> add(X1, X2), add(mark X1, X2) -> add(X1, X2), add(active X1, X2) -> add(X1, X2), dbl mark X -> dbl X, dbl active X -> dbl X, first(X1, mark X2) -> first(X1, X2), first(X1, active X2) -> first(X1, X2), first(mark X1, X2) -> first(X1, X2), first(active X1, X2) -> first(X1, X2), half mark X -> half X, half active X -> half X} Open SCC (2): Strict: { terms# mark X -> terms# X, terms# active X -> terms# X} Weak: { mark cons(X1, X2) -> active cons(mark X1, X2), mark recip X -> active recip mark X, mark sqr X -> active sqr mark X, mark terms X -> active terms mark X, mark s X -> active s mark X, mark 0() -> active 0(), mark add(X1, X2) -> active add(mark X1, mark X2), mark dbl X -> active dbl mark X, mark nil() -> active nil(), mark first(X1, X2) -> active first(mark X1, mark X2), mark half X -> active half mark X, cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), recip mark X -> recip X, recip active X -> recip X, sqr mark X -> sqr X, sqr active X -> sqr X, terms mark X -> terms X, terms active X -> terms X, s mark X -> s X, s active X -> s X, active sqr s X -> mark s add(sqr X, dbl X), active sqr 0() -> mark 0(), active terms N -> mark cons(recip sqr N, terms s N), active add(s X, Y) -> mark s add(X, Y), active add(0(), X) -> mark X, active dbl s X -> mark s s dbl X, active dbl 0() -> mark 0(), active first(s X, cons(Y, Z)) -> mark cons(Y, first(X, Z)), active first(0(), X) -> mark nil(), active half s s X -> mark s half X, active half s 0() -> mark 0(), active half 0() -> mark 0(), active half dbl X -> mark X, add(X1, mark X2) -> add(X1, X2), add(X1, active X2) -> add(X1, X2), add(mark X1, X2) -> add(X1, X2), add(active X1, X2) -> add(X1, X2), dbl mark X -> dbl X, dbl active X -> dbl X, first(X1, mark X2) -> first(X1, X2), first(X1, active X2) -> first(X1, X2), first(mark X1, X2) -> first(X1, X2), first(active X1, X2) -> first(X1, X2), half mark X -> half X, half active X -> half X} Open SCC (2): Strict: { sqr# mark X -> sqr# X, sqr# active X -> sqr# X} Weak: { mark cons(X1, X2) -> active cons(mark X1, X2), mark recip X -> active recip mark X, mark sqr X -> active sqr mark X, mark terms X -> active terms mark X, mark s X -> active s mark X, mark 0() -> active 0(), mark add(X1, X2) -> active add(mark X1, mark X2), mark dbl X -> active dbl mark X, mark nil() -> active nil(), mark first(X1, X2) -> active first(mark X1, mark X2), mark half X -> active half mark X, cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), recip mark X -> recip X, recip active X -> recip X, sqr mark X -> sqr X, sqr active X -> sqr X, terms mark X -> terms X, terms active X -> terms X, s mark X -> s X, s active X -> s X, active sqr s X -> mark s add(sqr X, dbl X), active sqr 0() -> mark 0(), active terms N -> mark cons(recip sqr N, terms s N), active add(s X, Y) -> mark s add(X, Y), active add(0(), X) -> mark X, active dbl s X -> mark s s dbl X, active dbl 0() -> mark 0(), active first(s X, cons(Y, Z)) -> mark cons(Y, first(X, Z)), active first(0(), X) -> mark nil(), active half s s X -> mark s half X, active half s 0() -> mark 0(), active half 0() -> mark 0(), active half dbl X -> mark X, add(X1, mark X2) -> add(X1, X2), add(X1, active X2) -> add(X1, X2), add(mark X1, X2) -> add(X1, X2), add(active X1, X2) -> add(X1, X2), dbl mark X -> dbl X, dbl active X -> dbl X, first(X1, mark X2) -> first(X1, X2), first(X1, active X2) -> first(X1, X2), first(mark X1, X2) -> first(X1, X2), first(active X1, X2) -> first(X1, X2), half mark X -> half X, half active X -> half X} Open SCC (2): Strict: { recip# mark X -> recip# X, recip# active X -> recip# X} Weak: { mark cons(X1, X2) -> active cons(mark X1, X2), mark recip X -> active recip mark X, mark sqr X -> active sqr mark X, mark terms X -> active terms mark X, mark s X -> active s mark X, mark 0() -> active 0(), mark add(X1, X2) -> active add(mark X1, mark X2), mark dbl X -> active dbl mark X, mark nil() -> active nil(), mark first(X1, X2) -> active first(mark X1, mark X2), mark half X -> active half mark X, cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), recip mark X -> recip X, recip active X -> recip X, sqr mark X -> sqr X, sqr active X -> sqr X, terms mark X -> terms X, terms active X -> terms X, s mark X -> s X, s active X -> s X, active sqr s X -> mark s add(sqr X, dbl X), active sqr 0() -> mark 0(), active terms N -> mark cons(recip sqr N, terms s N), active add(s X, Y) -> mark s add(X, Y), active add(0(), X) -> mark X, active dbl s X -> mark s s dbl X, active dbl 0() -> mark 0(), active first(s X, cons(Y, Z)) -> mark cons(Y, first(X, Z)), active first(0(), X) -> mark nil(), active half s s X -> mark s half X, active half s 0() -> mark 0(), active half 0() -> mark 0(), active half dbl X -> mark X, add(X1, mark X2) -> add(X1, X2), add(X1, active X2) -> add(X1, X2), add(mark X1, X2) -> add(X1, X2), add(active X1, X2) -> add(X1, X2), dbl mark X -> dbl X, dbl active X -> dbl X, first(X1, mark X2) -> first(X1, X2), first(X1, active X2) -> first(X1, X2), first(mark X1, X2) -> first(X1, X2), first(active X1, X2) -> first(X1, X2), half mark X -> half X, half active X -> half X} Open SCC (4): Strict: { cons#(X1, mark X2) -> cons#(X1, X2), cons#(X1, active X2) -> cons#(X1, X2), cons#(mark X1, X2) -> cons#(X1, X2), cons#(active X1, X2) -> cons#(X1, X2)} Weak: { mark cons(X1, X2) -> active cons(mark X1, X2), mark recip X -> active recip mark X, mark sqr X -> active sqr mark X, mark terms X -> active terms mark X, mark s X -> active s mark X, mark 0() -> active 0(), mark add(X1, X2) -> active add(mark X1, mark X2), mark dbl X -> active dbl mark X, mark nil() -> active nil(), mark first(X1, X2) -> active first(mark X1, mark X2), mark half X -> active half mark X, cons(X1, mark X2) -> cons(X1, X2), cons(X1, active X2) -> cons(X1, X2), cons(mark X1, X2) -> cons(X1, X2), cons(active X1, X2) -> cons(X1, X2), recip mark X -> recip X, recip active X -> recip X, sqr mark X -> sqr X, sqr active X -> sqr X, terms mark X -> terms X, terms active X -> terms X, s mark X -> s X, s active X -> s X, active sqr s X -> mark s add(sqr X, dbl X), active sqr 0() -> mark 0(), active terms N -> mark cons(recip sqr N, terms s N), active add(s X, Y) -> mark s add(X, Y), active add(0(), X) -> mark X, active dbl s X -> mark s s dbl X, active dbl 0() -> mark 0(), active first(s X, cons(Y, Z)) -> mark cons(Y, first(X, Z)), active first(0(), X) -> mark nil(), active half s s X -> mark s half X, active half s 0() -> mark 0(), active half 0() -> mark 0(), active half dbl X -> mark X, add(X1, mark X2) -> add(X1, X2), add(X1, active X2) -> add(X1, X2), add(mark X1, X2) -> add(X1, X2), add(active X1, X2) -> add(X1, X2), dbl mark X -> dbl X, dbl active X -> dbl X, first(X1, mark X2) -> first(X1, X2), first(X1, active X2) -> first(X1, X2), first(mark X1, X2) -> first(X1, X2), first(active X1, X2) -> first(X1, X2), half mark X -> half X, half active X -> half X} Open