YES
0 QTRS
↳1 QTRSRRRProof (⇔, 79 ms)
↳2 QTRS
↳3 QTRSRRRProof (⇔, 0 ms)
↳4 QTRS
↳5 RisEmptyProof (⇔, 0 ms)
↳6 YES
terms(N) → cons(recip(sqr(N)), n__terms(s(N)))
sqr(0) → 0
sqr(s(X)) → s(add(sqr(X), dbl(X)))
dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
add(0, X) → X
add(s(X), Y) → s(add(X, Y))
first(0, X) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z)))
terms(X) → n__terms(X)
first(X1, X2) → n__first(X1, X2)
activate(n__terms(X)) → terms(X)
activate(n__first(X1, X2)) → first(X1, X2)
activate(X) → X
0 > nil > s1
[first2, nfirst2] > activate1 > terms1 > cons2 > s1
[first2, nfirst2] > activate1 > terms1 > sqr1 > add2 > s1
[first2, nfirst2] > activate1 > terms1 > sqr1 > dbl1 > s1
terms1: [1]
cons2: [2,1]
sqr1: multiset
s1: multiset
0: multiset
add2: [1,2]
dbl1: multiset
first2: [1,2]
nil: multiset
nfirst2: [1,2]
activate1: [1]
terms(N) → cons(recip(sqr(N)), n__terms(s(N)))
sqr(0) → 0
sqr(s(X)) → s(add(sqr(X), dbl(X)))
dbl(0) → 0
dbl(s(X)) → s(s(dbl(X)))
add(0, X) → X
add(s(X), Y) → s(add(X, Y))
first(0, X) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(X, activate(Z)))
terms(X) → n__terms(X)
activate(n__terms(X)) → terms(X)
activate(n__first(X1, X2)) → first(X1, X2)
activate(X) → X
first(X1, X2) → n__first(X1, X2)
first2 > nfirst2
first_2=0
n__first_2=0
first(X1, X2) → n__first(X1, X2)