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