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

NO