NO
* Step 1: UnsatPaths NO
    + Considered Problem:
        Rules:
          0. f11(A,B,C,D,E,F) -> f11(-2 + A,-1 + B,1 + C,G,E,F) [A >= 1 && G >= 1]               (?,1)
          1. f11(A,B,C,D,E,F) -> f11(-2 + A,B,C,G,E,F)          [0 >= G && A >= 1 && A >= 1 + B] (?,1)
          2. f21(A,B,C,D,E,F) -> f21(A,B,C,D,E,F)               True                             (?,1)
          3. f23(A,B,C,D,E,F) -> f26(A,B,C,D,E,F)               True                             (?,1)
          4. f11(A,B,C,D,E,F) -> f21(A,B,C,D,E,F)               [0 >= A]                         (?,1)
          5. f0(A,B,C,D,E,F)  -> f11(4,G,0,D,G,4)               [G >= 1]                         (1,1)
        Signature:
          {(f0,6);(f11,6);(f21,6);(f23,6);(f26,6)}
        Flow Graph:
          [0->{0,1,4},1->{0,1,4},2->{2},3->{},4->{2},5->{0,1,4}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(5,4)]
* Step 2: UnreachableRules NO
    + Considered Problem:
        Rules:
          0. f11(A,B,C,D,E,F) -> f11(-2 + A,-1 + B,1 + C,G,E,F) [A >= 1 && G >= 1]               (?,1)
          1. f11(A,B,C,D,E,F) -> f11(-2 + A,B,C,G,E,F)          [0 >= G && A >= 1 && A >= 1 + B] (?,1)
          2. f21(A,B,C,D,E,F) -> f21(A,B,C,D,E,F)               True                             (?,1)
          3. f23(A,B,C,D,E,F) -> f26(A,B,C,D,E,F)               True                             (?,1)
          4. f11(A,B,C,D,E,F) -> f21(A,B,C,D,E,F)               [0 >= A]                         (?,1)
          5. f0(A,B,C,D,E,F)  -> f11(4,G,0,D,G,4)               [G >= 1]                         (1,1)
        Signature:
          {(f0,6);(f11,6);(f21,6);(f23,6);(f26,6)}
        Flow Graph:
          [0->{0,1,4},1->{0,1,4},2->{2},3->{},4->{2},5->{0,1}]
        
    + Applied Processor:
        UnreachableRules
    + Details:
        Following transitions are not reachable from the starting states and are revomed: [3]
* Step 3: FromIts NO
    + Considered Problem:
        Rules:
          0. f11(A,B,C,D,E,F) -> f11(-2 + A,-1 + B,1 + C,G,E,F) [A >= 1 && G >= 1]               (?,1)
          1. f11(A,B,C,D,E,F) -> f11(-2 + A,B,C,G,E,F)          [0 >= G && A >= 1 && A >= 1 + B] (?,1)
          2. f21(A,B,C,D,E,F) -> f21(A,B,C,D,E,F)               True                             (?,1)
          4. f11(A,B,C,D,E,F) -> f21(A,B,C,D,E,F)               [0 >= A]                         (?,1)
          5. f0(A,B,C,D,E,F)  -> f11(4,G,0,D,G,4)               [G >= 1]                         (1,1)
        Signature:
          {(f0,6);(f11,6);(f21,6);(f23,6);(f26,6)}
        Flow Graph:
          [0->{0,1,4},1->{0,1,4},2->{2},4->{2},5->{0,1}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 4: CloseWith NO
    + Considered Problem:
        Rules:
          f11(A,B,C,D,E,F) -> f11(-2 + A,-1 + B,1 + C,G,E,F)  [A >= 1 && G >= 1]
          f11(A,B,C,D,E,F) -> f11(-2 + A,B,C,G,E,F)           [0 >= G && A >= 1 && A >= 1 + B]
          f21(A,B,C,D,E,F) -> f21(A,B,C,D,E,F)                True
          f11(A,B,C,D,E,F) -> f21(A,B,C,D,E,F)                [0 >= A]
          f0(A,B,C,D,E,F)  -> f11(4,G,0,D,G,4)                [G >= 1]
        Signature:
          {(f0,6);(f11,6);(f21,6);(f23,6);(f26,6)}
        Rule Graph:
          [0->{0,1,4},1->{0,1,4},2->{2},4->{2},5->{0,1}]
    + Applied Processor:
        CloseWith False
    + Details:
        ()

NO