Input TRS: 1: f(true,x,y) -> f(and(gt(x,y),gt(y,s(s(0)))),plus(s(0),x),double(y)) 2: gt(0,v) -> false 3: gt(s(u),0) -> true 4: gt(s(u),s(v)) -> gt(u,v) 5: and(x,true) -> x 6: and(x,false) -> false 7: plus(n,0) -> n 8: plus(n,s(m)) -> s(plus(n,m)) 9: double(0) -> 0 10: double(s(x)) -> s(s(double(x))) Dependency Pairs: #1: #f(true,x,y) -> #f(and(gt(x,y),gt(y,s(s(0)))),plus(s(0),x),double(y)) #2: #f(true,x,y) -> #and(gt(x,y),gt(y,s(s(0)))) #3: #f(true,x,y) -> #gt(x,y) #4: #f(true,x,y) -> #gt(y,s(s(0))) #5: #f(true,x,y) -> #plus(s(0),x) #6: #f(true,x,y) -> #double(y) #7: #gt(s(u),s(v)) -> #gt(u,v) #8: #plus(n,s(m)) -> #plus(n,m) #9: #double(s(x)) -> #double(x) Number of SCCs: 4 SCC { #7 } QKBOS(sum)... removes: #7 I(s) = 1 + x1 \pi(s) = [1] I(#gt) = x1 + x2 \pi(#gt) = [2,1] PREC: #gt > s USABLE RULES: { } Number of SCCs: 3 SCC { #8 } QKBOS(sum)... removes: #8 I(#plus) = x1 + x2 \pi(#plus) = [1,2] I(s) = 1 + x1 \pi(s) = [1] PREC: #plus = s USABLE RULES: { } Number of SCCs: 2 SCC { #9 } QKBOS(sum)... removes: #9 I(s) = 1 + x1 \pi(s) = [1] I(#double) = x1 \pi(#double) = 1 PREC: s USABLE RULES: { } Number of SCCs: 1 SCC { #1 } QKBOS(sum)... failed.