Input TRS:
    1: h(X) -> g(X)
    2: g(a()) -> f(b())
    3: f(X) -> h(a())
    4: a() -> b()
Number of strict rules: 4
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #g(a()) -> #f(b())
   #2: #f(X) -> #h(a())
   #3: #f(X) -> #a()
   #4: #h(X) -> #g(X)
Number of SCCs: 1, DPs: 3, edges: 3
	SCC { #1 #2 #4 }
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(a())	-#4->
  #g(a())	--->*
  #g(a())	-#1->
  #f(b())	--->*
  #f(b())	-#2->
  #h(a())	--->*
  #h(a())
  Looping with: [ ]
NO