Input TRS:
    1: f(tt(),x) -> f(isDouble(x),s(s(x)))
    2: isDouble(s(s(x))) -> isDouble(x)
    3: isDouble(0()) -> tt()
Number of strict rules: 3
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #isDouble(s(s(x))) -> #isDouble(x)
   #2: #f(tt(),x) -> #f(isDouble(x),s(s(x)))
   #3: #f(tt(),x) -> #isDouble(x)
Number of SCCs: 2, DPs: 2, edges: 2
	SCC { #1 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
     s(x1)	weight: (/ 1 4) + x1
     f(x1,x2)	weight: 0
     0()	weight: 0
#isDouble(x1)	weight: x1
   #f(x1,x2)	weight: 0
isDouble(x1)	weight: 0
    tt()	weight: 0
    Usable rules: { }
    Removed DPs: #1
Number of SCCs: 1, DPs: 1, edges: 1
	SCC { #2 }
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