Certification Problem
Input (TPDB SRS_Standard/Waldmann_07_size12/size-12-alpha-3-num-160)
The rewrite relation of the following TRS is considered.
|
a(x1) |
→ |
x1 |
(1) |
|
a(b(x1)) |
→ |
b(a(a(c(b(a(x1)))))) |
(2) |
|
b(x1) |
→ |
x1 |
(3) |
|
c(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
|
= |
a(b(c(b(x1)))) |
|
→
|
b(a(a(c(b(a(c(b(x1)))))))) |
|
→
|
b(a(a(c(b(c(b(x1))))))) |
|
→
|
b(a(a(c(c(b(x1)))))) |
|
→
|
a(a(c(c(b(x1))))) |
|
→
|
a(a(b(x1))) |
|
→
|
a(b(a(a(c(b(a(x1))))))) |
|
→
|
a(b(a(a(c(b(x1)))))) |
|
→
|
a(b(a(c(b(x1))))) |
|
→
|
a(b(c(b(x1)))) |
|
= |
t9
|
where t9 =
t0σ
and
σ =
{x1/x1}