NO * Step 1: FromIts NO + Considered Problem: Rules: 0. f0(A,B,C,D) -> f1(A,B,C,D) True (1,1) 1. f1(A,B,C,D) -> f1(A + B,B + C,C + D,-1 + D) [A >= 1] (?,1) 2. f1(A,B,C,D) -> f1(-1 + A,B,C,D) [A >= 1] (?,1) Signature: {(f0,4);(f1,4)} Flow Graph: [0->{1,2},1->{1,2},2->{1,2}] + Applied Processor: FromIts + Details: () * Step 2: CloseWith NO + Considered Problem: Rules: f0(A,B,C,D) -> f1(A,B,C,D) True f1(A,B,C,D) -> f1(A + B,B + C,C + D,-1 + D) [A >= 1] f1(A,B,C,D) -> f1(-1 + A,B,C,D) [A >= 1] Signature: {(f0,4);(f1,4)} Rule Graph: [0->{1,2},1->{1,2},2->{1,2}] + Applied Processor: CloseWith False + Details: () NO