YES

Problem:
 active(f(b(),X,c())) -> mark(f(X,c(),X))
 active(c()) -> mark(b())
 active(f(X1,X2,X3)) -> f(X1,active(X2),X3)
 f(X1,mark(X2),X3) -> mark(f(X1,X2,X3))
 proper(f(X1,X2,X3)) -> f(proper(X1),proper(X2),proper(X3))
 proper(b()) -> ok(b())
 proper(c()) -> ok(c())
 f(ok(X1),ok(X2),ok(X3)) -> ok(f(X1,X2,X3))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))

Proof:
 DP Processor:
  DPs:
   active#(f(b(),X,c())) -> f#(X,c(),X)
   active#(f(X1,X2,X3)) -> active#(X2)
   active#(f(X1,X2,X3)) -> f#(X1,active(X2),X3)
   f#(X1,mark(X2),X3) -> f#(X1,X2,X3)
   proper#(f(X1,X2,X3)) -> proper#(X3)
   proper#(f(X1,X2,X3)) -> proper#(X2)
   proper#(f(X1,X2,X3)) -> proper#(X1)
   proper#(f(X1,X2,X3)) -> f#(proper(X1),proper(X2),proper(X3))
   f#(ok(X1),ok(X2),ok(X3)) -> f#(X1,X2,X3)
   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(b(),X,c())) -> mark(f(X,c(),X))
   active(c()) -> mark(b())
   active(f(X1,X2,X3)) -> f(X1,active(X2),X3)
   f(X1,mark(X2),X3) -> mark(f(X1,X2,X3))
   proper(f(X1,X2,X3)) -> f(proper(X1),proper(X2),proper(X3))
   proper(b()) -> ok(b())
   proper(c()) -> ok(c())
   f(ok(X1),ok(X2),ok(X3)) -> ok(f(X1,X2,X3))
   top(mark(X)) -> top(proper(X))
   top(ok(X)) -> top(active(X))
  TDG Processor:
   DPs:
    active#(f(b(),X,c())) -> f#(X,c(),X)
    active#(f(X1,X2,X3)) -> active#(X2)
    active#(f(X1,X2,X3)) -> f#(X1,active(X2),X3)
    f#(X1,mark(X2),X3) -> f#(X1,X2,X3)
    proper#(f(X1,X2,X3)) -> proper#(X3)
    proper#(f(X1,X2,X3)) -> proper#(X2)
    proper#(f(X1,X2,X3)) -> proper#(X1)
    proper#(f(X1,X2,X3)) -> f#(proper(X1),proper(X2),proper(X3))
    f#(ok(X1),ok(X2),ok(X3)) -> f#(X1,X2,X3)
    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(b(),X,c())) -> mark(f(X,c(),X))
    active(c()) -> mark(b())
    active(f(X1,X2,X3)) -> f(X1,active(X2),X3)
    f(X1,mark(X2),X3) -> mark(f(X1,X2,X3))
    proper(f(X1,X2,X3)) -> f(proper(X1),proper(X2),proper(X3))
    proper(b()) -> ok(b())
    proper(c()) -> ok(c())
    f(ok(X1),ok(X2),ok(X3)) -> ok(f(X1,X2,X3))
    top(mark(X)) -> top(proper(X))
    top(ok(X)) -> top(active(X))
   graph:
    top#(ok(X)) -> top#(active(X)) -> top#(ok(X)) -> top#(active(X))
    top#(ok(X)) -> top#(active(X)) -> top#(ok(X)) -> active#(X)
    top#(ok(X)) -> top#(active(X)) ->
    top#(mark(X)) -> top#(proper(X))
    top#(ok(X)) -> top#(active(X)) -> top#(mark(X)) -> proper#(X)
    top#(ok(X)) -> active#(X) ->
    active#(f(X1,X2,X3)) -> f#(X1,active(X2),X3)
    top#(ok(X)) -> active#(X) -> active#(f(X1,X2,X3)) -> active#(X2)
    top#(ok(X)) -> active#(X) ->
    active#(f(b(),X,c())) -> f#(X,c(),X)
    top#(mark(X)) -> top#(proper(X)) ->
    top#(ok(X)) -> top#(active(X))
    top#(mark(X)) -> top#(proper(X)) -> top#(ok(X)) -> active#(X)
    top#(mark(X)) -> top#(proper(X)) ->
    top#(mark(X)) -> top#(proper(X))
    top#(mark(X)) -> top#(proper(X)) -> top#(mark(X)) -> proper#(X)
    top#(mark(X)) -> proper#(X) ->
    proper#(f(X1,X2,X3)) -> f#(proper(X1),proper(X2),proper(X3))
    top#(mark(X)) -> proper#(X) -> proper#(f(X1,X2,X3)) -> proper#(X1)
    top#(mark(X)) -> proper#(X) -> proper#(f(X1,X2,X3)) -> proper#(X2)
    top#(mark(X)) -> proper#(X) ->
    proper#(f(X1,X2,X3)) -> proper#(X3)
    proper#(f(X1,X2,X3)) -> proper#(X3) ->
    proper#(f(X1,X2,X3)) -> f#(proper(X1),proper(X2),proper(X3))
    proper#(f(X1,X2,X3)) -> proper#(X3) ->
    proper#(f(X1,X2,X3)) -> proper#(X1)
    proper#(f(X1,X2,X3)) -> proper#(X3) ->
    proper#(f(X1,X2,X3)) -> proper#(X2)
    proper#(f(X1,X2,X3)) -> proper#(X3) ->
    proper#(f(X1,X2,X3)) -> proper#(X3)
    proper#(f(X1,X2,X3)) -> proper#(X2) ->
    proper#(f(X1,X2,X3)) -> f#(proper(X1),proper(X2),proper(X3))
    proper#(f(X1,X2,X3)) -> proper#(X2) ->
    proper#(f(X1,X2,X3)) -> proper#(X1)
    proper#(f(X1,X2,X3)) -> proper#(X2) ->
    proper#(f(X1,X2,X3)) -> proper#(X2)
    proper#(f(X1,X2,X3)) -> proper#(X2) ->
    proper#(f(X1,X2,X3)) -> proper#(X3)
    proper#(f(X1,X2,X3)) -> proper#(X1) ->
    proper#(f(X1,X2,X3)) -> f#(proper(X1),proper(X2),proper(X3))
    proper#(f(X1,X2,X3)) -> proper#(X1) ->
    proper#(f(X1,X2,X3)) -> proper#(X1)
    proper#(f(X1,X2,X3)) -> proper#(X1) ->
    proper#(f(X1,X2,X3)) -> proper#(X2)
    proper#(f(X1,X2,X3)) -> proper#(X1) ->
    proper#(f(X1,X2,X3)) -> proper#(X3)
    proper#(f(X1,X2,X3)) -> f#(proper(X1),proper(X2),proper(X3)) ->
    f#(ok(X1),ok(X2),ok(X3)) -> f#(X1,X2,X3)
    proper#(f(X1,X2,X3)) -> f#(proper(X1),proper(X2),proper(X3)) ->
    f#(X1,mark(X2),X3) -> f#(X1,X2,X3)
    f#(ok(X1),ok(X2),ok(X3)) -> f#(X1,X2,X3) ->
    f#(ok(X1),ok(X2),ok(X3)) -> f#(X1,X2,X3)
    f#(ok(X1),ok(X2),ok(X3)) -> f#(X1,X2,X3) ->
    f#(X1,mark(X2),X3) -> f#(X1,X2,X3)
    f#(X1,mark(X2),X3) -> f#(X1,X2,X3) ->
    f#(ok(X1),ok(X2),ok(X3)) -> f#(X1,X2,X3)
    f#(X1,mark(X2),X3) -> f#(X1,X2,X3) ->
    f#(X1,mark(X2),X3) -> f#(X1,X2,X3)
    active#(f(b(),X,c())) -> f#(X,c(),X) ->
    f#(ok(X1),ok(X2),ok(X3)) -> f#(X1,X2,X3)
    active#(f(b(),X,c())) -> f#(X,c(),X) ->
    f#(X1,mark(X2),X3) -> f#(X1,X2,X3)
    active#(f(X1,X2,X3)) -> f#(X1,active(X2),X3) ->
    f#(ok(X1),ok(X2),ok(X3)) -> f#(X1,X2,X3)
    active#(f(X1,X2,X3)) -> f#(X1,active(X2),X3) ->
    f#(X1,mark(X2),X3) -> f#(X1,X2,X3)
    active#(f(X1,X2,X3)) -> active#(X2) ->
    active#(f(X1,X2,X3)) -> f#(X1,active(X2),X3)
    active#(f(X1,X2,X3)) -> active#(X2) ->
    active#(f(X1,X2,X3)) -> active#(X2)
    active#(f(X1,X2,X3)) -> active#(X2) -> active#(f(b(),X,c())) -> f#(X,c(),X)
   SCC Processor:
    #sccs: 4
    #rules: 8
    #arcs: 40/169
    DPs:
     top#(ok(X)) -> top#(active(X))
     top#(mark(X)) -> top#(proper(X))
    TRS:
     active(f(b(),X,c())) -> mark(f(X,c(),X))
     active(c()) -> mark(b())
     active(f(X1,X2,X3)) -> f(X1,active(X2),X3)
     f(X1,mark(X2),X3) -> mark(f(X1,X2,X3))
     proper(f(X1,X2,X3)) -> f(proper(X1),proper(X2),proper(X3))
     proper(b()) -> ok(b())
     proper(c()) -> ok(c())
     f(ok(X1),ok(X2),ok(X3)) -> ok(f(X1,X2,X3))
     top(mark(X)) -> top(proper(X))
     top(ok(X)) -> top(active(X))
    Matrix Interpretation Processor: dim=3
     
     interpretation:
      [top#](x0) = [0 1 0]x0,
      
                  [0 0 0]     [0]
      [top](x0) = [1 1 1]x0 + [1]
                  [0 1 0]     [0],
      
                   
      [ok](x0) = x0
                   ,
      
                       
      [proper](x0) = x0
                       ,
      
                        [0]
      [mark](x0) = x0 + [1]
                        [0],
      
                     [1 0 1]  
      [active](x0) = [0 1 0]x0
                     [0 0 0]  ,
      
                        [1 0 0]     [1 0 1]     [0 0 0]  
      [f](x0, x1, x2) = [1 0 0]x0 + [1 1 1]x1 + [0 1 1]x2
                        [0 0 0]     [0 0 0]     [0 0 0]  ,
      
            [0]
      [c] = [1]
            [1],
      
            [1]
      [b] = [0]
            [0]
     orientation:
      top#(ok(X)) = [0 1 0]X >= [0 1 0]X = top#(active(X))
      
      top#(mark(X)) = [0 1 0]X + [1] >= [0 1 0]X = top#(proper(X))
      
                             [1 0 1]    [1]    [1 0 0]    [1]                   
      active(f(b(),X,c())) = [1 1 1]X + [3] >= [1 1 1]X + [3] = mark(f(X,c(),X))
                             [0 0 0]    [0]    [0 0 0]    [0]                   
      
                    [1]    [1]            
      active(c()) = [1] >= [1] = mark(b())
                    [0]    [0]            
      
                            [1 0 0]     [1 0 1]     [0 0 0]      [1 0 0]     [1 0 1]     [0 0 0]                        
      active(f(X1,X2,X3)) = [1 0 0]X1 + [1 1 1]X2 + [0 1 1]X3 >= [1 0 0]X1 + [1 1 1]X2 + [0 1 1]X3 = f(X1,active(X2),X3)
                            [0 0 0]     [0 0 0]     [0 0 0]      [0 0 0]     [0 0 0]     [0 0 0]                        
      
                          [1 0 0]     [1 0 1]     [0 0 0]     [0]    [1 0 0]     [1 0 1]     [0 0 0]     [0]                    
      f(X1,mark(X2),X3) = [1 0 0]X1 + [1 1 1]X2 + [0 1 1]X3 + [1] >= [1 0 0]X1 + [1 1 1]X2 + [0 1 1]X3 + [1] = mark(f(X1,X2,X3))
                          [0 0 0]     [0 0 0]     [0 0 0]     [0]    [0 0 0]     [0 0 0]     [0 0 0]     [0]                    
      
                            [1 0 0]     [1 0 1]     [0 0 0]      [1 0 0]     [1 0 1]     [0 0 0]                                        
      proper(f(X1,X2,X3)) = [1 0 0]X1 + [1 1 1]X2 + [0 1 1]X3 >= [1 0 0]X1 + [1 1 1]X2 + [0 1 1]X3 = f(proper(X1),proper(X2),proper(X3))
                            [0 0 0]     [0 0 0]     [0 0 0]      [0 0 0]     [0 0 0]     [0 0 0]                                        
      
                    [1]    [1]          
      proper(b()) = [0] >= [0] = ok(b())
                    [0]    [0]          
      
                    [0]    [0]          
      proper(c()) = [1] >= [1] = ok(c())
                    [1]    [1]          
      
                                [1 0 0]     [1 0 1]     [0 0 0]      [1 0 0]     [1 0 1]     [0 0 0]                    
      f(ok(X1),ok(X2),ok(X3)) = [1 0 0]X1 + [1 1 1]X2 + [0 1 1]X3 >= [1 0 0]X1 + [1 1 1]X2 + [0 1 1]X3 = ok(f(X1,X2,X3))
                                [0 0 0]     [0 0 0]     [0 0 0]      [0 0 0]     [0 0 0]     [0 0 0]                    
      
                     [0 0 0]    [0]    [0 0 0]    [0]                 
      top(mark(X)) = [1 1 1]X + [2] >= [1 1 1]X + [1] = top(proper(X))
                     [0 1 0]    [1]    [0 1 0]    [0]                 
      
                   [0 0 0]    [0]    [0 0 0]    [0]                 
      top(ok(X)) = [1 1 1]X + [1] >= [1 1 1]X + [1] = top(active(X))
                   [0 1 0]    [0]    [0 1 0]    [0]                 
     problem:
      DPs:
       top#(ok(X)) -> top#(active(X))
      TRS:
       active(f(b(),X,c())) -> mark(f(X,c(),X))
       active(c()) -> mark(b())
       active(f(X1,X2,X3)) -> f(X1,active(X2),X3)
       f(X1,mark(X2),X3) -> mark(f(X1,X2,X3))
       proper(f(X1,X2,X3)) -> f(proper(X1),proper(X2),proper(X3))
       proper(b()) -> ok(b())
       proper(c()) -> ok(c())
       f(ok(X1),ok(X2),ok(X3)) -> ok(f(X1,X2,X3))
       top(mark(X)) -> top(proper(X))
       top(ok(X)) -> top(active(X))
     Arctic Interpretation Processor:
      dimension: 1
      interpretation:
       [top#](x0) = x0 + 0,
       
       [top](x0) = 0,
       
       [ok](x0) = x0 + 5,
       
       [proper](x0) = x0 + 5,
       
       [mark](x0) = x0 + 2,
       
       [active](x0) = 2,
       
       [f](x0, x1, x2) = x1 + 2,
       
       [c] = 0,
       
       [b] = 0
      orientation:
       top#(ok(X)) = X + 5 >= 2 = top#(active(X))
       
       active(f(b(),X,c())) = 2 >= 2 = mark(f(X,c(),X))
       
       active(c()) = 2 >= 2 = mark(b())
       
       active(f(X1,X2,X3)) = 2 >= 2 = f(X1,active(X2),X3)
       
       f(X1,mark(X2),X3) = X2 + 2 >= X2 + 2 = mark(f(X1,X2,X3))
       
       proper(f(X1,X2,X3)) = X2 + 5 >= X2 + 5 = f(proper(X1),proper(X2),proper(X3))
       
       proper(b()) = 5 >= 5 = ok(b())
       
       proper(c()) = 5 >= 5 = ok(c())
       
       f(ok(X1),ok(X2),ok(X3)) = X2 + 5 >= X2 + 5 = ok(f(X1,X2,X3))
       
       top(mark(X)) = 0 >= 0 = top(proper(X))
       
       top(ok(X)) = 0 >= 0 = top(active(X))
      problem:
       DPs:
        
       TRS:
        active(f(b(),X,c())) -> mark(f(X,c(),X))
        active(c()) -> mark(b())
        active(f(X1,X2,X3)) -> f(X1,active(X2),X3)
        f(X1,mark(X2),X3) -> mark(f(X1,X2,X3))
        proper(f(X1,X2,X3)) -> f(proper(X1),proper(X2),proper(X3))
        proper(b()) -> ok(b())
        proper(c()) -> ok(c())
        f(ok(X1),ok(X2),ok(X3)) -> ok(f(X1,X2,X3))
        top(mark(X)) -> top(proper(X))
        top(ok(X)) -> top(active(X))
      Qed
    
    DPs:
     active#(f(X1,X2,X3)) -> active#(X2)
    TRS:
     active(f(b(),X,c())) -> mark(f(X,c(),X))
     active(c()) -> mark(b())
     active(f(X1,X2,X3)) -> f(X1,active(X2),X3)
     f(X1,mark(X2),X3) -> mark(f(X1,X2,X3))
     proper(f(X1,X2,X3)) -> f(proper(X1),proper(X2),proper(X3))
     proper(b()) -> ok(b())
     proper(c()) -> ok(c())
     f(ok(X1),ok(X2),ok(X3)) -> ok(f(X1,X2,X3))
     top(mark(X)) -> top(proper(X))
     top(ok(X)) -> top(active(X))
    Subterm Criterion Processor:
     simple projection:
      pi(active#) = 0
     problem:
      DPs:
       
      TRS:
       active(f(b(),X,c())) -> mark(f(X,c(),X))
       active(c()) -> mark(b())
       active(f(X1,X2,X3)) -> f(X1,active(X2),X3)
       f(X1,mark(X2),X3) -> mark(f(X1,X2,X3))
       proper(f(X1,X2,X3)) -> f(proper(X1),proper(X2),proper(X3))
       proper(b()) -> ok(b())
       proper(c()) -> ok(c())
       f(ok(X1),ok(X2),ok(X3)) -> ok(f(X1,X2,X3))
       top(mark(X)) -> top(proper(X))
       top(ok(X)) -> top(active(X))
     Qed
    
    DPs:
     proper#(f(X1,X2,X3)) -> proper#(X3)
     proper#(f(X1,X2,X3)) -> proper#(X2)
     proper#(f(X1,X2,X3)) -> proper#(X1)
    TRS:
     active(f(b(),X,c())) -> mark(f(X,c(),X))
     active(c()) -> mark(b())
     active(f(X1,X2,X3)) -> f(X1,active(X2),X3)
     f(X1,mark(X2),X3) -> mark(f(X1,X2,X3))
     proper(f(X1,X2,X3)) -> f(proper(X1),proper(X2),proper(X3))
     proper(b()) -> ok(b())
     proper(c()) -> ok(c())
     f(ok(X1),ok(X2),ok(X3)) -> ok(f(X1,X2,X3))
     top(mark(X)) -> top(proper(X))
     top(ok(X)) -> top(active(X))
    Subterm Criterion Processor:
     simple projection:
      pi(proper#) = 0
     problem:
      DPs:
       
      TRS:
       active(f(b(),X,c())) -> mark(f(X,c(),X))
       active(c()) -> mark(b())
       active(f(X1,X2,X3)) -> f(X1,active(X2),X3)
       f(X1,mark(X2),X3) -> mark(f(X1,X2,X3))
       proper(f(X1,X2,X3)) -> f(proper(X1),proper(X2),proper(X3))
       proper(b()) -> ok(b())
       proper(c()) -> ok(c())
       f(ok(X1),ok(X2),ok(X3)) -> ok(f(X1,X2,X3))
       top(mark(X)) -> top(proper(X))
       top(ok(X)) -> top(active(X))
     Qed
    
    DPs:
     f#(X1,mark(X2),X3) -> f#(X1,X2,X3)
     f#(ok(X1),ok(X2),ok(X3)) -> f#(X1,X2,X3)
    TRS:
     active(f(b(),X,c())) -> mark(f(X,c(),X))
     active(c()) -> mark(b())
     active(f(X1,X2,X3)) -> f(X1,active(X2),X3)
     f(X1,mark(X2),X3) -> mark(f(X1,X2,X3))
     proper(f(X1,X2,X3)) -> f(proper(X1),proper(X2),proper(X3))
     proper(b()) -> ok(b())
     proper(c()) -> ok(c())
     f(ok(X1),ok(X2),ok(X3)) -> ok(f(X1,X2,X3))
     top(mark(X)) -> top(proper(X))
     top(ok(X)) -> top(active(X))
    Subterm Criterion Processor:
     simple projection:
      pi(f#) = 2
     problem:
      DPs:
       f#(X1,mark(X2),X3) -> f#(X1,X2,X3)
      TRS:
       active(f(b(),X,c())) -> mark(f(X,c(),X))
       active(c()) -> mark(b())
       active(f(X1,X2,X3)) -> f(X1,active(X2),X3)
       f(X1,mark(X2),X3) -> mark(f(X1,X2,X3))
       proper(f(X1,X2,X3)) -> f(proper(X1),proper(X2),proper(X3))
       proper(b()) -> ok(b())
       proper(c()) -> ok(c())
       f(ok(X1),ok(X2),ok(X3)) -> ok(f(X1,X2,X3))
       top(mark(X)) -> top(proper(X))
       top(ok(X)) -> top(active(X))
     Subterm Criterion Processor:
      simple projection:
       pi(f#) = 1
      problem:
       DPs:
        
       TRS:
        active(f(b(),X,c())) -> mark(f(X,c(),X))
        active(c()) -> mark(b())
        active(f(X1,X2,X3)) -> f(X1,active(X2),X3)
        f(X1,mark(X2),X3) -> mark(f(X1,X2,X3))
        proper(f(X1,X2,X3)) -> f(proper(X1),proper(X2),proper(X3))
        proper(b()) -> ok(b())
        proper(c()) -> ok(c())
        f(ok(X1),ok(X2),ok(X3)) -> ok(f(X1,X2,X3))
        top(mark(X)) -> top(proper(X))
        top(ok(X)) -> top(active(X))
      Qed