NO
* Step 1: TrivialSCCs NO
    + Considered Problem:
        Rules:
          0. f2(A,B,C,D,E,F,G,H) -> f1(A,B,C,D,E,F,I,J)   True         (1,1)
          1. f1(A,B,C,D,E,F,G,H) -> f300(A,A,I,J,E,K,G,H) [A = B]      (?,1)
          2. f1(A,B,C,D,E,F,G,H) -> f1(A,B,I,J,K,F,G,H)   [B >= 1 + A] (?,1)
          3. f1(A,B,C,D,E,F,G,H) -> f1(A,B,I,J,K,F,G,H)   [A >= 1 + B] (?,1)
        Signature:
          {(f1,8);(f2,8);(f300,8)}
        Flow Graph:
          [0->{1,2,3},1->{},2->{1,2,3},3->{1,2,3}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: UnsatPaths NO
    + Considered Problem:
        Rules:
          0. f2(A,B,C,D,E,F,G,H) -> f1(A,B,C,D,E,F,I,J)   True         (1,1)
          1. f1(A,B,C,D,E,F,G,H) -> f300(A,A,I,J,E,K,G,H) [A = B]      (1,1)
          2. f1(A,B,C,D,E,F,G,H) -> f1(A,B,I,J,K,F,G,H)   [B >= 1 + A] (?,1)
          3. f1(A,B,C,D,E,F,G,H) -> f1(A,B,I,J,K,F,G,H)   [A >= 1 + B] (?,1)
        Signature:
          {(f1,8);(f2,8);(f300,8)}
        Flow Graph:
          [0->{1,2,3},1->{},2->{1,2,3},3->{1,2,3}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(2,1),(2,3),(3,1),(3,2)]
* Step 3: Looptree NO
    + Considered Problem:
        Rules:
          0. f2(A,B,C,D,E,F,G,H) -> f1(A,B,C,D,E,F,I,J)   True         (1,1)
          1. f1(A,B,C,D,E,F,G,H) -> f300(A,A,I,J,E,K,G,H) [A = B]      (1,1)
          2. f1(A,B,C,D,E,F,G,H) -> f1(A,B,I,J,K,F,G,H)   [B >= 1 + A] (?,1)
          3. f1(A,B,C,D,E,F,G,H) -> f1(A,B,I,J,K,F,G,H)   [A >= 1 + B] (?,1)
        Signature:
          {(f1,8);(f2,8);(f300,8)}
        Flow Graph:
          [0->{1,2,3},1->{},2->{2},3->{3}]
        
    + Applied Processor:
        Looptree
    + Details:
        We construct a looptree:
          P: [0,1,2,3]
          |
          +- p:[3] c: []
          |
          `- p:[2] c: []

NO