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