Input TRS: 1: active(and(tt,X)) -> mark(X) 2: active(plus(N,0)) -> mark(N) 3: active(plus(N,s(M))) -> mark(s(plus(N,M))) 4: active(and(X1,X2)) -> and(active(X1),X2) 5: active(plus(X1,X2)) -> plus(active(X1),X2) 6: active(plus(X1,X2)) -> plus(X1,active(X2)) 7: active(s(X)) -> s(active(X)) 8: and(mark(X1),X2) -> mark(and(X1,X2)) 9: plus(mark(X1),X2) -> mark(plus(X1,X2)) 10: plus(X1,mark(X2)) -> mark(plus(X1,X2)) 11: s(mark(X)) -> mark(s(X)) 12: proper(and(X1,X2)) -> and(proper(X1),proper(X2)) 13: proper(tt) -> ok(tt) 14: proper(plus(X1,X2)) -> plus(proper(X1),proper(X2)) 15: proper(0) -> ok(0) 16: proper(s(X)) -> s(proper(X)) 17: and(ok(X1),ok(X2)) -> ok(and(X1,X2)) 18: plus(ok(X1),ok(X2)) -> ok(plus(X1,X2)) 19: s(ok(X)) -> ok(s(X)) 20: top(mark(X)) -> top(proper(X)) 21: top(ok(X)) -> top(active(X)) Dependency Pairs: #1: #active(plus(N,s(M))) -> #s(plus(N,M)) #2: #active(plus(N,s(M))) -> #plus(N,M) #3: #active(and(X1,X2)) -> #and(active(X1),X2) #4: #active(and(X1,X2)) -> #active(X1) #5: #active(plus(X1,X2)) -> #plus(active(X1),X2) #6: #active(plus(X1,X2)) -> #active(X1) #7: #active(plus(X1,X2)) -> #plus(X1,active(X2)) #8: #active(plus(X1,X2)) -> #active(X2) #9: #active(s(X)) -> #s(active(X)) #10: #active(s(X)) -> #active(X) #11: #and(mark(X1),X2) -> #and(X1,X2) #12: #plus(mark(X1),X2) -> #plus(X1,X2) #13: #plus(X1,mark(X2)) -> #plus(X1,X2) #14: #s(mark(X)) -> #s(X) #15: #proper(and(X1,X2)) -> #and(proper(X1),proper(X2)) #16: #proper(and(X1,X2)) -> #proper(X1) #17: #proper(and(X1,X2)) -> #proper(X2) #18: #proper(plus(X1,X2)) -> #plus(proper(X1),proper(X2)) #19: #proper(plus(X1,X2)) -> #proper(X1) #20: #proper(plus(X1,X2)) -> #proper(X2) #21: #proper(s(X)) -> #s(proper(X)) #22: #proper(s(X)) -> #proper(X) #23: #and(ok(X1),ok(X2)) -> #and(X1,X2) #24: #plus(ok(X1),ok(X2)) -> #plus(X1,X2) #25: #s(ok(X)) -> #s(X) #26: #top(mark(X)) -> #top(proper(X)) #27: #top(mark(X)) -> #proper(X) #28: #top(ok(X)) -> #top(active(X)) #29: #top(ok(X)) -> #active(X) Number of SCCs: 6 SCC { #14 #25 } QKBOS(sum)... removes: #14 I(ok) = x1 \pi(ok) = 1 I(#s) = x1 \pi(#s) = [1] I(mark) = x1 \pi(mark) = [1] PREC: #s = mark USABLE RULES: { } Number of SCCs: 6 SCC { #25 } QKBOS(sum)... removes: #25 I(ok) = 1 + x1 \pi(ok) = [1] I(#s) = x1 \pi(#s) = 1 PREC: ok USABLE RULES: { } Number of SCCs: 5 SCC { #11 #23 } QKBOS(sum)... removes: #11 I(ok) = x1 \pi(ok) = 1 I(#and) = 1 + x1 \pi(#and) = [1] I(mark) = 2 + x1 \pi(mark) = [1] PREC: #and = mark USABLE RULES: { } Number of SCCs: 5 SCC { #23 } QKBOS(sum)... removes: #23 I(ok) = 1 + x1 \pi(ok) = [1] I(#and) = x1 + x2 \pi(#and) = [2,1] PREC: #and > ok USABLE RULES: { } Number of SCCs: 4 SCC { #26 #28 } QKBOS(sum)... failed.