MAYBE
* Step 1: ArgumentFilter MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D)  -> f14(E,E,0,D)     [0 >= E]               (1,1)
          1. f0(A,B,C,D)  -> f14(E,E,0,D)     [E >= 1024]            (1,1)
          2. f0(A,B,C,D)  -> f14(E,E,0,F)     [1023 >= E && E >= 1]  (1,1)
          3. f14(A,B,C,D) -> f14(A,B,1 + C,D) [C >= 0 && E >= 1 + C] (?,1)
          4. f14(A,B,C,D) -> f22(A,B,C,D)     [C >= 0 && C >= E]     (?,1)
        Signature:
          {(f0,4);(f14,4);(f22,4)}
        Flow Graph:
          [0->{3,4},1->{3,4},2->{3,4},3->{3,4},4->{}]
        
    + Applied Processor:
        ArgumentFilter [0,1,3]
    + Details:
        We remove following argument positions: [0,1,3].
* Step 2: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f0(C)  -> f14(0)     [0 >= E]               (1,1)
          1. f0(C)  -> f14(0)     [E >= 1024]            (1,1)
          2. f0(C)  -> f14(0)     [1023 >= E && E >= 1]  (1,1)
          3. f14(C) -> f14(1 + C) [C >= 0 && E >= 1 + C] (?,1)
          4. f14(C) -> f22(C)     [C >= 0 && C >= E]     (?,1)
        Signature:
          {(f0,4);(f14,4);(f22,4)}
        Flow Graph:
          [0->{3,4},1->{3,4},2->{3,4},3->{3,4},4->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f0(C)  -> f14(0)      [0 >= E]
          f0(C)  -> f14(0)      [E >= 1024]
          f0(C)  -> f14(0)      [1023 >= E && E >= 1]
          f14(C) -> f14(1 + C)  [C >= 0 && E >= 1 + C]
          f14(C) -> f22(C)      [C >= 0 && C >= E]
        Signature:
          {(f0,4);(f14,4);(f22,4)}
        Rule Graph:
          [0->{3,4},1->{3,4},2->{3,4},3->{3,4},4->{}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 4: Failure MAYBE
  + Considered Problem:
      Rules:
        f0(C)  -> f14(0)        [0 >= E]
        f0(C)  -> f14(0)        [E >= 1024]
        f0(C)  -> f14(0)        [1023 >= E && E >= 1]
        f14(C) -> f14(1 + C)    [C >= 0 && E >= 1 + C]
        f14(C) -> f22(C)        [C >= 0 && C >= E]
        f22(C) -> exitus616(C)  True
        f22(C) -> exitus616(C)  True
        f22(C) -> exitus616(C)  True
      Signature:
        {(exitus616,1);(f0,4);(f14,4);(f22,4)}
      Rule Graph:
        [0->{3,4},1->{3,4},2->{3,4},3->{3,4},4->{5,6,7}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7]
        |
        `- p:[3] c: []
MAYBE