YES
  TPA v.1.0

Result: TRS is terminating

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) pred(s(x)) -> x
(2) minus(x,0) -> x
(3) minus(x,s(y)) -> pred(minus(x,y))
(4) quot(0,s(y)) -> 0
(5) quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))

[2]  Apply the Dependency Pair transformation resulting in the following dependency pairs:
<Minus(x,s(y)), Pred(minus(x,y))>
<Minus(x,s(y)), Minus(x,y)>
<Quot(s(x),s(y)), Quot(minus(x,y),s(y))>
<Quot(s(x),s(y)), Minus(x,y)>
 and 2 SCCs in the dependency graph. Proofs for those SCCs follow.

[2a-1]  Consider the following SCC obtained from analysis of dependency graph:
(1) pred(s(x)) ->= x
(2) minus(x,0) ->= x
(3) minus(x,s(y)) ->= pred(minus(x,y))
(4) quot(0,s(y)) ->= 0
(5) quot(s(x),s(y)) ->= s(quot(minus(x,y),s(y)))
(DP3) Quot(s(x),s(y)) -> Quot(minus(x,y),s(y))

[2a-2]  Use following polynomial interpretation:
[s(x)] = x + 1
[minus(x,y)] = x
rest default

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

[2a-3]  Since there are no remaining strict rules, relative termination is proved!

[2b-1]  Consider the following SCC obtained from analysis of dependency graph:
(1) pred(s(x)) ->= x
(2) minus(x,0) ->= x
(3) minus(x,s(y)) ->= pred(minus(x,y))
(4) quot(0,s(y)) ->= 0
(5) quot(s(x),s(y)) ->= s(quot(minus(x,y),s(y)))
(DP2) Minus(x,s(y)) -> Minus(x,y)

[2b-2]  Use following polynomial interpretation:
[s(x)] = x + 1
[minus(x,y)] = x
rest default

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

[2b-3]  Since there are no remaining strict rules, relative termination is proved!



../tpdb/TRS/AG01/#3.2.trs, 0.01, Y
Couldn't open file <60>: 60: No such file or directory