MAYBE
* Step 1: UnsatPaths 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:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,2),(1,4),(1,5),(2,1),(2,3)]
* Step 2: FromIts 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,3},2->{2,4,5},3->{},4->{1,2,3,4,5},5->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: Unfold MAYBE
    + Considered Problem:
        Rules:
          f300(A,B) -> f2(A,B)       True
          f2(A,B)   -> f2(-1 + A,B)  [13 >= A && A >= 1]
          f2(A,B)   -> f2(-1 + A,B)  [A >= 15 && A >= 1]
          f2(A,B)   -> f1(-1 + A,C)  [13 >= A && 0 >= A]
          f2(A,B)   -> f2(C,B)       [C >= 0 && A = 14]
          f2(A,B)   -> f1(C,D)       [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:
        Unfold
    + Details:
        ()
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f300.0(A,B) -> f2.1(A,B)       True
          f300.0(A,B) -> f2.2(A,B)       True
          f300.0(A,B) -> f2.3(A,B)       True
          f300.0(A,B) -> f2.4(A,B)       True
          f300.0(A,B) -> f2.5(A,B)       True
          f2.1(A,B)   -> f2.1(-1 + A,B)  [13 >= A && A >= 1]
          f2.1(A,B)   -> f2.3(-1 + A,B)  [13 >= A && A >= 1]
          f2.2(A,B)   -> f2.2(-1 + A,B)  [A >= 15 && A >= 1]
          f2.2(A,B)   -> f2.4(-1 + A,B)  [A >= 15 && A >= 1]
          f2.2(A,B)   -> f2.5(-1 + A,B)  [A >= 15 && A >= 1]
          f2.3(A,B)   -> f1.6(-1 + A,C)  [13 >= A && 0 >= A]
          f2.4(A,B)   -> f2.1(C,B)       [C >= 0 && A = 14]
          f2.4(A,B)   -> f2.2(C,B)       [C >= 0 && A = 14]
          f2.4(A,B)   -> f2.3(C,B)       [C >= 0 && A = 14]
          f2.4(A,B)   -> f2.4(C,B)       [C >= 0 && A = 14]
          f2.4(A,B)   -> f2.5(C,B)       [C >= 0 && A = 14]
          f2.5(A,B)   -> f1.6(C,D)       [0 >= 1 + C && A = 14]
        Signature:
          {(f1.6,2);(f2.1,2);(f2.2,2);(f2.3,2);(f2.4,2);(f2.5,2);(f300.0,2)}
        Rule Graph:
          [0->{5,6},1->{7,8,9},2->{10},3->{11,12,13,14,15},4->{16},5->{5,6},6->{10},7->{7,8,9},8->{11,12,13,14,15}
          ,9->{16},10->{},11->{5,6},12->{7,8,9},13->{10},14->{11,12,13,14,15},15->{16},16->{}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Failure MAYBE
  + Considered Problem:
      Rules:
        f300.0(A,B) -> f2.1(A,B)       True
        f300.0(A,B) -> f2.2(A,B)       True
        f300.0(A,B) -> f2.3(A,B)       True
        f300.0(A,B) -> f2.4(A,B)       True
        f300.0(A,B) -> f2.5(A,B)       True
        f2.1(A,B)   -> f2.1(-1 + A,B)  [13 >= A && A >= 1]
        f2.1(A,B)   -> f2.3(-1 + A,B)  [13 >= A && A >= 1]
        f2.2(A,B)   -> f2.2(-1 + A,B)  [A >= 15 && A >= 1]
        f2.2(A,B)   -> f2.4(-1 + A,B)  [A >= 15 && A >= 1]
        f2.2(A,B)   -> f2.5(-1 + A,B)  [A >= 15 && A >= 1]
        f2.3(A,B)   -> f1.6(-1 + A,C)  [13 >= A && 0 >= A]
        f2.4(A,B)   -> f2.1(C,B)       [C >= 0 && A = 14]
        f2.4(A,B)   -> f2.2(C,B)       [C >= 0 && A = 14]
        f2.4(A,B)   -> f2.3(C,B)       [C >= 0 && A = 14]
        f2.4(A,B)   -> f2.4(C,B)       [C >= 0 && A = 14]
        f2.4(A,B)   -> f2.5(C,B)       [C >= 0 && A = 14]
        f2.5(A,B)   -> f1.6(C,D)       [0 >= 1 + C && A = 14]
        f1.6(A,B)   -> exitus616(A,B)  True
        f1.6(A,B)   -> exitus616(A,B)  True
        f1.6(A,B)   -> exitus616(A,B)  True
        f1.6(A,B)   -> exitus616(A,B)  True
        f1.6(A,B)   -> exitus616(A,B)  True
        f1.6(A,B)   -> exitus616(A,B)  True
        f1.6(A,B)   -> exitus616(A,B)  True
        f1.6(A,B)   -> exitus616(A,B)  True
        f1.6(A,B)   -> exitus616(A,B)  True
        f1.6(A,B)   -> exitus616(A,B)  True
        f1.6(A,B)   -> exitus616(A,B)  True
      Signature:
        {(exitus616,2);(f1.6,2);(f2.1,2);(f2.2,2);(f2.3,2);(f2.4,2);(f2.5,2);(f300.0,2)}
      Rule Graph:
        [0->{5,6},1->{7,8,9},2->{10},3->{11,12,13,14,15},4->{16},5->{5,6},6->{10},7->{7,8,9},8->{11,12,13,14,15}
        ,9->{16},10->{19,21,22,24,26,27},11->{5,6},12->{7,8,9},13->{10},14->{11,12,13,14,15},15->{16},16->{17,18,20
        ,23,25}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27]
        |
        +- p:[7,12,8,14] c: []
        |
        `- p:[5] c: [5]
MAYBE