NO
* Step 1: FromIts NO
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E) -> f3(0,0,C,D,E)      True               (1,1)
          1. f3(A,B,C,D,E) -> f3(A,B,-1 + C,F,E) [C >= 1 && F >= 1] (?,1)
          2. f3(A,B,C,D,E) -> f3(A,B,-2 + C,F,E) [C >= 1 && 0 >= F] (?,1)
          3. f3(A,B,C,D,E) -> f6(A,B,C,D,F)      [0 >= C]           (?,1)
          4. f6(A,B,C,D,E) -> f6(1,B,C,D,F)      [E >= 1]           (?,1)
          5. f6(A,B,C,D,E) -> f6(0,B,C,D,F)      [0 >= E]           (?,1)
        Signature:
          {(f0,5);(f3,5);(f6,5)}
        Flow Graph:
          [0->{1,2,3},1->{1,2,3},2->{1,2,3},3->{4,5},4->{4,5},5->{4,5}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: CloseWith NO
    + Considered Problem:
        Rules:
          f0(A,B,C,D,E) -> f3(0,0,C,D,E)       True
          f3(A,B,C,D,E) -> f3(A,B,-1 + C,F,E)  [C >= 1 && F >= 1]
          f3(A,B,C,D,E) -> f3(A,B,-2 + C,F,E)  [C >= 1 && 0 >= F]
          f3(A,B,C,D,E) -> f6(A,B,C,D,F)       [0 >= C]
          f6(A,B,C,D,E) -> f6(1,B,C,D,F)       [E >= 1]
          f6(A,B,C,D,E) -> f6(0,B,C,D,F)       [0 >= E]
        Signature:
          {(f0,5);(f3,5);(f6,5)}
        Rule Graph:
          [0->{1,2,3},1->{1,2,3},2->{1,2,3},3->{4,5},4->{4,5},5->{4,5}]
    + Applied Processor:
        CloseWith False
    + Details:
        ()

NO