YES Input TRS: C symbols: gcd 1: le(0(),y) -> true() 2: le(s(x),0()) -> false() 3: le(s(x),s(y)) -> le(x,y) 4: pred(s(x)) -> x 5: minus(x,0()) -> x 6: minus(x,s(y)) -> pred(minus(x,y)) 7: gcd(0(),y) -> y 8: gcd(s(x),0()) -> s(x) 9: gcd(s(x),s(y)) -> if_gcd(le(y,x),s(x),s(y)) 10: if_gcd(true(),s(x),s(y)) -> gcd(minus(x,y),s(y)) 11: if_gcd(false(),s(x),s(y)) -> gcd(minus(y,x),s(x)) Number of strict rules: 11 Direct POLO(bPol) ... failed. Uncurrying ... failed. Dependency Pairs: #1: #minus(x,s(y)) -> #pred(minus(x,y)) #2: #minus(x,s(y)) -> #minus(x,y) #3: #gcd(s(x),s(y)) -> #if_gcd(le(y,x),s(x),s(y)) #4: #gcd(s(x),s(y)) -> #le(y,x) #5: #if_gcd(false(),s(x),s(y)) -> #gcd(minus(y,x),s(x)) #6: #if_gcd(false(),s(x),s(y)) -> #minus(y,x) #7: #if_gcd(true(),s(x),s(y)) -> #gcd(minus(x,y),s(y)) #8: #if_gcd(true(),s(x),s(y)) -> #minus(x,y) #9: #le(s(x),s(y)) -> #le(x,y) Number of SCCs: 3, DPs: 5 SCC { #2 } POLO(Sum)... succeeded. le w: 0 s w: x1 + 1 #le w: 0 minus w: 0 gcd w: 0 false w: 0 true w: 0 pred w: 0 0 w: 0 #minus w: x2 #pred w: 0 if_gcd w: 0 #if_gcd w: 0 #gcd w: 0 USABLE RULES: { } Removed DPs: #2 Number of SCCs: 2, DPs: 4 SCC { #9 } POLO(Sum)... succeeded. le w: 0 s w: x1 + 1 #le w: x2 minus w: 0 gcd w: 0 false w: 0 true w: 0 pred w: 0 0 w: 0 #minus w: 0 #pred w: 0 if_gcd w: 0 #if_gcd w: 0 #gcd w: 0 USABLE RULES: { } Removed DPs: #9 Number of SCCs: 1, DPs: 3 SCC { #3 #5 #7 } POLO(Sum)... succeeded. le w: x1 + x2 + 1 s w: x1 + 3 #le w: 0 minus w: x1 + 1 gcd w: 0 false w: 6 true w: 3 pred w: x1 0 w: 1 #minus w: 0 #pred w: 0 if_gcd w: 0 #if_gcd w: x2 + x3 #gcd w: x1 + x2 + 1 USABLE RULES: { 4..6 } Removed DPs: #3 #5 #7 Number of SCCs: 0, DPs: 0 Next Dependency Pairs: Number of SCCs: 0, DPs: 0