Input TRS:
    1: f(a(),x) -> f(x,f(b(),x))
    2: f(f(x,y),z) ->= f(x,f(y,z))
    3: f(x,f(y,z)) ->= f(f(x,y),z)
Number of strict rules: 1
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #f(f(x,y),z) ->? #f(x,f(y,z))
   #2: #f(f(x,y),z) ->? #f(y,z)
   #3: #f(x,f(y,z)) ->? #f(f(x,y),z)
   #4: #f(x,f(y,z)) ->? #f(x,y)
   #5: #f(a(),x) -> #f(x,f(b(),x))
   #6: #f(a(),x) -> #f(b(),x)
Number of SCCs: 1, DPs: 6, edges: 30
	SCC { #1..6 }
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