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

WORST_CASE(?,O(1))