Input TRS:
    1: active(f(X,X)) -> mark(f(a(),b()))
    2: active(b()) -> mark(a())
    3: mark(f(X1,X2)) -> active(f(mark(X1),X2))
    4: mark(a()) -> active(a())
    5: mark(b()) -> active(b())
    6: f(mark(X1),X2) -> f(X1,X2)
    7: f(X1,mark(X2)) -> f(X1,X2)
    8: f(active(X1),X2) -> f(X1,X2)
    9: f(X1,active(X2)) -> f(X1,X2)
Number of strict rules: 9
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #active(b()) -> #mark(a())
   #2: #f(mark(X1),X2) -> #f(X1,X2)
   #3: #f(X1,active(X2)) -> #f(X1,X2)
   #4: #f(X1,mark(X2)) -> #f(X1,X2)
   #5: #mark(b()) -> #active(b())
   #6: #mark(f(X1,X2)) -> #active(f(mark(X1),X2))
   #7: #mark(f(X1,X2)) -> #f(mark(X1),X2)
   #8: #mark(f(X1,X2)) -> #mark(X1)
   #9: #active(f(X,X)) -> #mark(f(a(),b()))
   #10: #active(f(X,X)) -> #f(a(),b())
   #11: #f(active(X1),X2) -> #f(X1,X2)
   #12: #mark(a()) -> #active(a())
Number of SCCs: 2, DPs: 7, edges: 21
	SCC { #6 #8 #9 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
     a()	weight: 0
     b()	weight: 0
     f(x1,x2)	weight: (/ 1 4) + x1 + x2
#mark(x1)	weight: x1
  mark(x1)	weight: (/ 1 4)
   #f(x1,x2)	weight: 0
active(x1)	weight: (/ 1 2)
#active(x1)	weight: (/ 1 4)
    Usable rules: { }
    Removed DPs: #8
Number of SCCs: 2, DPs: 6, edges: 18
	SCC { #6 #9 }
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