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