Input TRS:
    1: g(X) -> h(X)
    2: c() -> d()
    3: h(d()) -> g(c())
Number of strict rules: 3
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #h(d()) -> #g(c())
   #2: #h(d()) -> #c()
   #3: #g(X) -> #h(X)
Number of SCCs: 1, DPs: 2, edges: 2
	SCC { #1 #3 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... Order(PosReal,>,MaxSum)... QWPOpS(PosReal,>,MaxSum)... Order(PosReal,>,Sum-Sum; PosReal,≥,Sum-Sum)... Order(PosReal,>,Sum-Sum; NegReal,≥,Sum)... Order(PosReal,>,MaxSum-Sum; NegReal,≥,Sum)... failed.
Removing edges: failed.
Finding a loop...  found.
  #h(d())	-#1->
  #g(c())	--->*
  #g(c())	-#3->
  #h(c())	--->*
  #h(d())
  Looping with: [ ]
NO