Certification Problem
Input (TPDB TRS_Standard/Endrullis_06/pair2simple1)
The rewrite relation of the following TRS is considered.
|
p(a(x0),p(a(b(x1)),x2)) |
→ |
p(a(b(a(x2))),p(a(a(x1)),x2)) |
(1) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by AProVE @ termCOMP 2023)
1 Rule Removal
Using the
| prec(p) |
= |
1 |
|
stat(p) |
= |
lex
|
| prec(a) |
= |
0 |
|
stat(a) |
= |
lex
|
| prec(b) |
= |
1 |
|
stat(b) |
= |
lex
|
| π(p) |
= |
[2,1] |
| π(a) |
= |
[1] |
| π(b) |
= |
[1] |
all of the following rules can be deleted.
|
p(a(x0),p(a(b(x1)),x2)) |
→ |
p(a(b(a(x2))),p(a(a(x1)),x2)) |
(1) |
1.1 R is empty
There are no rules in the TRS. Hence, it is terminating.