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