TPA v.1.1

Result: Run out of time while trying to 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 as loaded from the input file:
f(t,x,y) -> f(g(x,y),x,s(y))
g(s(x),0) -> t
g(s(x),s(y)) -> g(x,y)

[2]  TRS after applying termination preserving transformation to remove all the function symbol of arity >= 2: 
(1) f`1(t,f`2(x,y)) -> f`1(g(x,y),f`2(x,s(y)))
(2) g(s(x),0) -> t
(3) g(s(x),s(y)) -> g(x,y)


/tmp/tmpQ9A3-Z/ex02.trs, 60.52, T
Couldn't open file <60>: 60: No such file or directory