MAYBE
  TPA v.1.0

Result: Couldn't prove (non-)termination of that system. Only partial proof available.

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) f(X) -> g(h(f(X)))

[2]  Eliminate dummy symbol <h>, to obtain the following TRS:
(1a) f(X) -> g(#0)
(1b) f(X) -> #1(f(X))

[3]  Use following polynomial interpretation:
[f(x)] = x + 1
rest default

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


../tpdb/TRS/nontermin/CSR/ExConc_Zan97.trs, 0.01, U
Couldn't open file <60>: 60: No such file or directory