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