Certification Problem
Input (TPDB SRS_Standard/Waldmann_19/random-185)
The rewrite relation of the following TRS is considered.
|
a(a(a(a(x1)))) |
→ |
b(a(b(b(x1)))) |
(1) |
|
b(b(a(a(x1)))) |
→ |
a(a(b(b(x1)))) |
(2) |
|
b(a(b(b(x1)))) |
→ |
a(a(b(b(x1)))) |
(3) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by AProVE @ termCOMP 2023)
1 String Reversal
Since only unary symbols occur, one can reverse all terms and obtains the TRS
|
a(a(a(a(x1)))) |
→ |
b(b(a(b(x1)))) |
(4) |
|
a(a(b(b(x1)))) |
→ |
b(b(a(a(x1)))) |
(5) |
|
b(b(a(b(x1)))) |
→ |
b(b(a(a(x1)))) |
(6) |
1.1 Closure Under Flat Contexts
Using the flat contexts
{a(☐), b(☐)}
We obtain the transformed TRS
|
b(b(a(b(x1)))) |
→ |
b(b(a(a(x1)))) |
(6) |
|
a(a(a(a(a(x1))))) |
→ |
a(b(b(a(b(x1))))) |
(7) |
|
b(a(a(a(a(x1))))) |
→ |
b(b(b(a(b(x1))))) |
(8) |
|
a(a(a(b(b(x1))))) |
→ |
a(b(b(a(a(x1))))) |
(9) |
|
b(a(a(b(b(x1))))) |
→ |
b(b(b(a(a(x1))))) |
(10) |
1.1.1 Semantic Labeling
Root-labeling is applied.
We obtain the labeled TRS
|
bb(ba(ab(bb(x1)))) |
→ |
bb(ba(aa(ab(x1)))) |
(11) |
|
bb(ba(ab(ba(x1)))) |
→ |
bb(ba(aa(aa(x1)))) |
(12) |
|
aa(aa(aa(aa(ab(x1))))) |
→ |
ab(bb(ba(ab(bb(x1))))) |
(13) |
|
aa(aa(aa(aa(aa(x1))))) |
→ |
ab(bb(ba(ab(ba(x1))))) |
(14) |
|
ba(aa(aa(aa(ab(x1))))) |
→ |
bb(bb(ba(ab(bb(x1))))) |
(15) |
|
ba(aa(aa(aa(aa(x1))))) |
→ |
bb(bb(ba(ab(ba(x1))))) |
(16) |
|
aa(aa(ab(bb(bb(x1))))) |
→ |
ab(bb(ba(aa(ab(x1))))) |
(17) |
|
aa(aa(ab(bb(ba(x1))))) |
→ |
ab(bb(ba(aa(aa(x1))))) |
(18) |
|
ba(aa(ab(bb(bb(x1))))) |
→ |
bb(bb(ba(aa(ab(x1))))) |
(19) |
|
ba(aa(ab(bb(ba(x1))))) |
→ |
bb(bb(ba(aa(aa(x1))))) |
(20) |
1.1.1.1 Dependency Pair Transformation
The following set of initial dependency pairs has been identified.
|
bb#(ba(ab(bb(x1)))) |
→ |
bb#(ba(aa(ab(x1)))) |
(21) |
|
bb#(ba(ab(bb(x1)))) |
→ |
ba#(aa(ab(x1))) |
(22) |
|
bb#(ba(ab(bb(x1)))) |
→ |
aa#(ab(x1)) |
(23) |
|
bb#(ba(ab(ba(x1)))) |
→ |
bb#(ba(aa(aa(x1)))) |
(24) |
|
bb#(ba(ab(ba(x1)))) |
→ |
ba#(aa(aa(x1))) |
(25) |
|
bb#(ba(ab(ba(x1)))) |
→ |
aa#(aa(x1)) |
(26) |
|
bb#(ba(ab(ba(x1)))) |
→ |
aa#(x1) |
(27) |
|
aa#(aa(aa(aa(ab(x1))))) |
→ |
bb#(ba(ab(bb(x1)))) |
(28) |
|
aa#(aa(aa(aa(ab(x1))))) |
→ |
ba#(ab(bb(x1))) |
(29) |
|
aa#(aa(aa(aa(ab(x1))))) |
→ |
bb#(x1) |
(30) |
|
aa#(aa(aa(aa(aa(x1))))) |
→ |
bb#(ba(ab(ba(x1)))) |
(31) |
|
aa#(aa(aa(aa(aa(x1))))) |
→ |
ba#(ab(ba(x1))) |
(32) |
|
aa#(aa(aa(aa(aa(x1))))) |
→ |
ba#(x1) |
(33) |
|
ba#(aa(aa(aa(ab(x1))))) |
→ |
bb#(bb(ba(ab(bb(x1))))) |
(34) |
|
ba#(aa(aa(aa(ab(x1))))) |
→ |
bb#(ba(ab(bb(x1)))) |
(35) |
|
ba#(aa(aa(aa(ab(x1))))) |
→ |
ba#(ab(bb(x1))) |
(36) |
|
ba#(aa(aa(aa(ab(x1))))) |
→ |
bb#(x1) |
(37) |
|
ba#(aa(aa(aa(aa(x1))))) |
→ |
bb#(bb(ba(ab(ba(x1))))) |
(38) |
|
ba#(aa(aa(aa(aa(x1))))) |
→ |
bb#(ba(ab(ba(x1)))) |
(39) |
|
ba#(aa(aa(aa(aa(x1))))) |
→ |
ba#(ab(ba(x1))) |
(40) |
|
ba#(aa(aa(aa(aa(x1))))) |
→ |
ba#(x1) |
(41) |
|
aa#(aa(ab(bb(bb(x1))))) |
→ |
bb#(ba(aa(ab(x1)))) |
(42) |
|
aa#(aa(ab(bb(bb(x1))))) |
→ |
ba#(aa(ab(x1))) |
(43) |
|
aa#(aa(ab(bb(bb(x1))))) |
→ |
aa#(ab(x1)) |
(44) |
|
aa#(aa(ab(bb(ba(x1))))) |
→ |
bb#(ba(aa(aa(x1)))) |
(45) |
|
aa#(aa(ab(bb(ba(x1))))) |
→ |
ba#(aa(aa(x1))) |
(46) |
|
aa#(aa(ab(bb(ba(x1))))) |
→ |
aa#(aa(x1)) |
(47) |
|
aa#(aa(ab(bb(ba(x1))))) |
→ |
aa#(x1) |
(48) |
|
ba#(aa(ab(bb(bb(x1))))) |
→ |
bb#(bb(ba(aa(ab(x1))))) |
(49) |
|
ba#(aa(ab(bb(bb(x1))))) |
→ |
bb#(ba(aa(ab(x1)))) |
(50) |
|
ba#(aa(ab(bb(bb(x1))))) |
→ |
ba#(aa(ab(x1))) |
(51) |
|
ba#(aa(ab(bb(bb(x1))))) |
→ |
aa#(ab(x1)) |
(52) |
|
ba#(aa(ab(bb(ba(x1))))) |
→ |
bb#(bb(ba(aa(aa(x1))))) |
(53) |
|
ba#(aa(ab(bb(ba(x1))))) |
→ |
bb#(ba(aa(aa(x1)))) |
(54) |
|
ba#(aa(ab(bb(ba(x1))))) |
→ |
ba#(aa(aa(x1))) |
(55) |
|
ba#(aa(ab(bb(ba(x1))))) |
→ |
aa#(aa(x1)) |
(56) |
|
ba#(aa(ab(bb(ba(x1))))) |
→ |
aa#(x1) |
(57) |
1.1.1.1.1 Dependency Graph Processor
The dependency pairs are split into 1
component.