NO
* Step 1: UnsatPaths NO
    + Considered Problem:
        Rules:
          0. f1(A,B) -> f0(A,B)     True                   (1,1)
          1. f0(A,B) -> f0(A + B,B) [A >= 1 && B >= 1]     (?,1)
          2. f0(A,B) -> f0(A + B,B) [A >= 1 && 0 >= 1 + B] (?,1)
        Signature:
          {(f0,2);(f1,2)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{1,2}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(1,2),(2,1)]
* Step 2: FromIts NO
    + Considered Problem:
        Rules:
          0. f1(A,B) -> f0(A,B)     True                   (1,1)
          1. f0(A,B) -> f0(A + B,B) [A >= 1 && B >= 1]     (?,1)
          2. f0(A,B) -> f0(A + B,B) [A >= 1 && 0 >= 1 + B] (?,1)
        Signature:
          {(f0,2);(f1,2)}
        Flow Graph:
          [0->{1,2},1->{1},2->{2}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: CloseWith NO
    + Considered Problem:
        Rules:
          f1(A,B) -> f0(A,B)      True
          f0(A,B) -> f0(A + B,B)  [A >= 1 && B >= 1]
          f0(A,B) -> f0(A + B,B)  [A >= 1 && 0 >= 1 + B]
        Signature:
          {(f0,2);(f1,2)}
        Rule Graph:
          [0->{1,2},1->{1},2->{2}]
    + Applied Processor:
        CloseWith False
    + Details:
        ()

NO