NO
* Step 1: FromIts NO
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F,G,H,I,J)  -> f31(1,B,C,D,E,K,0,1,L,L) [K >= 1 && 0 >= L]                                                                                  (1,1)
          1. f0(A,B,C,D,E,F,G,H,I,J)  -> f18(1,B,C,D,E,K,0,1,L,L) [K >= 1 && L >= 1]                                                                                  (1,1)
          2. f0(A,B,C,D,E,F,G,H,I,J)  -> f18(1,B,C,D,E,K,K,H,I,J) [0 >= K]                                                                                            (1,1)
          3. f31(A,B,C,D,E,F,G,H,I,J) -> f31(A,B,C,D,E,F,G,H,I,J) [-1*G >= 0 && A + -1*G >= 0 && 1 + -1*A + -1*G >= 0 && 1 + -1*A >= 0 && A >= 0]                     (?,1)
          4. f18(A,B,C,D,E,F,G,H,I,J) -> f24(0,B,K,D,K,F,G,H,I,J) [-1*G >= 0 && -1 + A + -1*G >= 0 && 1 + -1*A + -1*G >= 0 && 1 + -1*A >= 0 && -1 + A >= 0 && A >= 1] (?,1)
          5. f24(A,B,C,D,E,F,G,H,I,J) -> f31(1,L,C,K,E,F,G,H,I,J) [-1*G >= 0 && A + -1*G >= 0 && -1*A + -1*G >= 0 && -1*A >= 0 && A >= 0 && 0 >= A && K >= 1000 + C]  (?,1)
          6. f24(A,B,C,D,E,F,G,H,I,J) -> f31(A,L,C,K,E,F,G,H,I,J) [-1*G >= 0 && A + -1*G >= 0 && -1*A + -1*G >= 0 && -1*A >= 0 && A >= 0 && 0 >= A && 999 + C >= K]   (?,1)
        Signature:
          {(f0,10);(f18,10);(f24,10);(f31,10)}
        Flow Graph:
          [0->{3},1->{4},2->{4},3->{3},4->{5,6},5->{3},6->{3}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: CloseWith NO
    + Considered Problem:
        Rules:
          f0(A,B,C,D,E,F,G,H,I,J)  -> f31(1,B,C,D,E,K,0,1,L,L)  [K >= 1 && 0 >= L]
          f0(A,B,C,D,E,F,G,H,I,J)  -> f18(1,B,C,D,E,K,0,1,L,L)  [K >= 1 && L >= 1]
          f0(A,B,C,D,E,F,G,H,I,J)  -> f18(1,B,C,D,E,K,K,H,I,J)  [0 >= K]
          f31(A,B,C,D,E,F,G,H,I,J) -> f31(A,B,C,D,E,F,G,H,I,J)  [-1*G >= 0
                                                                 && A + -1*G >= 0
                                                                 && 1 + -1*A + -1*G >= 0
                                                                 && 1 + -1*A >= 0
                                                                 && A >= 0]
          f18(A,B,C,D,E,F,G,H,I,J) -> f24(0,B,K,D,K,F,G,H,I,J)  [-1*G >= 0
                                                                 && -1 + A + -1*G >= 0
                                                                 && 1 + -1*A + -1*G >= 0
                                                                 && 1 + -1*A >= 0
                                                                 && -1 + A >= 0
                                                                 && A >= 1]
          f24(A,B,C,D,E,F,G,H,I,J) -> f31(1,L,C,K,E,F,G,H,I,J)  [-1*G >= 0
                                                                 && A + -1*G >= 0
                                                                 && -1*A + -1*G >= 0
                                                                 && -1*A >= 0
                                                                 && A >= 0
                                                                 && 0 >= A
                                                                 && K >= 1000 + C]
          f24(A,B,C,D,E,F,G,H,I,J) -> f31(A,L,C,K,E,F,G,H,I,J)  [-1*G >= 0
                                                                 && A + -1*G >= 0
                                                                 && -1*A + -1*G >= 0
                                                                 && -1*A >= 0
                                                                 && A >= 0
                                                                 && 0 >= A
                                                                 && 999 + C >= K]
        Signature:
          {(f0,10);(f18,10);(f24,10);(f31,10)}
        Rule Graph:
          [0->{3},1->{4},2->{4},3->{3},4->{5,6},5->{3},6->{3}]
    + Applied Processor:
        CloseWith False
    + Details:
        ()

NO