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