WORST_CASE(?,O(1))
* Step 1: UnsatRules WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. start(A,B,C) -> a(A,B,C)                [A >= 1]                                                 (1,1)
          1. start(A,B,C) -> a(A,B,C)                [A >= 2]                                                 (1,1)
          2. start(A,B,C) -> a(A,B,C)                [A >= 4]                                                 (1,1)
          3. a0(A,B,C)    -> a(A*B,B,C)              True                                                     (?,1)
          4. a1(A,B,C)    -> a(B*C,B,C)              True                                                     (?,1)
          5. a(A,B,C)     -> c2(a0(D,A,E),a1(D,A,E)) [1 >= 2*D && 3*D >= 2 && 1 >= 2*E && 3*E >= 2 && A >= 2] (?,1)
        Signature:
          {(a,3);(a0,3);(a1,3);(start,3)}
        Flow Graph:
          [0->{5},1->{5},2->{5},3->{5},4->{5},5->{3,4}]
        
    + Applied Processor:
        UnsatRules
    + Details:
        The following transitions have unsatisfiable constraints and are removed:  [5]
* Step 2: UnreachableRules WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. start(A,B,C) -> a(A,B,C)   [A >= 1] (1,1)
          1. start(A,B,C) -> a(A,B,C)   [A >= 2] (1,1)
          2. start(A,B,C) -> a(A,B,C)   [A >= 4] (1,1)
          3. a0(A,B,C)    -> a(A*B,B,C) True     (?,1)
          4. a1(A,B,C)    -> a(B*C,B,C) True     (?,1)
        Signature:
          {(a,3);(a0,3);(a1,3);(start,3)}
        Flow Graph:
          [0->{},1->{},2->{},3->{},4->{}]
        
    + Applied Processor:
        UnreachableRules
    + Details:
        The following transitions are not reachable from the starting states and are removed: [3,4]
* Step 3: LocalSizeboundsProc WORST_CASE(?,O(1))
    + Considered Problem:
        Rules:
          0. start(A,B,C) -> a(A,B,C) [A >= 1] (1,1)
          1. start(A,B,C) -> a(A,B,C) [A >= 2] (1,1)
          2. start(A,B,C) -> a(A,B,C) [A >= 4] (1,1)
        Signature:
          {(a,3);(a0,3);(a1,3);(start,3)}
        Flow Graph:
          [0->{},1->{},2->{}]
        
    + Applied Processor:
        LocalSizeboundsProc
    + Details:
        The problem is already solved.

WORST_CASE(?,O(1))