Input TRS:
    1: f(a(),g(y),z) -> f(a(),y,g(y))
    2: f(b(),g(y),z) -> f(a(),y,z)
    3: a() -> b()
    4: f(x,y,z) ->= f(x,y,g(z))
Number of strict rules: 3
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #f(b(),g(y),z) -> #f(a(),y,z)
   #2: #f(b(),g(y),z) -> #a()
   #3: #f(a(),g(y),z) -> #f(a(),y,g(y))
   #4: #f(x,y,z) ->? #f(x,y,g(z))
Number of SCCs: 1, DPs: 3, edges: 9
	SCC { #1 #3 #4 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
     a()	weight: 0
     b()	weight: 0
     f(x1,x2,x3)	weight: 0
   #f(x1,x2,x3)	weight: x2
   #a()	weight: 0
     g(x1)	weight: (/ 1 2) + x1
    Usable rules: { }
    Removed DPs: #1 #3
Number of SCCs: 1, DPs: 1, edges: 1
	SCC { #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...  failed.
MAYBE