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