Input TRS: 1: minus(n__0,Y) -> 0 2: minus(n__s(X),n__s(Y)) -> minus(activate(X),activate(Y)) 3: geq(X,n__0) -> true 4: geq(n__0,n__s(Y)) -> false 5: geq(n__s(X),n__s(Y)) -> geq(activate(X),activate(Y)) 6: div(0,n__s(Y)) -> 0 7: div(s(X),n__s(Y)) -> if(geq(X,activate(Y)),n__s(n__div(n__minus(X,activate(Y)),n__s(activate(Y)))),n__0) 8: if(true,X,Y) -> activate(X) 9: if(false,X,Y) -> activate(Y) 10: 0 -> n__0 11: s(X) -> n__s(X) 12: div(X1,X2) -> n__div(X1,X2) 13: minus(X1,X2) -> n__minus(X1,X2) 14: activate(n__0) -> 0 15: activate(n__s(X)) -> s(activate(X)) 16: activate(n__div(X1,X2)) -> div(activate(X1),X2) 17: activate(n__minus(X1,X2)) -> minus(X1,X2) 18: activate(X) -> X Dependency Pairs: #1: #minus(n__0,Y) -> #0 #2: #minus(n__s(X),n__s(Y)) -> #minus(activate(X),activate(Y)) #3: #minus(n__s(X),n__s(Y)) -> #activate(X) #4: #minus(n__s(X),n__s(Y)) -> #activate(Y) #5: #geq(n__s(X),n__s(Y)) -> #geq(activate(X),activate(Y)) #6: #geq(n__s(X),n__s(Y)) -> #activate(X) #7: #geq(n__s(X),n__s(Y)) -> #activate(Y) #8: #div(0,n__s(Y)) -> #0 #9: #div(s(X),n__s(Y)) -> #if(geq(X,activate(Y)),n__s(n__div(n__minus(X,activate(Y)),n__s(activate(Y)))),n__0) #10: #div(s(X),n__s(Y)) -> #geq(X,activate(Y)) #11: #div(s(X),n__s(Y)) -> #activate(Y) #12: #div(s(X),n__s(Y)) -> #activate(Y) #13: #div(s(X),n__s(Y)) -> #activate(Y) #14: #if(true,X,Y) -> #activate(X) #15: #if(false,X,Y) -> #activate(Y) #16: #activate(n__0) -> #0 #17: #activate(n__s(X)) -> #s(activate(X)) #18: #activate(n__s(X)) -> #activate(X) #19: #activate(n__div(X1,X2)) -> #div(activate(X1),X2) #20: #activate(n__div(X1,X2)) -> #activate(X1) #21: #activate(n__minus(X1,X2)) -> #minus(X1,X2) Number of SCCs: 1 SCC { #2 #3 #4 #5 #6 #7 #9 #10 #11 #12 #13 #14 #15 #18 #19 #20 #21 } QKBOPS(sum)... failed.