Certification Problem
Input (TPDB SRS_Standard/Mixed_SRS/08-oppelt08)
The rewrite relation of the following TRS is considered.
|
b(a(L(x1))) |
→ |
L(a(L(X(b(a(b(b(x1)))))))) |
(1) |
|
b(L(x1)) |
→ |
L(b(x1)) |
(2) |
Property / Task
Prove or disprove termination.Answer / Result
No.Proof (by AProVE @ termCOMP 2023)
1 Infinite derivation
There is a self-embedding derivation structure which implies nontermination.
b a
(b)n L a L →+ L a L X b a
(b)n + 1 L a L X b a b b
The derivation can be derived as follows.
-
b L →+ L b:
This is an original rule (OC1).
-
(b)n L →+ L
(b)n:
The derivation pattern is obtained from the following self-overlapping overlap closure (type 1)
-
b a L →+ L a L X b a b b:
This is an original rule (OC1).
-
b a
(b)n L →+ L a L X b a b b
(b)n:
The derivation pattern is obtained from overlapping the following two derivation patterns (DP OC 1.2)
-
(b)n L →+ L
(b)n
-
b a L →+ L a L X b a b b
-
b a
(b)n L →+ L a L X b a
(b)n + 2:
The derivation pattern is equivalent to the following derivation pattern.
-
b a
(b)n L →+ L a L X b a b b
(b)n
-
b a
(b)n L →+ L a L X b a
(b)n + 1 b:
The derivation pattern is equivalent to the following derivation pattern.
-
b a
(b)n L →+ L a L X b a
(b)n + 2
-
b a
(b)n L a L →+ L a L X b a
(b)n + 1 L a L X b a b b:
The derivation pattern is obtained from overlapping the following two derivation patterns (DP OC 3.2)
-
b a
(b)n L →+ L a L X b a
(b)n + 1 b
-
b a L →+ L a L X b a b b