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

NO