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