YES(?,O(1))
* Step 1: TrivialSCCs WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f1(A,B,C,D) -> f300(A,B,C,E) [C >= 1 + B && B >= 1 + A && C >= 1 + A] (1,1)
          1. f1(A,B,C,D) -> f300(A,B,C,E) [B >= 1 + A && B >= C]                   (1,1)
          2. f1(A,B,C,D) -> f300(A,B,C,E) [A >= B]                                 (1,1)
        Signature:
          {(f1,4);(f300,4)}
        Flow Graph:
          [0->{},1->{},2->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        The problem is already solved.

YES(?,O(1))