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