Input TRS:
    1: a__f(a(),b(),X) -> a__f(X,X,mark(X))
    2: a__c() -> a()
    3: a__c() -> b()
    4: mark(f(X1,X2,X3)) -> a__f(X1,X2,mark(X3))
    5: mark(c()) -> a__c()
    6: mark(a()) -> a()
    7: mark(b()) -> b()
    8: a__f(X1,X2,X3) -> f(X1,X2,X3)
    9: a__c() -> c()
Number of strict rules: 9
Direct Order(PosReal,>,Poly) ... failed.
Freezing ... failed.
Dependency Pairs:
   #1: #mark(c()) -> #a__c()
   #2: #a__f(a(),b(),X) -> #a__f(X,X,mark(X))
   #3: #a__f(a(),b(),X) -> #mark(X)
   #4: #mark(f(X1,X2,X3)) -> #a__f(X1,X2,mark(X3))
   #5: #mark(f(X1,X2,X3)) -> #mark(X3)
Number of SCCs: 1, DPs: 4, edges: 8
	SCC { #2..5 }
Removing DPs: Order(PosReal,>,Sum)... succeeded.
     a()	weight: 0
#a__c()	weight: 0
     b()	weight: 0
  a__f(x1,x2,x3)	weight: (/ 1 2) + x3
     c()	weight: 0
     f(x1,x2,x3)	weight: (/ 1 2) + x3
#mark(x1)	weight: x1
  mark(x1)	weight: x1
#a__f(x1,x2,x3)	weight: (/ 1 4) + x3
  a__c()	weight: 0
    Usable rules: { 1..9 }
    Removed DPs: #3..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