NO * Step 1: UnreachableRules NO + Considered Problem: Rules: 0. f8(A) -> f8(2) True (?,1) 1. f1(A) -> f4(3) True (1,1) 2. f4(A) -> f4(3) True (?,1) Signature: {(f1,1);(f4,1);(f8,1)} Flow Graph: [0->{0},1->{2},2->{2}] + Applied Processor: UnreachableRules + Details: Following transitions are not reachable from the starting states and are revomed: [0] * Step 2: FromIts NO + Considered Problem: Rules: 1. f1(A) -> f4(3) True (1,1) 2. f4(A) -> f4(3) True (?,1) Signature: {(f1,1);(f4,1);(f8,1)} Flow Graph: [1->{2},2->{2}] + Applied Processor: FromIts + Details: () * Step 3: CloseWith NO + Considered Problem: Rules: f1(A) -> f4(3) True f4(A) -> f4(3) True Signature: {(f1,1);(f4,1);(f8,1)} Rule Graph: [1->{2},2->{2}] + Applied Processor: CloseWith False + Details: () NO