MAYBE
* Step 1: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f2(A) -> f2(-1 + A) [1 >= A] (?,1)
          1. f2(A) -> f2(-1 + A) [A >= 2] (?,1)
          2. f3(A) -> f2(A)      True     (1,1)
        Signature:
          {(f2,1);(f3,1)}
        Flow Graph:
          [0->{0,1},1->{0,1},2->{0,1}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,1)]
* Step 2: PolyRank MAYBE
    + Considered Problem:
        Rules:
          0. f2(A) -> f2(-1 + A) [1 >= A] (?,1)
          1. f2(A) -> f2(-1 + A) [A >= 2] (?,1)
          2. f3(A) -> f2(A)      True     (1,1)
        Signature:
          {(f2,1);(f3,1)}
        Flow Graph:
          [0->{0},1->{0,1},2->{0,1}]
        
    + Applied Processor:
        PolyRank {useFarkas = True, withSizebounds = [], shape = Linear}
    + Details:
        We apply a polynomial interpretation of shape linear:
          p(f2) = x1
          p(f3) = x1
        
        Following rules are strictly oriented:
        [A >= 2] ==>           
           f2(A)   = A         
                   > -1 + A    
                   = f2(-1 + A)
        
        
        Following rules are weakly oriented:
        [1 >= A] ==>           
           f2(A)   = A         
                  >= -1 + A    
                   = f2(-1 + A)
        
            True ==>           
           f3(A)   = A         
                  >= A         
                   = f2(A)     
        
        
* Step 3: Failure MAYBE
  + Considered Problem:
      Rules:
        0. f2(A) -> f2(-1 + A) [1 >= A] (?,1)
        1. f2(A) -> f2(-1 + A) [A >= 2] (A,1)
        2. f3(A) -> f2(A)      True     (1,1)
      Signature:
        {(f2,1);(f3,1)}
      Flow Graph:
        [0->{0},1->{0,1},2->{0,1}]
      
  + Applied Processor:
      Failing "Open problems left."
  + Details:
      Open problems left.
MAYBE