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