YES
  TPA v.1.0

Result: TRS is terminating

Default interpretations for symbols are not printed. For polynomial interpretations
and semantic labelling over N\{0,1} defaults are 2 for constants, identity for unary
symbols and x+y-2 for binary symbols. For semantic labelling over {0,1} (booleans)
defaults are 0 for constants, identity for unary symbols and disjunction for binary symbols.

[1]  TRS loaded from input file:
(1) a__c -> a__f(g(c))
(2) a__f(g(X)) -> g(X)
(3) mark(c) -> a__c
(4) mark(f(X)) -> a__f(X)
(5) mark(g(X)) -> g(X)
(6) a__c -> c
(7) a__f(X) -> f(X)

[2]  Use following polynomial interpretation:
[mark(x)] = x + 1
rest default

  Remove rules with left hand side strictly bigger than right hand side:
(3)-(5)

[3]  Use following polynomial interpretation:
[a__c] = 3
rest default

  Remove rules with left hand side strictly bigger than right hand side:
(1), (6)

[4]  Use following polynomial interpretation:
[a__f(x)] = x + 1
rest default

  Remove rules with left hand side strictly bigger than right hand side:
(2), (7)

[5]  Since there are no remaining rules, termination is proved!

../tpdb/TRS/TRCSR/Ex6_GM04_GM.trs, 0.01, Y
Couldn't open file <60>: 60: No such file or directory