Input TRS: 1: active(dbl(0)) -> mark(0) 2: active(dbl(s(X))) -> mark(s(s(dbl(X)))) 3: active(dbls(nil)) -> mark(nil) 4: active(dbls(cons(X,Y))) -> mark(cons(dbl(X),dbls(Y))) 5: active(sel(0,cons(X,Y))) -> mark(X) 6: active(sel(s(X),cons(Y,Z))) -> mark(sel(X,Z)) 7: active(indx(nil,X)) -> mark(nil) 8: active(indx(cons(X,Y),Z)) -> mark(cons(sel(X,Z),indx(Y,Z))) 9: active(from(X)) -> mark(cons(X,from(s(X)))) 10: active(dbl1(0)) -> mark(01) 11: active(dbl1(s(X))) -> mark(s1(s1(dbl1(X)))) 12: active(sel1(0,cons(X,Y))) -> mark(X) 13: active(sel1(s(X),cons(Y,Z))) -> mark(sel1(X,Z)) 14: active(quote(0)) -> mark(01) 15: active(quote(s(X))) -> mark(s1(quote(X))) 16: active(quote(dbl(X))) -> mark(dbl1(X)) 17: active(quote(sel(X,Y))) -> mark(sel1(X,Y)) 18: mark(dbl(X)) -> active(dbl(mark(X))) 19: mark(0) -> active(0) 20: mark(s(X)) -> active(s(X)) 21: mark(dbls(X)) -> active(dbls(mark(X))) 22: mark(nil) -> active(nil) 23: mark(cons(X1,X2)) -> active(cons(X1,X2)) 24: mark(sel(X1,X2)) -> active(sel(mark(X1),mark(X2))) 25: mark(indx(X1,X2)) -> active(indx(mark(X1),X2)) 26: mark(from(X)) -> active(from(X)) 27: mark(dbl1(X)) -> active(dbl1(mark(X))) 28: mark(01) -> active(01) 29: mark(s1(X)) -> active(s1(mark(X))) 30: mark(sel1(X1,X2)) -> active(sel1(mark(X1),mark(X2))) 31: mark(quote(X)) -> active(quote(mark(X))) 32: dbl(mark(X)) -> dbl(X) 33: dbl(active(X)) -> dbl(X) 34: s(mark(X)) -> s(X) 35: s(active(X)) -> s(X) 36: dbls(mark(X)) -> dbls(X) 37: dbls(active(X)) -> dbls(X) 38: cons(mark(X1),X2) -> cons(X1,X2) 39: cons(X1,mark(X2)) -> cons(X1,X2) 40: cons(active(X1),X2) -> cons(X1,X2) 41: cons(X1,active(X2)) -> cons(X1,X2) 42: sel(mark(X1),X2) -> sel(X1,X2) 43: sel(X1,mark(X2)) -> sel(X1,X2) 44: sel(active(X1),X2) -> sel(X1,X2) 45: sel(X1,active(X2)) -> sel(X1,X2) 46: indx(mark(X1),X2) -> indx(X1,X2) 47: indx(X1,mark(X2)) -> indx(X1,X2) 48: indx(active(X1),X2) -> indx(X1,X2) 49: indx(X1,active(X2)) -> indx(X1,X2) 50: from(mark(X)) -> from(X) 51: from(active(X)) -> from(X) 52: dbl1(mark(X)) -> dbl1(X) 53: dbl1(active(X)) -> dbl1(X) 54: s1(mark(X)) -> s1(X) 55: s1(active(X)) -> s1(X) 56: sel1(mark(X1),X2) -> sel1(X1,X2) 57: sel1(X1,mark(X2)) -> sel1(X1,X2) 58: sel1(active(X1),X2) -> sel1(X1,X2) 59: sel1(X1,active(X2)) -> sel1(X1,X2) 60: quote(mark(X)) -> quote(X) 61: quote(active(X)) -> quote(X) Dependency Pairs: #1: #active(dbl(0)) -> #mark(0) #2: #active(dbl(s(X))) -> #mark(s(s(dbl(X)))) #3: #active(dbl(s(X))) -> #s(s(dbl(X))) #4: #active(dbl(s(X))) -> #s(dbl(X)) #5: #active(dbl(s(X))) -> #dbl(X) #6: #active(dbls(nil)) -> #mark(nil) #7: #active(dbls(cons(X,Y))) -> #mark(cons(dbl(X),dbls(Y))) #8: #active(dbls(cons(X,Y))) -> #cons(dbl(X),dbls(Y)) #9: #active(dbls(cons(X,Y))) -> #dbl(X) #10: #active(dbls(cons(X,Y))) -> #dbls(Y) #11: #active(sel(0,cons(X,Y))) -> #mark(X) #12: #active(sel(s(X),cons(Y,Z))) -> #mark(sel(X,Z)) #13: #active(sel(s(X),cons(Y,Z))) -> #sel(X,Z) #14: #active(indx(nil,X)) -> #mark(nil) #15: #active(indx(cons(X,Y),Z)) -> #mark(cons(sel(X,Z),indx(Y,Z))) #16: #active(indx(cons(X,Y),Z)) -> #cons(sel(X,Z),indx(Y,Z)) #17: #active(indx(cons(X,Y),Z)) -> #sel(X,Z) #18: #active(indx(cons(X,Y),Z)) -> #indx(Y,Z) #19: #active(from(X)) -> #mark(cons(X,from(s(X)))) #20: #active(from(X)) -> #cons(X,from(s(X))) #21: #active(from(X)) -> #from(s(X)) #22: #active(from(X)) -> #s(X) #23: #active(dbl1(0)) -> #mark(01) #24: #active(dbl1(s(X))) -> #mark(s1(s1(dbl1(X)))) #25: #active(dbl1(s(X))) -> #s1(s1(dbl1(X))) #26: #active(dbl1(s(X))) -> #s1(dbl1(X)) #27: #active(dbl1(s(X))) -> #dbl1(X) #28: #active(sel1(0,cons(X,Y))) -> #mark(X) #29: #active(sel1(s(X),cons(Y,Z))) -> #mark(sel1(X,Z)) #30: #active(sel1(s(X),cons(Y,Z))) -> #sel1(X,Z) #31: #active(quote(0)) -> #mark(01) #32: #active(quote(s(X))) -> #mark(s1(quote(X))) #33: #active(quote(s(X))) -> #s1(quote(X)) #34: #active(quote(s(X))) -> #quote(X) #35: #active(quote(dbl(X))) -> #mark(dbl1(X)) #36: #active(quote(dbl(X))) -> #dbl1(X) #37: #active(quote(sel(X,Y))) -> #mark(sel1(X,Y)) #38: #active(quote(sel(X,Y))) -> #sel1(X,Y) #39: #mark(dbl(X)) -> #active(dbl(mark(X))) #40: #mark(dbl(X)) -> #dbl(mark(X)) #41: #mark(dbl(X)) -> #mark(X) #42: #mark(0) -> #active(0) #43: #mark(s(X)) -> #active(s(X)) #44: #mark(s(X)) -> #s(X) #45: #mark(dbls(X)) -> #active(dbls(mark(X))) #46: #mark(dbls(X)) -> #dbls(mark(X)) #47: #mark(dbls(X)) -> #mark(X) #48: #mark(nil) -> #active(nil) #49: #mark(cons(X1,X2)) -> #active(cons(X1,X2)) #50: #mark(cons(X1,X2)) -> #cons(X1,X2) #51: #mark(sel(X1,X2)) -> #active(sel(mark(X1),mark(X2))) #52: #mark(sel(X1,X2)) -> #sel(mark(X1),mark(X2)) #53: #mark(sel(X1,X2)) -> #mark(X1) #54: #mark(sel(X1,X2)) -> #mark(X2) #55: #mark(indx(X1,X2)) -> #active(indx(mark(X1),X2)) #56: #mark(indx(X1,X2)) -> #indx(mark(X1),X2) #57: #mark(indx(X1,X2)) -> #mark(X1) #58: #mark(from(X)) -> #active(from(X)) #59: #mark(from(X)) -> #from(X) #60: #mark(dbl1(X)) -> #active(dbl1(mark(X))) #61: #mark(dbl1(X)) -> #dbl1(mark(X)) #62: #mark(dbl1(X)) -> #mark(X) #63: #mark(01) -> #active(01) #64: #mark(s1(X)) -> #active(s1(mark(X))) #65: #mark(s1(X)) -> #s1(mark(X)) #66: #mark(s1(X)) -> #mark(X) #67: #mark(sel1(X1,X2)) -> #active(sel1(mark(X1),mark(X2))) #68: #mark(sel1(X1,X2)) -> #sel1(mark(X1),mark(X2)) #69: #mark(sel1(X1,X2)) -> #mark(X1) #70: #mark(sel1(X1,X2)) -> #mark(X2) #71: #mark(quote(X)) -> #active(quote(mark(X))) #72: #mark(quote(X)) -> #quote(mark(X)) #73: #mark(quote(X)) -> #mark(X) #74: #dbl(mark(X)) -> #dbl(X) #75: #dbl(active(X)) -> #dbl(X) #76: #s(mark(X)) -> #s(X) #77: #s(active(X)) -> #s(X) #78: #dbls(mark(X)) -> #dbls(X) #79: #dbls(active(X)) -> #dbls(X) #80: #cons(mark(X1),X2) -> #cons(X1,X2) #81: #cons(X1,mark(X2)) -> #cons(X1,X2) #82: #cons(active(X1),X2) -> #cons(X1,X2) #83: #cons(X1,active(X2)) -> #cons(X1,X2) #84: #sel(mark(X1),X2) -> #sel(X1,X2) #85: #sel(X1,mark(X2)) -> #sel(X1,X2) #86: #sel(active(X1),X2) -> #sel(X1,X2) #87: #sel(X1,active(X2)) -> #sel(X1,X2) #88: #indx(mark(X1),X2) -> #indx(X1,X2) #89: #indx(X1,mark(X2)) -> #indx(X1,X2) #90: #indx(active(X1),X2) -> #indx(X1,X2) #91: #indx(X1,active(X2)) -> #indx(X1,X2) #92: #from(mark(X)) -> #from(X) #93: #from(active(X)) -> #from(X) #94: #dbl1(mark(X)) -> #dbl1(X) #95: #dbl1(active(X)) -> #dbl1(X) #96: #s1(mark(X)) -> #s1(X) #97: #s1(active(X)) -> #s1(X) #98: #sel1(mark(X1),X2) -> #sel1(X1,X2) #99: #sel1(X1,mark(X2)) -> #sel1(X1,X2) #100: #sel1(active(X1),X2) -> #sel1(X1,X2) #101: #sel1(X1,active(X2)) -> #sel1(X1,X2) #102: #quote(mark(X)) -> #quote(X) #103: #quote(active(X)) -> #quote(X) Number of SCCs: 12 SCC { #96 #97 } QKBOS(sum)... removes: #96 I(active) = x1 \pi(active) = 1 I(#s1) = x1 \pi(#s1) = [1] I(mark) = x1 \pi(mark) = [1] PREC: #s1 = mark USABLE RULES: { } Number of SCCs: 12 SCC { #97 } QKBOS(sum)... removes: #97 I(active) = 1 + x1 \pi(active) = [1] I(#s1) = x1 \pi(#s1) = 1 PREC: active USABLE RULES: { } Number of SCCs: 11 SCC { #76 #77 } QKBOS(sum)... removes: #76 I(active) = x1 \pi(active) = 1 I(#s) = x1 \pi(#s) = [1] I(mark) = x1 \pi(mark) = [1] PREC: #s = mark USABLE RULES: { } Number of SCCs: 11 SCC { #77 } QKBOS(sum)... removes: #77 I(active) = 1 + x1 \pi(active) = [1] I(#s) = x1 \pi(#s) = 1 PREC: active USABLE RULES: { } Number of SCCs: 10 SCC { #74 #75 } QKBOS(sum)... removes: #74 I(active) = x1 \pi(active) = 1 I(#dbl) = x1 \pi(#dbl) = [1] I(mark) = x1 \pi(mark) = [1] PREC: #dbl = mark USABLE RULES: { } Number of SCCs: 10 SCC { #75 } QKBOS(sum)... removes: #75 I(active) = 1 + x1 \pi(active) = [1] I(#dbl) = x1 \pi(#dbl) = 1 PREC: active USABLE RULES: { } Number of SCCs: 9 SCC { #78 #79 } QKBOS(sum)... removes: #78 I(#dbls) = x1 \pi(#dbls) = 1 I(active) = x1 \pi(active) = 1 I(mark) = x1 \pi(mark) = [1] PREC: mark USABLE RULES: { } Number of SCCs: 9 SCC { #79 } QKBOS(sum)... removes: #79 I(#dbls) = x1 \pi(#dbls) = 1 I(active) = 1 + x1 \pi(active) = [1] PREC: active USABLE RULES: { } Number of SCCs: 8 SCC { #92 #93 } QKBOS(sum)... removes: #92 I(#from) = x1 \pi(#from) = 1 I(active) = x1 \pi(active) = 1 I(mark) = x1 \pi(mark) = [1] PREC: mark USABLE RULES: { } Number of SCCs: 8 SCC { #93 } QKBOS(sum)... removes: #93 I(#from) = x1 \pi(#from) = 1 I(active) = 1 + x1 \pi(active) = [1] PREC: active USABLE RULES: { } Number of SCCs: 7 SCC { #94 #95 } QKBOS(sum)... removes: #94 I(#dbl1) = x1 \pi(#dbl1) = 1 I(active) = x1 \pi(active) = 1 I(mark) = x1 \pi(mark) = [1] PREC: mark USABLE RULES: { } Number of SCCs: 7 SCC { #95 } QKBOS(sum)... removes: #95 I(#dbl1) = x1 \pi(#dbl1) = 1 I(active) = 1 + x1 \pi(active) = [1] PREC: active USABLE RULES: { } Number of SCCs: 6 SCC { #102 #103 } QKBOS(sum)... removes: #102 I(active) = x1 \pi(active) = 1 I(mark) = x1 \pi(mark) = [1] I(#quote) = x1 \pi(#quote) = 1 PREC: mark USABLE RULES: { } Number of SCCs: 6 SCC { #103 } QKBOS(sum)... removes: #103 I(active) = 1 + x1 \pi(active) = [1] I(#quote) = x1 \pi(#quote) = 1 PREC: active USABLE RULES: { } Number of SCCs: 5 SCC { #98 #99 #100 #101 } QKBOS(sum)... removes: #101 I(#sel1) = x2 \pi(#sel1) = 2 I(active) = x1 \pi(active) = [1] I(mark) = x1 \pi(mark) = 1 PREC: active USABLE RULES: { } Number of SCCs: 5 SCC { #98 #99 #100 } QKBOS(sum)... removes: #98 #99 I(#sel1) = 2 + x1 + x2 \pi(#sel1) = [1,2] I(active) = x1 \pi(active) = 1 I(mark) = 1 + x1 \pi(mark) = [1] PREC: #sel1 > mark USABLE RULES: { } Number of SCCs: 5 SCC { #100 } QKBOS(sum)... removes: #100 I(#sel1) = x1 + x2 \pi(#sel1) = [2,1] I(active) = 1 + x1 \pi(active) = [1] PREC: #sel1 = active USABLE RULES: { } Number of SCCs: 4 SCC { #80 #81 #82 #83 } QKBOS(sum)... removes: #81 I(active) = x1 \pi(active) = 1 I(#cons) = x2 \pi(#cons) = 2 I(mark) = x1 \pi(mark) = [1] PREC: mark USABLE RULES: { } Number of SCCs: 4 SCC { #80 #82 #83 } QKBOS(sum)... removes: #80 #82 I(active) = 1 + x1 \pi(active) = [1] I(#cons) = 2 + x1 \pi(#cons) = [1] I(mark) = 1 + x1 \pi(mark) = [1] PREC: #cons > mark > active USABLE RULES: { } Number of SCCs: 4 SCC { #83 } QKBOS(sum)... removes: #83 I(active) = 1 + x1 \pi(active) = [1] I(#cons) = x1 + x2 \pi(#cons) = [1,2] PREC: active = #cons USABLE RULES: { } Number of SCCs: 3 SCC { #84 #85 #86 #87 } QKBOS(sum)... removes: #85 I(active) = x1 \pi(active) = 1 I(#sel) = x2 \pi(#sel) = 2 I(mark) = x1 \pi(mark) = [1] PREC: mark USABLE RULES: { } Number of SCCs: 3 SCC { #84 #86 #87 } QKBOS(sum)... removes: #84 #86 I(active) = 1 + x1 \pi(active) = [1] I(#sel) = 2 + x1 \pi(#sel) = [1] I(mark) = 1 + x1 \pi(mark) = [1] PREC: #sel > mark > active USABLE RULES: { } Number of SCCs: 3 SCC { #87 } QKBOS(sum)... removes: #87 I(active) = 1 + x1 \pi(active) = [1] I(#sel) = x1 + x2 \pi(#sel) = [1,2] PREC: active = #sel USABLE RULES: { } Number of SCCs: 2 SCC { #88 #89 #90 #91 } QKBOS(sum)... removes: #89 I(active) = x1 \pi(active) = 1 I(#indx) = x2 \pi(#indx) = 2 I(mark) = x1 \pi(mark) = [1] PREC: mark USABLE RULES: { } Number of SCCs: 2 SCC { #88 #90 #91 } QKBOS(sum)... removes: #88 #90 I(active) = 1 + x1 \pi(active) = [1] I(#indx) = 2 + x1 \pi(#indx) = [1] I(mark) = 1 + x1 \pi(mark) = [1] PREC: #indx > mark > active USABLE RULES: { } Number of SCCs: 2 SCC { #91 } QKBOS(sum)... removes: #91 I(active) = 1 + x1 \pi(active) = [1] I(#indx) = x1 + x2 \pi(#indx) = [1,2] PREC: active = #indx USABLE RULES: { } Number of SCCs: 1 SCC { #2 #7 #11 #12 #15 #19 #24 #28 #29 #32 #35 #37 #39 #41 #43 #45 #47 #49 #51 #53 #54 #55 #57 #58 #60 #62 #64 #66 #67 #69 #70 #71 #73 } QKBOS(sum)... removes: #43 #49 #64 I(01) = 8 I(cons) = 3 \pi(cons) = [] I(indx) = 4 \pi(indx) = [] I(active) = 6 \pi(active) = [] I(#mark) = 4 \pi(#mark) = [] I(from) = 4 \pi(from) = [] I(0) = 7 I(quote) = 4 \pi(quote) = [] I(s) = 2 \pi(s) = [] I(dbl1) = 4 \pi(dbl1) = [] I(sel1) = 4 \pi(sel1) = [] I(#active) = x1 \pi(#active) = 1 I(nil) = 5 I(dbls) = 4 \pi(dbls) = [] I(dbl) = 4 \pi(dbl) = [] I(sel) = 4 \pi(sel) = [] I(mark) = x1 \pi(mark) = 1 I(s1) = 3 \pi(s1) = [] PREC: 01 > cons = indx = active = #mark = from = 0 = quote = s = dbl1 = sel1 = nil = dbls = dbl = sel = s1 USABLE RULES: { 61..32 } Number of SCCs: 1 SCC { #2 #7 #11 #12 #15 #19 #24 #28 #29 #32 #35 #37 #39 #41 #45 #47 #51 #53 #54 #55 #57 #58 #60 #62 #66 #67 #69 #70 #71 #73 } QKBOS(sum)... failed.