MAYBE
* Step 1: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B,C) -> f5(0,0,C)             True (1,1)
          1. f5(A,B,C) -> f5(1 + A,2 + B,D + E) True (?,1)
          2. f5(A,B,C) -> f16(A,B,C)            True (?,1)
        Signature:
          {(f0,3);(f16,3);(f5,3)}
        Flow Graph:
          [0->{1,2},1->{1,2},2->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 2: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f0(A,B,C) -> f5(0,0,C)              True
          f5(A,B,C) -> f5(1 + A,2 + B,D + E)  True
          f5(A,B,C) -> f16(A,B,C)             True
        Signature:
          {(f0,3);(f16,3);(f5,3)}
        Rule Graph:
          [0->{1,2},1->{1,2},2->{}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 3: Failure MAYBE
  + Considered Problem:
      Rules:
        f0(A,B,C)  -> f5(0,0,C)              True
        f5(A,B,C)  -> f5(1 + A,2 + B,D + E)  True
        f5(A,B,C)  -> f16(A,B,C)             True
        f16(A,B,C) -> exitus616(A,B,C)       True
      Signature:
        {(exitus616,3);(f0,3);(f16,3);(f5,3)}
      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