NO
Input TRS:
      1: f(a(),X) -> f(X,X)
      2: c() -> a()
      3: c() -> b()
Number of strict rules: 3
Direct POLO(bPol) ... failed.
Uncurrying ... failed.
Dependency Pairs:
     #1: #f(a(),X) -> #f(X,X)
Number of SCCs: 1, DPs: 1
  SCC { #1 }
POLO(Sum)... POLO(max)... QLPOS... POLO(mSum)... QWPOpS(mSum)... Mat2b... failed.
Finding a loop...  found.
  #f(a(),a())	-#1->
  #f(a(),a())	--->*
  #f(a(),a())
  Looping with: [ ]