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