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) ap(ap(g,x),y) -> y
(2) ap(f,x) -> ap(f,app(g,x))

[2]  Eliminate dummy symbol <app>, to obtain the following TRS:
(1) ap(ap(g,x),y) -> y
(2a) ap(f,x) -> ap(f,#0)
(2b) ap(f,x) -> #1(g)
(2c) ap(f,x) -> #2(x)

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

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

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

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


../tpdb/TRS/higher-order/AProVE_HO/TypeEx5.trs, 0.01, U
Couldn't open file <60>: 60: No such file or directory