YES(?,O(1))
* Step 1: TrivialSCCs WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F,G,H,I,J,K,L,M,N,O,P,Q,R,S,T,U,V,W,X,Y,Z,A1,B1,C1,D1,E1,F1,G1,H1,I1,J1,K1,L1,M1,N1,O1,P1,Q1,R1 -> f75(2,W1,W1,W1,W1,W1,2,X1,X1,X1,X1,X1,2,Y1,Y1,Y1,Y1,Y1,2,Z1,Z1,Z1,Z1,Z1,2,A2,A2,A2,A2,A2,2,B2,B2,B2,B2True (1,1)
             ,S1,T1,U1,V1)                                                                                               ,B2,2,C2,C2,C2,C2,C2,2,D2,D2,D2,D2,D2)                                                                              
        Signature:
          {(f0,48);(f75,48)}
        Flow Graph:
          [0->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        The problem is already solved.

YES(?,O(1))