MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f2(A,B) -> f300(A,C)    [A = 0]      (?,1)
          1. f3(A,B) -> f2(A,B)      True         (1,1)
          2. f2(A,B) -> f2(1 + C,B)  [A >= 1]     (?,1)
          3. f2(A,B) -> f2(-1 + C,B) [0 >= 1 + A] (?,1)
        Signature:
          {(f2,2);(f3,2);(f300,2)}
        Flow Graph:
          [0->{},1->{0,2,3},2->{0,2,3},3->{0,2,3}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: Failure MAYBE
  + Considered Problem:
      Rules:
        0. f2(A,B) -> f300(A,C)    [A = 0]      (1,1)
        1. f3(A,B) -> f2(A,B)      True         (1,1)
        2. f2(A,B) -> f2(1 + C,B)  [A >= 1]     (?,1)
        3. f2(A,B) -> f2(-1 + C,B) [0 >= 1 + A] (?,1)
      Signature:
        {(f2,2);(f3,2);(f300,2)}
      Flow Graph:
        [0->{},1->{0,2,3},2->{0,2,3},3->{0,2,3}]
      
  + Applied Processor:
      Failing "Open problems left."
  + Details:
      Open problems left.
MAYBE