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

WORST_CASE(?,O(1))