MAYBE
(ignored inputs)COMMENT submitted by: Johannes Waldmann
Rewrite Rules:
   [ b(c(?x)) -> b(a(?x)),
     c(a(?x)) -> b(a(?x)),
     c(a(?x)) -> a(b(?x)),
     b(a(?x)) -> c(c(?x)),
     a(a(?x)) -> a(c(?x)),
     c(c(?x)) -> a(b(?x)),
     b(b(?x)) -> a(b(?x)) ]
Apply Direct Methods...
Inner CPs:
   [ b(b(a(?x_1))) = b(a(a(?x_1))),
     b(a(b(?x_2))) = b(a(a(?x_2))),
     b(a(b(?x_5))) = b(a(c(?x_5))),
     c(a(c(?x_4))) = b(a(a(?x_4))),
     c(a(c(?x_4))) = a(b(a(?x_4))),
     b(a(c(?x_4))) = c(c(a(?x_4))),
     c(b(a(?x_1))) = a(b(a(?x_1))),
     c(a(b(?x_2))) = a(b(a(?x_2))),
     b(b(a(?x))) = a(b(c(?x))),
     b(c(c(?x_3))) = a(b(a(?x_3))),
     a(a(c(?x))) = a(c(a(?x))),
     c(a(b(?x))) = a(b(c(?x))),
     b(a(b(?x))) = a(b(b(?x))) ]
Outer CPs:
   [ b(a(?x_1)) = a(b(?x_1)) ]
not Overlay, check Termination...
unknown/not Terminating
unknown Knuth & Bendix
Linear
unknown Development Closed
unknown Strongly Closed
unknown Weakly-Non-Overlapping & Non-Collapsing & Shallow
unknown Upside-Parallel-Closed/Outside-Closed
(inner) Parallel CPs: (not computed)
unknown Toyama (Parallel CPs)
Simultaneous CPs:
   [ b(b(a(?x_2))) = b(a(a(?x_2))),
     b(a(b(?x_3))) = b(a(a(?x_3))),
     b(a(b(?x_6))) = b(a(c(?x_6))),
     a(b(b(a(?x_2)))) = b(b(a(a(?x_2)))),
     a(b(a(b(?x_3)))) = b(b(a(a(?x_3)))),
     a(b(a(b(?x_6)))) = b(b(a(c(?x_6)))),
     a(b(c(?x))) = b(b(a(?x))),
     a(b(?x)) = b(a(?x)),
     c(a(c(?x_5))) = b(a(a(?x_5))),
     b(a(a(c(?x_5)))) = b(b(a(a(?x_5)))),
     a(b(a(c(?x_5)))) = c(b(a(a(?x_5)))),
     b(a(a(?x))) = b(b(a(?x))),
     a(b(a(?x))) = c(b(a(?x))),
     b(a(?x)) = a(b(?x)),
     c(a(c(?x_5))) = a(b(a(?x_5))),
     b(a(a(c(?x_5)))) = b(a(b(a(?x_5)))),
     a(b(a(c(?x_5)))) = c(a(b(a(?x_5)))),
     b(a(a(?x))) = b(a(b(?x))),
     a(b(a(?x))) = c(a(b(?x))),
     b(a(c(?x_5))) = c(c(a(?x_5))),
     a(b(a(c(?x_5)))) = b(c(c(a(?x_5)))),
     a(b(a(?x))) = b(c(c(?x))),
     a(a(c(?x_1))) = a(c(a(?x_1))),
     a(c(a(c(?x_1)))) = a(a(c(a(?x_1)))),
     b(a(a(c(?x_1)))) = c(a(c(a(?x_1)))),
     a(b(a(c(?x_1)))) = c(a(c(a(?x_1)))),
     c(c(a(c(?x_1)))) = b(a(c(a(?x_1)))),
     a(c(a(?x))) = a(a(c(?x))),
     b(a(a(?x))) = c(a(c(?x))),
     a(b(a(?x))) = c(a(c(?x))),
     c(c(a(?x))) = b(a(c(?x))),
     c(a(b(?x_1))) = a(b(c(?x_1))),
     c(b(a(?x_3))) = a(b(a(?x_3))),
     c(a(b(?x_4))) = a(b(a(?x_4))),
     a(b(a(b(?x_1)))) = c(a(b(c(?x_1)))),
     a(b(b(a(?x_3)))) = c(a(b(a(?x_3)))),
     a(b(a(b(?x_4)))) = c(a(b(a(?x_4)))),
     b(a(a(b(?x_1)))) = b(a(b(c(?x_1)))),
     b(a(b(a(?x_3)))) = b(a(b(a(?x_3)))),
     b(a(a(b(?x_4)))) = b(a(b(a(?x_4)))),
     a(b(c(?x))) = c(a(b(?x))),
     b(a(c(?x))) = b(a(b(?x))),
     b(a(b(?x_1))) = a(b(b(?x_1))),
     b(b(a(?x_2))) = a(b(c(?x_2))),
     b(c(c(?x_5))) = a(b(a(?x_5))),
     a(b(a(b(?x_1)))) = b(a(b(b(?x_1)))),
     a(b(b(a(?x_2)))) = b(a(b(c(?x_2)))),
     a(b(c(c(?x_5)))) = b(a(b(a(?x_5)))),
     a(b(b(?x))) = 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 <b(b(a(?x_1))), b(a(a(?x_1)))> by Rules <1, 0> preceded by [(b,1)]
 joinable by a reduction of rules <[([(b,1)],3),([],0)], [([(b,1)],4)]>
 joinable by a reduction of rules <[([],6)], [([],3),([],5)]>
Critical Pair <b(a(b(?x_2))), b(a(a(?x_2)))> by Rules <2, 0> preceded by [(b,1)]
 joinable by a reduction of rules <[], [([],3),([(c,1)],2),([],1)]>
 joinable by a reduction of rules <[([],3),([],5)], [([],3),([(c,1)],2),([],2)]>
Critical Pair <b(a(b(?x_5))), b(a(c(?x_5)))> by Rules <5, 0> preceded by [(b,1)]
 joinable by a reduction of rules <[], [([],3),([(c,1)],5),([],1)]>
 joinable by a reduction of rules <[([],3),([],5)], [([],3),([(c,1)],5),([],2)]>
Critical Pair <c(a(c(?x_4))), b(a(a(?x_4)))> by Rules <4, 1> preceded by [(c,1)]
 joinable by a reduction of rules <[([],1)], [([(b,1)],4)]>
Critical Pair <c(a(c(?x_4))), a(b(a(?x_4)))> by Rules <4, 2> preceded by [(c,1)]
 joinable by a reduction of rules <[([],2),([(a,1)],0)], []>
Critical Pair <b(a(c(?x_4))), c(c(a(?x_4)))> by Rules <4, 3> preceded by [(b,1)]
 joinable by a reduction of rules <[([],3),([(c,1)],5)], [([(c,1)],2)]>
 joinable by a reduction of rules <[([],3)], [([(c,1)],1),([(c,1)],3)]>
Critical Pair <c(b(a(?x_1))), a(b(a(?x_1)))> by Rules <1, 5> preceded by [(c,1)]
 joinable by a reduction of rules <[([(c,1)],3),([],5),([(a,1)],0)], []>
Critical Pair <c(a(b(?x_2))), a(b(a(?x_2)))> by Rules <2, 5> preceded by [(c,1)]
 joinable by a reduction of rules <[([],2),([(a,1)],6)], [([(a,1)],3),([(a,1)],5)]>
Critical Pair <b(b(a(?x))), a(b(c(?x)))> by Rules <0, 6> preceded by [(b,1)]
 joinable by a reduction of rules <[([],6)], [([(a,1)],0)]>
Critical Pair <b(c(c(?x_3))), a(b(a(?x_3)))> by Rules <3, 6> preceded by [(b,1)]
 joinable by a reduction of rules <[([(b,1)],5),([],3),([],5),([(a,1)],6)], [([(a,1)],3),([(a,1)],5)]>
 joinable by a reduction of rules <[([],0),([],3),([],5),([(a,1)],0)], []>
Critical Pair <a(a(c(?x))), a(c(a(?x)))> by Rules <4, 4> preceded by [(a,1)]
 joinable by a reduction of rules <[([],4),([(a,1)],5)], [([(a,1)],2)]>
 joinable by a reduction of rules <[([],4)], [([(a,1)],1),([(a,1)],3)]>
Critical Pair <c(a(b(?x))), a(b(c(?x)))> by Rules <5, 5> preceded by [(c,1)]
 joinable by a reduction of rules <[([],2),([(a,1)],6)], [([(a,1)],0),([(a,1)],3),([(a,1)],5)]>
Critical Pair <b(a(b(?x))), a(b(b(?x)))> by Rules <6, 6> preceded by [(b,1)]
 joinable by a reduction of rules <[([],3),([],5)], []>
Critical Pair <a(b(?x_2)), b(a(?x_2))> by Rules <2, 1> preceded by []
 joinable by a reduction of rules <[], [([],3),([],5)]>
unknown Diagram Decreasing
check Non-Confluence...
obtain 11 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) (failure)
check by Descendants-Approximation, check by Ordering(poly) (failure)
unknown Non-Confluence
unknown Huet (modulo AC)
check by Reduction-Preserving Completion...
failure(empty P)
unknown Reduction-Preserving Completion
Direct Methods: Can't judge

Try Persistent Decomposition for...
   [ b(c(?x)) -> b(a(?x)),
     c(a(?x)) -> b(a(?x)),
     c(a(?x)) -> a(b(?x)),
     b(a(?x)) -> c(c(?x)),
     a(a(?x)) -> a(c(?x)),
     c(c(?x)) -> a(b(?x)),
     b(b(?x)) -> a(b(?x)) ]
Sort Assignment:
 a : 14=>14
 b : 14=>14
 c : 14=>14
maximal types: {14}
Persistent Decomposition failed: Can't judge

Try Layer Preserving Decomposition for...
   [ b(c(?x)) -> b(a(?x)),
     c(a(?x)) -> b(a(?x)),
     c(a(?x)) -> a(b(?x)),
     b(a(?x)) -> c(c(?x)),
     a(a(?x)) -> a(c(?x)),
     c(c(?x)) -> a(b(?x)),
     b(b(?x)) -> a(b(?x)) ]
Layer Preserving Decomposition failed: Can't judge

Try Commutative Decomposition for...
   [ b(c(?x)) -> b(a(?x)),
     c(a(?x)) -> b(a(?x)),
     c(a(?x)) -> a(b(?x)),
     b(a(?x)) -> c(c(?x)),
     a(a(?x)) -> a(c(?x)),
     c(c(?x)) -> a(b(?x)),
     b(b(?x)) -> a(b(?x)) ]
Outside Critical Pair: <a(b(?x_2)), b(a(?x_2))> by Rules <2, 1>
develop reducts from lhs term...
<{}, a(b(?x_2))>
develop reducts from rhs term...
<{3}, c(c(?x_2))>
<{}, b(a(?x_2))>
Inside Critical Pair: <b(b(a(?x_1))), b(a(a(?x_1)))> by Rules <1, 0>
develop reducts from lhs term...
<{6}, a(b(a(?x_1)))>
<{3}, b(c(c(?x_1)))>
<{}, b(b(a(?x_1)))>
develop reducts from rhs term...
<{3}, c(c(a(?x_1)))>
<{4}, b(a(c(?x_1)))>
<{}, b(a(a(?x_1)))>
Inside Critical Pair: <b(a(b(?x_2))), b(a(a(?x_2)))> by Rules <2, 0>
develop reducts from lhs term...
<{3}, c(c(b(?x_2)))>
<{}, b(a(b(?x_2)))>
develop reducts from rhs term...
<{3}, c(c(a(?x_2)))>
<{4}, b(a(c(?x_2)))>
<{}, b(a(a(?x_2)))>
Inside Critical Pair: <b(a(b(?x_5))), b(a(c(?x_5)))> by Rules <5, 0>
develop reducts from lhs term...
<{3}, c(c(b(?x_5)))>
<{}, b(a(b(?x_5)))>
develop reducts from rhs term...
<{3}, c(c(c(?x_5)))>
<{}, b(a(c(?x_5)))>
Inside Critical Pair: <c(a(c(?x_4))), b(a(a(?x_4)))> by Rules <4, 1>
develop reducts from lhs term...
<{2}, a(b(c(?x_4)))>
<{1}, b(a(c(?x_4)))>
<{}, c(a(c(?x_4)))>
develop reducts from rhs term...
<{3}, c(c(a(?x_4)))>
<{4}, b(a(c(?x_4)))>
<{}, b(a(a(?x_4)))>
Inside Critical Pair: <c(a(c(?x_4))), a(b(a(?x_4)))> by Rules <4, 2>
develop reducts from lhs term...
<{2}, a(b(c(?x_4)))>
<{1}, b(a(c(?x_4)))>
<{}, c(a(c(?x_4)))>
develop reducts from rhs term...
<{3}, a(c(c(?x_4)))>
<{}, a(b(a(?x_4)))>
Inside Critical Pair: <b(a(c(?x_4))), c(c(a(?x_4)))> by Rules <4, 3>
develop reducts from lhs term...
<{3}, c(c(c(?x_4)))>
<{}, b(a(c(?x_4)))>
develop reducts from rhs term...
<{5}, a(b(a(?x_4)))>
<{2}, c(a(b(?x_4)))>
<{1}, c(b(a(?x_4)))>
<{}, c(c(a(?x_4)))>
Inside Critical Pair: <c(b(a(?x_1))), a(b(a(?x_1)))> by Rules <1, 5>
develop reducts from lhs term...
<{3}, c(c(c(?x_1)))>
<{}, c(b(a(?x_1)))>
develop reducts from rhs term...
<{3}, a(c(c(?x_1)))>
<{}, a(b(a(?x_1)))>
Inside Critical Pair: <c(a(b(?x_2))), a(b(a(?x_2)))> by Rules <2, 5>
develop reducts from lhs term...
<{2}, a(b(b(?x_2)))>
<{1}, b(a(b(?x_2)))>
<{}, c(a(b(?x_2)))>
develop reducts from rhs term...
<{3}, a(c(c(?x_2)))>
<{}, a(b(a(?x_2)))>
Inside Critical Pair: <b(b(a(?x))), a(b(c(?x)))> by Rules <0, 6>
develop reducts from lhs term...
<{6}, a(b(a(?x)))>
<{3}, b(c(c(?x)))>
<{}, b(b(a(?x)))>
develop reducts from rhs term...
<{0}, a(b(a(?x)))>
<{}, a(b(c(?x)))>
Inside Critical Pair: <b(c(c(?x_3))), a(b(a(?x_3)))> by Rules <3, 6>
develop reducts from lhs term...
<{0}, b(a(c(?x_3)))>
<{5}, b(a(b(?x_3)))>
<{}, b(c(c(?x_3)))>
develop reducts from rhs term...
<{3}, a(c(c(?x_3)))>
<{}, a(b(a(?x_3)))>
Commutative Decomposition failed: Can't judge
No further decomposition possible


Combined result: Can't judge
1001.trs: Failure(unknown CR)
(2937 msec.)