MAYBE
* Step 1: UnsatPaths MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f3(0,B)     True               (1,1)
          1. f3(A,B) -> f3(1 + C,B) [A = 5]            (?,1)
          2. f3(A,B) -> f3(1 + A,A) [9 >= A && 4 >= A] (?,1)
          3. f3(A,B) -> f3(1 + A,A) [9 >= A && A >= 6] (?,1)
          4. f3(A,B) -> f12(A,B)    [A >= 10]          (?,1)
        Signature:
          {(f0,2);(f12,2);(f3,2)}
        Flow Graph:
          [0->{1,2,3,4},1->{1,2,3,4},2->{1,2,3,4},3->{1,2,3,4},4->{}]
        
    + Applied Processor:
        UnsatPaths
    + Details:
        We remove following edges from the transition graph: [(0,1),(0,3),(0,4),(2,3),(2,4),(3,1),(3,2)]
* Step 2: FromIts MAYBE
    + Considered Problem:
        Rules:
          0. f0(A,B) -> f3(0,B)     True               (1,1)
          1. f3(A,B) -> f3(1 + C,B) [A = 5]            (?,1)
          2. f3(A,B) -> f3(1 + A,A) [9 >= A && 4 >= A] (?,1)
          3. f3(A,B) -> f3(1 + A,A) [9 >= A && A >= 6] (?,1)
          4. f3(A,B) -> f12(A,B)    [A >= 10]          (?,1)
        Signature:
          {(f0,2);(f12,2);(f3,2)}
        Flow Graph:
          [0->{2},1->{1,2,3,4},2->{1,2},3->{3,4},4->{}]
        
    + Applied Processor:
        FromIts
    + Details:
        ()
* Step 3: Unfold MAYBE
    + Considered Problem:
        Rules:
          f0(A,B) -> f3(0,B)      True
          f3(A,B) -> f3(1 + C,B)  [A = 5]
          f3(A,B) -> f3(1 + A,A)  [9 >= A && 4 >= A]
          f3(A,B) -> f3(1 + A,A)  [9 >= A && A >= 6]
          f3(A,B) -> f12(A,B)     [A >= 10]
        Signature:
          {(f0,2);(f12,2);(f3,2)}
        Rule Graph:
          [0->{2},1->{1,2,3,4},2->{1,2},3->{3,4},4->{}]
    + Applied Processor:
        Unfold
    + Details:
        ()
* Step 4: AddSinks MAYBE
    + Considered Problem:
        Rules:
          f0.0(A,B) -> f3.2(0,B)      True
          f3.1(A,B) -> f3.1(1 + C,B)  [A = 5]
          f3.1(A,B) -> f3.2(1 + C,B)  [A = 5]
          f3.1(A,B) -> f3.3(1 + C,B)  [A = 5]
          f3.1(A,B) -> f3.4(1 + C,B)  [A = 5]
          f3.2(A,B) -> f3.1(1 + A,A)  [9 >= A && 4 >= A]
          f3.2(A,B) -> f3.2(1 + A,A)  [9 >= A && 4 >= A]
          f3.3(A,B) -> f3.3(1 + A,A)  [9 >= A && A >= 6]
          f3.3(A,B) -> f3.4(1 + A,A)  [9 >= A && A >= 6]
          f3.4(A,B) -> f12.5(A,B)     [A >= 10]
        Signature:
          {(f0.0,2);(f12.5,2);(f3.1,2);(f3.2,2);(f3.3,2);(f3.4,2)}
        Rule Graph:
          [0->{5,6},1->{1,2,3,4},2->{5,6},3->{7,8},4->{9},5->{1,2,3,4},6->{5,6},7->{7,8},8->{9},9->{}]
    + Applied Processor:
        AddSinks
    + Details:
        ()
* Step 5: Failure MAYBE
  + Considered Problem:
      Rules:
        f0.0(A,B)  -> f3.2(0,B)       True
        f3.1(A,B)  -> f3.1(1 + C,B)   [A = 5]
        f3.1(A,B)  -> f3.2(1 + C,B)   [A = 5]
        f3.1(A,B)  -> f3.3(1 + C,B)   [A = 5]
        f3.1(A,B)  -> f3.4(1 + C,B)   [A = 5]
        f3.2(A,B)  -> f3.1(1 + A,A)   [9 >= A && 4 >= A]
        f3.2(A,B)  -> f3.2(1 + A,A)   [9 >= A && 4 >= A]
        f3.3(A,B)  -> f3.3(1 + A,A)   [9 >= A && A >= 6]
        f3.3(A,B)  -> f3.4(1 + A,A)   [9 >= A && A >= 6]
        f3.4(A,B)  -> f12.5(A,B)      [A >= 10]
        f12.5(A,B) -> exitus616(A,B)  True
        f12.5(A,B) -> exitus616(A,B)  True
      Signature:
        {(exitus616,2);(f0.0,2);(f12.5,2);(f3.1,2);(f3.2,2);(f3.3,2);(f3.4,2)}
      Rule Graph:
        [0->{5,6},1->{1,2,3,4},2->{5,6},3->{7,8},4->{9},5->{1,2,3,4},6->{5,6},7->{7,8},8->{9},9->{10,11}]
  + Applied Processor:
      Decompose Greedy
  + Details:
      We construct a looptree:
        P: [0,1,2,3,4,5,6,7,8,9,10,11]
        |
        +- p:[5,2,1,6] c: []
        |
        `- p:[7] c: [7]
MAYBE