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