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