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