YES Trs: {f(a(), f(a(), f(b(), f(a(), f(a(), f(b(), f(a(), x))))))) -> f(a(), f(b(), f(a(), f(a(), f(b(), f(a(), f(a(), f(a(), f(b(), x)))))))))} Comment: We consider a non-duplicating trs. BOUND: Automaton: { b_3() -> q77, b_2() -> q25, b_1() -> q5, b_0() -> q3, a_3() -> q76, a_2() -> q24, a_1() -> q4, a_0() -> q3, f_3(q77, q92) -> q93, f_3(q77, q89) -> q90, f_3(q77, q84) -> q85, f_3(q77, q81) -> q82, f_3(q77, q31) -> q86, f_3(q77, q28) -> q78, f_3(q76, q93) -> q84 | q40, f_3(q76, q91) -> q92, f_3(q76, q90) -> q91, f_3(q76, q88) -> q89, f_3(q76, q87) -> q88, f_3(q76, q86) -> q87, f_3(q76, q85) -> q81 | q37, f_3(q76, q83) -> q84, f_3(q76, q82) -> q83, f_3(q76, q80) -> q81, f_3(q76, q79) -> q80, f_3(q76, q78) -> q79, f_2(q25, q59) -> q52, f_2(q25, q58) -> q59, f_2(q25, q55) -> q56, f_2(q25, q41) -> q34, f_2(q25, q40) -> q41, f_2(q25, q37) -> q38, f_2(q25, q33) -> q26, f_2(q25, q32) -> q33, f_2(q25, q31) -> q52, f_2(q25, q29) -> q30, f_2(q25, q28) -> q34, f_2(q25, q13) -> q26, f_2(q25, q11) -> q52, f_2(q25, q10) -> q26, f_2(q25, q8) -> q34, f_2(q25, q7) -> q26, f_2(q25, q6) -> q26, f_2(q24, q59) -> q40 | q12, f_2(q24, q57) -> q58, f_2(q24, q56) -> q57, f_2(q24, q54) -> q55, f_2(q24, q53) -> q54, f_2(q24, q52) -> q53, f_2(q24, q41) -> q37 | q9, f_2(q24, q39) -> q40, f_2(q24, q38) -> q39, f_2(q24, q36) -> q37, f_2(q24, q35) -> q36, f_2(q24, q34) -> q35, f_2(q24, q33) -> q80 | q36 | q8, f_2(q24, q31) -> q32, f_2(q24, q30) -> q31, f_2(q24, q28) -> q29, f_2(q24, q27) -> q28, f_2(q24, q26) -> q27, f_1(q5, q59) -> q6, f_1(q5, q41) -> q6, f_1(q5, q13) -> q6, f_1(q5, q12) -> q13, f_1(q5, q11) -> q6, f_1(q5, q9) -> q10, f_1(q5, q8) -> q6, f_1(q5, q3) -> q6, f_1(q4, q13) -> q36 | q8 | q3, f_1(q4, q11) -> q12, f_1(q4, q10) -> q11, f_1(q4, q8) -> q9, f_1(q4, q7) -> q8, f_1(q4, q6) -> q7, f_0(q3, q3) -> q3} Strict: {} Qed