MAYBE * Step 1: UnreachableRules MAYBE + Considered Problem: Rules: 0. f10(A,B,C,D,E,F) -> f16(A,0,G,G,E,F) [0 >= A] (?,1) 1. f16(A,B,C,D,E,F) -> f16(A,B,C,D,E,F) [D >= 1] (?,1) 2. f25(A,B,C,D,E,F) -> f25(A,B,C,D,E,F) True (?,1) 3. f27(A,B,C,D,E,F) -> f30(A,B,C,D,E,F) True (?,1) 4. f16(A,B,C,D,E,F) -> f10(G,B,C,D,0,G) [0 >= D] (?,1) 5. f10(A,B,C,D,E,F) -> f25(A,B,C,D,E,F) [A >= 1] (?,1) 6. f0(A,B,C,D,E,F) -> f10(G,0,C,D,0,G) True (1,1) Signature: {(f0,6);(f10,6);(f16,6);(f25,6);(f27,6);(f30,6)} Flow Graph: [0->{1,4},1->{1,4},2->{2},3->{},4->{0,5},5->{2},6->{0,5}] + Applied Processor: UnreachableRules + Details: Following transitions are not reachable from the starting states and are revomed: [3] * Step 2: UnsatPaths MAYBE + Considered Problem: Rules: 0. f10(A,B,C,D,E,F) -> f16(A,0,G,G,E,F) [0 >= A] (?,1) 1. f16(A,B,C,D,E,F) -> f16(A,B,C,D,E,F) [D >= 1] (?,1) 2. f25(A,B,C,D,E,F) -> f25(A,B,C,D,E,F) True (?,1) 4. f16(A,B,C,D,E,F) -> f10(G,B,C,D,0,G) [0 >= D] (?,1) 5. f10(A,B,C,D,E,F) -> f25(A,B,C,D,E,F) [A >= 1] (?,1) 6. f0(A,B,C,D,E,F) -> f10(G,0,C,D,0,G) True (1,1) Signature: {(f0,6);(f10,6);(f16,6);(f25,6);(f27,6);(f30,6)} Flow Graph: [0->{1,4},1->{1,4},2->{2},4->{0,5},5->{2},6->{0,5}] + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(1,4)] * Step 3: FromIts MAYBE + Considered Problem: Rules: 0. f10(A,B,C,D,E,F) -> f16(A,0,G,G,E,F) [0 >= A] (?,1) 1. f16(A,B,C,D,E,F) -> f16(A,B,C,D,E,F) [D >= 1] (?,1) 2. f25(A,B,C,D,E,F) -> f25(A,B,C,D,E,F) True (?,1) 4. f16(A,B,C,D,E,F) -> f10(G,B,C,D,0,G) [0 >= D] (?,1) 5. f10(A,B,C,D,E,F) -> f25(A,B,C,D,E,F) [A >= 1] (?,1) 6. f0(A,B,C,D,E,F) -> f10(G,0,C,D,0,G) True (1,1) Signature: {(f0,6);(f10,6);(f16,6);(f25,6);(f27,6);(f30,6)} Flow Graph: [0->{1,4},1->{1},2->{2},4->{0,5},5->{2},6->{0,5}] + Applied Processor: FromIts + Details: () * Step 4: Unfold MAYBE + Considered Problem: Rules: f10(A,B,C,D,E,F) -> f16(A,0,G,G,E,F) [0 >= A] f16(A,B,C,D,E,F) -> f16(A,B,C,D,E,F) [D >= 1] f25(A,B,C,D,E,F) -> f25(A,B,C,D,E,F) True f16(A,B,C,D,E,F) -> f10(G,B,C,D,0,G) [0 >= D] f10(A,B,C,D,E,F) -> f25(A,B,C,D,E,F) [A >= 1] f0(A,B,C,D,E,F) -> f10(G,0,C,D,0,G) True Signature: {(f0,6);(f10,6);(f16,6);(f25,6);(f27,6);(f30,6)} Rule Graph: [0->{1,4},1->{1},2->{2},4->{0,5},5->{2},6->{0,5}] + Applied Processor: Unfold + Details: () * Step 5: AddSinks MAYBE + Considered Problem: Rules: f10.0(A,B,C,D,E,F) -> f16.1(A,0,G,G,E,F) [0 >= A] f10.0(A,B,C,D,E,F) -> f16.4(A,0,G,G,E,F) [0 >= A] f16.1(A,B,C,D,E,F) -> f16.1(A,B,C,D,E,F) [D >= 1] f25.2(A,B,C,D,E,F) -> f25.2(A,B,C,D,E,F) True f16.4(A,B,C,D,E,F) -> f10.0(G,B,C,D,0,G) [0 >= D] f16.4(A,B,C,D,E,F) -> f10.5(G,B,C,D,0,G) [0 >= D] f10.5(A,B,C,D,E,F) -> f25.2(A,B,C,D,E,F) [A >= 1] f0.6(A,B,C,D,E,F) -> f10.0(G,0,C,D,0,G) True f0.6(A,B,C,D,E,F) -> f10.5(G,0,C,D,0,G) True Signature: {(f0.6,6);(f10.0,6);(f10.5,6);(f16.1,6);(f16.4,6);(f25.2,6)} Rule Graph: [0->{2},1->{4,5},2->{2},3->{3},4->{0,1},5->{6},6->{3},7->{0,1},8->{6}] + Applied Processor: AddSinks + Details: () * Step 6: Failure MAYBE + Considered Problem: Rules: f10.0(A,B,C,D,E,F) -> f16.1(A,0,G,G,E,F) [0 >= A] f10.0(A,B,C,D,E,F) -> f16.4(A,0,G,G,E,F) [0 >= A] f16.1(A,B,C,D,E,F) -> f16.1(A,B,C,D,E,F) [D >= 1] f25.2(A,B,C,D,E,F) -> f25.2(A,B,C,D,E,F) True f16.4(A,B,C,D,E,F) -> f10.0(G,B,C,D,0,G) [0 >= D] f16.4(A,B,C,D,E,F) -> f10.5(G,B,C,D,0,G) [0 >= D] f10.5(A,B,C,D,E,F) -> f25.2(A,B,C,D,E,F) [A >= 1] f0.6(A,B,C,D,E,F) -> f10.0(G,0,C,D,0,G) True f0.6(A,B,C,D,E,F) -> f10.5(G,0,C,D,0,G) True f25.2(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True f25.2(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True f16.1(A,B,C,D,E,F) -> exitus616(A,B,C,D,E,F) True Signature: {(exitus616,6);(f0.6,6);(f10.0,6);(f10.5,6);(f16.1,6);(f16.4,6);(f25.2,6)} Rule Graph: [0->{2},1->{4,5},2->{2,11},3->{3,9,10},4->{0,1},5->{6},6->{3},7->{0,1},8->{6}] + Applied Processor: Decompose Greedy + Details: We construct a looptree: P: [0,1,2,3,4,5,6,7,8,9,10,11] | +- p:[1,4] c: [] | +- p:[3] c: [] | `- p:[2] c: [] MAYBE