Certification Problem
Input (TPDB TRS_Innermost/AG01_innermost/#4.18)
The rewrite relation of the following TRS is considered.
|
a(b(a(b(x)))) |
→ |
b(a(b(a(a(b(x)))))) |
(1) |
The evaluation strategy is innermost.Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by AProVE @ termCOMP 2023)
1 Dependency Pair Transformation
The following set of initial dependency pairs has been identified.
|
a#(b(a(b(x)))) |
→ |
a#(b(a(a(b(x))))) |
(2) |
|
a#(b(a(b(x)))) |
→ |
a#(a(b(x))) |
(3) |
1.1 Dependency Graph Processor
The dependency pairs are split into 0
components.