YES

Problem:
 rev(a()) -> a()
 rev(b()) -> b()
 rev(++(x,y)) -> ++(rev(y),rev(x))
 rev(++(x,x)) -> rev(x)

Proof:
 Matrix Interpretation Processor: dim=1
  
  interpretation:
   [rev](x0) = x0,
   
   [++](x0, x1) = 4x0 + 4x1 + 3,
   
   [a] = 4,
   
   [b] = 0
  orientation:
   rev(a()) = 4 >= 4 = a()
   
   rev(b()) = 0 >= 0 = b()
   
   rev(++(x,y)) = 4x + 4y + 3 >= 4x + 4y + 3 = ++(rev(y),rev(x))
   
   rev(++(x,x)) = 8x + 3 >= x = rev(x)
  problem:
   rev(a()) -> a()
   rev(b()) -> b()
   rev(++(x,y)) -> ++(rev(y),rev(x))
  Matrix Interpretation Processor: dim=3
   
   interpretation:
                [1 1 1]  
    [rev](x0) = [0 1 0]x0
                [0 0 0]  ,
    
                   [1 0 1]          [0]
    [++](x0, x1) = [0 1 0]x0 + x1 + [1]
                   [0 0 0]          [0],
    
          [0]
    [a] = [1]
          [0],
    
          [0]
    [b] = [1]
          [0]
   orientation:
               [1]    [0]      
    rev(a()) = [1] >= [1] = a()
               [0]    [0]      
    
               [1]    [0]      
    rev(b()) = [1] >= [1] = b()
               [0]    [0]      
    
                   [1 1 1]    [1 1 1]    [1]    [1 1 1]    [1 1 1]    [0]                    
    rev(++(x,y)) = [0 1 0]x + [0 1 0]y + [1] >= [0 1 0]x + [0 1 0]y + [1] = ++(rev(y),rev(x))
                   [0 0 0]    [0 0 0]    [0]    [0 0 0]    [0 0 0]    [0]                    
   problem:
    
   Qed