MAYBE * Step 1: UnsatPaths MAYBE + Considered Problem: Rules: 0. f300(A,B,C) -> f2(A,B,C) True (1,1) 1. f2(A,B,C) -> f1(A,0,D) [0 >= A] (?,1) 2. f2(A,B,C) -> f2(A,0,C) [A >= 1] (?,1) 3. f2(A,B,C) -> f1(-1 + A,D,E) [0 >= 1 + D && 1 >= A] (?,1) 4. f2(A,B,C) -> f1(-1 + A,D,E) [D >= 1 && 1 >= A] (?,1) 5. f2(A,B,C) -> f2(-1 + A,D,C) [0 >= 1 + D && A >= 2] (?,1) 6. f2(A,B,C) -> f2(-1 + A,D,C) [D >= 1 && A >= 2] (?,1) Signature: {(f1,3);(f2,3);(f300,3)} Flow Graph: [0->{1,2,3,4,5,6},1->{},2->{1,2,3,4,5,6},3->{},4->{},5->{1,2,3,4,5,6},6->{1,2,3,4,5,6}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(2,1),(5,1),(6,1)] * Step 2: FromIts MAYBE + Considered Problem: Rules: 0. f300(A,B,C) -> f2(A,B,C) True (1,1) 1. f2(A,B,C) -> f1(A,0,D) [0 >= A] (?,1) 2. f2(A,B,C) -> f2(A,0,C) [A >= 1] (?,1) 3. f2(A,B,C) -> f1(-1 + A,D,E) [0 >= 1 + D && 1 >= A] (?,1) 4. f2(A,B,C) -> f1(-1 + A,D,E) [D >= 1 && 1 >= A] (?,1) 5. f2(A,B,C) -> f2(-1 + A,D,C) [0 >= 1 + D && A >= 2] (?,1) 6. f2(A,B,C) -> f2(-1 + A,D,C) [D >= 1 && A >= 2] (?,1) Signature: {(f1,3);(f2,3);(f300,3)} Flow Graph: [0->{1,2,3,4,5,6},1->{},2->{2,3,4,5,6},3->{},4->{},5->{2,3,4,5,6},6->{2,3,4,5,6}] + Applied Processor: FromIts + Details: () * Step 3: Unfold MAYBE + Considered Problem: Rules: f300(A,B,C) -> f2(A,B,C) True f2(A,B,C) -> f1(A,0,D) [0 >= A] f2(A,B,C) -> f2(A,0,C) [A >= 1] f2(A,B,C) -> f1(-1 + A,D,E) [0 >= 1 + D && 1 >= A] f2(A,B,C) -> f1(-1 + A,D,E) [D >= 1 && 1 >= A] f2(A,B,C) -> f2(-1 + A,D,C) [0 >= 1 + D && A >= 2] f2(A,B,C) -> f2(-1 + A,D,C) [D >= 1 && A >= 2] Signature: {(f1,3);(f2,3);(f300,3)} Rule Graph: [0->{1,2,3,4,5,6},1->{},2->{2,3,4,5,6},3->{},4->{},5->{2,3,4,5,6},6->{2,3,4,5,6}] + Applied Processor: Unfold + Details: () * Step 4: AddSinks MAYBE + Considered Problem: Rules: f300.0(A,B,C) -> f2.1(A,B,C) True f300.0(A,B,C) -> f2.2(A,B,C) True f300.0(A,B,C) -> f2.3(A,B,C) True f300.0(A,B,C) -> f2.4(A,B,C) True f300.0(A,B,C) -> f2.5(A,B,C) True f300.0(A,B,C) -> f2.6(A,B,C) True f2.1(A,B,C) -> f1.7(A,0,D) [0 >= A] f2.2(A,B,C) -> f2.2(A,0,C) [A >= 1] f2.2(A,B,C) -> f2.3(A,0,C) [A >= 1] f2.2(A,B,C) -> f2.4(A,0,C) [A >= 1] f2.2(A,B,C) -> f2.5(A,0,C) [A >= 1] f2.2(A,B,C) -> f2.6(A,0,C) [A >= 1] f2.3(A,B,C) -> f1.7(-1 + A,D,E) [0 >= 1 + D && 1 >= A] f2.4(A,B,C) -> f1.7(-1 + A,D,E) [D >= 1 && 1 >= A] f2.5(A,B,C) -> f2.2(-1 + A,D,C) [0 >= 1 + D && A >= 2] f2.5(A,B,C) -> f2.3(-1 + A,D,C) [0 >= 1 + D && A >= 2] f2.5(A,B,C) -> f2.4(-1 + A,D,C) [0 >= 1 + D && A >= 2] f2.5(A,B,C) -> f2.5(-1 + A,D,C) [0 >= 1 + D && A >= 2] f2.5(A,B,C) -> f2.6(-1 + A,D,C) [0 >= 1 + D && A >= 2] f2.6(A,B,C) -> f2.2(-1 + A,D,C) [D >= 1 && A >= 2] f2.6(A,B,C) -> f2.3(-1 + A,D,C) [D >= 1 && A >= 2] f2.6(A,B,C) -> f2.4(-1 + A,D,C) [D >= 1 && A >= 2] f2.6(A,B,C) -> f2.5(-1 + A,D,C) [D >= 1 && A >= 2] f2.6(A,B,C) -> f2.6(-1 + A,D,C) [D >= 1 && A >= 2] Signature: {(f1.7,3);(f2.1,3);(f2.2,3);(f2.3,3);(f2.4,3);(f2.5,3);(f2.6,3);(f300.0,3)} Rule Graph: [0->{6},1->{7,8,9,10,11},2->{12},3->{13},4->{14,15,16,17,18},5->{19,20,21,22,23},6->{},7->{7,8,9,10,11} ,8->{12},9->{13},10->{14,15,16,17,18},11->{19,20,21,22,23},12->{},13->{},14->{7,8,9,10,11},15->{12},16->{13} ,17->{14,15,16,17,18},18->{19,20,21,22,23},19->{7,8,9,10,11},20->{12},21->{13},22->{14,15,16,17,18},23->{19 ,20,21,22,23}] + Applied Processor: AddSinks + Details: () * Step 5: Failure MAYBE + Considered Problem: Rules: f300.0(A,B,C) -> f2.1(A,B,C) True f300.0(A,B,C) -> f2.2(A,B,C) True f300.0(A,B,C) -> f2.3(A,B,C) True f300.0(A,B,C) -> f2.4(A,B,C) True f300.0(A,B,C) -> f2.5(A,B,C) True f300.0(A,B,C) -> f2.6(A,B,C) True f2.1(A,B,C) -> f1.7(A,0,D) [0 >= A] f2.2(A,B,C) -> f2.2(A,0,C) [A >= 1] f2.2(A,B,C) -> f2.3(A,0,C) [A >= 1] f2.2(A,B,C) -> f2.4(A,0,C) [A >= 1] f2.2(A,B,C) -> f2.5(A,0,C) [A >= 1] f2.2(A,B,C) -> f2.6(A,0,C) [A >= 1] f2.3(A,B,C) -> f1.7(-1 + A,D,E) [0 >= 1 + D && 1 >= A] f2.4(A,B,C) -> f1.7(-1 + A,D,E) [D >= 1 && 1 >= A] f2.5(A,B,C) -> f2.2(-1 + A,D,C) [0 >= 1 + D && A >= 2] f2.5(A,B,C) -> f2.3(-1 + A,D,C) [0 >= 1 + D && A >= 2] f2.5(A,B,C) -> f2.4(-1 + A,D,C) [0 >= 1 + D && A >= 2] f2.5(A,B,C) -> f2.5(-1 + A,D,C) [0 >= 1 + D && A >= 2] f2.5(A,B,C) -> f2.6(-1 + A,D,C) [0 >= 1 + D && A >= 2] f2.6(A,B,C) -> f2.2(-1 + A,D,C) [D >= 1 && A >= 2] f2.6(A,B,C) -> f2.3(-1 + A,D,C) [D >= 1 && A >= 2] f2.6(A,B,C) -> f2.4(-1 + A,D,C) [D >= 1 && A >= 2] f2.6(A,B,C) -> f2.5(-1 + A,D,C) [D >= 1 && A >= 2] f2.6(A,B,C) -> f2.6(-1 + A,D,C) [D >= 1 && A >= 2] f1.7(A,B,C) -> exitus616(A,B,C) True f1.7(A,B,C) -> exitus616(A,B,C) True f1.7(A,B,C) -> exitus616(A,B,C) True f1.7(A,B,C) -> exitus616(A,B,C) True f1.7(A,B,C) -> exitus616(A,B,C) True f1.7(A,B,C) -> exitus616(A,B,C) True f1.7(A,B,C) -> exitus616(A,B,C) True f1.7(A,B,C) -> exitus616(A,B,C) True f1.7(A,B,C) -> exitus616(A,B,C) True f1.7(A,B,C) -> exitus616(A,B,C) True f1.7(A,B,C) -> exitus616(A,B,C) True f1.7(A,B,C) -> exitus616(A,B,C) True f1.7(A,B,C) -> exitus616(A,B,C) True f1.7(A,B,C) -> exitus616(A,B,C) True f1.7(A,B,C) -> exitus616(A,B,C) True f1.7(A,B,C) -> exitus616(A,B,C) True f1.7(A,B,C) -> exitus616(A,B,C) True f1.7(A,B,C) -> exitus616(A,B,C) True f1.7(A,B,C) -> exitus616(A,B,C) True f1.7(A,B,C) -> exitus616(A,B,C) True f1.7(A,B,C) -> exitus616(A,B,C) True Signature: {(exitus616,3);(f1.7,3);(f2.1,3);(f2.2,3);(f2.3,3);(f2.4,3);(f2.5,3);(f2.6,3);(f300.0,3)} Rule Graph: [0->{6},1->{7,8,9,10,11},2->{12},3->{13},4->{14,15,16,17,18},5->{19,20,21,22,23},6->{44},7->{7,8,9,10,11} ,8->{12},9->{13},10->{14,15,16,17,18},11->{19,20,21,22,23},12->{25,27,29,31,33,35,37,39,41,43},13->{24,26,28 ,30,32,34,36,38,40,42},14->{7,8,9,10,11},15->{12},16->{13},17->{14,15,16,17,18},18->{19,20,21,22,23},19->{7 ,8,9,10,11},20->{12},21->{13},22->{14,15,16,17,18},23->{19,20,21,22,23}] + 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,41,42,43,44] | `- p:[7,14,10,19,11,18,17,22,23] c: [10,11,14,17,18,19,22,23] | `- p:[7] c: [] MAYBE