YES
* Step 1: UnreachableRules YES
    + Considered Problem:
        Rules:
          0. f12(A,B,C,D,E) -> f11(A,B,C,D,E) True     (?,1)
          1. f28(A,B,C,D,E) -> f20(A,1,A,1,A) [A >= 1] (1,1)
        Signature:
          {(f11,5);(f12,5);(f20,5);(f28,5)}
        Flow Graph:
          [0->{},1->{}]
        
    + Applied Processor:
        UnreachableRules
    + Details:
        Following transitions are not reachable from the starting states and are revomed: [0]
* Step 2: FromIts YES
    + Considered Problem:
        Rules:
          1. f28(A,B,C,D,E) -> f20(A,1,A,1,A) [A >= 1] (1,1)
        Signature:
          {(f11,5);(f12,5);(f20,5);(f28,5)}
        Flow Graph:
          [1->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: Decompose YES
    + Considered Problem:
        Rules:
          f28(A,B,C,D,E) -> f20(A,1,A,1,A)  [A >= 1]
        Signature:
          {(f11,5);(f12,5);(f20,5);(f28,5)}
        Rule Graph:
          [1->{}]
    + Applied Processor:
        Decompose NoGreedy
    + Details:
        We construct a looptree:
          P: [1]
* Step 4: CloseWith YES
    + Considered Problem:
        (Rules:
          f28(A,B,C,D,E) -> f20(A,1,A,1,A)  [A >= 1]
        Signature:
          {(f11,5);(f12,5);(f20,5);(f28,5)}
        Rule Graph:
          [1->{}]
        ,We construct a looptree:
          P: [1])
    + Applied Processor:
        CloseWith True
    + Details:
        ()

YES