YES
(ignored inputs)COMMENT translated from Cops 190
*** Computating Strongly Quasi-Reducible Parts ***
TRS:
   [ or(?x,T) -> T,
     or(?x,F) -> ?x,
     or(?x,?y) -> or(?y,?x) ]
Constructors: {F,T}
Defined function symbols: {or}
Constructor subsystem:
   [ ]
Rule part & Conj Part:
   [ or(?x,T) -> T,
     or(?x,F) -> ?x ]
   [ or(?x,?y) -> or(?y,?x) ]
*** Ground Confluence Check by Rewriting Induction ***
Sort: {Bool}
Signature:
   [ F : Bool,
     T : Bool,
     or : Bool,Bool -> Bool ]
Rule Part:
   [ or(?x,T) -> T,
     or(?x,F) -> ?x ]
Conjecture Part:
   [ or(?x,?y) = or(?y,?x) ]
Precedence (by weight): {(F,2),(T,0),(or,1)}
Rule part is confluent.
R0 is ground confluent.
Check conj part consists of inductive theorems of R0.
Rules:
   [ or(?x,T) -> T,
     or(?x,F) -> ?x ]
Conjectures:
   [ or(?x,?y) = or(?y,?x) ]
STEP 0
ES:
   [ or(?x,?y) = or(?y,?x) ]
HS:
   [ ]
ES0:
   [ or(?x,?y) = or(?y,?x) ]
HS0:
   [ ]
ES1:
   [ or(?x,?y) = or(?y,?x) ]
HS1:
   [ ]
Expand or(?x,?y) = or(?y,?x)
   [ T = or(T,?x_1),
     ?x_2 = or(F,?x_2) ]
ES2:
   [ T = or(T,?x_1),
     ?x_2 = or(F,?x_2) ]
HS2:
   [ or(?x,?y) -> or(?y,?x) ]
STEP 1
ES:
   [ T = or(T,?x_1),
     ?x_2 = or(F,?x_2) ]
HS:
   [ or(?x,?y) -> or(?y,?x) ]
ES0:
   [ T = or(T,?x_1),
     ?x_2 = or(F,?x_2) ]
HS0:
   [ or(?x,?y) -> or(?y,?x) ]
ES1:
   [ T = or(T,?x_1),
     ?x_2 = or(F,?x_2) ]
HS1:
   [ or(?x,?y) -> or(?y,?x) ]
Expand or(T,?x_1) = T
   [ T = T,
     T = T ]
ES2:
   [ T = T,
     T = T,
     ?x_2 = or(F,?x_2) ]
HS2:
   [ or(T,?x_1) -> T,
     or(?x,?y) -> or(?y,?x) ]
STEP 2
ES:
   [ T = T,
     T = T,
     ?x_2 = or(F,?x_2) ]
HS:
   [ or(T,?x_1) -> T,
     or(?x,?y) -> or(?y,?x) ]
ES0:
   [ T = T,
     T = T,
     ?x_2 = or(F,?x_2) ]
HS0:
   [ or(T,?x_1) -> T,
     or(?x,?y) -> or(?y,?x) ]
ES1:
   [ ?x_2 = or(F,?x_2) ]
HS1:
   [ or(T,?x_1) -> T,
     or(?x,?y) -> or(?y,?x) ]
Expand or(F,?x_2) = ?x_2
   [ T = T,
     F = F ]
ES2:
   [ T = T,
     F = F ]
HS2:
   [ or(F,?x_2) -> ?x_2,
     or(T,?x_1) -> T,
     or(?x,?y) -> or(?y,?x) ]
STEP 3
ES:
   [ T = T,
     F = F ]
HS:
   [ or(F,?x_2) -> ?x_2,
     or(T,?x_1) -> T,
     or(?x,?y) -> or(?y,?x) ]
ES0:
   [ T = T,
     F = F ]
HS0:
   [ or(F,?x_2) -> ?x_2,
     or(T,?x_1) -> T,
     or(?x,?y) -> or(?y,?x) ]
ES1:
   [ ]
HS1:
   [ or(F,?x_2) -> ?x_2,
     or(T,?x_1) -> T,
     or(?x,?y) -> or(?y,?x) ]
Conj part consisits of inductive theorems of R0.
examples/fromCops/cr/190.trs: Success(GCR)
(7 msec.)