YES

Problem:
 active(f(f(a()))) -> mark(c(f(g(f(a())))))
 mark(f(X)) -> active(f(mark(X)))
 mark(a()) -> active(a())
 mark(c(X)) -> active(c(X))
 mark(g(X)) -> active(g(mark(X)))
 f(mark(X)) -> f(X)
 f(active(X)) -> f(X)
 c(mark(X)) -> c(X)
 c(active(X)) -> c(X)
 g(mark(X)) -> g(X)
 g(active(X)) -> g(X)

Proof:
 DP Processor:
  DPs:
   active#(f(f(a()))) -> g#(f(a()))
   active#(f(f(a()))) -> f#(g(f(a())))
   active#(f(f(a()))) -> c#(f(g(f(a()))))
   active#(f(f(a()))) -> mark#(c(f(g(f(a())))))
   mark#(f(X)) -> mark#(X)
   mark#(f(X)) -> f#(mark(X))
   mark#(f(X)) -> active#(f(mark(X)))
   mark#(a()) -> active#(a())
   mark#(c(X)) -> active#(c(X))
   mark#(g(X)) -> mark#(X)
   mark#(g(X)) -> g#(mark(X))
   mark#(g(X)) -> active#(g(mark(X)))
   f#(mark(X)) -> f#(X)
   f#(active(X)) -> f#(X)
   c#(mark(X)) -> c#(X)
   c#(active(X)) -> c#(X)
   g#(mark(X)) -> g#(X)
   g#(active(X)) -> g#(X)
  TRS:
   active(f(f(a()))) -> mark(c(f(g(f(a())))))
   mark(f(X)) -> active(f(mark(X)))
   mark(a()) -> active(a())
   mark(c(X)) -> active(c(X))
   mark(g(X)) -> active(g(mark(X)))
   f(mark(X)) -> f(X)
   f(active(X)) -> f(X)
   c(mark(X)) -> c(X)
   c(active(X)) -> c(X)
   g(mark(X)) -> g(X)
   g(active(X)) -> g(X)
  Matrix Interpretation Processor: dim=1
   
   usable rules:
    active(f(f(a()))) -> mark(c(f(g(f(a())))))
    mark(f(X)) -> active(f(mark(X)))
    mark(a()) -> active(a())
    mark(c(X)) -> active(c(X))
    mark(g(X)) -> active(g(mark(X)))
    f(mark(X)) -> f(X)
    f(active(X)) -> f(X)
    c(mark(X)) -> c(X)
    c(active(X)) -> c(X)
    g(mark(X)) -> g(X)
    g(active(X)) -> g(X)
   interpretation:
    [mark#](x0) = 4x0 + 3,
    
    [c#](x0) = x0 + 1,
    
    [f#](x0) = x0 + 2,
    
    [g#](x0) = x0,
    
    [active#](x0) = x0 + 4,
    
    [mark](x0) = 4x0 + 1,
    
    [c](x0) = 1,
    
    [g](x0) = x0 + 2,
    
    [active](x0) = x0 + 2,
    
    [f](x0) = x0 + 1,
    
    [a] = 7
   orientation:
    active#(f(f(a()))) = 13 >= 8 = g#(f(a()))
    
    active#(f(f(a()))) = 13 >= 12 = f#(g(f(a())))
    
    active#(f(f(a()))) = 13 >= 12 = c#(f(g(f(a()))))
    
    active#(f(f(a()))) = 13 >= 7 = mark#(c(f(g(f(a())))))
    
    mark#(f(X)) = 4X + 7 >= 4X + 3 = mark#(X)
    
    mark#(f(X)) = 4X + 7 >= 4X + 3 = f#(mark(X))
    
    mark#(f(X)) = 4X + 7 >= 4X + 6 = active#(f(mark(X)))
    
    mark#(a()) = 31 >= 11 = active#(a())
    
    mark#(c(X)) = 7 >= 5 = active#(c(X))
    
    mark#(g(X)) = 4X + 11 >= 4X + 3 = mark#(X)
    
    mark#(g(X)) = 4X + 11 >= 4X + 1 = g#(mark(X))
    
    mark#(g(X)) = 4X + 11 >= 4X + 7 = active#(g(mark(X)))
    
    f#(mark(X)) = 4X + 3 >= X + 2 = f#(X)
    
    f#(active(X)) = X + 4 >= X + 2 = f#(X)
    
    c#(mark(X)) = 4X + 2 >= X + 1 = c#(X)
    
    c#(active(X)) = X + 3 >= X + 1 = c#(X)
    
    g#(mark(X)) = 4X + 1 >= X = g#(X)
    
    g#(active(X)) = X + 2 >= X = g#(X)
    
    active(f(f(a()))) = 11 >= 5 = mark(c(f(g(f(a())))))
    
    mark(f(X)) = 4X + 5 >= 4X + 4 = active(f(mark(X)))
    
    mark(a()) = 29 >= 9 = active(a())
    
    mark(c(X)) = 5 >= 3 = active(c(X))
    
    mark(g(X)) = 4X + 9 >= 4X + 5 = active(g(mark(X)))
    
    f(mark(X)) = 4X + 2 >= X + 1 = f(X)
    
    f(active(X)) = X + 3 >= X + 1 = f(X)
    
    c(mark(X)) = 1 >= 1 = c(X)
    
    c(active(X)) = 1 >= 1 = c(X)
    
    g(mark(X)) = 4X + 3 >= X + 2 = g(X)
    
    g(active(X)) = X + 4 >= X + 2 = g(X)
   problem:
    DPs:
     
    TRS:
     active(f(f(a()))) -> mark(c(f(g(f(a())))))
     mark(f(X)) -> active(f(mark(X)))
     mark(a()) -> active(a())
     mark(c(X)) -> active(c(X))
     mark(g(X)) -> active(g(mark(X)))
     f(mark(X)) -> f(X)
     f(active(X)) -> f(X)
     c(mark(X)) -> c(X)
     c(active(X)) -> c(X)
     g(mark(X)) -> g(X)
     g(active(X)) -> g(X)
   Qed