YES(?,O(1))
* Step 1: TrivialSCCs WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f8(A,B,C) -> f12(2,1,C) [A = 2]  (?,1)
          1. f8(A,B,C) -> f12(A,0,C) [1 >= A] (?,1)
          2. f8(A,B,C) -> f12(A,0,C) [A >= 3] (?,1)
          3. f0(A,B,C) -> f12(1,1,1) True     (1,1)
        Signature:
          {(f0,3);(f12,3);(f8,3)}
        Flow Graph:
          [0->{},1->{},2->{},3->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: UnsatRules WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. f8(A,B,C) -> f12(2,1,C) [A = 2]  (1,1)
          1. f8(A,B,C) -> f12(A,0,C) [1 >= A] (1,1)
          2. f8(A,B,C) -> f12(A,0,C) [A >= 3] (1,1)
          3. f0(A,B,C) -> f12(1,1,1) True     (1,1)
        Signature:
          {(f0,3);(f12,3);(f8,3)}
        Flow Graph:
          [0->{},1->{},2->{},3->{}]
        
    + Applied Processor:
        UnsatRules
    + Details:
        The problem is already solved.

YES(?,O(1))