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