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

NO