Input TRS:
    1: s(s(|0|())) -> f(|0|())
    2: f(|0|()) -> |0|()
    3: s(s(s(|0|()))) -> f(s(|0|()))
    4: f(s(|0|())) -> s(|0|())
    5: s(s(s(s(s(s(s(s(|0|())))))))) -> f(s(s(|0|())))
    6: f(s(s(|0|()))) -> s(s(s(s(s(s(|0|()))))))
    7: g(x) -> h(x,x)
    8: s(x) -> h(x,|0|())
    9: s(x) -> h(|0|(),x)
    10: f(g(x)) -> g(g(f(x)))
    11: g(s(x)) -> s(s(g(x)))
    12: h(f(x),g(x)) -> f(s(x))
Number of strict rules: 12
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #f(s(s(|0|()))) -> #s(s(s(s(s(s(|0|()))))))
   #2: #f(s(s(|0|()))) -> #s(s(s(s(s(|0|())))))
   #3: #f(s(s(|0|()))) -> #s(s(s(s(|0|()))))
   #4: #f(s(s(|0|()))) -> #s(s(s(|0|())))
   #5: #s(x) -> #h(|0|(),x)
   #6: #g(s(x)) -> #s(s(g(x)))
   #7: #g(s(x)) -> #s(g(x))
   #8: #g(s(x)) -> #g(x)
   #9: #h(f(x),g(x)) -> #f(s(x))
   #10: #h(f(x),g(x)) -> #s(x)
   #11: #g(x) -> #h(x,x)
   #12: #f(g(x)) -> #g(g(f(x)))
   #13: #f(g(x)) -> #g(f(x))
   #14: #f(g(x)) -> #f(x)
   #15: #s(s(s(s(s(s(s(s(|0|())))))))) -> #f(s(s(|0|())))
   #16: #s(s(s(|0|()))) -> #f(s(|0|()))
   #17: #s(s(|0|())) -> #f(|0|())
   #18: #s(x) -> #h(x,|0|())
Number of SCCs: 2, DPs: 2, edges: 2
	SCC { #8 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   |0|()	weight: 0
     h(x1,x2)	weight: 0
     s(x1)	weight: (/ 1 2) + x1
     f(x1)	weight: 0
   #h(x1,x2)	weight: 0
   #s(x1)	weight: 0
   #f(x1)	weight: 0
   #g(x1)	weight: x1
     g(x1)	weight: 0
    Usable rules: { }
    Removed DPs: #8
Number of SCCs: 1, DPs: 1, edges: 1
	SCC { #14 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
   |0|()	weight: 0
     h(x1,x2)	weight: 0
     s(x1)	weight: (/ 1 2)
     f(x1)	weight: 0
   #h(x1,x2)	weight: 0
   #s(x1)	weight: 0
   #f(x1)	weight: x1
   #g(x1)	weight: 0
     g(x1)	weight: (/ 1 2) + x1
    Usable rules: { }
    Removed DPs: #14
Number of SCCs: 0, DPs: 0, edges: 0
YES