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