YES
(VAR x y z)
(RULES 
minus(x,0) -> x
minus(s(x),s(y)) -> minus(x,y)
quot(0,s(y)) -> 0
quot(s(x),s(y)) -> s(quot(minus(x,y),s(y)))
plus(0,y) -> y
plus(s(x),y) -> s(plus(x,y))
minus(minus(x,y),z) -> minus(x,plus(y,z))
)

Proving termination of rewriting for _3_4:

-> Dependency pairs:
nF_minus(s(x),s(y)) -> nF_minus(x,y)
nF_quot(s(x),s(y)) -> nF_quot(minus(x,y),s(y))
nF_quot(s(x),s(y)) -> nF_minus(x,y)
nF_plus(s(x),y) -> nF_plus(x,y)
nF_minus(minus(x,y),z) -> nF_minus(x,plus(y,z))
nF_minus(minus(x,y),z) -> nF_plus(y,z)

-> Proof of termination for _3_4_1_1:
-> -> Dependency pairs in cycle:
nF_quot(s(x),s(y)) -> nF_quot(minus(x,y),s(y))

UsableRules:
minus(x,0) -> x
minus(s(x),s(y)) -> minus(x,y)
plus(0,y) -> y
plus(s(x),y) -> s(plus(x,y))
minus(minus(x,y),z) -> minus(x,plus(y,z))

Polynomial Interpretation:

[minus](X1,X2) = X1
[0] = 0
[s](X) = X + 1
[quot](X1,X2) = 0
[plus](X1,X2) = X1 + X2
[nF_quot](X1,X2) = X1

TIME: 4.2095e-2


-> Proof of termination for _3_4_1_2:
-> -> Dependency pairs in cycle:
nF_minus(s(x),s(y)) -> nF_minus(x,y)
nF_minus(minus(x,y),z) -> nF_minus(x,plus(y,z))

Termination proved: Cycles verify subterm criterion.

-> Proof of termination for _3_4_1_3:
-> -> Dependency pairs in cycle:
nF_plus(s(x),y) -> nF_plus(x,y)

Termination proved: Cycles verify subterm criterion.

SETTINGS:
Base ordering: Polynomial ordering
Proof mode: SCCs in DG + base ordering
Upper bound for coeffs: 1
Rationals below 1 for all non-replacing args: No
Polynomial interpretation: Linear
Coeffs in polynomials: No rationals
Delta: automatic



Termination was proved succesfully.