Input TRS:
    1: f(x,y) -> cond(and(isNat(x),isNat(y)),x,y)
    2: cond(tt(),x,y) -> f(s(x),s(y))
    3: isNat(s(x)) -> isNat(x)
    4: isNat(0()) -> tt()
    5: and(tt(),tt()) -> tt()
    6: and(ff(),x) -> ff()
    7: and(x,ff()) -> ff()
Number of strict rules: 7
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #cond(tt(),x,y) -> #f(s(x),s(y))
   #2: #isNat(s(x)) -> #isNat(x)
   #3: #f(x,y) -> #cond(and(isNat(x),isNat(y)),x,y)
   #4: #f(x,y) -> #and(isNat(x),isNat(y))
   #5: #f(x,y) -> #isNat(x)
   #6: #f(x,y) -> #isNat(y)
Number of SCCs: 2, DPs: 3, edges: 3
	SCC { #2 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
     s(x1)	weight: (/ 1 2) + x1
#isNat(x1)	weight: x1
   and(x1,x2)	weight: 0
    ff()	weight: 0
     f(x1,x2)	weight: 0
#cond(x1,x2,x3)	weight: 0
     0()	weight: 0
   #f(x1,x2)	weight: 0
 isNat(x1)	weight: 0
    tt()	weight: 0
 #and(x1,x2)	weight: 0
  cond(x1,x2,x3)	weight: 0
    Usable rules: { }
    Removed DPs: #2
Number of SCCs: 1, DPs: 2, edges: 2
	SCC { #1 #3 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... QLPOpS... Order(PosReal,>,MaxSum)... QWPOpS(PosReal,>,MaxSum)... Order(PosReal,>,Sum-Sum; PosReal,≥,Sum-Sum)... Order(PosReal,>,Sum-Sum; NegReal,≥,Sum)... Order(PosReal,>,MaxSum-Sum; NegReal,≥,Sum)... failed.
Removing edges: failed.
Finding a loop...  failed.
MAYBE