Input TRS:
    1: xor(x,F()) -> x
    2: xor(x,neg(x)) -> F()
    3: and(x,T()) -> x
    4: and(x,F()) -> F()
    5: and(x,x) -> x
    6: and(xor(x,y),z) -> xor(and(x,z),and(y,z))
    7: xor(x,x) -> F()
    8: impl(x,y) -> xor(and(x,y),xor(x,T()))
    9: or(x,y) -> xor(and(x,y),xor(x,y))
    10: equiv(x,y) -> xor(x,xor(y,T()))
    11: neg(x) -> xor(x,T())
Number of strict rules: 11
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #and(xor(x,y),z) -> #xor(and(x,z),and(y,z))
   #2: #and(xor(x,y),z) -> #and(x,z)
   #3: #and(xor(x,y),z) -> #and(y,z)
   #4: #or(x,y) -> #xor(and(x,y),xor(x,y))
   #5: #or(x,y) -> #and(x,y)
   #6: #or(x,y) -> #xor(x,y)
   #7: #neg(x) -> #xor(x,T())
   #8: #equiv(x,y) -> #xor(x,xor(y,T()))
   #9: #equiv(x,y) -> #xor(y,T())
   #10: #impl(x,y) -> #xor(and(x,y),xor(x,T()))
   #11: #impl(x,y) -> #and(x,y)
   #12: #impl(x,y) -> #xor(x,T())
Number of SCCs: 1, DPs: 2, edges: 4
	SCC { #2 #3 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
     T()	weight: 0
     F()	weight: 0
   and(x1,x2)	weight: 0
#impl(x1,x2)	weight: 0
 equiv(x1,x2)	weight: 0
    or(x1,x2)	weight: 0
   neg(x1)	weight: 0
  impl(x1,x2)	weight: 0
 #xor(x1,x2)	weight: 0
#equiv(x1,x2)	weight: 0
  #or(x1,x2)	weight: 0
 #neg(x1)	weight: 0
   xor(x1,x2)	weight: (/ 1 2) + x1 + x2
 #and(x1,x2)	weight: x1
    Usable rules: { }
    Removed DPs: #2 #3
Number of SCCs: 0, DPs: 0, edges: 0
YES