MAYBE
* Step 1: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f4(A) -> f12(A)    [A >= 4]           (?,1)
          1. f4(A) -> f4(1)     [0 >= A && 3 >= A] (?,1)
          2. f4(A) -> f4(1 + A) [3 >= A && A >= 1] (?,1)
          3. f0(A) -> f4(B)     True               (1,1)
        Signature:
          {(f0,1);(f12,1);(f4,1)}
        Flow Graph:
          [0->{},1->{0,1,2},2->{0,1,2},3->{0,1,2}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,0),(1,1),(2,1)]
* Step 2: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f4(A) -> f12(A)    [A >= 4]           (?,1)
          1. f4(A) -> f4(1)     [0 >= A && 3 >= A] (?,1)
          2. f4(A) -> f4(1 + A) [3 >= A && A >= 1] (?,1)
          3. f0(A) -> f4(B)     True               (1,1)
        Signature:
          {(f0,1);(f12,1);(f4,1)}
        Flow Graph:
          [0->{},1->{2},2->{0,2},3->{0,1,2}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 3: Failure MAYBE
  + Considered Problem:
      Rules:
        0. f4(A) -> f12(A)    [A >= 4]           (1,1)
        1. f4(A) -> f4(1)     [0 >= A && 3 >= A] (1,1)
        2. f4(A) -> f4(1 + A) [3 >= A && A >= 1] (?,1)
        3. f0(A) -> f4(B)     True               (1,1)
      Signature:
        {(f0,1);(f12,1);(f4,1)}
      Flow Graph:
        [0->{},1->{2},2->{0,2},3->{0,1,2}]
      
  + Applied Processor:
      Failing "Open problems left."
  + Details:
      Open problems left.
MAYBE