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