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: minus(x,x) -> 0 minus(x,y) -> cond(min(x,y),x,y) cond(y,x,y) -> s(minus(x,s(y))) min(0,v) -> 0 min(u,0) -> 0 min(s(u),s(v)) -> s(min(u,v)) [2] TRS after applying termination preserving transformation to remove all the function symbol of arity >= 2:(1) minus(x,x) -> 0 (2) minus(x,y) -> cond`1(min(x,y),cond`2(x,y)) (3) cond`1(y,cond`2(x,y)) -> s(minus(x,s(y))) (4) min(0,v) -> 0 (5) min(u,0) -> 0 (6) min(s(u),s(v)) -> s(min(u,v)) /tmp/tmp6Euvyj/ex04.trs, 65.63, T Couldn't open file <60>: 60: No such file or directory