Input TRS: 1: lcm(x,y) -> lcmIter(x,y,0,times(x,y)) 2: lcmIter(x,y,z,u) -> if(or(ge(0,x),ge(z,u)),x,y,z,u) 3: if(true,x,y,z,u) -> z 4: if(false,x,y,z,u) -> if2(divisible(z,y),x,y,z,u) 5: if2(true,x,y,z,u) -> z 6: if2(false,x,y,z,u) -> lcmIter(x,y,plus(x,z),u) 7: plus(0,y) -> y 8: plus(s(x),y) -> s(plus(x,y)) 9: times(x,y) -> ifTimes(ge(0,x),x,y) 10: ifTimes(true,x,y) -> 0 11: ifTimes(false,x,y) -> plus(y,times(y,p(x))) 12: p(s(x)) -> x 13: p(0) -> s(s(0)) 14: ge(x,0) -> true 15: ge(0,s(y)) -> false 16: ge(s(x),s(y)) -> ge(x,y) 17: or(true,y) -> true 18: or(false,y) -> y 19: divisible(0,s(y)) -> true 20: divisible(s(x),s(y)) -> div(s(x),s(y),s(y)) 21: div(x,y,0) -> divisible(x,y) 22: div(0,y,s(z)) -> false 23: div(s(x),y,s(z)) -> div(x,y,z) 24: a -> b 25: a -> c Dependency Pairs: #1: #lcm(x,y) -> #lcmIter(x,y,0,times(x,y)) #2: #lcm(x,y) -> #times(x,y) #3: #lcmIter(x,y,z,u) -> #if(or(ge(0,x),ge(z,u)),x,y,z,u) #4: #lcmIter(x,y,z,u) -> #or(ge(0,x),ge(z,u)) #5: #lcmIter(x,y,z,u) -> #ge(0,x) #6: #lcmIter(x,y,z,u) -> #ge(z,u) #7: #if(false,x,y,z,u) -> #if2(divisible(z,y),x,y,z,u) #8: #if(false,x,y,z,u) -> #divisible(z,y) #9: #if2(false,x,y,z,u) -> #lcmIter(x,y,plus(x,z),u) #10: #if2(false,x,y,z,u) -> #plus(x,z) #11: #plus(s(x),y) -> #plus(x,y) #12: #times(x,y) -> #ifTimes(ge(0,x),x,y) #13: #times(x,y) -> #ge(0,x) #14: #ifTimes(false,x,y) -> #plus(y,times(y,p(x))) #15: #ifTimes(false,x,y) -> #times(y,p(x)) #16: #ifTimes(false,x,y) -> #p(x) #17: #ge(s(x),s(y)) -> #ge(x,y) #18: #divisible(s(x),s(y)) -> #div(s(x),s(y),s(y)) #19: #div(x,y,0) -> #divisible(x,y) #20: #div(s(x),y,s(z)) -> #div(x,y,z) Number of SCCs: 5 SCC { #17 } QKBOPS(sum)... removes: #17 I(#ge) = x1 + x2 \pi(#ge) = [] I(s) = 1 + x1 \pi(s) = [1] PREC: #ge > s USABLE RULES: { } Number of SCCs: 4 SCC { #11 } QKBOPS(sum)... removes: #11 I(#plus) = x1 + x2 \pi(#plus) = [] I(s) = 1 + x1 \pi(s) = [1] PREC: #plus > s USABLE RULES: { } Number of SCCs: 3 SCC { #12 #15 } QKBOPS(sum)... failed.