YES
0 QTRS
↳1 QTRSRRRProof (⇔, 66 ms)
↳2 QTRS
↳3 QTRSRRRProof (⇔, 0 ms)
↳4 QTRS
↳5 RisEmptyProof (⇔, 0 ms)
↳6 YES
from(X) → cons(X, n__from(s(X)))
head(cons(X, XS)) → X
2nd(cons(X, XS)) → head(activate(XS))
take(0, XS) → nil
take(s(N), cons(X, XS)) → cons(X, n__take(N, activate(XS)))
sel(0, cons(X, XS)) → X
sel(s(N), cons(X, XS)) → sel(N, activate(XS))
from(X) → n__from(X)
take(X1, X2) → n__take(X1, X2)
activate(n__from(X)) → from(X)
activate(n__take(X1, X2)) → take(X1, X2)
activate(X) → X
sel2 > [from1, 2nd1, activate1, take2] > cons2 > ntake2
sel2 > [from1, 2nd1, activate1, take2] > s1 > ntake2
sel2 > [from1, 2nd1, activate1, take2] > [0, nil] > ntake2
from1: multiset
cons2: multiset
s1: [1]
2nd1: multiset
activate1: multiset
take2: multiset
0: multiset
nil: multiset
ntake2: multiset
sel2: [1,2]
from(X) → cons(X, n__from(s(X)))
head(cons(X, XS)) → X
2nd(cons(X, XS)) → head(activate(XS))
take(0, XS) → nil
take(s(N), cons(X, XS)) → cons(X, n__take(N, activate(XS)))
sel(0, cons(X, XS)) → X
sel(s(N), cons(X, XS)) → sel(N, activate(XS))
from(X) → n__from(X)
take(X1, X2) → n__take(X1, X2)
activate(n__take(X1, X2)) → take(X1, X2)
activate(X) → X
activate(n__from(X)) → from(X)
activate1 > from1 > nfrom1
activate_1=1
n__from_1=1
from_1=2
activate(n__from(X)) → from(X)