MAYBE
* Step 1: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f4(0,99) True                       (1,1)
          1. f4(A,B) -> f4(E,B)  [B >= 1 + A && C >= 1 + D] (?,1)
          2. f4(A,B) -> f4(A,E)  [B >= 1 + A]               (?,1)
          3. f4(A,B) -> f11(A,B) [A >= B]                   (?,1)
        Signature:
          {(f0,2);(f11,2);(f4,2)}
        Flow Graph:
          [0->{1,2,3},1->{1,2,3},2->{1,2,3},3->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,3)]
* Step 2: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f4(0,99) True                       (1,1)
          1. f4(A,B) -> f4(E,B)  [B >= 1 + A && C >= 1 + D] (?,1)
          2. f4(A,B) -> f4(A,E)  [B >= 1 + A]               (?,1)
          3. f4(A,B) -> f11(A,B) [A >= B]                   (?,1)
        Signature:
          {(f0,2);(f11,2);(f4,2)}
        Flow Graph:
          [0->{1,2},1->{1,2,3},2->{1,2,3},3->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: Unfold MAYBE
    + Considered Problem:
        Rules:
          f0(A,B) -> f4(0,99)  True
          f4(A,B) -> f4(E,B)   [B >= 1 + A && C >= 1 + D]
          f4(A,B) -> f4(A,E)   [B >= 1 + A]
          f4(A,B) -> f11(A,B)  [A >= B]
        Signature:
          {(f0,2);(f11,2);(f4,2)}
        Rule Graph:
          [0->{1,2},1->{1,2,3},2->{1,2,3},3->{}]
    + Applied Processor:
        Unfold
    + Details:
        ()
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f0.0(A,B) -> f4.1(0,99)  True
          f0.0(A,B) -> f4.2(0,99)  True
          f4.1(A,B) -> f4.1(E,B)   [B >= 1 + A && C >= 1 + D]
          f4.1(A,B) -> f4.2(E,B)   [B >= 1 + A && C >= 1 + D]
          f4.1(A,B) -> f4.3(E,B)   [B >= 1 + A && C >= 1 + D]
          f4.2(A,B) -> f4.1(A,E)   [B >= 1 + A]
          f4.2(A,B) -> f4.2(A,E)   [B >= 1 + A]
          f4.2(A,B) -> f4.3(A,E)   [B >= 1 + A]
          f4.3(A,B) -> f11.4(A,B)  [A >= B]
        Signature:
          {(f0.0,2);(f11.4,2);(f4.1,2);(f4.2,2);(f4.3,2)}
        Rule Graph:
          [0->{2,3,4},1->{5,6,7},2->{2,3,4},3->{5,6,7},4->{8},5->{2,3,4},6->{5,6,7},7->{8},8->{}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Failure MAYBE
  + Considered Problem:
      Rules:
        f0.0(A,B)  -> f4.1(0,99)      True
        f0.0(A,B)  -> f4.2(0,99)      True
        f4.1(A,B)  -> f4.1(E,B)       [B >= 1 + A && C >= 1 + D]
        f4.1(A,B)  -> f4.2(E,B)       [B >= 1 + A && C >= 1 + D]
        f4.1(A,B)  -> f4.3(E,B)       [B >= 1 + A && C >= 1 + D]
        f4.2(A,B)  -> f4.1(A,E)       [B >= 1 + A]
        f4.2(A,B)  -> f4.2(A,E)       [B >= 1 + A]
        f4.2(A,B)  -> f4.3(A,E)       [B >= 1 + A]
        f4.3(A,B)  -> f11.4(A,B)      [A >= B]
        f11.4(A,B) -> exitus616(A,B)  True
        f11.4(A,B) -> exitus616(A,B)  True
        f11.4(A,B) -> exitus616(A,B)  True
        f11.4(A,B) -> exitus616(A,B)  True
      Signature:
        {(exitus616,2);(f0.0,2);(f11.4,2);(f4.1,2);(f4.2,2);(f4.3,2)}
      Rule Graph:
        [0->{2,3,4},1->{5,6,7},2->{2,3,4},3->{5,6,7},4->{8},5->{2,3,4},6->{5,6,7},7->{8},8->{9,10,11,12}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7,8,9,10,11,12]
        |
        `- p:[2,5,3,6] c: []
MAYBE