(ignored inputs)COMMENT submitted by: Johannes Waldmann secret problem 2020 category: SRS
Rewrite Rules:
   [ a(b(a(?x))) -> a(a(b(a(b(?x))))) ]
Apply Direct Methods...
Inner CPs:
   [ a(b(a(a(b(a(b(?x))))))) = a(a(b(a(b(b(a(?x))))))) ]
Outer CPs:
   [  ]
not Overlay, check Termination...
unknown/not Terminating
unknown Knuth & Bendix
Linear
unknown Development Closed
unknown Strongly Closed
unknown Weakly-Non-Overlapping & Non-Collapsing & Shallow
inner CP cond (upside-parallel)
innter CP Cond (outside)
unknown Upside-Parallel-Closed/Outside-Closed
(inner) Parallel CPs: (not computed)
unknown Toyama (Parallel CPs)
Simultaneous CPs:
   [ a(b(a(a(b(a(b(?x_1))))))) = a(a(b(a(b(b(a(?x_1))))))),
     a(a(b(a(b(b(a(a(b(a(b(?x_1))))))))))) = a(b(a(a(b(a(b(b(a(?x_1))))))))),
     a(a(b(a(b(b(a(?x))))))) = a(b(a(a(b(a(b(?x))))))) ]
unknown Okui (Simultaneous CPs)
unknown Strongly Depth-Preserving & Root-E-Closed/Non-E-Overlapping
unknown Strongly Weight-Preserving & Root-E-Closed/Non-E-Overlapping
check Locally Decreasing Diagrams by Rule Labelling...
Critical Pair <a(b(a(a(b(a(b(?x))))))), a(a(b(a(b(b(a(?x)))))))> by Rules <0, 0> preceded by [(a,1),(b,1)]
unknown Diagram Decreasing
check Non-Confluence...
obtain 3 rules by 3 steps unfolding
obtain 100 candidates for checking non-joinability
check by TCAP-Approximation (failure)
check by Ordering(rpo), check by Tree-Automata Approximation (failure)
check by Interpretation(mod2)