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

YES(?,O(1))