Input TRS:
    1: g(x,x) -> g(a(),b())
    2: g(c(),g(c(),x)) -> g(e(),g(d(),x))
    3: g(d(),g(d(),x)) -> g(c(),g(e(),x))
    4: g(e(),g(e(),x)) -> g(d(),g(c(),x))
    5: f(g(x,y)) -> g(y,g(f(f(x)),a()))
Number of strict rules: 5
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #g(c(),g(c(),x)) -> #g(e(),g(d(),x))
   #2: #g(c(),g(c(),x)) -> #g(d(),x)
   #3: #f(g(x,y)) -> #g(y,g(f(f(x)),a()))
   #4: #f(g(x,y)) -> #g(f(f(x)),a())
   #5: #f(g(x,y)) -> #f(f(x))
   #6: #f(g(x,y)) -> #f(x)
   #7: #g(d(),g(d(),x)) -> #g(c(),g(e(),x))
   #8: #g(d(),g(d(),x)) -> #g(e(),x)
   #9: #g(x,x) -> #g(a(),b())
   #10: #g(e(),g(e(),x)) -> #g(d(),g(c(),x))
   #11: #g(e(),g(e(),x)) -> #g(c(),x)
Number of SCCs: 3, DPs: 9, edges: 17
	SCC { #9 }
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