Input TRS: 1: active(terms(N)) -> mark(cons(recip(sqr(N)),terms(s(N)))) 2: active(sqr(0)) -> mark(0) 3: active(sqr(s(X))) -> mark(s(add(sqr(X),dbl(X)))) 4: active(dbl(0)) -> mark(0) 5: active(dbl(s(X))) -> mark(s(s(dbl(X)))) 6: active(add(0,X)) -> mark(X) 7: active(add(s(X),Y)) -> mark(s(add(X,Y))) 8: active(first(0,X)) -> mark(nil) 9: active(first(s(X),cons(Y,Z))) -> mark(cons(Y,first(X,Z))) 10: mark(terms(X)) -> active(terms(mark(X))) 11: mark(cons(X1,X2)) -> active(cons(mark(X1),X2)) 12: mark(recip(X)) -> active(recip(mark(X))) 13: mark(sqr(X)) -> active(sqr(mark(X))) 14: mark(s(X)) -> active(s(X)) 15: mark(0) -> active(0) 16: mark(add(X1,X2)) -> active(add(mark(X1),mark(X2))) 17: mark(dbl(X)) -> active(dbl(mark(X))) 18: mark(first(X1,X2)) -> active(first(mark(X1),mark(X2))) 19: mark(nil) -> active(nil) 20: terms(mark(X)) -> terms(X) 21: terms(active(X)) -> terms(X) 22: cons(mark(X1),X2) -> cons(X1,X2) 23: cons(X1,mark(X2)) -> cons(X1,X2) 24: cons(active(X1),X2) -> cons(X1,X2) 25: cons(X1,active(X2)) -> cons(X1,X2) 26: recip(mark(X)) -> recip(X) 27: recip(active(X)) -> recip(X) 28: sqr(mark(X)) -> sqr(X) 29: sqr(active(X)) -> sqr(X) 30: s(mark(X)) -> s(X) 31: s(active(X)) -> s(X) 32: add(mark(X1),X2) -> add(X1,X2) 33: add(X1,mark(X2)) -> add(X1,X2) 34: add(active(X1),X2) -> add(X1,X2) 35: add(X1,active(X2)) -> add(X1,X2) 36: dbl(mark(X)) -> dbl(X) 37: dbl(active(X)) -> dbl(X) 38: first(mark(X1),X2) -> first(X1,X2) 39: first(X1,mark(X2)) -> first(X1,X2) 40: first(active(X1),X2) -> first(X1,X2) 41: first(X1,active(X2)) -> first(X1,X2) Dependency Pairs: #1: #active(terms(N)) -> #mark(cons(recip(sqr(N)),terms(s(N)))) #2: #active(terms(N)) -> #cons(recip(sqr(N)),terms(s(N))) #3: #active(terms(N)) -> #recip(sqr(N)) #4: #active(terms(N)) -> #sqr(N) #5: #active(terms(N)) -> #terms(s(N)) #6: #active(terms(N)) -> #s(N) #7: #active(sqr(0)) -> #mark(0) #8: #active(sqr(s(X))) -> #mark(s(add(sqr(X),dbl(X)))) #9: #active(sqr(s(X))) -> #s(add(sqr(X),dbl(X))) #10: #active(sqr(s(X))) -> #add(sqr(X),dbl(X)) #11: #active(sqr(s(X))) -> #sqr(X) #12: #active(sqr(s(X))) -> #dbl(X) #13: #active(dbl(0)) -> #mark(0) #14: #active(dbl(s(X))) -> #mark(s(s(dbl(X)))) #15: #active(dbl(s(X))) -> #s(s(dbl(X))) #16: #active(dbl(s(X))) -> #s(dbl(X)) #17: #active(dbl(s(X))) -> #dbl(X) #18: #active(add(0,X)) -> #mark(X) #19: #active(add(s(X),Y)) -> #mark(s(add(X,Y))) #20: #active(add(s(X),Y)) -> #s(add(X,Y)) #21: #active(add(s(X),Y)) -> #add(X,Y) #22: #active(first(0,X)) -> #mark(nil) #23: #active(first(s(X),cons(Y,Z))) -> #mark(cons(Y,first(X,Z))) #24: #active(first(s(X),cons(Y,Z))) -> #cons(Y,first(X,Z)) #25: #active(first(s(X),cons(Y,Z))) -> #first(X,Z) #26: #mark(terms(X)) -> #active(terms(mark(X))) #27: #mark(terms(X)) -> #terms(mark(X)) #28: #mark(terms(X)) -> #mark(X) #29: #mark(cons(X1,X2)) -> #active(cons(mark(X1),X2)) #30: #mark(cons(X1,X2)) -> #cons(mark(X1),X2) #31: #mark(cons(X1,X2)) -> #mark(X1) #32: #mark(recip(X)) -> #active(recip(mark(X))) #33: #mark(recip(X)) -> #recip(mark(X)) #34: #mark(recip(X)) -> #mark(X) #35: #mark(sqr(X)) -> #active(sqr(mark(X))) #36: #mark(sqr(X)) -> #sqr(mark(X)) #37: #mark(sqr(X)) -> #mark(X) #38: #mark(s(X)) -> #active(s(X)) #39: #mark(s(X)) -> #s(X) #40: #mark(0) -> #active(0) #41: #mark(add(X1,X2)) -> #active(add(mark(X1),mark(X2))) #42: #mark(add(X1,X2)) -> #add(mark(X1),mark(X2)) #43: #mark(add(X1,X2)) -> #mark(X1) #44: #mark(add(X1,X2)) -> #mark(X2) #45: #mark(dbl(X)) -> #active(dbl(mark(X))) #46: #mark(dbl(X)) -> #dbl(mark(X)) #47: #mark(dbl(X)) -> #mark(X) #48: #mark(first(X1,X2)) -> #active(first(mark(X1),mark(X2))) #49: #mark(first(X1,X2)) -> #first(mark(X1),mark(X2)) #50: #mark(first(X1,X2)) -> #mark(X1) #51: #mark(first(X1,X2)) -> #mark(X2) #52: #mark(nil) -> #active(nil) #53: #terms(mark(X)) -> #terms(X) #54: #terms(active(X)) -> #terms(X) #55: #cons(mark(X1),X2) -> #cons(X1,X2) #56: #cons(X1,mark(X2)) -> #cons(X1,X2) #57: #cons(active(X1),X2) -> #cons(X1,X2) #58: #cons(X1,active(X2)) -> #cons(X1,X2) #59: #recip(mark(X)) -> #recip(X) #60: #recip(active(X)) -> #recip(X) #61: #sqr(mark(X)) -> #sqr(X) #62: #sqr(active(X)) -> #sqr(X) #63: #s(mark(X)) -> #s(X) #64: #s(active(X)) -> #s(X) #65: #add(mark(X1),X2) -> #add(X1,X2) #66: #add(X1,mark(X2)) -> #add(X1,X2) #67: #add(active(X1),X2) -> #add(X1,X2) #68: #add(X1,active(X2)) -> #add(X1,X2) #69: #dbl(mark(X)) -> #dbl(X) #70: #dbl(active(X)) -> #dbl(X) #71: #first(mark(X1),X2) -> #first(X1,X2) #72: #first(X1,mark(X2)) -> #first(X1,X2) #73: #first(active(X1),X2) -> #first(X1,X2) #74: #first(X1,active(X2)) -> #first(X1,X2) Number of SCCs: 9 SCC { #59 #60 } QKBOPS(sum)... removes: #59 I(#recip) = x1 \pi(#recip) = 1 I(active) = x1 \pi(active) = 1 I(mark) = 1 + x1 \pi(mark) = [1] PREC: mark USABLE RULES: { } Number of SCCs: 9 SCC { #60 } QKBOPS(sum)... removes: #60 I(#recip) = x1 \pi(#recip) = [] I(active) = 1 + x1 \pi(active) = [] PREC: #recip = active USABLE RULES: { } Number of SCCs: 8 SCC { #61 #62 } QKBOPS(sum)... removes: #61 I(#sqr) = x1 \pi(#sqr) = 1 I(active) = x1 \pi(active) = 1 I(mark) = 1 + x1 \pi(mark) = [1] PREC: mark USABLE RULES: { } Number of SCCs: 8 SCC { #62 } QKBOPS(sum)... removes: #62 I(#sqr) = x1 \pi(#sqr) = [] I(active) = 1 + x1 \pi(active) = [] PREC: #sqr = active USABLE RULES: { } Number of SCCs: 7 SCC { #53 #54 } QKBOPS(sum)... removes: #53 I(#terms) = x1 \pi(#terms) = 1 I(active) = x1 \pi(active) = 1 I(mark) = 1 + x1 \pi(mark) = [1] PREC: mark USABLE RULES: { } Number of SCCs: 7 SCC { #54 } QKBOPS(sum)... removes: #54 I(#terms) = x1 \pi(#terms) = [] I(active) = 1 + x1 \pi(active) = [] PREC: #terms = active USABLE RULES: { } Number of SCCs: 6 SCC { #63 #64 } QKBOPS(sum)... removes: #63 I(active) = x1 \pi(active) = 1 I(#s) = x1 \pi(#s) = 1 I(mark) = 1 + x1 \pi(mark) = [1] PREC: mark USABLE RULES: { } Number of SCCs: 6 SCC { #64 } QKBOPS(sum)... removes: #64 I(active) = 1 + x1 \pi(active) = [1] I(#s) = x1 \pi(#s) = [] PREC: active = #s USABLE RULES: { } Number of SCCs: 5 SCC { #69 #70 } QKBOPS(sum)... removes: #69 I(active) = x1 \pi(active) = 1 I(#dbl) = x1 \pi(#dbl) = 1 I(mark) = 1 + x1 \pi(mark) = [1] PREC: mark USABLE RULES: { } Number of SCCs: 5 SCC { #70 } QKBOPS(sum)... removes: #70 I(active) = 1 + x1 \pi(active) = [1] I(#dbl) = x1 \pi(#dbl) = [] PREC: active = #dbl USABLE RULES: { } Number of SCCs: 4 SCC { #55 #56 #57 #58 } QKBOPS(sum)... removes: #57 I(active) = 1 + x1 \pi(active) = [1] I(#cons) = 3 + x1 \pi(#cons) = [] I(mark) = x1 \pi(mark) = [] PREC: mark > #cons > active USABLE RULES: { } Number of SCCs: 4 SCC { #55 #56 #58 } QKBOPS(sum)... removes: #55 #56 I(active) = x1 \pi(active) = 1 I(#cons) = x1 + x2 \pi(#cons) = [2,1] I(mark) = x1 \pi(mark) = [1] PREC: #cons = mark USABLE RULES: { } Number of SCCs: 4 SCC { #58 } QKBOPS(sum)... removes: #58 I(active) = 1 + x1 \pi(active) = [] I(#cons) = x2 \pi(#cons) = [] PREC: active = #cons USABLE RULES: { } Number of SCCs: 3 SCC { #65 #66 #67 #68 } QKBOPS(sum)... removes: #65 I(active) = x1 \pi(active) = 1 I(mark) = x1 \pi(mark) = [1] I(#add) = x1 \pi(#add) = 1 PREC: mark USABLE RULES: { } Number of SCCs: 3 SCC { #66 #67 #68 } QKBOPS(sum)... removes: #66 I(active) = x1 \pi(active) = 1 I(mark) = x1 \pi(mark) = [1] I(#add) = 1 + x1 + x2 \pi(#add) = [2,1] PREC: mark = #add USABLE RULES: { } Number of SCCs: 3 SCC { #67 #68 } QKBOPS(sum)... removes: #67 #68 I(active) = x1 \pi(active) = [1] I(#add) = 1 + x1 + x2 \pi(#add) = [1,2] PREC: active = #add USABLE RULES: { } Number of SCCs: 2 SCC { #71 #72 #73 #74 } QKBOPS(sum)... removes: #73 I(active) = 1 + x1 \pi(active) = [1] I(#first) = 3 + x1 \pi(#first) = [] I(mark) = x1 \pi(mark) = [] PREC: mark > #first > active USABLE RULES: { } Number of SCCs: 2 SCC { #71 #72 #74 } QKBOPS(sum)... removes: #71 #72 I(active) = x1 \pi(active) = 1 I(#first) = x1 + x2 \pi(#first) = [2,1] I(mark) = x1 \pi(mark) = [1] PREC: #first = mark USABLE RULES: { } Number of SCCs: 2 SCC { #74 } QKBOPS(sum)... removes: #74 I(active) = 1 + x1 \pi(active) = [] I(#first) = x2 \pi(#first) = [] PREC: active = #first USABLE RULES: { } Number of SCCs: 1 SCC { #1 #8 #14 #18 #19 #23 #26 #28 #29 #31 #32 #34 #35 #37 #38 #41 #43 #44 #45 #47 #48 #50 #51 } QKBOPS(sum)... removes: #1 #8 #14 #18 #19 #23 #28 #31 #34 #37 #43 #44 #47 #50 #51 I(sqr) = 2 + x1 \pi(sqr) = [1] I(cons) = 3 + x1 \pi(cons) = [] I(first) = 1 + x1 + x2 \pi(first) = [2,1] I(active) = x1 \pi(active) = 1 I(#mark) = x1 \pi(#mark) = 1 I(0) = 2 I(s) = 2 \pi(s) = [] I(#active) = x1 \pi(#active) = 1 I(nil) = 3 I(dbl) = x1 \pi(dbl) = [1] I(terms) = 7 + x1 \pi(terms) = [] I(add) = 1 + x1 + x2 \pi(add) = [1,2] I(mark) = x1 \pi(mark) = 1 I(recip) = 1 + x1 \pi(recip) = [1] PREC: dbl > add = recip > 0 > sqr > cons = first = s = nil = terms USABLE RULES: { 41..1 } Number of SCCs: 0