MAYBE
* Step 1: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F) -> f0(-1*A,A + B,A + C,D,E,F)      [0 >= 1 + A]             (?,1)
          1. f0(A,B,C,D,E,F) -> f0(A + B,-1*B,C,B + D,E,F)      [0 >= 1 + B]             (?,1)
          2. f0(A,B,C,D,E,F) -> f0(A,B + D,C,-1*D,D + E,F)      [0 >= 1 + D]             (?,1)
          3. f0(A,B,C,D,E,F) -> f0(A,B,C + E,D + E,-1*E,F)      [0 >= 1 + E]             (?,1)
          4. f0(A,B,C,D,E,F) -> f0(A + C,B,-1*C,D,C + E,F)      [0 >= 1 + C]             (?,1)
          5. f1(A,B,C,D,E,F) -> f0(G,H,K,I,J,G + H + I + J + K) [G + H + I + J + K >= 1] (1,1)
        Signature:
          {(f0,6);(f1,6)}
        Flow Graph:
          [0->{0,1,2,3,4},1->{0,1,2,3,4},2->{0,1,2,3,4},3->{0,1,2,3,4},4->{0,1,2,3,4},5->{0,1,2,3,4}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,0),(1,1),(2,2),(3,3),(4,4)]
* Step 2: AddSinks MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F) -> f0(-1*A,A + B,A + C,D,E,F)      [0 >= 1 + A]             (?,1)
          1. f0(A,B,C,D,E,F) -> f0(A + B,-1*B,C,B + D,E,F)      [0 >= 1 + B]             (?,1)
          2. f0(A,B,C,D,E,F) -> f0(A,B + D,C,-1*D,D + E,F)      [0 >= 1 + D]             (?,1)
          3. f0(A,B,C,D,E,F) -> f0(A,B,C + E,D + E,-1*E,F)      [0 >= 1 + E]             (?,1)
          4. f0(A,B,C,D,E,F) -> f0(A + C,B,-1*C,D,C + E,F)      [0 >= 1 + C]             (?,1)
          5. f1(A,B,C,D,E,F) -> f0(G,H,K,I,J,G + H + I + J + K) [G + H + I + J + K >= 1] (1,1)
        Signature:
          {(f0,6);(f1,6)}
        Flow Graph:
          [0->{1,2,3,4},1->{0,2,3,4},2->{0,1,3,4},3->{0,1,2,4},4->{0,1,2,3},5->{0,1,2,3,4}]
        
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C,D,E,F) -> f0(-1*A,A + B,A + C,D,E,F)      [0 >= 1 + A]             (?,1)
          1. f0(A,B,C,D,E,F) -> f0(A + B,-1*B,C,B + D,E,F)      [0 >= 1 + B]             (?,1)
          2. f0(A,B,C,D,E,F) -> f0(A,B + D,C,-1*D,D + E,F)      [0 >= 1 + D]             (?,1)
          3. f0(A,B,C,D,E,F) -> f0(A,B,C + E,D + E,-1*E,F)      [0 >= 1 + E]             (?,1)
          4. f0(A,B,C,D,E,F) -> f0(A + C,B,-1*C,D,C + E,F)      [0 >= 1 + C]             (?,1)
          5. f1(A,B,C,D,E,F) -> f0(G,H,K,I,J,G + H + I + J + K) [G + H + I + J + K >= 1] (1,1)
          6. f0(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F)          True                     (?,1)
        Signature:
          {(exitus616,6);(f0,6);(f1,6)}
        Flow Graph:
          [0->{0,1,2,3,4,6},1->{0,1,2,3,4,6},2->{0,1,2,3,4,6},3->{0,1,2,3,4,6},4->{0,1,2,3,4,6},5->{0,1,2,3,4,6}
          ,6->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,0),(1,1),(2,2),(3,3),(4,4)]
* Step 4: Failure MAYBE
  + Considered Problem:
      Rules:
        0. f0(A,B,C,D,E,F) -> f0(-1*A,A + B,A + C,D,E,F)      [0 >= 1 + A]             (?,1)
        1. f0(A,B,C,D,E,F) -> f0(A + B,-1*B,C,B + D,E,F)      [0 >= 1 + B]             (?,1)
        2. f0(A,B,C,D,E,F) -> f0(A,B + D,C,-1*D,D + E,F)      [0 >= 1 + D]             (?,1)
        3. f0(A,B,C,D,E,F) -> f0(A,B,C + E,D + E,-1*E,F)      [0 >= 1 + E]             (?,1)
        4. f0(A,B,C,D,E,F) -> f0(A + C,B,-1*C,D,C + E,F)      [0 >= 1 + C]             (?,1)
        5. f1(A,B,C,D,E,F) -> f0(G,H,K,I,J,G + H + I + J + K) [G + H + I + J + K >= 1] (1,1)
        6. f0(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F)          True                     (?,1)
      Signature:
        {(exitus616,6);(f0,6);(f1,6)}
      Flow Graph:
        [0->{1,2,3,4,6},1->{0,2,3,4,6},2->{0,1,3,4,6},3->{0,1,2,4,6},4->{0,1,2,3,6},5->{0,1,2,3,4,6},6->{}]
      
  + Applied Processor:
      LooptreeTransformer
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6]
        |
        `- p:[0,1,2,3,4] c: []
MAYBE