WORST_CASE(?,O(1)) * Step 1: RestrictVarsProcessor WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f11(A,B,C,D,E,F,G,H,I,J,K) -> f54(A,B,A + B,D,E,F,G,H,I,J,K) [A >= B] (?,1) 1. f11(A,B,C,D,E,F,G,H,I,J,K) -> f54(A,B,-1*A + B,D,E,F,G,H,I,J,K) [B >= 1 + A] (?,1) 2. f38(A,B,C,D,E,F,G,H,I,J,K) -> f11(L,B,C,D,E,D,D,H,I,J,K) [D >= 1 + E] (?,1) 3. f38(A,B,C,D,E,F,G,H,I,J,K) -> f11(L,B,C,D,E,D,D,M,I,J,K) [E >= D] (?,1) 4. f0(A,B,C,D,E,F,G,H,I,J,K) -> f38(1,2,C,1,10,F,G,H,10,2,L) True (1,1) Signature: {(f0,11);(f11,11);(f38,11);(f54,11)} Flow Graph: [0->{},1->{},2->{0,1},3->{0,1},4->{2,3}] + Applied Processor: RestrictVarsProcessor + Details: We removed the arguments [C,F,G,H,I,J,K] . * Step 2: LocalSizeboundsProc WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f11(A,B,D,E) -> f54(A,B,D,E) [A >= B] (?,1) 1. f11(A,B,D,E) -> f54(A,B,D,E) [B >= 1 + A] (?,1) 2. f38(A,B,D,E) -> f11(L,B,D,E) [D >= 1 + E] (?,1) 3. f38(A,B,D,E) -> f11(L,B,D,E) [E >= D] (?,1) 4. f0(A,B,D,E) -> f38(1,2,1,10) True (1,1) Signature: {(f0,4);(f11,4);(f38,4);(f54,4)} Flow Graph: [0->{},1->{},2->{0,1},3->{0,1},4->{2,3}] + Applied Processor: LocalSizeboundsProc + Details: LocalSizebounds generated; rvgraph (<0,0,A>, A, .= 0) (<0,0,B>, B, .= 0) (<0,0,D>, D, .= 0) (<0,0,E>, E, .= 0) (<1,0,A>, A, .= 0) (<1,0,B>, B, .= 0) (<1,0,D>, D, .= 0) (<1,0,E>, E, .= 0) (<2,0,A>, ?, .?) (<2,0,B>, B, .= 0) (<2,0,D>, D, .= 0) (<2,0,E>, E, .= 0) (<3,0,A>, ?, .?) (<3,0,B>, B, .= 0) (<3,0,D>, D, .= 0) (<3,0,E>, E, .= 0) (<4,0,A>, 1, .= 1) (<4,0,B>, 2, .= 2) (<4,0,D>, 1, .= 1) (<4,0,E>, 10, .= 10) * Step 3: SizeboundsProc WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f11(A,B,D,E) -> f54(A,B,D,E) [A >= B] (?,1) 1. f11(A,B,D,E) -> f54(A,B,D,E) [B >= 1 + A] (?,1) 2. f38(A,B,D,E) -> f11(L,B,D,E) [D >= 1 + E] (?,1) 3. f38(A,B,D,E) -> f11(L,B,D,E) [E >= D] (?,1) 4. f0(A,B,D,E) -> f38(1,2,1,10) True (1,1) Signature: {(f0,4);(f11,4);(f38,4);(f54,4)} Flow Graph: [0->{},1->{},2->{0,1},3->{0,1},4->{2,3}] Sizebounds: (<0,0,A>, ?) (<0,0,B>, ?) (<0,0,D>, ?) (<0,0,E>, ?) (<1,0,A>, ?) (<1,0,B>, ?) (<1,0,D>, ?) (<1,0,E>, ?) (<2,0,A>, ?) (<2,0,B>, ?) (<2,0,D>, ?) (<2,0,E>, ?) (<3,0,A>, ?) (<3,0,B>, ?) (<3,0,D>, ?) (<3,0,E>, ?) (<4,0,A>, ?) (<4,0,B>, ?) (<4,0,D>, ?) (<4,0,E>, ?) + Applied Processor: SizeboundsProc + Details: Sizebounds computed: (<0,0,A>, ?) (<0,0,B>, 2) (<0,0,D>, 1) (<0,0,E>, 10) (<1,0,A>, ?) (<1,0,B>, 2) (<1,0,D>, 1) (<1,0,E>, 10) (<2,0,A>, ?) (<2,0,B>, 2) (<2,0,D>, 1) (<2,0,E>, 10) (<3,0,A>, ?) (<3,0,B>, 2) (<3,0,D>, 1) (<3,0,E>, 10) (<4,0,A>, 1) (<4,0,B>, 2) (<4,0,D>, 1) (<4,0,E>, 10) * Step 4: UnsatPaths WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f11(A,B,D,E) -> f54(A,B,D,E) [A >= B] (?,1) 1. f11(A,B,D,E) -> f54(A,B,D,E) [B >= 1 + A] (?,1) 2. f38(A,B,D,E) -> f11(L,B,D,E) [D >= 1 + E] (?,1) 3. f38(A,B,D,E) -> f11(L,B,D,E) [E >= D] (?,1) 4. f0(A,B,D,E) -> f38(1,2,1,10) True (1,1) Signature: {(f0,4);(f11,4);(f38,4);(f54,4)} Flow Graph: [0->{},1->{},2->{0,1},3->{0,1},4->{2,3}] Sizebounds: (<0,0,A>, ?) (<0,0,B>, 2) (<0,0,D>, 1) (<0,0,E>, 10) (<1,0,A>, ?) (<1,0,B>, 2) (<1,0,D>, 1) (<1,0,E>, 10) (<2,0,A>, ?) (<2,0,B>, 2) (<2,0,D>, 1) (<2,0,E>, 10) (<3,0,A>, ?) (<3,0,B>, 2) (<3,0,D>, 1) (<3,0,E>, 10) (<4,0,A>, 1) (<4,0,B>, 2) (<4,0,D>, 1) (<4,0,E>, 10) + Applied Processor: UnsatPaths + Details: We remove following edges from the transition graph: [(4,2)] * Step 5: UnreachableRules WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f11(A,B,D,E) -> f54(A,B,D,E) [A >= B] (?,1) 1. f11(A,B,D,E) -> f54(A,B,D,E) [B >= 1 + A] (?,1) 2. f38(A,B,D,E) -> f11(L,B,D,E) [D >= 1 + E] (?,1) 3. f38(A,B,D,E) -> f11(L,B,D,E) [E >= D] (?,1) 4. f0(A,B,D,E) -> f38(1,2,1,10) True (1,1) Signature: {(f0,4);(f11,4);(f38,4);(f54,4)} Flow Graph: [0->{},1->{},2->{0,1},3->{0,1},4->{3}] Sizebounds: (<0,0,A>, ?) (<0,0,B>, 2) (<0,0,D>, 1) (<0,0,E>, 10) (<1,0,A>, ?) (<1,0,B>, 2) (<1,0,D>, 1) (<1,0,E>, 10) (<2,0,A>, ?) (<2,0,B>, 2) (<2,0,D>, 1) (<2,0,E>, 10) (<3,0,A>, ?) (<3,0,B>, 2) (<3,0,D>, 1) (<3,0,E>, 10) (<4,0,A>, 1) (<4,0,B>, 2) (<4,0,D>, 1) (<4,0,E>, 10) + Applied Processor: UnreachableRules + Details: The following transitions are not reachable from the starting states and are removed: [2] * Step 6: LeafRules WORST_CASE(?,O(1)) + Considered Problem: Rules: 0. f11(A,B,D,E) -> f54(A,B,D,E) [A >= B] (?,1) 1. f11(A,B,D,E) -> f54(A,B,D,E) [B >= 1 + A] (?,1) 3. f38(A,B,D,E) -> f11(L,B,D,E) [E >= D] (?,1) 4. f0(A,B,D,E) -> f38(1,2,1,10) True (1,1) Signature: {(f0,4);(f11,4);(f38,4);(f54,4)} Flow Graph: [0->{},1->{},3->{0,1},4->{3}] Sizebounds: (<0,0,A>, ?) (<0,0,B>, 2) (<0,0,D>, 1) (<0,0,E>, 10) (<1,0,A>, ?) (<1,0,B>, 2) (<1,0,D>, 1) (<1,0,E>, 10) (<3,0,A>, ?) (<3,0,B>, 2) (<3,0,D>, 1) (<3,0,E>, 10) (<4,0,A>, 1) (<4,0,B>, 2) (<4,0,D>, 1) (<4,0,E>, 10) + Applied Processor: LeafRules + Details: The following transitions are estimated by its predecessors and are removed [3,0,1] * Step 7: LocalSizeboundsProc WORST_CASE(?,O(1)) + Considered Problem: Rules: 4. f0(A,B,D,E) -> f38(1,2,1,10) True (1,1) Signature: {(f0,4);(f11,4);(f38,4);(f54,4)} Flow Graph: [4->{}] Sizebounds: (<4,0,A>, 1) (<4,0,B>, 2) (<4,0,D>, 1) (<4,0,E>, 10) + Applied Processor: LocalSizeboundsProc + Details: The problem is already solved. WORST_CASE(?,O(1))