Input TRS:
    1: a__f(f(a())) -> c(f(g(f(a()))))
    2: mark(f(X)) -> a__f(mark(X))
    3: mark(a()) -> a()
    4: mark(c(X)) -> c(X)
    5: mark(g(X)) -> g(mark(X))
    6: a__f(X) -> f(X)
Number of strict rules: 6
Direct Order(PosReal,>,Poly) ... removes: 4 3
     a()	weight: 0
  a__f(x1)	weight: (/ 1 8) + x1
     c(x1)	weight: x1
     f(x1)	weight: (/ 1 8) + x1
  mark(x1)	weight: (/ 1 8) + x1
     g(x1)	weight: x1
Number of strict rules: 4
Direct Order(PosReal,>,Poly) ... removes: 1 5 6 2
     a()	weight: 0
  a__f(x1)	weight: (/ 7 32) + x1
     c(x1)	weight: (/ 1 32) + x1
     f(x1)	weight: (/ 1 8) + x1
  mark(x1)	weight: (/ 1 32) + 2 * x1
     g(x1)	weight: (/ 1 32) + x1
Number of strict rules: 0
YES