MAYBE
* Step 1: ArgumentFilter MAYBE
    + Considered Problem:
        Rules:
          0. f300(A,B) -> f2(A,B)      True                   (1,1)
          1. f2(A,B)   -> f2(-1 + A,B) [13 >= A && A >= 1]    (?,1)
          2. f2(A,B)   -> f2(-1 + A,B) [A >= 15 && A >= 1]    (?,1)
          3. f2(A,B)   -> f1(-1 + A,C) [13 >= A && 0 >= A]    (?,1)
          4. f2(A,B)   -> f2(C,B)      [C >= 0 && A = 14]     (?,1)
          5. f2(A,B)   -> f1(C,D)      [0 >= 1 + C && A = 14] (?,1)
        Signature:
          {(f1,2);(f2,2);(f300,2)}
        Flow Graph:
          [0->{1,2,3,4,5},1->{1,2,3,4,5},2->{1,2,3,4,5},3->{},4->{1,2,3,4,5},5->{}]
        
    + Applied Processor:
        ArgumentFilter [1]
    + Details:
        We remove following argument positions: [1].
* Step 2: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f300(A) -> f2(A)      True                   (1,1)
          1. f2(A)   -> f2(-1 + A) [13 >= A && A >= 1]    (?,1)
          2. f2(A)   -> f2(-1 + A) [A >= 15 && A >= 1]    (?,1)
          3. f2(A)   -> f1(-1 + A) [13 >= A && 0 >= A]    (?,1)
          4. f2(A)   -> f2(C)      [C >= 0 && A = 14]     (?,1)
          5. f2(A)   -> f1(C)      [0 >= 1 + C && A = 14] (?,1)
        Signature:
          {(f1,2);(f2,2);(f300,2)}
        Flow Graph:
          [0->{1,2,3,4,5},1->{1,2,3,4,5},2->{1,2,3,4,5},3->{},4->{1,2,3,4,5},5->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,2),(1,4),(1,5),(2,1),(2,3)]
* Step 3: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f300(A) -> f2(A)      True                   (1,1)
          1. f2(A)   -> f2(-1 + A) [13 >= A && A >= 1]    (?,1)
          2. f2(A)   -> f2(-1 + A) [A >= 15 && A >= 1]    (?,1)
          3. f2(A)   -> f1(-1 + A) [13 >= A && 0 >= A]    (?,1)
          4. f2(A)   -> f2(C)      [C >= 0 && A = 14]     (?,1)
          5. f2(A)   -> f1(C)      [0 >= 1 + C && A = 14] (?,1)
        Signature:
          {(f1,2);(f2,2);(f300,2)}
        Flow Graph:
          [0->{1,2,3,4,5},1->{1,3},2->{2,4,5},3->{},4->{1,2,3,4,5},5->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f300(A) -> f2(A)       True
          f2(A)   -> f2(-1 + A)  [13 >= A && A >= 1]
          f2(A)   -> f2(-1 + A)  [A >= 15 && A >= 1]
          f2(A)   -> f1(-1 + A)  [13 >= A && 0 >= A]
          f2(A)   -> f2(C)       [C >= 0 && A = 14]
          f2(A)   -> f1(C)       [0 >= 1 + C && A = 14]
        Signature:
          {(f1,2);(f2,2);(f300,2)}
        Rule Graph:
          [0->{1,2,3,4,5},1->{1,3},2->{2,4,5},3->{},4->{1,2,3,4,5},5->{}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Failure MAYBE
  + Considered Problem:
      Rules:
        f300(A) -> f2(A)         True
        f2(A)   -> f2(-1 + A)    [13 >= A && A >= 1]
        f2(A)   -> f2(-1 + A)    [A >= 15 && A >= 1]
        f2(A)   -> f1(-1 + A)    [13 >= A && 0 >= A]
        f2(A)   -> f2(C)         [C >= 0 && A = 14]
        f2(A)   -> f1(C)         [0 >= 1 + C && A = 14]
        f1(A)   -> exitus616(A)  True
        f1(A)   -> exitus616(A)  True
      Signature:
        {(exitus616,1);(f1,2);(f2,2);(f300,2)}
      Rule Graph:
        [0->{1,2,3,4,5},1->{1,3},2->{2,4,5},3->{7},4->{1,2,3,4,5},5->{6}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7]
        |
        +- p:[2,4] c: []
        |
        `- p:[1] c: [1]
MAYBE