YES Input TRS: 1: q(0(x1)) -> p(p(s(s(0(s(s(s(s(x1))))))))) 2: q(s(x1)) -> p(p(s(s(s(s(s(s(r(p(p(s(s(x1))))))))))))) 3: r(0(x1)) -> p(s(p(s(0(p(p(p(s(s(s(x1))))))))))) 4: r(s(x1)) -> p(s(p(s(s(q(p(s(p(s(x1)))))))))) 5: p(p(s(x1))) -> p(x1) 6: p(s(x1)) -> x1 7: p(0(x1)) -> 0(s(s(s(x1)))) Number of strict rules: 7 Direct POLO(bPol) ... removes: 1 3 q w: 2 * x1 + 7177 s w: x1 r w: 2 * x1 + 7177 p w: x1 0 w: x1 + 2332 Number of strict rules: 5 Direct POLO(bPol) ... failed. Uncurrying p 2: q(s(x1)) -> p(p^1_s(s(s(s(s(s(r(p(p^1_s(s(x1))))))))))) 4: r(s(x1)) -> p^1_s(p^1_s(s(q(p^1_s(p^1_s(x1)))))) 5: p(p^1_s(x1)) -> p(x1) 6: p^1_s(x1) -> x1 7: p^1_0(x1) -> 0(s(s(s(x1)))) 8: p(0(_1)) ->= p^1_0(_1) 9: p(s(_1)) ->= p^1_s(_1) Number of strict rules: 5 Direct POLO(bPol) ... failed. Dependency Pairs: #1: #q(s(x1)) -> #p(p^1_s(s(s(s(s(s(r(p(p^1_s(s(x1))))))))))) #2: #q(s(x1)) -> #p^1_s(s(s(s(s(s(r(p(p^1_s(s(x1)))))))))) #3: #q(s(x1)) -> #r(p(p^1_s(s(x1)))) #4: #q(s(x1)) -> #p(p^1_s(s(x1))) #5: #q(s(x1)) -> #p^1_s(s(x1)) #6: #p(s(_1)) ->? #p^1_s(_1) #7: #p(p^1_s(x1)) -> #p(x1) #8: #p(0(_1)) ->? #p^1_0(_1) #9: #r(s(x1)) -> #p^1_s(p^1_s(s(q(p^1_s(p^1_s(x1)))))) #10: #r(s(x1)) -> #p^1_s(s(q(p^1_s(p^1_s(x1))))) #11: #r(s(x1)) -> #q(p^1_s(p^1_s(x1))) #12: #r(s(x1)) -> #p^1_s(p^1_s(x1)) #13: #r(s(x1)) -> #p^1_s(x1) Number of SCCs: 2, DPs: 3 SCC { #7 } POLO(Sum)... succeeded. q w: 0 s w: 0 #p^1_0 w: 0 #p^1_s w: 0 r w: 0 p^1_0 w: 0 p^1_s w: x1 + 1 #p w: x1 p w: 0 0 w: 0 #r w: 0 #q w: 0 USABLE RULES: { } Removed DPs: #7 Number of SCCs: 1, DPs: 2 SCC { #3 #11 } POLO(Sum)... succeeded. q w: 0 s w: x1 + 32290 #p^1_0 w: 0 #p^1_s w: 0 r w: 0 p^1_0 w: 20163 p^1_s w: x1 + 1 #p w: 0 p w: x1 0 w: 20163 #r w: x1 #q w: x1 + 2 USABLE RULES: { 5..9 } Removed DPs: #3 #11 Number of SCCs: 0, DPs: 0