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