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