YES

Problem:
 active(f(f(a()))) -> mark(f(g(f(a()))))
 active(g(X)) -> g(active(X))
 g(mark(X)) -> mark(g(X))
 proper(f(X)) -> f(proper(X))
 proper(a()) -> ok(a())
 proper(g(X)) -> g(proper(X))
 f(ok(X)) -> ok(f(X))
 g(ok(X)) -> ok(g(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))

Proof:
 DP Processor:
  DPs:
   active#(f(f(a()))) -> g#(f(a()))
   active#(f(f(a()))) -> f#(g(f(a())))
   active#(g(X)) -> active#(X)
   active#(g(X)) -> g#(active(X))
   g#(mark(X)) -> g#(X)
   proper#(f(X)) -> proper#(X)
   proper#(f(X)) -> f#(proper(X))
   proper#(g(X)) -> proper#(X)
   proper#(g(X)) -> g#(proper(X))
   f#(ok(X)) -> f#(X)
   g#(ok(X)) -> g#(X)
   top#(mark(X)) -> proper#(X)
   top#(mark(X)) -> top#(proper(X))
   top#(ok(X)) -> active#(X)
   top#(ok(X)) -> top#(active(X))
  TRS:
   active(f(f(a()))) -> mark(f(g(f(a()))))
   active(g(X)) -> g(active(X))
   g(mark(X)) -> mark(g(X))
   proper(f(X)) -> f(proper(X))
   proper(a()) -> ok(a())
   proper(g(X)) -> g(proper(X))
   f(ok(X)) -> ok(f(X))
   g(ok(X)) -> ok(g(X))
   top(mark(X)) -> top(proper(X))
   top(ok(X)) -> top(active(X))
  Matrix Interpretation Processor: dim=3
   
   interpretation:
    [top#](x0) = [1 0 1]x0,
    
    [proper#](x0) = [0 0 1]x0 + [1],
    
    [f#](x0) = [0 0 1]x0,
    
    [g#](x0) = [0 0 1]x0,
    
    [active#](x0) = [0 0 1]x0,
    
                [0 0 0]  
    [top](x0) = [0 0 0]x0
                [1 0 1]  ,
    
                    [0]
    [ok](x0) = x0 + [0]
                    [1],
    
                        [0]
    [proper](x0) = x0 + [0]
                        [1],
    
                 [1 0 0]     [1]
    [mark](x0) = [0 0 0]x0 + [0]
                 [0 0 1]     [1],
    
              [1 0 0]     [0]
    [g](x0) = [0 0 0]x0 + [0]
              [0 0 1]     [1],
    
                   [1 0 0]  
    [active](x0) = [0 0 0]x0
                   [0 0 1]  ,
    
              [0 1 0]     [1]
    [f](x0) = [1 1 0]x0 + [0]
              [0 1 1]     [1],
    
          [1]
    [a] = [1]
          [0]
   orientation:
    active#(f(f(a()))) = 5 >= 2 = g#(f(a()))
    
    active#(f(f(a()))) = 5 >= 3 = f#(g(f(a())))
    
    active#(g(X)) = [0 0 1]X + [1] >= [0 0 1]X = active#(X)
    
    active#(g(X)) = [0 0 1]X + [1] >= [0 0 1]X = g#(active(X))
    
    g#(mark(X)) = [0 0 1]X + [1] >= [0 0 1]X = g#(X)
    
    proper#(f(X)) = [0 1 1]X + [2] >= [0 0 1]X + [1] = proper#(X)
    
    proper#(f(X)) = [0 1 1]X + [2] >= [0 0 1]X + [1] = f#(proper(X))
    
    proper#(g(X)) = [0 0 1]X + [2] >= [0 0 1]X + [1] = proper#(X)
    
    proper#(g(X)) = [0 0 1]X + [2] >= [0 0 1]X + [1] = g#(proper(X))
    
    f#(ok(X)) = [0 0 1]X + [1] >= [0 0 1]X = f#(X)
    
    g#(ok(X)) = [0 0 1]X + [1] >= [0 0 1]X = g#(X)
    
    top#(mark(X)) = [1 0 1]X + [2] >= [0 0 1]X + [1] = proper#(X)
    
    top#(mark(X)) = [1 0 1]X + [2] >= [1 0 1]X + [1] = top#(proper(X))
    
    top#(ok(X)) = [1 0 1]X + [1] >= [0 0 1]X = active#(X)
    
    top#(ok(X)) = [1 0 1]X + [1] >= [1 0 1]X = top#(active(X))
    
                        [3]    [2]                     
    active(f(f(a()))) = [0] >= [0] = mark(f(g(f(a()))))
                        [5]    [5]                     
    
                   [1 0 0]    [0]    [1 0 0]    [0]               
    active(g(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = g(active(X))
                   [0 0 1]    [1]    [0 0 1]    [1]               
    
                 [1 0 0]    [1]    [1 0 0]    [1]             
    g(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = mark(g(X))
                 [0 0 1]    [2]    [0 0 1]    [2]             
    
                   [0 1 0]    [1]    [0 1 0]    [1]               
    proper(f(X)) = [1 1 0]X + [0] >= [1 1 0]X + [0] = f(proper(X))
                   [0 1 1]    [2]    [0 1 1]    [2]               
    
                  [1]    [1]          
    proper(a()) = [1] >= [1] = ok(a())
                  [1]    [1]          
    
                   [1 0 0]    [0]    [1 0 0]    [0]               
    proper(g(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = g(proper(X))
                   [0 0 1]    [2]    [0 0 1]    [2]               
    
               [0 1 0]    [1]    [0 1 0]    [1]           
    f(ok(X)) = [1 1 0]X + [0] >= [1 1 0]X + [0] = ok(f(X))
               [0 1 1]    [2]    [0 1 1]    [2]           
    
               [1 0 0]    [0]    [1 0 0]    [0]           
    g(ok(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = ok(g(X))
               [0 0 1]    [2]    [0 0 1]    [2]           
    
                   [0 0 0]    [0]    [0 0 0]    [0]                 
    top(mark(X)) = [0 0 0]X + [0] >= [0 0 0]X + [0] = top(proper(X))
                   [1 0 1]    [2]    [1 0 1]    [1]                 
    
                 [0 0 0]    [0]    [0 0 0]                  
    top(ok(X)) = [0 0 0]X + [0] >= [0 0 0]X = top(active(X))
                 [1 0 1]    [1]    [1 0 1]                  
   problem:
    DPs:
     
    TRS:
     active(f(f(a()))) -> mark(f(g(f(a()))))
     active(g(X)) -> g(active(X))
     g(mark(X)) -> mark(g(X))
     proper(f(X)) -> f(proper(X))
     proper(a()) -> ok(a())
     proper(g(X)) -> g(proper(X))
     f(ok(X)) -> ok(f(X))
     g(ok(X)) -> ok(g(X))
     top(mark(X)) -> top(proper(X))
     top(ok(X)) -> top(active(X))
   Qed