Input TRS:
    1: f(x,x) -> f(i(x),g(g(x)))
    2: f(x,y) -> x
    3: g(x) -> i(x)
    4: f(x,i(x)) -> f(x,x)
    5: f(i(x),i(g(x))) -> a()
Number of strict rules: 5
Direct Order(PosReal,>,Poly) ... removes: 5 2
     a()	weight: 0
     f(x1,x2)	weight: (/ 1 2) + x1 + 2 * x2
     i(x1)	weight: x1
     g(x1)	weight: x1
Number of strict rules: 3
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #f(x,x) -> #f(i(x),g(g(x)))
   #2: #f(x,x) -> #g(g(x))
   #3: #f(x,x) -> #g(x)
   #4: #f(x,i(x)) -> #f(x,x)
Number of SCCs: 1, DPs: 2, edges: 4
	SCC { #1 #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