MAYBE
* Step 1: TrivialSCCs MAYBE
    + Considered Problem:
        Rules:
          0. f4(A,B,C,D,E)  -> f5(A,1,C,D,E)      [A >= 2]           (?,1)
          1. f4(A,B,C,D,E)  -> f5(A,0,C,D,E)      [1 >= A]           (?,1)
          2. f30(A,B,C,D,E) -> f4(2,B,2,F,E)      True               (1,1)
          3. f5(A,B,C,D,E)  -> f4(-1 + A,B,C,F,E) [0 >= F && F >= 1] (?,1)
          4. f5(A,B,C,D,E)  -> f4(1 + A,B,C,F,E)  [F >= 1]           (?,1)
          5. f5(A,B,C,D,E)  -> f3(A,B,C,D,0)      [0 >= B]           (?,1)
        Signature:
          {(f3,5);(f30,5);(f4,5);(f5,5)}
        Flow Graph:
          [0->{3,4,5},1->{3,4,5},2->{0,1},3->{0,1},4->{0,1},5->{}]
        
    + Applied Processor:
        TrivialSCCs
    + Details:
        All trivial SCCs of the transition graph admit timebound 1.
* Step 2: UnsatRules MAYBE
    + Considered Problem:
        Rules:
          0. f4(A,B,C,D,E)  -> f5(A,1,C,D,E)      [A >= 2]           (?,1)
          1. f4(A,B,C,D,E)  -> f5(A,0,C,D,E)      [1 >= A]           (?,1)
          2. f30(A,B,C,D,E) -> f4(2,B,2,F,E)      True               (1,1)
          3. f5(A,B,C,D,E)  -> f4(-1 + A,B,C,F,E) [0 >= F && F >= 1] (?,1)
          4. f5(A,B,C,D,E)  -> f4(1 + A,B,C,F,E)  [F >= 1]           (?,1)
          5. f5(A,B,C,D,E)  -> f3(A,B,C,D,0)      [0 >= B]           (1,1)
        Signature:
          {(f3,5);(f30,5);(f4,5);(f5,5)}
        Flow Graph:
          [0->{3,4,5},1->{3,4,5},2->{0,1},3->{0,1},4->{0,1},5->{}]
        
    + Applied Processor:
        UnsatRules
    + Details:
        Following transitions have unsatisfiable constraints and are removed:  [3]
* Step 3: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f4(A,B,C,D,E)  -> f5(A,1,C,D,E)     [A >= 2] (?,1)
          1. f4(A,B,C,D,E)  -> f5(A,0,C,D,E)     [1 >= A] (?,1)
          2. f30(A,B,C,D,E) -> f4(2,B,2,F,E)     True     (1,1)
          4. f5(A,B,C,D,E)  -> f4(1 + A,B,C,F,E) [F >= 1] (?,1)
          5. f5(A,B,C,D,E)  -> f3(A,B,C,D,0)     [0 >= B] (1,1)
        Signature:
          {(f3,5);(f30,5);(f4,5);(f5,5)}
        Flow Graph:
          [0->{4,5},1->{4,5},2->{0,1},4->{0,1},5->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,5),(2,1)]
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. f4(A,B,C,D,E)  -> f5(A,1,C,D,E)     [A >= 2] (?,1)
          1. f4(A,B,C,D,E)  -> f5(A,0,C,D,E)     [1 >= A] (?,1)
          2. f30(A,B,C,D,E) -> f4(2,B,2,F,E)     True     (1,1)
          4. f5(A,B,C,D,E)  -> f4(1 + A,B,C,F,E) [F >= 1] (?,1)
          5. f5(A,B,C,D,E)  -> f3(A,B,C,D,0)     [0 >= B] (1,1)
        Signature:
          {(f3,5);(f30,5);(f4,5);(f5,5)}
        Flow Graph:
          [0->{4},1->{4,5},2->{0},4->{0,1},5->{}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f4(A,B,C,D,E)  -> f5(A,1,C,D,E)        [A >= 2] (?,1)
          1. f4(A,B,C,D,E)  -> f5(A,0,C,D,E)        [1 >= A] (?,1)
          2. f30(A,B,C,D,E) -> f4(2,B,2,F,E)        True     (1,1)
          4. f5(A,B,C,D,E)  -> f4(1 + A,B,C,F,E)    [F >= 1] (?,1)
          5. f5(A,B,C,D,E)  -> f3(A,B,C,D,0)        [0 >= B] (?,1)
          6. f5(A,B,C,D,E)  -> exitus616(A,B,C,D,E) True     (?,1)
        Signature:
          {(exitus616,5);(f3,5);(f30,5);(f4,5);(f5,5)}
        Flow Graph:
          [0->{4,5,6},1->{4,5,6},2->{0,1},4->{0,1},5->{},6->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,5),(2,1)]
* Step 6: Failure MAYBE
  + Considered Problem:
      Rules:
        0. f4(A,B,C,D,E)  -> f5(A,1,C,D,E)        [A >= 2] (?,1)
        1. f4(A,B,C,D,E)  -> f5(A,0,C,D,E)        [1 >= A] (?,1)
        2. f30(A,B,C,D,E) -> f4(2,B,2,F,E)        True     (1,1)
        4. f5(A,B,C,D,E)  -> f4(1 + A,B,C,F,E)    [F >= 1] (?,1)
        5. f5(A,B,C,D,E)  -> f3(A,B,C,D,0)        [0 >= B] (?,1)
        6. f5(A,B,C,D,E)  -> exitus616(A,B,C,D,E) True     (?,1)
      Signature:
        {(exitus616,5);(f3,5);(f30,5);(f4,5);(f5,5)}
      Flow Graph:
        [0->{4,6},1->{4,5,6},2->{0},4->{0,1},5->{},6->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,4,5,6]
        |
        `- p:[0,4,1] c: [1]
           |
           `- p:[0,4] c: []
MAYBE