MAYBE
* Step 1: UnreachableRules MAYBE
    + Considered Problem:
        Rules:
          0. f10(A,B,C,D,E) -> f10(-1 + A,-1 + B,1 + C,F,E) [A >= 1 && F >= 1]               (?,1)
          1. f10(A,B,C,D,E) -> f10(-1 + A,B,C,F,E)          [0 >= F && A >= 1 && A >= 1 + B] (?,1)
          2. f20(A,B,C,D,E) -> f20(A,B,C,D,E)               True                             (?,1)
          3. f22(A,B,C,D,E) -> f25(A,B,C,D,E)               True                             (?,1)
          4. f10(A,B,C,D,E) -> f20(A,B,C,D,E)               [0 >= A]                         (?,1)
          5. f0(A,B,C,D,E)  -> f10(8,F,0,D,8)               [F >= 1]                         (1,1)
        Signature:
          {(f0,5);(f10,5);(f20,5);(f22,5);(f25,5)}
        Flow Graph:
          [0->{0,1,4},1->{0,1,4},2->{2},3->{},4->{2},5->{0,1,4}]
        
    + Applied Processor:
        UnreachableRules
    + Details:
        Following transitions are not reachable from the starting states and are revomed: [3]
* Step 2: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f10(A,B,C,D,E) -> f10(-1 + A,-1 + B,1 + C,F,E) [A >= 1 && F >= 1]               (?,1)
          1. f10(A,B,C,D,E) -> f10(-1 + A,B,C,F,E)          [0 >= F && A >= 1 && A >= 1 + B] (?,1)
          2. f20(A,B,C,D,E) -> f20(A,B,C,D,E)               True                             (?,1)
          4. f10(A,B,C,D,E) -> f20(A,B,C,D,E)               [0 >= A]                         (?,1)
          5. f0(A,B,C,D,E)  -> f10(8,F,0,D,8)               [F >= 1]                         (1,1)
        Signature:
          {(f0,5);(f10,5);(f20,5);(f22,5);(f25,5)}
        Flow Graph:
          [0->{0,1,4},1->{0,1,4},2->{2},4->{2},5->{0,1,4}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(5,4)]
* Step 3: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f10(A,B,C,D,E) -> f10(-1 + A,-1 + B,1 + C,F,E) [A >= 1 && F >= 1]               (?,1)
          1. f10(A,B,C,D,E) -> f10(-1 + A,B,C,F,E)          [0 >= F && A >= 1 && A >= 1 + B] (?,1)
          2. f20(A,B,C,D,E) -> f20(A,B,C,D,E)               True                             (?,1)
          4. f10(A,B,C,D,E) -> f20(A,B,C,D,E)               [0 >= A]                         (?,1)
          5. f0(A,B,C,D,E)  -> f10(8,F,0,D,8)               [F >= 1]                         (1,1)
        Signature:
          {(f0,5);(f10,5);(f20,5);(f22,5);(f25,5)}
        Flow Graph:
          [0->{0,1,4},1->{0,1,4},2->{2},4->{2},5->{0,1}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 4: Unfold MAYBE
    + Considered Problem:
        Rules:
          f10(A,B,C,D,E) -> f10(-1 + A,-1 + B,1 + C,F,E)  [A >= 1 && F >= 1]
          f10(A,B,C,D,E) -> f10(-1 + A,B,C,F,E)           [0 >= F && A >= 1 && A >= 1 + B]
          f20(A,B,C,D,E) -> f20(A,B,C,D,E)                True
          f10(A,B,C,D,E) -> f20(A,B,C,D,E)                [0 >= A]
          f0(A,B,C,D,E)  -> f10(8,F,0,D,8)                [F >= 1]
        Signature:
          {(f0,5);(f10,5);(f20,5);(f22,5);(f25,5)}
        Rule Graph:
          [0->{0,1,4},1->{0,1,4},2->{2},4->{2},5->{0,1}]
    + Applied Processor:
        Unfold
    + Details:
        ()
* Step 5: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f10.0(A,B,C,D,E) -> f10.0(-1 + A,-1 + B,1 + C,F,E)  [A >= 1 && F >= 1]
          f10.0(A,B,C,D,E) -> f10.1(-1 + A,-1 + B,1 + C,F,E)  [A >= 1 && F >= 1]
          f10.0(A,B,C,D,E) -> f10.4(-1 + A,-1 + B,1 + C,F,E)  [A >= 1 && F >= 1]
          f10.1(A,B,C,D,E) -> f10.0(-1 + A,B,C,F,E)           [0 >= F && A >= 1 && A >= 1 + B]
          f10.1(A,B,C,D,E) -> f10.1(-1 + A,B,C,F,E)           [0 >= F && A >= 1 && A >= 1 + B]
          f10.1(A,B,C,D,E) -> f10.4(-1 + A,B,C,F,E)           [0 >= F && A >= 1 && A >= 1 + B]
          f20.2(A,B,C,D,E) -> f20.2(A,B,C,D,E)                True
          f10.4(A,B,C,D,E) -> f20.2(A,B,C,D,E)                [0 >= A]
          f0.5(A,B,C,D,E)  -> f10.0(8,F,0,D,8)                [F >= 1]
          f0.5(A,B,C,D,E)  -> f10.1(8,F,0,D,8)                [F >= 1]
        Signature:
          {(f0.5,5);(f10.0,5);(f10.1,5);(f10.4,5);(f20.2,5)}
        Rule Graph:
          [0->{0,1,2},1->{3,4,5},2->{7},3->{0,1,2},4->{3,4,5},5->{7},6->{6},7->{6},8->{0,1,2},9->{3,4,5}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 6: Failure MAYBE
  + Considered Problem:
      Rules:
        f10.0(A,B,C,D,E) -> f10.0(-1 + A,-1 + B,1 + C,F,E)  [A >= 1 && F >= 1]
        f10.0(A,B,C,D,E) -> f10.1(-1 + A,-1 + B,1 + C,F,E)  [A >= 1 && F >= 1]
        f10.0(A,B,C,D,E) -> f10.4(-1 + A,-1 + B,1 + C,F,E)  [A >= 1 && F >= 1]
        f10.1(A,B,C,D,E) -> f10.0(-1 + A,B,C,F,E)           [0 >= F && A >= 1 && A >= 1 + B]
        f10.1(A,B,C,D,E) -> f10.1(-1 + A,B,C,F,E)           [0 >= F && A >= 1 && A >= 1 + B]
        f10.1(A,B,C,D,E) -> f10.4(-1 + A,B,C,F,E)           [0 >= F && A >= 1 && A >= 1 + B]
        f20.2(A,B,C,D,E) -> f20.2(A,B,C,D,E)                True
        f10.4(A,B,C,D,E) -> f20.2(A,B,C,D,E)                [0 >= A]
        f0.5(A,B,C,D,E)  -> f10.0(8,F,0,D,8)                [F >= 1]
        f0.5(A,B,C,D,E)  -> f10.1(8,F,0,D,8)                [F >= 1]
        f20.2(A,B,C,D,E) -> exitus616(A,B,C,D,E)            True
        f20.2(A,B,C,D,E) -> exitus616(A,B,C,D,E)            True
        f20.2(A,B,C,D,E) -> exitus616(A,B,C,D,E)            True
        f20.2(A,B,C,D,E) -> exitus616(A,B,C,D,E)            True
      Signature:
        {(exitus616,5);(f0.5,5);(f10.0,5);(f10.1,5);(f10.4,5);(f20.2,5)}
      Rule Graph:
        [0->{0,1,2},1->{3,4,5},2->{7},3->{0,1,2},4->{3,4,5},5->{7},6->{6,10,11,12,13},7->{6},8->{0,1,2},9->{3,4
        ,5}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13]
        |
        +- p:[0,3,1,4] c: [0,1,3,4]
        |
        `- p:[6] c: []
MAYBE