MAYBE * Step 1: UnsatPaths MAYBE + Considered Problem: Rules: 0. f6(A,B,C) -> f9(A,D,C) [0 >= 1 + A] (?,1) 1. f6(A,B,C) -> f9(A,D,C) [A >= 1] (?,1) 2. f6(A,B,C) -> f17(0,B,C) [A = 0] (?,1) 3. f17(A,B,C) -> f24(A,B,C) [0 >= C] (?,1) 4. f17(A,B,C) -> f24(A,B,C) [C >= 2] (?,1) 5. f17(A,B,C) -> f24(A,B,0) [C = 1] (?,1) 6. f9(A,B,C) -> f17(A,0,1) [B = 0] (?,1) 7. f9(A,B,C) -> f6(D,B,C) [0 >= 1 + B] (?,1) 8. f9(A,B,C) -> f6(D,B,C) [B >= 1] (?,1) 9. f0(A,B,C) -> f6(D,B,0) True (1,1) Signature: {(f0,3);(f17,3);(f24,3);(f6,3);(f9,3)} Flow Graph: [0->{6,7,8},1->{6,7,8},2->{3,4,5},3->{},4->{},5->{},6->{3,4,5},7->{0,1,2},8->{0,1,2},9->{0,1,2}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(6,3),(6,4)] * Step 2: FromIts MAYBE + Considered Problem: Rules: 0. f6(A,B,C) -> f9(A,D,C) [0 >= 1 + A] (?,1) 1. f6(A,B,C) -> f9(A,D,C) [A >= 1] (?,1) 2. f6(A,B,C) -> f17(0,B,C) [A = 0] (?,1) 3. f17(A,B,C) -> f24(A,B,C) [0 >= C] (?,1) 4. f17(A,B,C) -> f24(A,B,C) [C >= 2] (?,1) 5. f17(A,B,C) -> f24(A,B,0) [C = 1] (?,1) 6. f9(A,B,C) -> f17(A,0,1) [B = 0] (?,1) 7. f9(A,B,C) -> f6(D,B,C) [0 >= 1 + B] (?,1) 8. f9(A,B,C) -> f6(D,B,C) [B >= 1] (?,1) 9. f0(A,B,C) -> f6(D,B,0) True (1,1) Signature: {(f0,3);(f17,3);(f24,3);(f6,3);(f9,3)} Flow Graph: [0->{6,7,8},1->{6,7,8},2->{3,4,5},3->{},4->{},5->{},6->{5},7->{0,1,2},8->{0,1,2},9->{0,1,2}] + Applied Processor: FromIts + Details: () * Step 3: Unfold MAYBE + Considered Problem: Rules: f6(A,B,C) -> f9(A,D,C) [0 >= 1 + A] f6(A,B,C) -> f9(A,D,C) [A >= 1] f6(A,B,C) -> f17(0,B,C) [A = 0] f17(A,B,C) -> f24(A,B,C) [0 >= C] f17(A,B,C) -> f24(A,B,C) [C >= 2] f17(A,B,C) -> f24(A,B,0) [C = 1] f9(A,B,C) -> f17(A,0,1) [B = 0] f9(A,B,C) -> f6(D,B,C) [0 >= 1 + B] f9(A,B,C) -> f6(D,B,C) [B >= 1] f0(A,B,C) -> f6(D,B,0) True Signature: {(f0,3);(f17,3);(f24,3);(f6,3);(f9,3)} Rule Graph: [0->{6,7,8},1->{6,7,8},2->{3,4,5},3->{},4->{},5->{},6->{5},7->{0,1,2},8->{0,1,2},9->{0,1,2}] + Applied Processor: Unfold + Details: () * Step 4: AddSinks MAYBE + Considered Problem: Rules: f6.0(A,B,C) -> f9.6(A,D,C) [0 >= 1 + A] f6.0(A,B,C) -> f9.7(A,D,C) [0 >= 1 + A] f6.0(A,B,C) -> f9.8(A,D,C) [0 >= 1 + A] f6.1(A,B,C) -> f9.6(A,D,C) [A >= 1] f6.1(A,B,C) -> f9.7(A,D,C) [A >= 1] f6.1(A,B,C) -> f9.8(A,D,C) [A >= 1] f6.2(A,B,C) -> f17.3(0,B,C) [A = 0] f6.2(A,B,C) -> f17.4(0,B,C) [A = 0] f6.2(A,B,C) -> f17.5(0,B,C) [A = 0] f17.3(A,B,C) -> f24.10(A,B,C) [0 >= C] f17.4(A,B,C) -> f24.10(A,B,C) [C >= 2] f17.5(A,B,C) -> f24.10(A,B,0) [C = 1] f9.6(A,B,C) -> f17.5(A,0,1) [B = 0] f9.7(A,B,C) -> f6.0(D,B,C) [0 >= 1 + B] f9.7(A,B,C) -> f6.1(D,B,C) [0 >= 1 + B] f9.7(A,B,C) -> f6.2(D,B,C) [0 >= 1 + B] f9.8(A,B,C) -> f6.0(D,B,C) [B >= 1] f9.8(A,B,C) -> f6.1(D,B,C) [B >= 1] f9.8(A,B,C) -> f6.2(D,B,C) [B >= 1] f0.9(A,B,C) -> f6.0(D,B,0) True f0.9(A,B,C) -> f6.1(D,B,0) True f0.9(A,B,C) -> f6.2(D,B,0) True Signature: {(f0.9,3);(f17.3,3);(f17.4,3);(f17.5,3);(f24.10,3);(f6.0,3);(f6.1,3);(f6.2,3);(f9.6,3);(f9.7,3);(f9.8,3)} Rule Graph: [0->{12},1->{13,14,15},2->{16,17,18},3->{12},4->{13,14,15},5->{16,17,18},6->{9},7->{10},8->{11},9->{} ,10->{},11->{},12->{11},13->{0,1,2},14->{3,4,5},15->{6,7,8},16->{0,1,2},17->{3,4,5},18->{6,7,8},19->{0,1,2} ,20->{3,4,5},21->{6,7,8}] + Applied Processor: AddSinks + Details: () * Step 5: Failure MAYBE + Considered Problem: Rules: f6.0(A,B,C) -> f9.6(A,D,C) [0 >= 1 + A] f6.0(A,B,C) -> f9.7(A,D,C) [0 >= 1 + A] f6.0(A,B,C) -> f9.8(A,D,C) [0 >= 1 + A] f6.1(A,B,C) -> f9.6(A,D,C) [A >= 1] f6.1(A,B,C) -> f9.7(A,D,C) [A >= 1] f6.1(A,B,C) -> f9.8(A,D,C) [A >= 1] f6.2(A,B,C) -> f17.3(0,B,C) [A = 0] f6.2(A,B,C) -> f17.4(0,B,C) [A = 0] f6.2(A,B,C) -> f17.5(0,B,C) [A = 0] f17.3(A,B,C) -> f24.10(A,B,C) [0 >= C] f17.4(A,B,C) -> f24.10(A,B,C) [C >= 2] f17.5(A,B,C) -> f24.10(A,B,0) [C = 1] f9.6(A,B,C) -> f17.5(A,0,1) [B = 0] f9.7(A,B,C) -> f6.0(D,B,C) [0 >= 1 + B] f9.7(A,B,C) -> f6.1(D,B,C) [0 >= 1 + B] f9.7(A,B,C) -> f6.2(D,B,C) [0 >= 1 + B] f9.8(A,B,C) -> f6.0(D,B,C) [B >= 1] f9.8(A,B,C) -> f6.1(D,B,C) [B >= 1] f9.8(A,B,C) -> f6.2(D,B,C) [B >= 1] f0.9(A,B,C) -> f6.0(D,B,0) True f0.9(A,B,C) -> f6.1(D,B,0) True f0.9(A,B,C) -> f6.2(D,B,0) True f24.10(A,B,C) -> exitus616(A,B,C) True f24.10(A,B,C) -> exitus616(A,B,C) True f24.10(A,B,C) -> exitus616(A,B,C) True f24.10(A,B,C) -> exitus616(A,B,C) True f24.10(A,B,C) -> exitus616(A,B,C) True f24.10(A,B,C) -> exitus616(A,B,C) True f24.10(A,B,C) -> exitus616(A,B,C) True f24.10(A,B,C) -> exitus616(A,B,C) True f24.10(A,B,C) -> exitus616(A,B,C) True f24.10(A,B,C) -> exitus616(A,B,C) True f24.10(A,B,C) -> exitus616(A,B,C) True f24.10(A,B,C) -> exitus616(A,B,C) True f24.10(A,B,C) -> exitus616(A,B,C) True f24.10(A,B,C) -> exitus616(A,B,C) True f24.10(A,B,C) -> exitus616(A,B,C) True f24.10(A,B,C) -> exitus616(A,B,C) True f24.10(A,B,C) -> exitus616(A,B,C) True f24.10(A,B,C) -> exitus616(A,B,C) True f24.10(A,B,C) -> exitus616(A,B,C) True Signature: {(exitus616,3) ;(f0.9,3) ;(f17.3,3) ;(f17.4,3) ;(f17.5,3) ;(f24.10,3) ;(f6.0,3) ;(f6.1,3) ;(f6.2,3) ;(f9.6,3) ;(f9.7,3) ;(f9.8,3)} Rule Graph: [0->{12},1->{13,14,15},2->{16,17,18},3->{12},4->{13,14,15},5->{16,17,18},6->{9},7->{10},8->{11},9->{24,27 ,30,35,38},10->{23,26,29,34,37},11->{22,25,28,31,32,33,36,39,40},12->{11},13->{0,1,2},14->{3,4,5},15->{6,7 ,8},16->{0,1,2},17->{3,4,5},18->{6,7,8},19->{0,1,2},20->{3,4,5},21->{6,7,8}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16,17,18,19,20,21,22,23,24,25,26,27,28,29,30,31,32,33,34,35,36,37,38,39,40] | `- p:[1,13,4,14,17,2,16,5] c: [] MAYBE