NO
* Step 1: UnsatPaths NO
    + Considered Problem:
        Rules:
          0. f2(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,B,M,N,L,O,G,H,I,J,K)   [L >= 1 && B >= 1 + A]     (?,1)
          1. f2(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,B,M,N,L,O,G,H,I,J,K)   [0 >= 1 + L && B >= 1 + A] (?,1)
          2. f2(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,B,M,N,0,F,G,H,I,J,K)   [B >= 1 + A]               (?,1)
          3. f2(A,B,C,D,E,F,G,H,I,J,K) -> f300(A,B,M,N,E,F,L,H,I,J,K) [A >= B]                   (?,1)
          4. f1(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,B,C,D,E,F,G,M,N,N,M)   True                       (1,1)
        Signature:
          {(f1,11);(f2,11);(f300,11)}
        Flow Graph:
          [0->{0,1,2,3},1->{0,1,2,3},2->{0,1,2,3},3->{},4->{0,1,2,3}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,3),(1,3),(2,3)]
* Step 2: FromIts NO
    + Considered Problem:
        Rules:
          0. f2(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,B,M,N,L,O,G,H,I,J,K)   [L >= 1 && B >= 1 + A]     (?,1)
          1. f2(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,B,M,N,L,O,G,H,I,J,K)   [0 >= 1 + L && B >= 1 + A] (?,1)
          2. f2(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,B,M,N,0,F,G,H,I,J,K)   [B >= 1 + A]               (?,1)
          3. f2(A,B,C,D,E,F,G,H,I,J,K) -> f300(A,B,M,N,E,F,L,H,I,J,K) [A >= B]                   (?,1)
          4. f1(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,B,C,D,E,F,G,M,N,N,M)   True                       (1,1)
        Signature:
          {(f1,11);(f2,11);(f300,11)}
        Flow Graph:
          [0->{0,1,2},1->{0,1,2},2->{0,1,2},3->{},4->{0,1,2,3}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: CloseWith NO
    + Considered Problem:
        Rules:
          f2(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,B,M,N,L,O,G,H,I,J,K)    [L >= 1 && B >= 1 + A]
          f2(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,B,M,N,L,O,G,H,I,J,K)    [0 >= 1 + L && B >= 1 + A]
          f2(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,B,M,N,0,F,G,H,I,J,K)    [B >= 1 + A]
          f2(A,B,C,D,E,F,G,H,I,J,K) -> f300(A,B,M,N,E,F,L,H,I,J,K)  [A >= B]
          f1(A,B,C,D,E,F,G,H,I,J,K) -> f2(A,B,C,D,E,F,G,M,N,N,M)    True
        Signature:
          {(f1,11);(f2,11);(f300,11)}
        Rule Graph:
          [0->{0,1,2},1->{0,1,2},2->{0,1,2},3->{},4->{0,1,2,3}]
    + Applied Processor:
        CloseWith False
    + Details:
        ()

NO