Certification Problem

Input (TPDB SRS_Standard/Waldmann_07_size12/size-12-alpha-3-num-11)

The rewrite relation of the following TRS is considered.

a(x1) → x1 (1)
a(x1) → b(x1) (2)
a(b(c(x1))) → c(c(b(a(a(x1))))) (3)
c(x1) → x1 (4)

Property / Task

Prove or disprove termination.

Answer / Result

No.

Proof (by matchbox @ termCOMP 2023)

1 Loop

The following loop proves nontermination.

t0 = b(b(b(a(a(b(a(b(c(c(x1))))))))))
→ b(b(b(a(a(b(c(c(b(a(a(c(x1))))))))))))
→ b(b(b(a(a(b(c(c(b(a(b(c(x1))))))))))))
→ b(b(b(a(c(c(b(a(a(c(b(a(b(c(x1))))))))))))))
→ b(b(b(a(c(b(a(a(c(b(a(b(c(x1)))))))))))))
→ b(b(b(a(b(a(a(c(b(a(b(c(x1))))))))))))
→ b(b(b(a(b(a(b(c(b(a(b(c(x1))))))))))))
→ b(b(b(a(b(c(c(b(a(a(b(a(b(c(x1))))))))))))))
→ b(b(b(a(b(c(c(b(a(b(a(b(c(x1)))))))))))))
→ b(b(b(a(b(c(b(a(b(a(b(c(x1))))))))))))
→ b(b(b(c(c(b(a(a(b(a(b(a(b(c(x1))))))))))))))
→ b(b(b(c(b(a(a(b(a(b(a(b(c(x1)))))))))))))
→ b(b(b(b(a(a(b(a(b(a(b(c(x1))))))))))))
→ b(b(b(b(a(a(b(a(b(c(c(b(a(a(x1))))))))))))))
= t13
where t13 = C[t0σ] and σ = {x1/b(a(a(x1)))} and C = b(☐)