MAYBE
* Step 1: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f10(A,B,C,D,E,F) -> f4(4,0,0,D,E,F)     True                                                                             (1,1)
          1. f4(A,B,C,D,E,F)  -> f4(A,1 + B,G,H,E,G) [B >= 0 && -4 + A + B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && -4 + A >= 0] (?,1)
          2. f4(A,B,C,D,E,F)  -> f9(A,B,C,C,C,F)     [B >= 0 && -4 + A + B >= 0 && 4 + -1*A + B >= 0 && 4 + -1*A >= 0 && -4 + A >= 0] (?,1)
        Signature:
          {(f10,6);(f4,6);(f9,6)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f10(A,B,C,D,E,F) -> f4(4,0,0,D,E,F)      True
          f4(A,B,C,D,E,F)  -> f4(A,1 + B,G,H,E,G)  [B >= 0
                                                    && -4 + A + B >= 0
                                                    && 4 + -1*A + B >= 0
                                                    && 4 + -1*A >= 0
                                                    && -4 + A >= 0]
          f4(A,B,C,D,E,F)  -> f9(A,B,C,C,C,F)      [B >= 0
                                                    && -4 + A + B >= 0
                                                    && 4 + -1*A + B >= 0
                                                    && 4 + -1*A >= 0
                                                    && -4 + A >= 0]
        Signature:
          {(f10,6);(f4,6);(f9,6)}
        Rule Graph:
          [0->{1,2},1->{1,2},2->{}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: Failure MAYBE
  + Considered Problem:
      Rules:
        f10(A,B,C,D,E,F) -> f4(4,0,0,D,E,F)         True
        f4(A,B,C,D,E,F)  -> f4(A,1 + B,G,H,E,G)     [B >= 0
                                                     && -4 + A + B >= 0
                                                     && 4 + -1*A + B >= 0
                                                     && 4 + -1*A >= 0
                                                     && -4 + A >= 0]
        f4(A,B,C,D,E,F)  -> f9(A,B,C,C,C,F)         [B >= 0
                                                     && -4 + A + B >= 0
                                                     && 4 + -1*A + B >= 0
                                                     && 4 + -1*A >= 0
                                                     && -4 + A >= 0]
        f9(A,B,C,D,E,F)  -> exitus616(A,B,C,D,E,F)  True
      Signature:
        {(exitus616,6);(f10,6);(f4,6);(f9,6)}
      Rule Graph:
        [0->{1,2},1->{1,2},2->{3}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3]
        |
        `- p:[1] c: []
MAYBE