Certification Problem
Input (TPDB TRS_Standard/Strategy_removed_AG01/#4.18)
The rewrite relation of the following TRS is considered.
|
a(b(a(b(x)))) |
→ |
b(a(b(a(a(b(x)))))) |
(1) |
Property / Task
Prove or disprove termination.Answer / Result
No.Proof (by AProVE @ termCOMP 2023)
1 Looping derivation
There is a looping derivation.
a b a b a b →+ b a b a b a b a a b
The derivation can be derived as follows.
-
a b a b →+ b a b a a b:
This is an original rule (OC1).
-
a b a b a b →+ b a b a b a b a a b:
The overlap closure is obtained from the following two overlap closures (OC2).
-
a b a b →+ b a b a a b
-
a b a b →+ b a b a a b