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