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