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) 2nd(cons(X,cons(Y,Z))) -> Y
(2) from(X) -> cons(X,from(s(X)))

[2]  Eliminate dummy symbol <s>, to obtain the following TRS:
(1) 2nd(cons(X,cons(Y,Z))) -> Y
(2a) from(X) -> cons(X,from(#0))
(2b) from(X) -> #1(X)

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

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

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

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


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