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