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