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