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