MAYBE
* Step 1: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f1(A,B,C,D,E,F,G,H) -> f1(A,B,I,J,K,F,G,H)   [A >= 1 + B] (?,1)
          1. f1(A,B,C,D,E,F,G,H) -> f1(A,B,I,J,K,F,G,H)   [B >= 1 + A] (?,1)
          2. f1(A,B,C,D,E,F,G,H) -> f300(A,A,I,J,E,K,G,H) [A = B]      (?,1)
          3. f2(A,B,C,D,E,F,G,H) -> f1(A,B,C,D,E,F,I,J)   True         (1,1)
        Signature:
          {(f1,8);(f2,8);(f300,8)}
        Flow Graph:
          [0->{0,1,2},1->{0,1,2},2->{},3->{0,1,2}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,1),(0,2),(1,0),(1,2)]
* Step 2: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f1(A,B,C,D,E,F,G,H) -> f1(A,B,I,J,K,F,G,H)   [A >= 1 + B] (?,1)
          1. f1(A,B,C,D,E,F,G,H) -> f1(A,B,I,J,K,F,G,H)   [B >= 1 + A] (?,1)
          2. f1(A,B,C,D,E,F,G,H) -> f300(A,A,I,J,E,K,G,H) [A = B]      (?,1)
          3. f2(A,B,C,D,E,F,G,H) -> f1(A,B,C,D,E,F,I,J)   True         (1,1)
        Signature:
          {(f1,8);(f2,8);(f300,8)}
        Flow Graph:
          [0->{0},1->{1},2->{},3->{0,1,2}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: Unfold MAYBE
    + Considered Problem:
        Rules:
          f1(A,B,C,D,E,F,G,H) -> f1(A,B,I,J,K,F,G,H)    [A >= 1 + B]
          f1(A,B,C,D,E,F,G,H) -> f1(A,B,I,J,K,F,G,H)    [B >= 1 + A]
          f1(A,B,C,D,E,F,G,H) -> f300(A,A,I,J,E,K,G,H)  [A = B]
          f2(A,B,C,D,E,F,G,H) -> f1(A,B,C,D,E,F,I,J)    True
        Signature:
          {(f1,8);(f2,8);(f300,8)}
        Rule Graph:
          [0->{0},1->{1},2->{},3->{0,1,2}]
    + Applied Processor:
        Unfold
    + Details:
        ()
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f1.0(A,B,C,D,E,F,G,H) -> f1.0(A,B,I,J,K,F,G,H)    [A >= 1 + B]
          f1.1(A,B,C,D,E,F,G,H) -> f1.1(A,B,I,J,K,F,G,H)    [B >= 1 + A]
          f1.2(A,B,C,D,E,F,G,H) -> f300.4(A,A,I,J,E,K,G,H)  [A = B]
          f2.3(A,B,C,D,E,F,G,H) -> f1.0(A,B,C,D,E,F,I,J)    True
          f2.3(A,B,C,D,E,F,G,H) -> f1.1(A,B,C,D,E,F,I,J)    True
          f2.3(A,B,C,D,E,F,G,H) -> f1.2(A,B,C,D,E,F,I,J)    True
        Signature:
          {(f1.0,8);(f1.1,8);(f1.2,8);(f2.3,8);(f300.4,8)}
        Rule Graph:
          [0->{0},1->{1},2->{},3->{0},4->{1},5->{2}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Failure MAYBE
  + Considered Problem:
      Rules:
        f1.0(A,B,C,D,E,F,G,H)   -> f1.0(A,B,I,J,K,F,G,H)       [A >= 1 + B]
        f1.1(A,B,C,D,E,F,G,H)   -> f1.1(A,B,I,J,K,F,G,H)       [B >= 1 + A]
        f1.2(A,B,C,D,E,F,G,H)   -> f300.4(A,A,I,J,E,K,G,H)     [A = B]
        f2.3(A,B,C,D,E,F,G,H)   -> f1.0(A,B,C,D,E,F,I,J)       True
        f2.3(A,B,C,D,E,F,G,H)   -> f1.1(A,B,C,D,E,F,I,J)       True
        f2.3(A,B,C,D,E,F,G,H)   -> f1.2(A,B,C,D,E,F,I,J)       True
        f300.4(A,B,C,D,E,F,G,H) -> exitus616(A,B,C,D,E,F,G,H)  True
        f1.1(A,B,C,D,E,F,G,H)   -> exitus616(A,B,C,D,E,F,G,H)  True
        f1.0(A,B,C,D,E,F,G,H)   -> exitus616(A,B,C,D,E,F,G,H)  True
      Signature:
        {(exitus616,8);(f1.0,8);(f1.1,8);(f1.2,8);(f2.3,8);(f300.4,8)}
      Rule Graph:
        [0->{0,8},1->{1,7},2->{6},3->{0},4->{1},5->{2}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7,8]
        |
        +- p:[1] c: []
        |
        `- p:[0] c: []
MAYBE