Input TRS:
    1: a__g(X) -> a__h(X)
    2: a__c() -> d()
    3: a__h(d()) -> a__g(c())
    4: mark(g(X)) -> a__g(X)
    5: mark(h(X)) -> a__h(X)
    6: mark(c()) -> a__c()
    7: mark(d()) -> d()
    8: a__g(X) -> g(X)
    9: a__h(X) -> h(X)
    10: a__c() -> c()
Number of strict rules: 10
Direct Order(PosReal,>,Poly) ... removes: 4 8 5 7 9 6
     h(x1)	weight: (/ 1 4) + x1
  a__g(x1)	weight: (/ 1 2) + x1
     d()	weight: 0
  a__h(x1)	weight: (/ 1 2) + x1
     c()	weight: 0
  mark(x1)	weight: (/ 1 2) + x1
     g(x1)	weight: (/ 1 4) + x1
  a__c()	weight: 0
Number of strict rules: 4
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #a__h(d()) -> #a__g(c())
   #2: #a__g(X) -> #a__h(X)
Number of SCCs: 1, DPs: 2, edges: 2
	SCC { #1 #2 }
Removing DPs: Order(PosReal,>,Sum)... Order(PosReal,>,Max)... succeeded.
     h(x1)	weight: 0
  a__g(x1)	weight: 0
#a__c()	weight: 0
     d()	weight: (/ 3 2)
  a__h(x1)	weight: 0
#a__g(x1)	weight: (/ 1 2) + x1
     c()	weight: (/ 1 2)
#a__h(x1)	weight: x1
  mark(x1)	weight: 0
     g(x1)	weight: 0
  a__c()	weight: 0
    Usable rules: { }
    Removed DPs: #1 #2
Number of SCCs: 0, DPs: 0, edges: 0
YES