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: FromIts 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:
        FromIts
    + Details:
        ()
* Step 3: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f3(A)   -> f3(-1 + A)  [A >= 1]
          f3(A)   -> f3(-1 + A)  [0 >= A]
          f300(A) -> f3(A)       True
        Signature:
          {(f3,1);(f300,1)}
        Rule Graph:
          [0->{0,1},1->{1},2->{0,1}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 4: Failure MAYBE
  + Considered Problem:
      Rules:
        f3(A)   -> f3(-1 + A)    [A >= 1]
        f3(A)   -> f3(-1 + A)    [0 >= A]
        f300(A) -> f3(A)         True
        f3(A)   -> exitus616(A)  True
      Signature:
        {(exitus616,1);(f3,1);(f300,1)}
      Rule Graph:
        [0->{0,1},1->{1,3},2->{0,1}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3]
        |
        +- p:[0] c: [0]
        |
        `- p:[1] c: []
MAYBE