NO
* Step 1: UnsatPaths NO
    + 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 NO
    + 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: CloseWith NO
    + 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:
        CloseWith False
    + Details:
        ()

NO