(ignored inputs)COMMENT submitted by: Johannes Waldmann
Rewrite Rules:
   [ b(c(?x)) -> a(a(?x)),
     c(b(?x)) -> a(c(?x)),
     a(b(?x)) -> a(a(?x)),
     b(b(?x)) -> a(b(?x)),
     b(c(?x)) -> b(c(?x)),
     c(a(?x)) -> a(b(?x)),
     a(c(?x)) -> c(b(?x)),
     b(a(?x)) -> c(a(?x)) ]
Apply Direct Methods...
Inner CPs:
   [ b(a(c(?x_1))) = a(a(b(?x_1))),
     b(a(b(?x_5))) = a(a(a(?x_5))),
     c(a(a(?x))) = a(c(c(?x))),
     c(a(b(?x_3))) = a(c(b(?x_3))),
     c(b(c(?x_4))) = a(c(c(?x_4))),
     c(c(a(?x_7))) = a(c(a(?x_7))),
     a(a(a(?x))) = a(a(c(?x))),
     a(a(b(?x_3))) = a(a(b(?x_3))),
     a(b(c(?x_4))) = a(a(c(?x_4))),
     a(c(a(?x_7))) = a(a(a(?x_7))),
     b(a(a(?x))) = a(b(c(?x))),
     b(b(c(?x_4))) = a(b(c(?x_4))),
     b(c(a(?x_7))) = a(b(a(?x_7))),
     b(a(c(?x_1))) = b(c(b(?x_1))),
     b(a(b(?x_5))) = b(c(a(?x_5))),
     c(a(a(?x_2))) = a(b(b(?x_2))),
     c(c(b(?x_6))) = a(b(c(?x_6))),
     a(a(c(?x_1))) = c(b(b(?x_1))),
     a(a(b(?x_5))) = c(b(a(?x_5))),
     b(a(a(?x_2))) = c(a(b(?x_2))),
     b(c(b(?x_6))) = c(a(c(?x_6))),
     b(a(b(?x))) = a(b(b(?x))) ]
Outer CPs:
   [ a(a(?x)) = b(c(?x)) ]
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:
   [ b(c(?x)) = a(a(?x)),
     b(a(c(?x_2))) = a(a(b(?x_2))),
     b(a(b(?x_6))) = a(a(a(?x_6))),
     a(c(a(c(?x_2)))) = c(a(a(b(?x_2)))),
     a(c(a(b(?x_6)))) = c(a(a(a(?x_6)))),
     a(a(a(c(?x_2)))) = a(a(a(b(?x_2)))),
     a(a(a(b(?x_6)))) = a(a(a(a(?x_6)))),
     a(b(a(c(?x_2)))) = b(a(a(b(?x_2)))),
     a(b(a(b(?x_6)))) = b(a(a(a(?x_6)))),
     a(c(c(?x))) = c(a(a(?x))),
     a(a(c(?x))) = a(a(a(?x))),
     a(b(c(?x))) = b(a(a(?x))),
     c(a(a(?x_2))) = a(c(c(?x_2))),
     c(a(b(?x_4))) = a(c(b(?x_4))),
     c(b(c(?x_5))) = a(c(c(?x_5))),
     c(c(a(?x_8))) = a(c(a(?x_8))),
     a(a(a(a(?x_2)))) = b(a(c(c(?x_2)))),
     a(a(a(b(?x_4)))) = b(a(c(b(?x_4)))),
     a(a(b(c(?x_5)))) = b(a(c(c(?x_5)))),
     a(a(c(a(?x_8)))) = b(a(c(a(?x_8)))),
     b(c(a(a(?x_2)))) = b(a(c(c(?x_2)))),
     b(c(a(b(?x_4)))) = b(a(c(b(?x_4)))),
     b(c(b(c(?x_5)))) = b(a(c(c(?x_5)))),
     b(c(c(a(?x_8)))) = b(a(c(a(?x_8)))),
     c(b(a(a(?x_2)))) = a(a(c(c(?x_2)))),
     c(b(a(b(?x_4)))) = a(a(c(b(?x_4)))),
     c(b(b(c(?x_5)))) = a(a(c(c(?x_5)))),
     c(b(c(a(?x_8)))) = a(a(c(a(?x_8)))),
     a(a(b(?x))) = b(a(c(?x))),
     b(c(b(?x))) = b(a(c(?x))),
     c(b(b(?x))) = a(a(c(?x))),
     a(a(a(?x_2))) = a(a(c(?x_2))),
     a(a(b(?x_4))) = a(a(b(?x_4))),
     a(b(c(?x_5))) = a(a(c(?x_5))),
     a(c(a(?x_8))) = a(a(a(?x_8))),
     a(b(a(a(?x_2)))) = c(a(a(c(?x_2)))),
     a(b(a(b(?x_4)))) = c(a(a(b(?x_4)))),
     a(b(b(c(?x_5)))) = c(a(a(c(?x_5)))),
     a(b(c(a(?x_8)))) = c(a(a(a(?x_8)))),
     c(a(a(a(?x_2)))) = b(a(a(c(?x_2)))),
     c(a(a(b(?x_4)))) = b(a(a(b(?x_4)))),
     c(a(b(c(?x_5)))) = b(a(a(c(?x_5)))),
     c(a(c(a(?x_8)))) = b(a(a(a(?x_8)))),
     a(b(b(?x))) = c(a(a(?x))),
     c(a(b(?x))) = b(a(a(?x))),
     b(a(b(?x_1))) = a(b(b(?x_1))),
     b(a(a(?x_2))) = a(b(c(?x_2))),
     b(b(c(?x_5))) = a(b(c(?x_5))),
     b(c(a(?x_8))) = a(b(a(?x_8))),
     a(b(a(b(?x_1)))) = b(a(b(b(?x_1)))),
     a(b(a(a(?x_2)))) = b(a(b(c(?x_2)))),
     a(b(b(c(?x_5)))) = b(a(b(c(?x_5)))),
     a(b(c(a(?x_8)))) = b(a(b(a(?x_8)))),
     a(c(a(b(?x_1)))) = c(a(b(b(?x_1)))),
     a(c(a(a(?x_2)))) = c(a(b(c(?x_2)))),
     a(c(b(c(?x_5)))) = c(a(b(c(?x_5)))),
     a(c(c(a(?x_8)))) = c(a(b(a(?x_8)))),
     a(a(a(b(?x_1)))) = a(a(b(b(?x_1)))),
     a(a(a(a(?x_2)))) = a(a(b(c(?x_2)))),
     a(a(b(c(?x_5)))) = a(a(b(c(?x_5)))),
     a(a(c(a(?x_8)))) = a(a(b(a(?x_8)))),
     a(b(b(?x))) = b(a(b(?x))),
     a(c(b(?x))) = c(a(b(?x))),
     a(a(?x)) = b(c(?x)),
     b(a(c(?x_3))) = b(c(b(?x_3))),
     b(a(b(?x_6))) = b(c(a(?x_6))),
     a(c(a(c(?x_3)))) = c(b(c(b(?x_3)))),
     a(c(a(b(?x_6)))) = c(b(c(a(?x_6)))),
     a(a(a(c(?x_3)))) = a(b(c(b(?x_3)))),
     a(a(a(b(?x_6)))) = a(b(c(a(?x_6)))),
     a(b(a(c(?x_3)))) = b(b(c(b(?x_3)))),
     a(b(a(b(?x_6)))) = b(b(c(a(?x_6)))),
     a(c(c(?x))) = c(b(c(?x))),
     a(a(c(?x))) = a(b(c(?x))),
     a(b(c(?x))) = b(b(c(?x))),
     c(a(a(?x_4))) = a(b(b(?x_4))),
     c(c(b(?x_7))) = a(b(c(?x_7))),
     a(a(a(a(?x_4)))) = b(a(b(b(?x_4)))),
     a(a(c(b(?x_7)))) = b(a(b(c(?x_7)))),
     b(c(a(a(?x_4)))) = b(a(b(b(?x_4)))),
     b(c(c(b(?x_7)))) = b(a(b(c(?x_7)))),
     c(b(a(a(?x_4)))) = a(a(b(b(?x_4)))),
     c(b(c(b(?x_7)))) = a(a(b(c(?x_7)))),
     a(a(a(?x))) = b(a(b(?x))),
     b(c(a(?x))) = b(a(b(?x))),
     c(b(a(?x))) = a(a(b(?x))),
     a(a(c(?x_3))) = c(b(b(?x_3))),
     a(a(b(?x_7))) = c(b(a(?x_7))),
     a(b(a(c(?x_3)))) = c(c(b(b(?x_3)))),
     a(b(a(b(?x_7)))) = c(c(b(a(?x_7)))),
     c(a(a(c(?x_3)))) = b(c(b(b(?x_3)))),
     c(a(a(b(?x_7)))) = b(c(b(a(?x_7)))),
     a(b(c(?x))) = c(c(b(?x))),
     c(a(c(?x))) = b(c(b(?x))),
     b(a(a(?x_4))) = c(a(b(?x_4))),
     b(c(b(?x_8))) = c(a(c(?x_8))),
     a(c(a(a(?x_4)))) = c(c(a(b(?x_4)))),
     a(c(c(b(?x_8)))) = c(c(a(c(?x_8)))),
     a(a(a(a(?x_4)))) = a(c(a(b(?x_4)))),
     a(a(c(b(?x_8)))) = a(c(a(c(?x_8)))),
     a(b(a(a(?x_4)))) = b(c(a(b(?x_4)))),
     a(b(c(b(?x_8)))) = b(c(a(c(?x_8)))),
     a(c(a(?x))) = c(c(a(?x))),
     a(a(a(?x))) = a(c(a(?x))),
     a(b(a(?x))) = b(c(a(?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(a(c(?x_1))), a(a(b(?x_1)))> by Rules <1, 0> preceded by [(b,1)]
 joinable by a reduction of rules <[([(b,1)],6),([],0)], []>
Critical Pair <b(a(b(?x_5))), a(a(a(?x_5)))> by Rules <5, 0> preceded by [(b,1)]
 joinable by a reduction of rules <[([(b,1)],2),([],7),([],5),([],2)], []>
 joinable by a reduction of rules <[([],7),([(c,1)],2),([],5),([],2)], []>
 joinable by a reduction of rules <[([],7),([],5),([(a,1)],3),([(a,1)],2)], []>
 joinable by a reduction of rules <[([],7),([],5),([],2),([(a,1)],2)], []>
Critical Pair <c(a(a(?x))), a(c(c(?x)))> by Rules <0, 1> preceded by [(c,1)]
 joinable by a reduction of rules <[], [([],6),([(c,1)],0)]>
Critical Pair <c(a(b(?x_3))), a(c(b(?x_3)))> by Rules <3, 1> preceded by [(c,1)]
 joinable by a reduction of rules <[], [([],6),([(c,1)],3)]>
Critical Pair <c(b(c(?x_4))), a(c(c(?x_4)))> by Rules <4, 1> preceded by [(c,1)]
 joinable by a reduction of rules <[([],1)], []>
 joinable by a reduction of rules <[], [([],6)]>
Critical Pair <c(c(a(?x_7))), a(c(a(?x_7)))> by Rules <7, 1> preceded by [(c,1)]
 joinable by a reduction of rules <[], [([],6),([(c,1)],7)]>
Critical Pair <a(a(a(?x))), a(a(c(?x)))> by Rules <0, 2> preceded by [(a,1)]
unknown Diagram Decreasing
check Non-Confluence...
obtain 12 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...
STEP: 1 (parallel)
S:
   [ b(c(?x)) -> a(a(?x)),
     a(b(?x)) -> a(a(?x)),
     b(b(?x)) -> a(b(?x)),
     c(a(?x)) -> a(b(?x)),
     b(a(?x)) -> c(a(?x)) ]
P:
   [ c(b(?x)) -> a(c(?x)),
     b(c(?x)) -> b(c(?x)),
     a(c(?x)) -> c(b(?x)) ]
S: terminating
CP(S,S):
<b(a(b(?x_3))), a(a(a(?x_3)))> --> <a(a(a(?x_3))), a(a(a(?x_3)))> => yes
<a(a(a(?x))), a(a(c(?x)))> --> <a(a(a(?x))), a(a(c(?x)))> => no
<a(a(b(?x_2))), a(a(b(?x_2)))> --> <a(a(a(?x_2))), a(a(a(?x_2)))> => yes
<a(c(a(?x_4))), a(a(a(?x_4)))> --> <a(a(a(?x_4))), a(a(a(?x_4)))> => yes
<b(a(a(?x))), a(b(c(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
<b(a(b(?x))), a(b(b(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
<b(c(a(?x_4))), a(b(a(?x_4)))> --> <a(a(a(?x_4))), a(a(a(?x_4)))> => yes
<c(a(a(?x_1))), a(b(b(?x_1)))> --> <a(a(a(?x_1))), a(a(a(?x_1)))> => yes
<b(a(a(?x_1))), c(a(b(?x_1)))> --> <a(a(a(?x_1))), a(a(a(?x_1)))> => yes
PCP_in(symP,S):
<b(a(c(?x_3))), a(a(b(?x_3)))> --> <a(a(a(?x_3))), a(a(a(?x_3)))> => yes
<a(b(c(?x_2))), a(a(c(?x_2)))> --> <a(a(a(?x_2))), a(a(c(?x_2)))> => no
<b(b(c(?x_2))), a(b(c(?x_2)))> --> <a(a(a(?x_2))), a(a(a(?x_2)))> => yes
<c(c(b(?x_1))), a(b(c(?x_1)))> --> <c(c(b(?x_1))), a(a(a(?x_1)))> => no
<b(c(b(?x_1))), c(a(c(?x_1)))> --> <a(a(a(?x_1))), a(a(a(?x_1)))> => yes
CP(S,symP):
<a(a(?x)), b(c(?x))> --> <a(a(?x)), a(a(?x))> => yes
<c(a(a(?x))), a(c(c(?x)))> --> <a(a(a(?x))), a(c(c(?x)))> => no
<c(a(b(?x))), a(c(b(?x)))> --> <a(a(a(?x))), a(c(b(?x)))> => no
<a(a(b(?x))), c(b(a(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
<b(a(b(?x))), b(c(a(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
<c(c(a(?x))), a(c(a(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
check joinability condition:
check modulo joinability of a(a(a(?x))) and a(a(c(?x))): joinable by {0}
check modulo joinability of a(a(a(?x_2))) and a(a(c(?x_2))): joinable by {0}
check modulo reachablity from a(a(a(?x_1))) to c(c(b(?x_1))): maybe not reachable
check modulo reachablity from a(a(a(?x))) to a(c(c(?x))): maybe not reachable
check modulo reachablity from a(a(a(?x))) to a(c(b(?x))): maybe not reachable
failed
failure(Step 1)
   [ ]
Added S-Rules:
   [ ]
Added P-Rules:
   [ ]
STEP: 2 (linear)
S:
   [ b(c(?x)) -> a(a(?x)),
     a(b(?x)) -> a(a(?x)),
     b(b(?x)) -> a(b(?x)),
     c(a(?x)) -> a(b(?x)),
     b(a(?x)) -> c(a(?x)) ]
P:
   [ c(b(?x)) -> a(c(?x)),
     b(c(?x)) -> b(c(?x)),
     a(c(?x)) -> c(b(?x)) ]
S: terminating
CP(S,S):
<b(a(b(?x_3))), a(a(a(?x_3)))> --> <a(a(a(?x_3))), a(a(a(?x_3)))> => yes
<a(a(a(?x))), a(a(c(?x)))> --> <a(a(a(?x))), a(a(c(?x)))> => no
<a(a(b(?x_2))), a(a(b(?x_2)))> --> <a(a(a(?x_2))), a(a(a(?x_2)))> => yes
<a(c(a(?x_4))), a(a(a(?x_4)))> --> <a(a(a(?x_4))), a(a(a(?x_4)))> => yes
<b(a(a(?x))), a(b(c(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
<b(a(b(?x))), a(b(b(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
<b(c(a(?x_4))), a(b(a(?x_4)))> --> <a(a(a(?x_4))), a(a(a(?x_4)))> => yes
<c(a(a(?x_1))), a(b(b(?x_1)))> --> <a(a(a(?x_1))), a(a(a(?x_1)))> => yes
<b(a(a(?x_1))), c(a(b(?x_1)))> --> <a(a(a(?x_1))), a(a(a(?x_1)))> => yes
CP_in(symP,S):
<c(c(b(?x))), a(b(c(?x)))> --> <c(c(b(?x))), a(a(a(?x)))> => no
<b(c(b(?x))), c(a(c(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
<a(b(c(?x))), a(a(c(?x)))> --> <a(a(a(?x))), a(a(c(?x)))> => no
<b(b(c(?x))), a(b(c(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
<b(a(c(?x))), a(a(b(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
CP(S,symP):
<a(a(?x)), b(c(?x))> --> <a(a(?x)), a(a(?x))> => yes
<c(a(a(?x))), a(c(c(?x)))> --> <a(a(a(?x))), a(c(c(?x)))> => no
<c(a(b(?x))), a(c(b(?x)))> --> <a(a(a(?x))), a(c(b(?x)))> => no
<a(a(b(?x))), c(b(a(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
<b(a(b(?x))), b(c(a(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
<c(c(a(?x))), a(c(a(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
check joinability condition:
check modulo joinability of a(a(a(?x))) and a(a(c(?x))): maybe not joinable
check modulo reachablity from a(a(a(?x))) to c(c(b(?x))): maybe not reachable
check modulo joinability of a(a(a(?x))) and a(a(c(?x))): maybe not joinable
check modulo reachablity from a(a(a(?x))) to a(c(c(?x))): maybe not reachable
check modulo reachablity from a(a(a(?x))) to a(c(b(?x))): maybe not reachable
failed
failure(Step 2)
   [ ]
Added S-Rules:
   [ ]
Added P-Rules:
   [ ]
STEP: 3 (relative)
S:
   [ b(c(?x)) -> a(a(?x)),
     a(b(?x)) -> a(a(?x)),
     b(b(?x)) -> a(b(?x)),
     c(a(?x)) -> a(b(?x)),
     b(a(?x)) -> c(a(?x)) ]
P:
   [ c(b(?x)) -> a(c(?x)),
     b(c(?x)) -> b(c(?x)),
     a(c(?x)) -> c(b(?x)) ]
Check relative termination:
   [ b(c(?x)) -> a(a(?x)),
     a(b(?x)) -> a(a(?x)),
     b(b(?x)) -> a(b(?x)),
     c(a(?x)) -> a(b(?x)),
     b(a(?x)) -> c(a(?x)) ]
   [ c(b(?x)) -> a(c(?x)),
     b(c(?x)) -> b(c(?x)),
     a(c(?x)) -> c(b(?x)) ]
Polynomial Interpretation:
  a:= (1)*x1
  b:= (1)*x1
  c:= (8)+(1)*x1
retract b(c(?x)) -> a(a(?x))
retract c(a(?x)) -> a(b(?x))
Polynomial Interpretation:
  a:= (2)*x1*x1
  b:= (1)+(2)*x1*x1
  c:= (1)+(2)*x1*x1
retract b(c(?x)) -> a(a(?x))
retract a(b(?x)) -> a(a(?x))
retract b(b(?x)) -> a(b(?x))
retract c(a(?x)) -> a(b(?x))
retract c(b(?x)) -> a(c(?x))
Polynomial Interpretation:
  a:= (2)+(1)*x1+(1)*x1*x1
  b:= (1)*x1*x1
  c:= (1)*x1
relatively terminating
S/P: relatively terminating
check CP condition:
failed
failure(Step 3)
failure(no possibility remains)
unknown Reduction-Preserving Completion
Direct Methods: Can't judge

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

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

Try Commutative Decomposition for...
   [ b(c(?x)) -> a(a(?x)),
     c(b(?x)) -> a(c(?x)),
     a(b(?x)) -> a(a(?x)),
     b(b(?x)) -> a(b(?x)),
     b(c(?x)) -> b(c(?x)),
     c(a(?x)) -> a(b(?x)),
     a(c(?x)) -> c(b(?x)),
     b(a(?x)) -> c(a(?x)) ]
Outside Critical Pair: <b(c(?x_4)), a(a(?x_4))> by Rules <4, 0>
develop reducts from lhs term...
<{4}, b(c(?x_4))>
<{0}, a(a(?x_4))>
<{}, b(c(?x_4))>
develop reducts from rhs term...
<{}, a(a(?x_4))>
Inside Critical Pair: <b(a(c(?x_1))), a(a(b(?x_1)))> by Rules <1, 0>
develop reducts from lhs term...
<{7}, c(a(c(?x_1)))>
<{6}, b(c(b(?x_1)))>
<{}, b(a(c(?x_1)))>
develop reducts from rhs term...
<{2}, a(a(a(?x_1)))>
<{}, a(a(b(?x_1)))>
Inside Critical Pair: <b(a(b(?x_5))), a(a(a(?x_5)))> by Rules <5, 0>
develop reducts from lhs term...
<{7}, c(a(b(?x_5)))>
<{2}, b(a(a(?x_5)))>
<{}, b(a(b(?x_5)))>
develop reducts from rhs term...
<{}, a(a(a(?x_5)))>
Inside Critical Pair: <c(a(a(?x))), a(c(c(?x)))> by Rules <0, 1>
develop reducts from lhs term...
<{5}, a(b(a(?x)))>
<{}, c(a(a(?x)))>
develop reducts from rhs term...
<{6}, c(b(c(?x)))>
<{}, a(c(c(?x)))>
Inside Critical Pair: <c(a(b(?x_3))), a(c(b(?x_3)))> by Rules <3, 1>
develop reducts from lhs term...
<{5}, a(b(b(?x_3)))>
<{2}, c(a(a(?x_3)))>
<{}, c(a(b(?x_3)))>
develop reducts from rhs term...
<{6}, c(b(b(?x_3)))>
<{1}, a(a(c(?x_3)))>
<{}, a(c(b(?x_3)))>
Inside Critical Pair: <c(b(c(?x_4))), a(c(c(?x_4)))> by Rules <4, 1>
develop reducts from lhs term...
<{1}, a(c(c(?x_4)))>
<{4}, c(b(c(?x_4)))>
<{0}, c(a(a(?x_4)))>
<{}, c(b(c(?x_4)))>
develop reducts from rhs term...
<{6}, c(b(c(?x_4)))>
<{}, a(c(c(?x_4)))>
Inside Critical Pair: <c(c(a(?x_7))), a(c(a(?x_7)))> by Rules <7, 1>
develop reducts from lhs term...
<{5}, c(a(b(?x_7)))>
<{}, c(c(a(?x_7)))>
develop reducts from rhs term...
<{6}, c(b(a(?x_7)))>
<{5}, a(a(b(?x_7)))>
<{}, a(c(a(?x_7)))>
Inside Critical Pair: <a(a(a(?x))), a(a(c(?x)))> by Rules <0, 2>
develop reducts from lhs term...
<{}, a(a(a(?x)))>
develop reducts from rhs term...
<{6}, a(c(b(?x)))>
<{}, a(a(c(?x)))>
Inside Critical Pair: <a(a(b(?x_3))), a(a(b(?x_3)))> by Rules <3, 2>
develop reducts from lhs term...
<{2}, a(a(a(?x_3)))>
<{}, a(a(b(?x_3)))>
develop reducts from rhs term...
<{2}, a(a(a(?x_3)))>
<{}, a(a(b(?x_3)))>
Inside Critical Pair: <a(b(c(?x_4))), a(a(c(?x_4)))> by Rules <4, 2>
develop reducts from lhs term...
<{2}, a(a(c(?x_4)))>
<{4}, a(b(c(?x_4)))>
<{0}, a(a(a(?x_4)))>
<{}, a(b(c(?x_4)))>
develop reducts from rhs term...
<{6}, a(c(b(?x_4)))>
<{}, a(a(c(?x_4)))>
Inside Critical Pair: <a(c(a(?x_7))), a(a(a(?x_7)))> by Rules <7, 2>
develop reducts from lhs term...
<{6}, c(b(a(?x_7)))>
<{5}, a(a(b(?x_7)))>
<{}, a(c(a(?x_7)))>
develop reducts from rhs term...
<{}, a(a(a(?x_7)))>
Inside Critical Pair: <b(a(a(?x))), a(b(c(?x)))> by Rules <0, 3>
develop reducts from lhs term...
<{7}, c(a(a(?x)))>
<{}, b(a(a(?x)))>
develop reducts from rhs term...
<{2}, a(a(c(?x)))>
<{4}, a(b(c(?x)))>
<{0}, a(a(a(?x)))>
<{}, a(b(c(?x)))>
Inside Critical Pair: <b(b(c(?x_4))), a(b(c(?x_4)))> by Rules <4, 3>
develop reducts from lhs term...
<{3}, a(b(c(?x_4)))>
<{4}, b(b(c(?x_4)))>
<{0}, b(a(a(?x_4)))>
<{}, b(b(c(?x_4)))>
develop reducts from rhs term...
<{2}, a(a(c(?x_4)))>
<{4}, a(b(c(?x_4)))>
<{0}, a(a(a(?x_4)))>
<{}, a(b(c(?x_4)))>
Inside Critical Pair: <b(c(a(?x_7))), a(b(a(?x_7)))> by Rules <7, 3>
develop reducts from lhs term...
<{4}, b(c(a(?x_7)))>
<{0}, a(a(a(?x_7)))>
<{5}, b(a(b(?x_7)))>
<{}, b(c(a(?x_7)))>
develop reducts from rhs term...
<{2}, a(a(a(?x_7)))>
<{7}, a(c(a(?x_7)))>
<{}, a(b(a(?x_7)))>
Inside Critical Pair: <b(a(c(?x_1))), b(c(b(?x_1)))> by Rules <1, 4>
develop reducts from lhs term...
<{7}, c(a(c(?x_1)))>
<{6}, b(c(b(?x_1)))>
<{}, b(a(c(?x_1)))>
develop reducts from rhs term...
<{4}, b(c(b(?x_1)))>
<{0}, a(a(b(?x_1)))>
<{1}, b(a(c(?x_1)))>
<{}, b(c(b(?x_1)))>
Inside Critical Pair: <b(a(b(?x_5))), b(c(a(?x_5)))> by Rules <5, 4>
develop reducts from lhs term...
<{7}, c(a(b(?x_5)))>
<{2}, b(a(a(?x_5)))>
<{}, b(a(b(?x_5)))>
develop reducts from rhs term...
<{4}, b(c(a(?x_5)))>
<{0}, a(a(a(?x_5)))>
<{5}, b(a(b(?x_5)))>
<{}, b(c(a(?x_5)))>
Inside Critical Pair: <c(a(a(?x_2))), a(b(b(?x_2)))> by Rules <2, 5>
develop reducts from lhs term...
<{5}, a(b(a(?x_2)))>
<{}, c(a(a(?x_2)))>
develop reducts from rhs term...
<{2}, a(a(b(?x_2)))>
<{3}, a(a(b(?x_2)))>
<{}, a(b(b(?x_2)))>
Inside Critical Pair: <c(c(b(?x_6))), a(b(c(?x_6)))> by Rules <6, 5>
develop reducts from lhs term...
<{1}, c(a(c(?x_6)))>
<{}, c(c(b(?x_6)))>
develop reducts from rhs term...
<{2}, a(a(c(?x_6)))>
<{4}, a(b(c(?x_6)))>
<{0}, a(a(a(?x_6)))>
<{}, a(b(c(?x_6)))>
Inside Critical Pair: <a(a(c(?x_1))), c(b(b(?x_1)))> by Rules <1, 6>
develop reducts from lhs term...
<{6}, a(c(b(?x_1)))>
<{}, a(a(c(?x_1)))>
develop reducts from rhs term...
<{1}, a(c(b(?x_1)))>
<{3}, c(a(b(?x_1)))>
<{}, c(b(b(?x_1)))>
Inside Critical Pair: <a(a(b(?x_5))), c(b(a(?x_5)))> by Rules <5, 6>
develop reducts from lhs term...
<{2}, a(a(a(?x_5)))>
<{}, a(a(b(?x_5)))>
develop reducts from rhs term...
<{1}, a(c(a(?x_5)))>
<{7}, c(c(a(?x_5)))>
<{}, c(b(a(?x_5)))>
Inside Critical Pair: <b(a(a(?x_2))), c(a(b(?x_2)))> by Rules <2, 7>
develop reducts from lhs term...
<{7}, c(a(a(?x_2)))>
<{}, b(a(a(?x_2)))>
develop reducts from rhs term...
<{5}, a(b(b(?x_2)))>
<{2}, c(a(a(?x_2)))>
<{}, c(a(b(?x_2)))>
Inside Critical Pair: <b(c(b(?x_6))), c(a(c(?x_6)))> by Rules <6, 7>
develop reducts from lhs term...
<{4}, b(c(b(?x_6)))>
<{0}, a(a(b(?x_6)))>
<{1}, b(a(c(?x_6)))>
<{}, b(c(b(?x_6)))>
develop reducts from rhs term...
<{5}, a(b(c(?x_6)))>
<{6}, c(c(b(?x_6)))>
<{}, c(a(c(?x_6)))>
Try A Minimal Decomposition {6,2,7,3,1,0,5}{4}
{6,2,7,3,1,0,5}
(cm)Rewrite Rules:
   [ a(c(?x)) -> c(b(?x)),
     a(b(?x)) -> a(a(?x)),
     b(a(?x)) -> c(a(?x)),
     b(b(?x)) -> a(b(?x)),
     c(b(?x)) -> a(c(?x)),
     b(c(?x)) -> a(a(?x)),
     c(a(?x)) -> a(b(?x)) ]
Apply Direct Methods...
Inner CPs:
   [ a(a(c(?x_4))) = c(b(b(?x_4))),
     a(a(b(?x_6))) = c(b(a(?x_6))),
     a(c(a(?x_2))) = a(a(a(?x_2))),
     a(a(b(?x_3))) = a(a(b(?x_3))),
     a(a(a(?x_5))) = a(a(c(?x_5))),
     b(c(b(?x))) = c(a(c(?x))),
     b(a(a(?x_1))) = c(a(b(?x_1))),
     b(c(a(?x_2))) = a(b(a(?x_2))),
     b(a(a(?x_5))) = a(b(c(?x_5))),
     c(c(a(?x_2))) = a(c(a(?x_2))),
     c(a(b(?x_3))) = a(c(b(?x_3))),
     c(a(a(?x_5))) = a(c(c(?x_5))),
     b(a(c(?x_4))) = a(a(b(?x_4))),
     b(a(b(?x_6))) = a(a(a(?x_6))),
     c(c(b(?x))) = a(b(c(?x))),
     c(a(a(?x_1))) = a(b(b(?x_1))),
     b(a(b(?x))) = a(b(b(?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(a(c(?x_5))) = c(b(b(?x_5))),
     a(a(b(?x_7))) = c(b(a(?x_7))),
     c(a(a(c(?x_5)))) = b(c(b(b(?x_5)))),
     c(a(a(b(?x_7)))) = b(c(b(a(?x_7)))),
     a(b(a(c(?x_5)))) = c(c(b(b(?x_5)))),
     a(b(a(b(?x_7)))) = c(c(b(a(?x_7)))),
     c(a(c(?x))) = b(c(b(?x))),
     a(b(c(?x))) = c(c(b(?x))),
     a(c(a(?x_3))) = a(a(a(?x_3))),
     a(a(b(?x_4))) = a(a(b(?x_4))),
     a(a(a(?x_6))) = a(a(c(?x_6))),
     c(a(c(a(?x_3)))) = b(a(a(a(?x_3)))),
     c(a(a(b(?x_4)))) = b(a(a(b(?x_4)))),
     c(a(a(a(?x_6)))) = b(a(a(c(?x_6)))),
     a(b(c(a(?x_3)))) = c(a(a(a(?x_3)))),
     a(b(a(b(?x_4)))) = c(a(a(b(?x_4)))),
     a(b(a(a(?x_6)))) = c(a(a(c(?x_6)))),
     c(a(b(?x))) = b(a(a(?x))),
     a(b(b(?x))) = c(a(a(?x))),
     b(c(b(?x_2))) = c(a(c(?x_2))),
     b(a(a(?x_3))) = c(a(b(?x_3))),
     a(a(c(b(?x_2)))) = a(c(a(c(?x_2)))),
     a(a(a(a(?x_3)))) = a(c(a(b(?x_3)))),
     a(b(c(b(?x_2)))) = b(c(a(c(?x_2)))),
     a(b(a(a(?x_3)))) = b(c(a(b(?x_3)))),
     a(c(c(b(?x_2)))) = c(c(a(c(?x_2)))),
     a(c(a(a(?x_3)))) = c(c(a(b(?x_3)))),
     a(a(a(?x))) = a(c(a(?x))),
     a(b(a(?x))) = b(c(a(?x))),
     a(c(a(?x))) = c(c(a(?x))),
     b(a(b(?x_1))) = a(b(b(?x_1))),
     b(c(a(?x_4))) = a(b(a(?x_4))),
     b(a(a(?x_6))) = a(b(c(?x_6))),
     a(b(a(b(?x_1)))) = b(a(b(b(?x_1)))),
     a(b(c(a(?x_4)))) = b(a(b(a(?x_4)))),
     a(b(a(a(?x_6)))) = b(a(b(c(?x_6)))),
     a(a(a(b(?x_1)))) = a(a(b(b(?x_1)))),
     a(a(c(a(?x_4)))) = a(a(b(a(?x_4)))),
     a(a(a(a(?x_6)))) = a(a(b(c(?x_6)))),
     a(c(a(b(?x_1)))) = c(a(b(b(?x_1)))),
     a(c(c(a(?x_4)))) = c(a(b(a(?x_4)))),
     a(c(a(a(?x_6)))) = c(a(b(c(?x_6)))),
     a(b(b(?x))) = b(a(b(?x))),
     a(c(b(?x))) = c(a(b(?x))),
     c(c(a(?x_4))) = a(c(a(?x_4))),
     c(a(b(?x_5))) = a(c(b(?x_5))),
     c(a(a(?x_6))) = a(c(c(?x_6))),
     c(b(c(a(?x_4)))) = a(a(c(a(?x_4)))),
     c(b(a(b(?x_5)))) = a(a(c(b(?x_5)))),
     c(b(a(a(?x_6)))) = a(a(c(c(?x_6)))),
     a(a(c(a(?x_4)))) = b(a(c(a(?x_4)))),
     a(a(a(b(?x_5)))) = b(a(c(b(?x_5)))),
     a(a(a(a(?x_6)))) = b(a(c(c(?x_6)))),
     c(b(b(?x))) = a(a(c(?x))),
     a(a(b(?x))) = b(a(c(?x))),
     b(a(c(?x_6))) = a(a(b(?x_6))),
     b(a(b(?x_7))) = a(a(a(?x_7))),
     a(a(a(c(?x_6)))) = a(a(a(b(?x_6)))),
     a(a(a(b(?x_7)))) = a(a(a(a(?x_7)))),
     a(b(a(c(?x_6)))) = b(a(a(b(?x_6)))),
     a(b(a(b(?x_7)))) = b(a(a(a(?x_7)))),
     a(c(a(c(?x_6)))) = c(a(a(b(?x_6)))),
     a(c(a(b(?x_7)))) = c(a(a(a(?x_7)))),
     a(a(c(?x))) = a(a(a(?x))),
     a(b(c(?x))) = b(a(a(?x))),
     a(c(c(?x))) = c(a(a(?x))),
     c(c(b(?x_2))) = a(b(c(?x_2))),
     c(a(a(?x_3))) = a(b(b(?x_3))),
     c(b(c(b(?x_2)))) = a(a(b(c(?x_2)))),
     c(b(a(a(?x_3)))) = a(a(b(b(?x_3)))),
     a(a(c(b(?x_2)))) = b(a(b(c(?x_2)))),
     a(a(a(a(?x_3)))) = b(a(b(b(?x_3)))),
     c(b(a(?x))) = a(a(b(?x))),
     a(a(a(?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 <a(a(c(?x_4))), c(b(b(?x_4)))> by Rules <4, 0> preceded by [(a,1)]
 joinable by a reduction of rules <[([(a,1)],0)], [([],4)]>
Critical Pair <a(a(b(?x_6))), c(b(a(?x_6)))> by Rules <6, 0> preceded by [(a,1)]
 joinable by a reduction of rules <[], [([],4),([(a,1)],6)]>
Critical Pair <a(c(a(?x_2))), a(a(a(?x_2)))> by Rules <2, 1> preceded by [(a,1)]
 joinable by a reduction of rules <[([(a,1)],6),([(a,1)],1)], []>
Critical Pair <a(a(b(?x_3))), a(a(b(?x_3)))> by Rules <3, 1> preceded by [(a,1)]
 joinable by a reduction of rules <[], []>
Critical Pair <a(a(a(?x_5))), a(a(c(?x_5)))> by Rules <5, 1> preceded by [(a,1)]
unknown Diagram Decreasing
check Non-Confluence...
obtain 12 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...
STEP: 1 (parallel)
S:
   [ a(b(?x)) -> a(a(?x)),
     b(a(?x)) -> c(a(?x)),
     b(b(?x)) -> a(b(?x)),
     b(c(?x)) -> a(a(?x)),
     c(a(?x)) -> a(b(?x)) ]
P:
   [ a(c(?x)) -> c(b(?x)),
     c(b(?x)) -> a(c(?x)) ]
S: terminating
CP(S,S):
<a(c(a(?x_1))), a(a(a(?x_1)))> --> <a(a(a(?x_1))), a(a(a(?x_1)))> => yes
<a(a(b(?x_2))), a(a(b(?x_2)))> --> <a(a(a(?x_2))), a(a(a(?x_2)))> => yes
<a(a(a(?x_3))), a(a(c(?x_3)))> --> <a(a(a(?x_3))), a(a(c(?x_3)))> => no
<b(a(a(?x))), c(a(b(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
<b(c(a(?x_1))), a(b(a(?x_1)))> --> <a(a(a(?x_1))), a(a(a(?x_1)))> => yes
<b(a(b(?x))), a(b(b(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
<b(a(a(?x_3))), a(b(c(?x_3)))> --> <a(a(a(?x_3))), a(a(a(?x_3)))> => yes
<b(a(b(?x_4))), a(a(a(?x_4)))> --> <a(a(a(?x_4))), a(a(a(?x_4)))> => yes
<c(a(a(?x))), a(b(b(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
PCP_in(symP,S):
<b(c(b(?x_2))), c(a(c(?x_2)))> --> <a(a(a(?x_2))), a(a(a(?x_2)))> => yes
<b(a(c(?x_1))), a(a(b(?x_1)))> --> <a(a(a(?x_1))), a(a(a(?x_1)))> => yes
<c(c(b(?x_2))), a(b(c(?x_2)))> --> <c(c(b(?x_2))), a(a(a(?x_2)))> => no
CP(S,symP):
<c(c(a(?x))), a(c(a(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
<c(a(b(?x))), a(c(b(?x)))> --> <a(a(a(?x))), a(c(b(?x)))> => no
<c(a(a(?x))), a(c(c(?x)))> --> <a(a(a(?x))), a(c(c(?x)))> => no
<a(a(b(?x))), c(b(a(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
check joinability condition:
check modulo joinability of a(a(a(?x_3))) and a(a(c(?x_3))): joinable by {1}
check modulo reachablity from a(a(a(?x_2))) to c(c(b(?x_2))): maybe not reachable
check modulo reachablity from a(a(a(?x))) to a(c(b(?x))): maybe not reachable
check modulo reachablity from a(a(a(?x))) to a(c(c(?x))): maybe not reachable
failed
failure(Step 1)
   [ ]
Added S-Rules:
   [ ]
Added P-Rules:
   [ ]
STEP: 2 (linear)
S:
   [ a(b(?x)) -> a(a(?x)),
     b(a(?x)) -> c(a(?x)),
     b(b(?x)) -> a(b(?x)),
     b(c(?x)) -> a(a(?x)),
     c(a(?x)) -> a(b(?x)) ]
P:
   [ a(c(?x)) -> c(b(?x)),
     c(b(?x)) -> a(c(?x)) ]
S: terminating
CP(S,S):
<a(c(a(?x_1))), a(a(a(?x_1)))> --> <a(a(a(?x_1))), a(a(a(?x_1)))> => yes
<a(a(b(?x_2))), a(a(b(?x_2)))> --> <a(a(a(?x_2))), a(a(a(?x_2)))> => yes
<a(a(a(?x_3))), a(a(c(?x_3)))> --> <a(a(a(?x_3))), a(a(c(?x_3)))> => no
<b(a(a(?x))), c(a(b(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
<b(c(a(?x_1))), a(b(a(?x_1)))> --> <a(a(a(?x_1))), a(a(a(?x_1)))> => yes
<b(a(b(?x))), a(b(b(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
<b(a(a(?x_3))), a(b(c(?x_3)))> --> <a(a(a(?x_3))), a(a(a(?x_3)))> => yes
<b(a(b(?x_4))), a(a(a(?x_4)))> --> <a(a(a(?x_4))), a(a(a(?x_4)))> => yes
<c(a(a(?x))), a(b(b(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
CP_in(symP,S):
<b(a(c(?x))), a(a(b(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
<b(c(b(?x))), c(a(c(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
<c(c(b(?x))), a(b(c(?x)))> --> <c(c(b(?x))), a(a(a(?x)))> => no
CP(S,symP):
<c(c(a(?x))), a(c(a(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
<c(a(b(?x))), a(c(b(?x)))> --> <a(a(a(?x))), a(c(b(?x)))> => no
<c(a(a(?x))), a(c(c(?x)))> --> <a(a(a(?x))), a(c(c(?x)))> => no
<a(a(b(?x))), c(b(a(?x)))> --> <a(a(a(?x))), a(a(a(?x)))> => yes
check joinability condition:
check modulo joinability of a(a(a(?x_3))) and a(a(c(?x_3))): maybe not joinable
check modulo reachablity from a(a(a(?x))) to c(c(b(?x))): maybe not reachable
check modulo reachablity from a(a(a(?x))) to a(c(b(?x))): maybe not reachable
check modulo reachablity from a(a(a(?x))) to a(c(c(?x))): maybe not reachable
failed
failure(Step 2)
   [ ]
Added S-Rules:
   [ ]
Added P-Rules:
   [ ]
STEP: 3 (relative)
S:
   [ a(b(?x)) -> a(a(?x)),
     b(a(?x)) -> c(a(?x)),
     b(b(?x)) -> a(b(?x)),
     b(c(?x)) -> a(a(?x)),
     c(a(?x)) -> a(b(?x)) ]
P:
   [ a(c(?x)) -> c(b(?x)),
     c(b(?x)) -> a(c(?x)) ]
Check relative termination:
   [ a(b(?x)) -> a(a(?x)),
     b(a(?x)) -> c(a(?x)),
     b(b(?x)) -> a(b(?x)),
     b(c(?x)) -> a(a(?x)),
     c(a(?x)) -> a(b(?x)) ]
   [ a(c(?x)) -> c(b(?x)),
     c(b(?x)) -> a(c(?x)) ]
Polynomial Interpretation:
  a:= (2)*x1
  b:= (2)*x1
  c:= (4)+(2)*x1
retract b(c(?x)) -> a(a(?x))
retract c(a(?x)) -> a(b(?x))
retract a(c(?x)) -> c(b(?x))
Polynomial Interpretation:
  a:= (2)*x1*x1
  b:= (1)+(2)*x1*x1
  c:= (2)*x1*x1
relatively terminating
S/P: relatively terminating
check CP condition:
failed
failure(Step 3)
failure(no possibility remains)
unknown Reduction-Preserving Completion
Direct Methods: Can't judge

Try Persistent Decomposition for...
   [ a(c(?x)) -> c(b(?x)),
     a(b(?x)) -> a(a(?x)),
     b(a(?x)) -> c(a(?x)),
     b(b(?x)) -> a(b(?x)),
     c(b(?x)) -> a(c(?x)),
     b(c(?x)) -> a(a(?x)),
     c(a(?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...
   [ a(c(?x)) -> c(b(?x)),
     a(b(?x)) -> a(a(?x)),
     b(a(?x)) -> c(a(?x)),
     b(b(?x)) -> a(b(?x)),
     c(b(?x)) -> a(c(?x)),
     b(c(?x)) -> a(a(?x)),
     c(a(?x)) -> a(b(?x)) ]
Layer Preserving Decomposition failed: Can't judge
No further decomposition possible

{4}
(cm)Rewrite Rules:
   [ b(c(?x)) -> b(c(?x)) ]
Apply Direct Methods...
Inner CPs:
   [  ]
Outer CPs:
   [  ]
Overlay, check Innermost Termination...
unknown Innermost Terminating
unknown Knuth & Bendix
Linear
Development Closed
Direct Methods: CR
Commutative Decomposition failed: Can't judge
No further decomposition possible


Combined result: Can't judge
1005.trs: Failure(unknown CR)
MAYBE
(9320 msec.)