Input TRS:
    1: a__f(X,X) -> a__f(a(),b())
    2: a__b() -> a()
    3: mark(f(X1,X2)) -> a__f(mark(X1),X2)
    4: mark(b()) -> a__b()
    5: mark(a()) -> a()
    6: a__f(X1,X2) -> f(X1,X2)
    7: a__b() -> b()
Number of strict rules: 7
Direct Order(PosReal,>,Poly) ... removes: 4 3 5 6
     a()	weight: 0
     b()	weight: 0
  a__b()	weight: 0
  a__f(x1,x2)	weight: (/ 3 8) + x1 + 2 * x2
     f(x1,x2)	weight: (/ 1 4) + x1 + x2
  mark(x1)	weight: (/ 1 8) + 2 * x1
Number of strict rules: 3
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #a__f(X,X) -> #a__f(a(),b())
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