MAYBE * Step 1: UnsatPaths MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G) -> f10(1,1,H,0,2,1,G) [H >= 0] (1,1) 1. f10(A,B,C,D,E,F,G) -> f21(A,-1 + B,C,D,E,F,0) [F >= 1 && E >= F && B >= 1 && 0 >= C] (?,1) 2. f10(A,B,C,D,E,F,G) -> f21(1 + A,1 + A,H,D,E,F,I) [I >= 0 && 1 >= I && H >= 0 && F >= 1 && E >= F && 0 >= B && 0 >= C] (?,1) 3. f10(A,B,C,D,E,F,G) -> f21(A,B,-1 + C,D,E,F,H) [H >= 0 && 1 >= H && F >= 1 && C >= 1 && E >= F] (?,1) 4. f21(A,B,C,D,E,F,G) -> f10(A,B,C,D,E,-1 + F,G) [0 >= G] (?,1) 5. f21(A,B,C,D,E,F,G) -> f10(A,B,C,D,E,1 + F,G) [G >= 1] (?,1) 6. f10(A,B,C,D,E,F,G) -> f31(A,B,C,D,E,F,G) [0 >= F && E >= F] (?,1) 7. f10(A,B,C,D,E,F,G) -> f31(A,B,C,D,E,F,G) [F >= 1 + E] (?,1) Signature: {(f0,7);(f10,7);(f21,7);(f31,7)} Flow Graph: [0->{1,2,3,6,7},1->{4,5},2->{4,5},3->{4,5},4->{1,2,3,6,7},5->{1,2,3,6,7},6->{},7->{}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(0,2),(0,6),(0,7),(1,5)] * Step 2: FromIts MAYBE + Considered Problem: Rules: 0. f0(A,B,C,D,E,F,G) -> f10(1,1,H,0,2,1,G) [H >= 0] (1,1) 1. f10(A,B,C,D,E,F,G) -> f21(A,-1 + B,C,D,E,F,0) [F >= 1 && E >= F && B >= 1 && 0 >= C] (?,1) 2. f10(A,B,C,D,E,F,G) -> f21(1 + A,1 + A,H,D,E,F,I) [I >= 0 && 1 >= I && H >= 0 && F >= 1 && E >= F && 0 >= B && 0 >= C] (?,1) 3. f10(A,B,C,D,E,F,G) -> f21(A,B,-1 + C,D,E,F,H) [H >= 0 && 1 >= H && F >= 1 && C >= 1 && E >= F] (?,1) 4. f21(A,B,C,D,E,F,G) -> f10(A,B,C,D,E,-1 + F,G) [0 >= G] (?,1) 5. f21(A,B,C,D,E,F,G) -> f10(A,B,C,D,E,1 + F,G) [G >= 1] (?,1) 6. f10(A,B,C,D,E,F,G) -> f31(A,B,C,D,E,F,G) [0 >= F && E >= F] (?,1) 7. f10(A,B,C,D,E,F,G) -> f31(A,B,C,D,E,F,G) [F >= 1 + E] (?,1) Signature: {(f0,7);(f10,7);(f21,7);(f31,7)} Flow Graph: [0->{1,3},1->{4},2->{4,5},3->{4,5},4->{1,2,3,6,7},5->{1,2,3,6,7},6->{},7->{}] + Applied Processor: FromIts + Details: () * Step 3: Unfold MAYBE + Considered Problem: Rules: f0(A,B,C,D,E,F,G) -> f10(1,1,H,0,2,1,G) [H >= 0] f10(A,B,C,D,E,F,G) -> f21(A,-1 + B,C,D,E,F,0) [F >= 1 && E >= F && B >= 1 && 0 >= C] f10(A,B,C,D,E,F,G) -> f21(1 + A,1 + A,H,D,E,F,I) [I >= 0 && 1 >= I && H >= 0 && F >= 1 && E >= F && 0 >= B && 0 >= C] f10(A,B,C,D,E,F,G) -> f21(A,B,-1 + C,D,E,F,H) [H >= 0 && 1 >= H && F >= 1 && C >= 1 && E >= F] f21(A,B,C,D,E,F,G) -> f10(A,B,C,D,E,-1 + F,G) [0 >= G] f21(A,B,C,D,E,F,G) -> f10(A,B,C,D,E,1 + F,G) [G >= 1] f10(A,B,C,D,E,F,G) -> f31(A,B,C,D,E,F,G) [0 >= F && E >= F] f10(A,B,C,D,E,F,G) -> f31(A,B,C,D,E,F,G) [F >= 1 + E] Signature: {(f0,7);(f10,7);(f21,7);(f31,7)} Rule Graph: [0->{1,3},1->{4},2->{4,5},3->{4,5},4->{1,2,3,6,7},5->{1,2,3,6,7},6->{},7->{}] + Applied Processor: Unfold + Details: () * Step 4: AddSinks MAYBE + Considered Problem: Rules: f0.0(A,B,C,D,E,F,G) -> f10.1(1,1,H,0,2,1,G) [H >= 0] f0.0(A,B,C,D,E,F,G) -> f10.3(1,1,H,0,2,1,G) [H >= 0] f10.1(A,B,C,D,E,F,G) -> f21.4(A,-1 + B,C,D,E,F,0) [F >= 1 && E >= F && B >= 1 && 0 >= C] f10.2(A,B,C,D,E,F,G) -> f21.4(1 + A,1 + A,H,D,E,F,I) [I >= 0 && 1 >= I && H >= 0 && F >= 1 && E >= F && 0 >= B && 0 >= C] f10.2(A,B,C,D,E,F,G) -> f21.5(1 + A,1 + A,H,D,E,F,I) [I >= 0 && 1 >= I && H >= 0 && F >= 1 && E >= F && 0 >= B && 0 >= C] f10.3(A,B,C,D,E,F,G) -> f21.4(A,B,-1 + C,D,E,F,H) [H >= 0 && 1 >= H && F >= 1 && C >= 1 && E >= F] f10.3(A,B,C,D,E,F,G) -> f21.5(A,B,-1 + C,D,E,F,H) [H >= 0 && 1 >= H && F >= 1 && C >= 1 && E >= F] f21.4(A,B,C,D,E,F,G) -> f10.1(A,B,C,D,E,-1 + F,G) [0 >= G] f21.4(A,B,C,D,E,F,G) -> f10.2(A,B,C,D,E,-1 + F,G) [0 >= G] f21.4(A,B,C,D,E,F,G) -> f10.3(A,B,C,D,E,-1 + F,G) [0 >= G] f21.4(A,B,C,D,E,F,G) -> f10.6(A,B,C,D,E,-1 + F,G) [0 >= G] f21.4(A,B,C,D,E,F,G) -> f10.7(A,B,C,D,E,-1 + F,G) [0 >= G] f21.5(A,B,C,D,E,F,G) -> f10.1(A,B,C,D,E,1 + F,G) [G >= 1] f21.5(A,B,C,D,E,F,G) -> f10.2(A,B,C,D,E,1 + F,G) [G >= 1] f21.5(A,B,C,D,E,F,G) -> f10.3(A,B,C,D,E,1 + F,G) [G >= 1] f21.5(A,B,C,D,E,F,G) -> f10.6(A,B,C,D,E,1 + F,G) [G >= 1] f21.5(A,B,C,D,E,F,G) -> f10.7(A,B,C,D,E,1 + F,G) [G >= 1] f10.6(A,B,C,D,E,F,G) -> f31.8(A,B,C,D,E,F,G) [0 >= F && E >= F] f10.7(A,B,C,D,E,F,G) -> f31.8(A,B,C,D,E,F,G) [F >= 1 + E] Signature: {(f0.0,7);(f10.1,7);(f10.2,7);(f10.3,7);(f10.6,7);(f10.7,7);(f21.4,7);(f21.5,7);(f31.8,7)} Rule Graph: [0->{2},1->{5,6},2->{7,8,9,10,11},3->{7,8,9,10,11},4->{12,13,14,15,16},5->{7,8,9,10,11},6->{12,13,14,15 ,16},7->{2},8->{3,4},9->{5,6},10->{17},11->{18},12->{2},13->{3,4},14->{5,6},15->{17},16->{18},17->{},18->{}] + Applied Processor: AddSinks + Details: () * Step 5: Failure MAYBE + Considered Problem: Rules: f0.0(A,B,C,D,E,F,G) -> f10.1(1,1,H,0,2,1,G) [H >= 0] f0.0(A,B,C,D,E,F,G) -> f10.3(1,1,H,0,2,1,G) [H >= 0] f10.1(A,B,C,D,E,F,G) -> f21.4(A,-1 + B,C,D,E,F,0) [F >= 1 && E >= F && B >= 1 && 0 >= C] f10.2(A,B,C,D,E,F,G) -> f21.4(1 + A,1 + A,H,D,E,F,I) [I >= 0 && 1 >= I && H >= 0 && F >= 1 && E >= F && 0 >= B && 0 >= C] f10.2(A,B,C,D,E,F,G) -> f21.5(1 + A,1 + A,H,D,E,F,I) [I >= 0 && 1 >= I && H >= 0 && F >= 1 && E >= F && 0 >= B && 0 >= C] f10.3(A,B,C,D,E,F,G) -> f21.4(A,B,-1 + C,D,E,F,H) [H >= 0 && 1 >= H && F >= 1 && C >= 1 && E >= F] f10.3(A,B,C,D,E,F,G) -> f21.5(A,B,-1 + C,D,E,F,H) [H >= 0 && 1 >= H && F >= 1 && C >= 1 && E >= F] f21.4(A,B,C,D,E,F,G) -> f10.1(A,B,C,D,E,-1 + F,G) [0 >= G] f21.4(A,B,C,D,E,F,G) -> f10.2(A,B,C,D,E,-1 + F,G) [0 >= G] f21.4(A,B,C,D,E,F,G) -> f10.3(A,B,C,D,E,-1 + F,G) [0 >= G] f21.4(A,B,C,D,E,F,G) -> f10.6(A,B,C,D,E,-1 + F,G) [0 >= G] f21.4(A,B,C,D,E,F,G) -> f10.7(A,B,C,D,E,-1 + F,G) [0 >= G] f21.5(A,B,C,D,E,F,G) -> f10.1(A,B,C,D,E,1 + F,G) [G >= 1] f21.5(A,B,C,D,E,F,G) -> f10.2(A,B,C,D,E,1 + F,G) [G >= 1] f21.5(A,B,C,D,E,F,G) -> f10.3(A,B,C,D,E,1 + F,G) [G >= 1] f21.5(A,B,C,D,E,F,G) -> f10.6(A,B,C,D,E,1 + F,G) [G >= 1] f21.5(A,B,C,D,E,F,G) -> f10.7(A,B,C,D,E,1 + F,G) [G >= 1] f10.6(A,B,C,D,E,F,G) -> f31.8(A,B,C,D,E,F,G) [0 >= F && E >= F] f10.7(A,B,C,D,E,F,G) -> f31.8(A,B,C,D,E,F,G) [F >= 1 + E] f31.8(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True f31.8(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True f31.8(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True f31.8(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True f31.8(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True f31.8(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True f31.8(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True f31.8(A,B,C,D,E,F,G) -> exitus616(A,B,C,D,E,F,G) True Signature: {(exitus616,7);(f0.0,7);(f10.1,7);(f10.2,7);(f10.3,7);(f10.6,7);(f10.7,7);(f21.4,7);(f21.5,7);(f31.8,7)} Rule Graph: [0->{2},1->{5,6},2->{7,8,9,10,11},3->{7,8,9,10,11},4->{12,13,14,15,16},5->{7,8,9,10,11},6->{12,13,14,15 ,16},7->{2},8->{3,4},9->{5,6},10->{17},11->{18},12->{2},13->{3,4},14->{5,6},15->{17},16->{18},17->{20,22,24 ,26},18->{19,21,23,25}] + 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] | `- p:[2,7,3,8,5,9,14,4,13,6,12] c: [] MAYBE