Input TRS:
    1: active(h(X)) -> mark(g(X,X))
    2: active(g(a(),X)) -> mark(f(b(),X))
    3: active(f(X,X)) -> mark(h(a()))
    4: active(a()) -> mark(b())
    5: active(h(X)) -> h(active(X))
    6: active(g(X1,X2)) -> g(active(X1),X2)
    7: active(f(X1,X2)) -> f(active(X1),X2)
    8: h(mark(X)) -> mark(h(X))
    9: g(mark(X1),X2) -> mark(g(X1,X2))
    10: f(mark(X1),X2) -> mark(f(X1,X2))
    11: proper(h(X)) -> h(proper(X))
    12: proper(g(X1,X2)) -> g(proper(X1),proper(X2))
    13: proper(a()) -> ok(a())
    14: proper(f(X1,X2)) -> f(proper(X1),proper(X2))
    15: proper(b()) -> ok(b())
    16: h(ok(X)) -> ok(h(X))
    17: g(ok(X1),ok(X2)) -> ok(g(X1,X2))
    18: f(ok(X1),ok(X2)) -> ok(f(X1,X2))
    19: top(mark(X)) -> top(proper(X))
    20: top(ok(X)) -> top(active(X))
Number of strict rules: 20
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #active(g(a(),X)) -> #f(b(),X)
   #2: #active(g(X1,X2)) -> #g(active(X1),X2)
   #3: #active(g(X1,X2)) -> #active(X1)
   #4: #g(mark(X1),X2) -> #g(X1,X2)
   #5: #proper(h(X)) -> #h(proper(X))
   #6: #proper(h(X)) -> #proper(X)
   #7: #proper(g(X1,X2)) -> #g(proper(X1),proper(X2))
   #8: #proper(g(X1,X2)) -> #proper(X1)
   #9: #proper(g(X1,X2)) -> #proper(X2)
   #10: #proper(f(X1,X2)) -> #f(proper(X1),proper(X2))
   #11: #proper(f(X1,X2)) -> #proper(X1)
   #12: #proper(f(X1,X2)) -> #proper(X2)
   #13: #top(ok(X)) -> #top(active(X))
   #14: #top(ok(X)) -> #active(X)
   #15: #active(f(X1,X2)) -> #f(active(X1),X2)
   #16: #active(f(X1,X2)) -> #active(X1)
   #17: #f(mark(X1),X2) -> #f(X1,X2)
   #18: #active(h(X)) -> #h(active(X))
   #19: #active(h(X)) -> #active(X)
   #20: #g(ok(X1),ok(X2)) -> #g(X1,X2)
   #21: #top(mark(X)) -> #top(proper(X))
   #22: #top(mark(X)) -> #proper(X)
   #23: #h(ok(X)) -> #h(X)
   #24: #active(f(X,X)) -> #h(a())
   #25: #active(h(X)) -> #g(X,X)
   #26: #h(mark(X)) -> #h(X)
   #27: #f(ok(X1),ok(X2)) -> #f(X1,X2)
Number of SCCs: 6, DPs: 16, edges: 50
	SCC { #23 #26 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
     h(x1)	weight: 0
     a()	weight: 0
     b()	weight: 0
   top(x1)	weight: 0
 #top(x1)	weight: 0
     f(x1,x2)	weight: 0
proper(x1)	weight: 0
    ok(x1)	weight: (/ 1 2) + x1
   #h(x1)	weight: x1
  mark(x1)	weight: (/ 1 2) + x1
   #f(x1,x2)	weight: 0
   #g(x1,x2)	weight: 0
#proper(x1)	weight: 0
active(x1)	weight: 0
#active(x1)	weight: 0
     g(x1,x2)	weight: 0
    Usable rules: { }
    Removed DPs: #23 #26
Number of SCCs: 5, DPs: 14, edges: 46
	SCC { #13 #21 }
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