Certification Problem

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

The rewrite relation of the following TRS is considered.

a(x1) → x1 (1)
a(b(x1)) → b(a(c(a(x1)))) (2)
c(b(x1)) → x1 (3)
c(c(x1)) → b(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(a(b(a(b(a(b(x1)))))))
→ b(a(b(b(a(c(a(a(b(x1)))))))))
→ b(a(b(b(c(a(a(b(x1))))))))
→ b(b(a(c(a(b(c(a(a(b(x1))))))))))
→ b(b(a(c(b(a(c(a(c(a(a(b(x1))))))))))))
→ b(b(a(a(c(a(c(a(a(b(x1))))))))))
→ b(b(a(a(c(c(a(a(b(x1)))))))))
→ b(b(a(a(b(a(a(b(x1))))))))
→ b(b(a(b(a(c(a(a(a(b(x1))))))))))
→ b(b(a(b(c(a(a(a(b(x1)))))))))
→ b(b(b(a(c(a(c(a(a(a(b(x1)))))))))))
→ b(b(b(a(c(c(a(a(a(b(x1))))))))))
→ b(b(b(a(b(a(a(a(b(x1)))))))))
→ b(b(b(a(b(a(a(b(a(c(a(x1)))))))))))
→ b(b(b(a(b(a(a(b(a(c(x1))))))))))
→ b(b(b(a(b(a(a(b(c(x1)))))))))
→ b(b(b(a(b(a(b(a(c(a(c(x1)))))))))))
→ b(b(b(a(b(a(b(a(c(c(x1))))))))))
→ b(b(b(a(b(a(b(a(b(x1)))))))))
= t18
where t18 = C[t0σ] and σ = {x1/x1} and C = b(b(☐))