Input TRS: 1: active(app(nil,YS)) -> mark(YS) 2: active(app(cons(X,XS),YS)) -> mark(cons(X,app(XS,YS))) 3: active(from(X)) -> mark(cons(X,from(s(X)))) 4: active(zWadr(nil,YS)) -> mark(nil) 5: active(zWadr(XS,nil)) -> mark(nil) 6: active(zWadr(cons(X,XS),cons(Y,YS))) -> mark(cons(app(Y,cons(X,nil)),zWadr(XS,YS))) 7: active(prefix(L)) -> mark(cons(nil,zWadr(L,prefix(L)))) 8: active(app(X1,X2)) -> app(active(X1),X2) 9: active(app(X1,X2)) -> app(X1,active(X2)) 10: active(cons(X1,X2)) -> cons(active(X1),X2) 11: active(from(X)) -> from(active(X)) 12: active(s(X)) -> s(active(X)) 13: active(zWadr(X1,X2)) -> zWadr(active(X1),X2) 14: active(zWadr(X1,X2)) -> zWadr(X1,active(X2)) 15: active(prefix(X)) -> prefix(active(X)) 16: app(mark(X1),X2) -> mark(app(X1,X2)) 17: app(X1,mark(X2)) -> mark(app(X1,X2)) 18: cons(mark(X1),X2) -> mark(cons(X1,X2)) 19: from(mark(X)) -> mark(from(X)) 20: s(mark(X)) -> mark(s(X)) 21: zWadr(mark(X1),X2) -> mark(zWadr(X1,X2)) 22: zWadr(X1,mark(X2)) -> mark(zWadr(X1,X2)) 23: prefix(mark(X)) -> mark(prefix(X)) 24: proper(app(X1,X2)) -> app(proper(X1),proper(X2)) 25: proper(nil) -> ok(nil) 26: proper(cons(X1,X2)) -> cons(proper(X1),proper(X2)) 27: proper(from(X)) -> from(proper(X)) 28: proper(s(X)) -> s(proper(X)) 29: proper(zWadr(X1,X2)) -> zWadr(proper(X1),proper(X2)) 30: proper(prefix(X)) -> prefix(proper(X)) 31: app(ok(X1),ok(X2)) -> ok(app(X1,X2)) 32: cons(ok(X1),ok(X2)) -> ok(cons(X1,X2)) 33: from(ok(X)) -> ok(from(X)) 34: s(ok(X)) -> ok(s(X)) 35: zWadr(ok(X1),ok(X2)) -> ok(zWadr(X1,X2)) 36: prefix(ok(X)) -> ok(prefix(X)) 37: top(mark(X)) -> top(proper(X)) 38: top(ok(X)) -> top(active(X)) Dependency Pairs: #1: #active(app(cons(X,XS),YS)) -> #cons(X,app(XS,YS)) #2: #active(app(cons(X,XS),YS)) -> #app(XS,YS) #3: #active(from(X)) -> #cons(X,from(s(X))) #4: #active(from(X)) -> #from(s(X)) #5: #active(from(X)) -> #s(X) #6: #active(zWadr(cons(X,XS),cons(Y,YS))) -> #cons(app(Y,cons(X,nil)),zWadr(XS,YS)) #7: #active(zWadr(cons(X,XS),cons(Y,YS))) -> #app(Y,cons(X,nil)) #8: #active(zWadr(cons(X,XS),cons(Y,YS))) -> #cons(X,nil) #9: #active(zWadr(cons(X,XS),cons(Y,YS))) -> #zWadr(XS,YS) #10: #active(prefix(L)) -> #cons(nil,zWadr(L,prefix(L))) #11: #active(prefix(L)) -> #zWadr(L,prefix(L)) #12: #active(prefix(L)) -> #prefix(L) #13: #active(app(X1,X2)) -> #app(active(X1),X2) #14: #active(app(X1,X2)) -> #active(X1) #15: #active(app(X1,X2)) -> #app(X1,active(X2)) #16: #active(app(X1,X2)) -> #active(X2) #17: #active(cons(X1,X2)) -> #cons(active(X1),X2) #18: #active(cons(X1,X2)) -> #active(X1) #19: #active(from(X)) -> #from(active(X)) #20: #active(from(X)) -> #active(X) #21: #active(s(X)) -> #s(active(X)) #22: #active(s(X)) -> #active(X) #23: #active(zWadr(X1,X2)) -> #zWadr(active(X1),X2) #24: #active(zWadr(X1,X2)) -> #active(X1) #25: #active(zWadr(X1,X2)) -> #zWadr(X1,active(X2)) #26: #active(zWadr(X1,X2)) -> #active(X2) #27: #active(prefix(X)) -> #prefix(active(X)) #28: #active(prefix(X)) -> #active(X) #29: #app(mark(X1),X2) -> #app(X1,X2) #30: #app(X1,mark(X2)) -> #app(X1,X2) #31: #cons(mark(X1),X2) -> #cons(X1,X2) #32: #from(mark(X)) -> #from(X) #33: #s(mark(X)) -> #s(X) #34: #zWadr(mark(X1),X2) -> #zWadr(X1,X2) #35: #zWadr(X1,mark(X2)) -> #zWadr(X1,X2) #36: #prefix(mark(X)) -> #prefix(X) #37: #proper(app(X1,X2)) -> #app(proper(X1),proper(X2)) #38: #proper(app(X1,X2)) -> #proper(X1) #39: #proper(app(X1,X2)) -> #proper(X2) #40: #proper(cons(X1,X2)) -> #cons(proper(X1),proper(X2)) #41: #proper(cons(X1,X2)) -> #proper(X1) #42: #proper(cons(X1,X2)) -> #proper(X2) #43: #proper(from(X)) -> #from(proper(X)) #44: #proper(from(X)) -> #proper(X) #45: #proper(s(X)) -> #s(proper(X)) #46: #proper(s(X)) -> #proper(X) #47: #proper(zWadr(X1,X2)) -> #zWadr(proper(X1),proper(X2)) #48: #proper(zWadr(X1,X2)) -> #proper(X1) #49: #proper(zWadr(X1,X2)) -> #proper(X2) #50: #proper(prefix(X)) -> #prefix(proper(X)) #51: #proper(prefix(X)) -> #proper(X) #52: #app(ok(X1),ok(X2)) -> #app(X1,X2) #53: #cons(ok(X1),ok(X2)) -> #cons(X1,X2) #54: #from(ok(X)) -> #from(X) #55: #s(ok(X)) -> #s(X) #56: #zWadr(ok(X1),ok(X2)) -> #zWadr(X1,X2) #57: #prefix(ok(X)) -> #prefix(X) #58: #top(mark(X)) -> #top(proper(X)) #59: #top(mark(X)) -> #proper(X) #60: #top(ok(X)) -> #top(active(X)) #61: #top(ok(X)) -> #active(X) Number of SCCs: 9 SCC { #31 #53 } QKBOPS(sum)... removes: #31 #53 I(ok) = 1 + x1 \pi(ok) = [1] I(#cons) = x1 + x2 \pi(#cons) = [] I(mark) = 1 + x1 \pi(mark) = [1] PREC: #cons > mark > ok USABLE RULES: { } Number of SCCs: 8 SCC { #32 #54 } QKBOPS(sum)... removes: #32 I(#from) = x1 \pi(#from) = 1 I(ok) = x1 \pi(ok) = 1 I(mark) = 1 + x1 \pi(mark) = [1] PREC: mark USABLE RULES: { } Number of SCCs: 8 SCC { #54 } QKBOPS(sum)... removes: #54 I(#from) = x1 \pi(#from) = [] I(ok) = 1 + x1 \pi(ok) = [] PREC: #from = ok USABLE RULES: { } Number of SCCs: 7 SCC { #33 #55 } QKBOPS(sum)... removes: #33 I(ok) = x1 \pi(ok) = 1 I(#s) = x1 \pi(#s) = 1 I(mark) = 1 + x1 \pi(mark) = [1] PREC: mark USABLE RULES: { } Number of SCCs: 7 SCC { #55 } QKBOPS(sum)... removes: #55 I(ok) = 1 + x1 \pi(ok) = [1] I(#s) = x1 \pi(#s) = [] PREC: ok = #s USABLE RULES: { } Number of SCCs: 6 SCC { #36 #57 } QKBOPS(sum)... removes: #36 I(ok) = x1 \pi(ok) = 1 I(mark) = 1 + x1 \pi(mark) = [1] I(#prefix) = x1 \pi(#prefix) = 1 PREC: mark USABLE RULES: { } Number of SCCs: 6 SCC { #57 } QKBOPS(sum)... removes: #57 I(ok) = 1 + x1 \pi(ok) = [1] I(#prefix) = x1 \pi(#prefix) = [] PREC: ok = #prefix USABLE RULES: { } Number of SCCs: 5 SCC { #58 #60 } QKBOPS(sum)... removes: #58 I(#top) = x1 \pi(#top) = [] I(cons) = x1 \pi(cons) = [] I(#zWadr) = x1 \pi(#zWadr) = [] I(proper) = x1 \pi(proper) = 1 I(ok) = x1 \pi(ok) = [] I(app) = 1 + x1 + x2 \pi(app) = [2] I(#app) = 1 + x1 + x2 \pi(#app) = [1,2] I(active) = x1 \pi(active) = 1 I(from) = 7 + x1 \pi(from) = [] I(prefix) = 7 + x1 \pi(prefix) = [1] I(#proper) = x1 \pi(#proper) = 1 I(s) = x1 \pi(s) = 1 I(#active) = 1 \pi(#active) = [] I(nil) = 6 I(mark) = 1 + x1 \pi(mark) = [] I(zWadr) = 3 + x1 + x2 \pi(zWadr) = [] PREC: #top = #zWadr = #active > cons = prefix > app = from = mark = zWadr > ok = nil > #app USABLE RULES: { 36..1 } Number of SCCs: 5 SCC { #60 } QKBOPS(sum)... removes: #60 I(#top) = x1 \pi(#top) = 1 I(cons) = x1 \pi(cons) = 1 I(#zWadr) = x1 \pi(#zWadr) = [] I(proper) = 1 \pi(proper) = [] I(ok) = x1 \pi(ok) = [1] I(app) = x1 \pi(app) = [1] I(#app) = 1 + x1 + x2 \pi(#app) = [1,2] I(active) = x1 \pi(active) = 1 I(from) = x1 \pi(from) = [1] I(prefix) = x1 \pi(prefix) = [1] I(#proper) = x1 \pi(#proper) = 1 I(s) = x1 \pi(s) = 1 I(#active) = 1 \pi(#active) = [] I(nil) = 2 I(mark) = 1 \pi(mark) = [] I(zWadr) = x2 \pi(zWadr) = [2] PREC: #zWadr = ok = app = from = prefix = #active = mark = zWadr > nil > proper > #app USABLE RULES: { 36..31 23..1 } Number of SCCs: 4 SCC { #29 #30 #52 } QKBOPS(sum)... removes: #29 #30 #52 I(ok) = 1 + x1 \pi(ok) = [1] I(#app) = x1 + x2 \pi(#app) = [] I(mark) = 1 + x1 \pi(mark) = [1] PREC: #app > mark > ok USABLE RULES: { } Number of SCCs: 3 SCC { #34 #35 #56 } QKBOPS(sum)... removes: #34 #35 #56 I(#zWadr) = x1 + x2 \pi(#zWadr) = [] I(ok) = 1 + x1 \pi(ok) = [1] I(mark) = 1 + x1 \pi(mark) = [1] PREC: #zWadr > ok = mark USABLE RULES: { } Number of SCCs: 2 SCC { #14 #16 #18 #20 #22 #24 #26 #28 } QKBOPS(sum)... removes: #14 #16 #18 #24 #26 I(cons) = x1 + x2 \pi(cons) = [2] I(app) = x1 + x2 \pi(app) = [1] I(from) = x1 \pi(from) = 1 I(prefix) = x1 \pi(prefix) = 1 I(s) = x1 \pi(s) = 1 I(#active) = 1 + x1 \pi(#active) = [] I(zWadr) = x1 + x2 \pi(zWadr) = [1] PREC: cons = app = zWadr > #active USABLE RULES: { } Number of SCCs: 2 SCC { #20 #22 #28 } QKBOPS(sum)... removes: #22 I(from) = x1 \pi(from) = 1 I(prefix) = x1 \pi(prefix) = 1 I(s) = x1 \pi(s) = [1] I(#active) = x1 \pi(#active) = 1 PREC: s USABLE RULES: { } Number of SCCs: 2 SCC { #20 #28 } QKBOPS(sum)... removes: #20 I(from) = 1 + x1 \pi(from) = [1] I(prefix) = x1 \pi(prefix) = 1 I(#active) = x1 \pi(#active) = 1 PREC: from USABLE RULES: { } Number of SCCs: 2 SCC { #28 } QKBOPS(sum)... removes: #28 I(prefix) = 1 + x1 \pi(prefix) = [1] I(#active) = x1 \pi(#active) = [] PREC: prefix = #active USABLE RULES: { } Number of SCCs: 1 SCC { #38 #39 #41 #42 #44 #46 #48 #49 #51 } QKBOPS(sum)... removes: #38 #39 #41 #42 #48 #49 I(cons) = x1 + x2 \pi(cons) = [2,1] I(app) = x1 + x2 \pi(app) = [1,2] I(from) = x1 \pi(from) = 1 I(prefix) = x1 \pi(prefix) = 1 I(s) = x1 \pi(s) = 1 I(#proper) = x1 \pi(#proper) = [] I(zWadr) = x1 + x2 \pi(zWadr) = [1] PREC: cons = app = zWadr > #proper USABLE RULES: { } Number of SCCs: 1 SCC { #44 #46 #51 } QKBOPS(sum)... removes: #46 I(from) = x1 \pi(from) = 1 I(prefix) = x1 \pi(prefix) = 1 I(s) = x1 \pi(s) = [1] I(#proper) = x1 \pi(#proper) = 1 PREC: s USABLE RULES: { } Number of SCCs: 1 SCC { #44 #51 } QKBOPS(sum)... removes: #44 I(from) = 1 + x1 \pi(from) = [1] I(prefix) = x1 \pi(prefix) = 1 I(#proper) = x1 \pi(#proper) = 1 PREC: from USABLE RULES: { } Number of SCCs: 1 SCC { #51 } QKBOPS(sum)... removes: #51 I(prefix) = 1 + x1 \pi(prefix) = [1] I(#proper) = x1 \pi(#proper) = [] PREC: prefix = #proper USABLE RULES: { } Number of SCCs: 0