YES

Problem:
 active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
 active(__(X,nil())) -> mark(X)
 active(__(nil(),X)) -> mark(X)
 active(and(tt(),X)) -> mark(X)
 active(isNePal(__(I,__(P,I)))) -> mark(tt())
 active(__(X1,X2)) -> __(active(X1),X2)
 active(__(X1,X2)) -> __(X1,active(X2))
 active(and(X1,X2)) -> and(active(X1),X2)
 active(isNePal(X)) -> isNePal(active(X))
 __(mark(X1),X2) -> mark(__(X1,X2))
 __(X1,mark(X2)) -> mark(__(X1,X2))
 and(mark(X1),X2) -> mark(and(X1,X2))
 isNePal(mark(X)) -> mark(isNePal(X))
 proper(__(X1,X2)) -> __(proper(X1),proper(X2))
 proper(nil()) -> ok(nil())
 proper(and(X1,X2)) -> and(proper(X1),proper(X2))
 proper(tt()) -> ok(tt())
 proper(isNePal(X)) -> isNePal(proper(X))
 __(ok(X1),ok(X2)) -> ok(__(X1,X2))
 and(ok(X1),ok(X2)) -> ok(and(X1,X2))
 isNePal(ok(X)) -> ok(isNePal(X))
 top(mark(X)) -> top(proper(X))
 top(ok(X)) -> top(active(X))

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [tt] = 0,
   
   [ok](x0) = x0,
   
   [active](x0) = x0,
   
   [nil] = 2,
   
   [and](x0, x1) = 2x0 + 4x1,
   
   [__](x0, x1) = x0 + x1,
   
   [proper](x0) = x0,
   
   [top](x0) = x0,
   
   [isNePal](x0) = 4x0,
   
   [mark](x0) = x0
  orientation:
   active(__(__(X,Y),Z)) = X + Y + Z >= X + Y + Z = mark(__(X,__(Y,Z)))
   
   active(__(X,nil())) = X + 2 >= X = mark(X)
   
   active(__(nil(),X)) = X + 2 >= X = mark(X)
   
   active(and(tt(),X)) = 4X >= X = mark(X)
   
   active(isNePal(__(I,__(P,I)))) = 8I + 4P >= 0 = mark(tt())
   
   active(__(X1,X2)) = X1 + X2 >= X1 + X2 = __(active(X1),X2)
   
   active(__(X1,X2)) = X1 + X2 >= X1 + X2 = __(X1,active(X2))
   
   active(and(X1,X2)) = 2X1 + 4X2 >= 2X1 + 4X2 = and(active(X1),X2)
   
   active(isNePal(X)) = 4X >= 4X = isNePal(active(X))
   
   __(mark(X1),X2) = X1 + X2 >= X1 + X2 = mark(__(X1,X2))
   
   __(X1,mark(X2)) = X1 + X2 >= X1 + X2 = mark(__(X1,X2))
   
   and(mark(X1),X2) = 2X1 + 4X2 >= 2X1 + 4X2 = mark(and(X1,X2))
   
   isNePal(mark(X)) = 4X >= 4X = mark(isNePal(X))
   
   proper(__(X1,X2)) = X1 + X2 >= X1 + X2 = __(proper(X1),proper(X2))
   
   proper(nil()) = 2 >= 2 = ok(nil())
   
   proper(and(X1,X2)) = 2X1 + 4X2 >= 2X1 + 4X2 = and(proper(X1),proper(X2))
   
   proper(tt()) = 0 >= 0 = ok(tt())
   
   proper(isNePal(X)) = 4X >= 4X = isNePal(proper(X))
   
   __(ok(X1),ok(X2)) = X1 + X2 >= X1 + X2 = ok(__(X1,X2))
   
   and(ok(X1),ok(X2)) = 2X1 + 4X2 >= 2X1 + 4X2 = ok(and(X1,X2))
   
   isNePal(ok(X)) = 4X >= 4X = ok(isNePal(X))
   
   top(mark(X)) = X >= X = top(proper(X))
   
   top(ok(X)) = X >= X = top(active(X))
  problem:
   active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
   active(and(tt(),X)) -> mark(X)
   active(isNePal(__(I,__(P,I)))) -> mark(tt())
   active(__(X1,X2)) -> __(active(X1),X2)
   active(__(X1,X2)) -> __(X1,active(X2))
   active(and(X1,X2)) -> and(active(X1),X2)
   active(isNePal(X)) -> isNePal(active(X))
   __(mark(X1),X2) -> mark(__(X1,X2))
   __(X1,mark(X2)) -> mark(__(X1,X2))
   and(mark(X1),X2) -> mark(and(X1,X2))
   isNePal(mark(X)) -> mark(isNePal(X))
   proper(__(X1,X2)) -> __(proper(X1),proper(X2))
   proper(nil()) -> ok(nil())
   proper(and(X1,X2)) -> and(proper(X1),proper(X2))
   proper(tt()) -> ok(tt())
   proper(isNePal(X)) -> isNePal(proper(X))
   __(ok(X1),ok(X2)) -> ok(__(X1,X2))
   and(ok(X1),ok(X2)) -> ok(and(X1,X2))
   isNePal(ok(X)) -> ok(isNePal(X))
   top(mark(X)) -> top(proper(X))
   top(ok(X)) -> top(active(X))
  Matrix Interpretation Processor: dim=1
   
   interpretation:
    [tt] = 2,
    
    [ok](x0) = x0,
    
    [active](x0) = x0,
    
    [nil] = 0,
    
    [and](x0, x1) = 5x0 + x1,
    
    [__](x0, x1) = x0 + x1 + 1,
    
    [proper](x0) = x0,
    
    [top](x0) = x0,
    
    [isNePal](x0) = x0,
    
    [mark](x0) = x0
   orientation:
    active(__(__(X,Y),Z)) = X + Y + Z + 2 >= X + Y + Z + 2 = mark(__(X,__(Y,Z)))
    
    active(and(tt(),X)) = X + 10 >= X = mark(X)
    
    active(isNePal(__(I,__(P,I)))) = 2I + P + 2 >= 2 = mark(tt())
    
    active(__(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = __(active(X1),X2)
    
    active(__(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = __(X1,active(X2))
    
    active(and(X1,X2)) = 5X1 + X2 >= 5X1 + X2 = and(active(X1),X2)
    
    active(isNePal(X)) = X >= X = isNePal(active(X))
    
    __(mark(X1),X2) = X1 + X2 + 1 >= X1 + X2 + 1 = mark(__(X1,X2))
    
    __(X1,mark(X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = mark(__(X1,X2))
    
    and(mark(X1),X2) = 5X1 + X2 >= 5X1 + X2 = mark(and(X1,X2))
    
    isNePal(mark(X)) = X >= X = mark(isNePal(X))
    
    proper(__(X1,X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = __(proper(X1),proper(X2))
    
    proper(nil()) = 0 >= 0 = ok(nil())
    
    proper(and(X1,X2)) = 5X1 + X2 >= 5X1 + X2 = and(proper(X1),proper(X2))
    
    proper(tt()) = 2 >= 2 = ok(tt())
    
    proper(isNePal(X)) = X >= X = isNePal(proper(X))
    
    __(ok(X1),ok(X2)) = X1 + X2 + 1 >= X1 + X2 + 1 = ok(__(X1,X2))
    
    and(ok(X1),ok(X2)) = 5X1 + X2 >= 5X1 + X2 = ok(and(X1,X2))
    
    isNePal(ok(X)) = X >= X = ok(isNePal(X))
    
    top(mark(X)) = X >= X = top(proper(X))
    
    top(ok(X)) = X >= X = top(active(X))
   problem:
    active(__(__(X,Y),Z)) -> mark(__(X,__(Y,Z)))
    active(isNePal(__(I,__(P,I)))) -> mark(tt())
    active(__(X1,X2)) -> __(active(X1),X2)
    active(__(X1,X2)) -> __(X1,active(X2))
    active(and(X1,X2)) -> and(active(X1),X2)
    active(isNePal(X)) -> isNePal(active(X))
    __(mark(X1),X2) -> mark(__(X1,X2))
    __(X1,mark(X2)) -> mark(__(X1,X2))
    and(mark(X1),X2) -> mark(and(X1,X2))
    isNePal(mark(X)) -> mark(isNePal(X))
    proper(__(X1,X2)) -> __(proper(X1),proper(X2))
    proper(nil()) -> ok(nil())
    proper(and(X1,X2)) -> and(proper(X1),proper(X2))
    proper(tt()) -> ok(tt())
    proper(isNePal(X)) -> isNePal(proper(X))
    __(ok(X1),ok(X2)) -> ok(__(X1,X2))
    and(ok(X1),ok(X2)) -> ok(and(X1,X2))
    isNePal(ok(X)) -> ok(isNePal(X))
    top(mark(X)) -> top(proper(X))
    top(ok(X)) -> top(active(X))
   Matrix Interpretation Processor: dim=1
    
    interpretation:
     [tt] = 6,
     
     [ok](x0) = x0,
     
     [active](x0) = x0,
     
     [nil] = 0,
     
     [and](x0, x1) = 2x0 + x1,
     
     [__](x0, x1) = 5x0 + x1 + 4,
     
     [proper](x0) = x0,
     
     [top](x0) = x0,
     
     [isNePal](x0) = x0,
     
     [mark](x0) = x0 + 2
    orientation:
     active(__(__(X,Y),Z)) = 25X + 5Y + Z + 24 >= 5X + 5Y + Z + 10 = mark(__(X,__(Y,Z)))
     
     active(isNePal(__(I,__(P,I)))) = 6I + 5P + 8 >= 8 = mark(tt())
     
     active(__(X1,X2)) = 5X1 + X2 + 4 >= 5X1 + X2 + 4 = __(active(X1),X2)
     
     active(__(X1,X2)) = 5X1 + X2 + 4 >= 5X1 + X2 + 4 = __(X1,active(X2))
     
     active(and(X1,X2)) = 2X1 + X2 >= 2X1 + X2 = and(active(X1),X2)
     
     active(isNePal(X)) = X >= X = isNePal(active(X))
     
     __(mark(X1),X2) = 5X1 + X2 + 14 >= 5X1 + X2 + 6 = mark(__(X1,X2))
     
     __(X1,mark(X2)) = 5X1 + X2 + 6 >= 5X1 + X2 + 6 = mark(__(X1,X2))
     
     and(mark(X1),X2) = 2X1 + X2 + 4 >= 2X1 + X2 + 2 = mark(and(X1,X2))
     
     isNePal(mark(X)) = X + 2 >= X + 2 = mark(isNePal(X))
     
     proper(__(X1,X2)) = 5X1 + X2 + 4 >= 5X1 + X2 + 4 = __(proper(X1),proper(X2))
     
     proper(nil()) = 0 >= 0 = ok(nil())
     
     proper(and(X1,X2)) = 2X1 + X2 >= 2X1 + X2 = and(proper(X1),proper(X2))
     
     proper(tt()) = 6 >= 6 = ok(tt())
     
     proper(isNePal(X)) = X >= X = isNePal(proper(X))
     
     __(ok(X1),ok(X2)) = 5X1 + X2 + 4 >= 5X1 + X2 + 4 = ok(__(X1,X2))
     
     and(ok(X1),ok(X2)) = 2X1 + X2 >= 2X1 + X2 = ok(and(X1,X2))
     
     isNePal(ok(X)) = X >= X = ok(isNePal(X))
     
     top(mark(X)) = X + 2 >= X = top(proper(X))
     
     top(ok(X)) = X >= X = top(active(X))
    problem:
     active(isNePal(__(I,__(P,I)))) -> mark(tt())
     active(__(X1,X2)) -> __(active(X1),X2)
     active(__(X1,X2)) -> __(X1,active(X2))
     active(and(X1,X2)) -> and(active(X1),X2)
     active(isNePal(X)) -> isNePal(active(X))
     __(X1,mark(X2)) -> mark(__(X1,X2))
     isNePal(mark(X)) -> mark(isNePal(X))
     proper(__(X1,X2)) -> __(proper(X1),proper(X2))
     proper(nil()) -> ok(nil())
     proper(and(X1,X2)) -> and(proper(X1),proper(X2))
     proper(tt()) -> ok(tt())
     proper(isNePal(X)) -> isNePal(proper(X))
     __(ok(X1),ok(X2)) -> ok(__(X1,X2))
     and(ok(X1),ok(X2)) -> ok(and(X1,X2))
     isNePal(ok(X)) -> ok(isNePal(X))
     top(ok(X)) -> top(active(X))
    Matrix Interpretation Processor: dim=1
     
     interpretation:
      [tt] = 0,
      
      [ok](x0) = 2x0,
      
      [active](x0) = x0,
      
      [nil] = 1,
      
      [and](x0, x1) = 2x0 + x1,
      
      [__](x0, x1) = 4x0 + x1,
      
      [proper](x0) = 4x0,
      
      [top](x0) = 4x0 + 7,
      
      [isNePal](x0) = 4x0,
      
      [mark](x0) = x0
     orientation:
      active(isNePal(__(I,__(P,I)))) = 20I + 16P >= 0 = mark(tt())
      
      active(__(X1,X2)) = 4X1 + X2 >= 4X1 + X2 = __(active(X1),X2)
      
      active(__(X1,X2)) = 4X1 + X2 >= 4X1 + X2 = __(X1,active(X2))
      
      active(and(X1,X2)) = 2X1 + X2 >= 2X1 + X2 = and(active(X1),X2)
      
      active(isNePal(X)) = 4X >= 4X = isNePal(active(X))
      
      __(X1,mark(X2)) = 4X1 + X2 >= 4X1 + X2 = mark(__(X1,X2))
      
      isNePal(mark(X)) = 4X >= 4X = mark(isNePal(X))
      
      proper(__(X1,X2)) = 16X1 + 4X2 >= 16X1 + 4X2 = __(proper(X1),proper(X2))
      
      proper(nil()) = 4 >= 2 = ok(nil())
      
      proper(and(X1,X2)) = 8X1 + 4X2 >= 8X1 + 4X2 = and(proper(X1),proper(X2))
      
      proper(tt()) = 0 >= 0 = ok(tt())
      
      proper(isNePal(X)) = 16X >= 16X = isNePal(proper(X))
      
      __(ok(X1),ok(X2)) = 8X1 + 2X2 >= 8X1 + 2X2 = ok(__(X1,X2))
      
      and(ok(X1),ok(X2)) = 4X1 + 2X2 >= 4X1 + 2X2 = ok(and(X1,X2))
      
      isNePal(ok(X)) = 8X >= 8X = ok(isNePal(X))
      
      top(ok(X)) = 8X + 7 >= 4X + 7 = top(active(X))
     problem:
      active(isNePal(__(I,__(P,I)))) -> mark(tt())
      active(__(X1,X2)) -> __(active(X1),X2)
      active(__(X1,X2)) -> __(X1,active(X2))
      active(and(X1,X2)) -> and(active(X1),X2)
      active(isNePal(X)) -> isNePal(active(X))
      __(X1,mark(X2)) -> mark(__(X1,X2))
      isNePal(mark(X)) -> mark(isNePal(X))
      proper(__(X1,X2)) -> __(proper(X1),proper(X2))
      proper(and(X1,X2)) -> and(proper(X1),proper(X2))
      proper(tt()) -> ok(tt())
      proper(isNePal(X)) -> isNePal(proper(X))
      __(ok(X1),ok(X2)) -> ok(__(X1,X2))
      and(ok(X1),ok(X2)) -> ok(and(X1,X2))
      isNePal(ok(X)) -> ok(isNePal(X))
      top(ok(X)) -> top(active(X))
     Matrix Interpretation Processor: dim=1
      
      interpretation:
       [tt] = 0,
       
       [ok](x0) = x0,
       
       [active](x0) = x0,
       
       [and](x0, x1) = x0 + 2x1,
       
       [__](x0, x1) = 4x0 + 4x1,
       
       [proper](x0) = x0,
       
       [top](x0) = x0,
       
       [isNePal](x0) = x0 + 1,
       
       [mark](x0) = x0
      orientation:
       active(isNePal(__(I,__(P,I)))) = 20I + 16P + 1 >= 0 = mark(tt())
       
       active(__(X1,X2)) = 4X1 + 4X2 >= 4X1 + 4X2 = __(active(X1),X2)
       
       active(__(X1,X2)) = 4X1 + 4X2 >= 4X1 + 4X2 = __(X1,active(X2))
       
       active(and(X1,X2)) = X1 + 2X2 >= X1 + 2X2 = and(active(X1),X2)
       
       active(isNePal(X)) = X + 1 >= X + 1 = isNePal(active(X))
       
       __(X1,mark(X2)) = 4X1 + 4X2 >= 4X1 + 4X2 = mark(__(X1,X2))
       
       isNePal(mark(X)) = X + 1 >= X + 1 = mark(isNePal(X))
       
       proper(__(X1,X2)) = 4X1 + 4X2 >= 4X1 + 4X2 = __(proper(X1),proper(X2))
       
       proper(and(X1,X2)) = X1 + 2X2 >= X1 + 2X2 = and(proper(X1),proper(X2))
       
       proper(tt()) = 0 >= 0 = ok(tt())
       
       proper(isNePal(X)) = X + 1 >= X + 1 = isNePal(proper(X))
       
       __(ok(X1),ok(X2)) = 4X1 + 4X2 >= 4X1 + 4X2 = ok(__(X1,X2))
       
       and(ok(X1),ok(X2)) = X1 + 2X2 >= X1 + 2X2 = ok(and(X1,X2))
       
       isNePal(ok(X)) = X + 1 >= X + 1 = ok(isNePal(X))
       
       top(ok(X)) = X >= X = top(active(X))
      problem:
       active(__(X1,X2)) -> __(active(X1),X2)
       active(__(X1,X2)) -> __(X1,active(X2))
       active(and(X1,X2)) -> and(active(X1),X2)
       active(isNePal(X)) -> isNePal(active(X))
       __(X1,mark(X2)) -> mark(__(X1,X2))
       isNePal(mark(X)) -> mark(isNePal(X))
       proper(__(X1,X2)) -> __(proper(X1),proper(X2))
       proper(and(X1,X2)) -> and(proper(X1),proper(X2))
       proper(tt()) -> ok(tt())
       proper(isNePal(X)) -> isNePal(proper(X))
       __(ok(X1),ok(X2)) -> ok(__(X1,X2))
       and(ok(X1),ok(X2)) -> ok(and(X1,X2))
       isNePal(ok(X)) -> ok(isNePal(X))
       top(ok(X)) -> top(active(X))
      Matrix Interpretation Processor: dim=1
       
       interpretation:
        [tt] = 4,
        
        [ok](x0) = 3x0 + 2,
        
        [active](x0) = x0,
        
        [and](x0, x1) = x0 + 6x1 + 6,
        
        [__](x0, x1) = x0 + 5x1 + 5,
        
        [proper](x0) = 3x0 + 2,
        
        [top](x0) = x0,
        
        [isNePal](x0) = 4x0 + 3,
        
        [mark](x0) = x0
       orientation:
        active(__(X1,X2)) = X1 + 5X2 + 5 >= X1 + 5X2 + 5 = __(active(X1),X2)
        
        active(__(X1,X2)) = X1 + 5X2 + 5 >= X1 + 5X2 + 5 = __(X1,active(X2))
        
        active(and(X1,X2)) = X1 + 6X2 + 6 >= X1 + 6X2 + 6 = and(active(X1),X2)
        
        active(isNePal(X)) = 4X + 3 >= 4X + 3 = isNePal(active(X))
        
        __(X1,mark(X2)) = X1 + 5X2 + 5 >= X1 + 5X2 + 5 = mark(__(X1,X2))
        
        isNePal(mark(X)) = 4X + 3 >= 4X + 3 = mark(isNePal(X))
        
        proper(__(X1,X2)) = 3X1 + 15X2 + 17 >= 3X1 + 15X2 + 17 = __(proper(X1),proper(X2))
        
        proper(and(X1,X2)) = 3X1 + 18X2 + 20 >= 3X1 + 18X2 + 20 = and(proper(X1),proper(X2))
        
        proper(tt()) = 14 >= 14 = ok(tt())
        
        proper(isNePal(X)) = 12X + 11 >= 12X + 11 = isNePal(proper(X))
        
        __(ok(X1),ok(X2)) = 3X1 + 15X2 + 17 >= 3X1 + 15X2 + 17 = ok(__(X1,X2))
        
        and(ok(X1),ok(X2)) = 3X1 + 18X2 + 20 >= 3X1 + 18X2 + 20 = ok(and(X1,X2))
        
        isNePal(ok(X)) = 12X + 11 >= 12X + 11 = ok(isNePal(X))
        
        top(ok(X)) = 3X + 2 >= X = top(active(X))
       problem:
        active(__(X1,X2)) -> __(active(X1),X2)
        active(__(X1,X2)) -> __(X1,active(X2))
        active(and(X1,X2)) -> and(active(X1),X2)
        active(isNePal(X)) -> isNePal(active(X))
        __(X1,mark(X2)) -> mark(__(X1,X2))
        isNePal(mark(X)) -> mark(isNePal(X))
        proper(__(X1,X2)) -> __(proper(X1),proper(X2))
        proper(and(X1,X2)) -> and(proper(X1),proper(X2))
        proper(tt()) -> ok(tt())
        proper(isNePal(X)) -> isNePal(proper(X))
        __(ok(X1),ok(X2)) -> ok(__(X1,X2))
        and(ok(X1),ok(X2)) -> ok(and(X1,X2))
        isNePal(ok(X)) -> ok(isNePal(X))
       Matrix Interpretation Processor: dim=1
        
        interpretation:
         [tt] = 4,
         
         [ok](x0) = 2x0 + 2,
         
         [active](x0) = 4x0,
         
         [and](x0, x1) = x0 + 2x1,
         
         [__](x0, x1) = 4x0 + x1 + 4,
         
         [proper](x0) = 4x0,
         
         [isNePal](x0) = 6x0 + 4,
         
         [mark](x0) = x0 + 4
        orientation:
         active(__(X1,X2)) = 16X1 + 4X2 + 16 >= 16X1 + X2 + 4 = __(active(X1),X2)
         
         active(__(X1,X2)) = 16X1 + 4X2 + 16 >= 4X1 + 4X2 + 4 = __(X1,active(X2))
         
         active(and(X1,X2)) = 4X1 + 8X2 >= 4X1 + 2X2 = and(active(X1),X2)
         
         active(isNePal(X)) = 24X + 16 >= 24X + 4 = isNePal(active(X))
         
         __(X1,mark(X2)) = 4X1 + X2 + 8 >= 4X1 + X2 + 8 = mark(__(X1,X2))
         
         isNePal(mark(X)) = 6X + 28 >= 6X + 8 = mark(isNePal(X))
         
         proper(__(X1,X2)) = 16X1 + 4X2 + 16 >= 16X1 + 4X2 + 4 = __(proper(X1),proper(X2))
         
         proper(and(X1,X2)) = 4X1 + 8X2 >= 4X1 + 8X2 = and(proper(X1),proper(X2))
         
         proper(tt()) = 16 >= 10 = ok(tt())
         
         proper(isNePal(X)) = 24X + 16 >= 24X + 4 = isNePal(proper(X))
         
         __(ok(X1),ok(X2)) = 8X1 + 2X2 + 14 >= 8X1 + 2X2 + 10 = ok(__(X1,X2))
         
         and(ok(X1),ok(X2)) = 2X1 + 4X2 + 6 >= 2X1 + 4X2 + 2 = ok(and(X1,X2))
         
         isNePal(ok(X)) = 12X + 16 >= 12X + 10 = ok(isNePal(X))
        problem:
         active(and(X1,X2)) -> and(active(X1),X2)
         __(X1,mark(X2)) -> mark(__(X1,X2))
         proper(and(X1,X2)) -> and(proper(X1),proper(X2))
        Matrix Interpretation Processor: dim=3
         
         interpretation:
                         [1 0 1]  
          [active](x0) = [0 1 0]x0
                         [0 0 1]  ,
          
                          [1 0 0]     [1 0 0]     [0]
          [and](x0, x1) = [0 1 1]x0 + [0 0 1]x1 + [1]
                          [0 1 1]     [0 1 0]     [1],
          
                         [1 0 0]     [1 0 0]  
          [__](x0, x1) = [0 0 0]x0 + [0 0 1]x1
                         [0 0 0]     [0 1 0]  ,
          
                         [1 0 0]  
          [proper](x0) = [0 0 1]x0
                         [0 1 0]  ,
          
                            [0]
          [mark](x0) = x0 + [1]
                            [1]
         orientation:
                               [1 1 1]     [1 1 0]     [1]    [1 0 1]     [1 0 0]     [0]                     
          active(and(X1,X2)) = [0 1 1]X1 + [0 0 1]X2 + [1] >= [0 1 1]X1 + [0 0 1]X2 + [1] = and(active(X1),X2)
                               [0 1 1]     [0 1 0]     [1]    [0 1 1]     [0 1 0]     [1]                     
          
                            [1 0 0]     [1 0 0]     [0]    [1 0 0]     [1 0 0]     [0]                  
          __(X1,mark(X2)) = [0 0 0]X1 + [0 0 1]X2 + [1] >= [0 0 0]X1 + [0 0 1]X2 + [1] = mark(__(X1,X2))
                            [0 0 0]     [0 1 0]     [1]    [0 0 0]     [0 1 0]     [1]                  
          
                               [1 0 0]          [0]    [1 0 0]          [0]                             
          proper(and(X1,X2)) = [0 1 1]X1 + X2 + [1] >= [0 1 1]X1 + X2 + [1] = and(proper(X1),proper(X2))
                               [0 1 1]          [1]    [0 1 1]          [1]                             
         problem:
          __(X1,mark(X2)) -> mark(__(X1,X2))
          proper(and(X1,X2)) -> and(proper(X1),proper(X2))
         Matrix Interpretation Processor: dim=1
          
          interpretation:
           [and](x0, x1) = 2x0 + 5x1 + 3,
           
           [__](x0, x1) = x0 + 4x1,
           
           [proper](x0) = 3x0 + 1,
           
           [mark](x0) = x0 + 2
          orientation:
           __(X1,mark(X2)) = X1 + 4X2 + 8 >= X1 + 4X2 + 2 = mark(__(X1,X2))
           
           proper(and(X1,X2)) = 6X1 + 15X2 + 10 >= 6X1 + 15X2 + 10 = and(proper(X1),proper(X2))
          problem:
           proper(and(X1,X2)) -> and(proper(X1),proper(X2))
          Matrix Interpretation Processor: dim=1
           
           interpretation:
            [and](x0, x1) = 5x0 + 5x1 + 2,
            
            [proper](x0) = 6x0 + 1
           orientation:
            proper(and(X1,X2)) = 30X1 + 30X2 + 13 >= 30X1 + 30X2 + 12 = and(proper(X1),proper(X2))
           problem:
            
           Qed