Termination w.r.t. Q of the given QTRS could not be shown:

(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

a__from(X) → cons(mark(X), from(s(X)))
a__sel(0, cons(X, XS)) → mark(X)
a__sel(s(N), cons(X, XS)) → a__sel(mark(N), mark(XS))
a__minus(X, 0) → 0
a__minus(s(X), s(Y)) → a__minus(mark(X), mark(Y))
a__quot(0, s(Y)) → 0
a__quot(s(X), s(Y)) → s(a__quot(a__minus(mark(X), mark(Y)), s(mark(Y))))
a__zWquot(XS, nil) → nil
a__zWquot(nil, XS) → nil
a__zWquot(cons(X, XS), cons(Y, YS)) → cons(a__quot(mark(X), mark(Y)), zWquot(XS, YS))
mark(from(X)) → a__from(mark(X))
mark(sel(X1, X2)) → a__sel(mark(X1), mark(X2))
mark(minus(X1, X2)) → a__minus(mark(X1), mark(X2))
mark(quot(X1, X2)) → a__quot(mark(X1), mark(X2))
mark(zWquot(X1, X2)) → a__zWquot(mark(X1), mark(X2))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__from(X) → from(X)
a__sel(X1, X2) → sel(X1, X2)
a__minus(X1, X2) → minus(X1, X2)
a__quot(X1, X2) → quot(X1, X2)
a__zWquot(X1, X2) → zWquot(X1, X2)

Q is empty.

(1) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.

(2) Obligation:

Q DP problem:
The TRS P consists of the following rules:

A__FROM(X) → MARK(X)
A__SEL(0, cons(X, XS)) → MARK(X)
A__SEL(s(N), cons(X, XS)) → A__SEL(mark(N), mark(XS))
A__SEL(s(N), cons(X, XS)) → MARK(N)
A__SEL(s(N), cons(X, XS)) → MARK(XS)
A__MINUS(s(X), s(Y)) → A__MINUS(mark(X), mark(Y))
A__MINUS(s(X), s(Y)) → MARK(X)
A__MINUS(s(X), s(Y)) → MARK(Y)
A__QUOT(s(X), s(Y)) → A__QUOT(a__minus(mark(X), mark(Y)), s(mark(Y)))
A__QUOT(s(X), s(Y)) → A__MINUS(mark(X), mark(Y))
A__QUOT(s(X), s(Y)) → MARK(X)
A__QUOT(s(X), s(Y)) → MARK(Y)
A__ZWQUOT(cons(X, XS), cons(Y, YS)) → A__QUOT(mark(X), mark(Y))
A__ZWQUOT(cons(X, XS), cons(Y, YS)) → MARK(X)
A__ZWQUOT(cons(X, XS), cons(Y, YS)) → MARK(Y)
MARK(from(X)) → A__FROM(mark(X))
MARK(from(X)) → MARK(X)
MARK(sel(X1, X2)) → A__SEL(mark(X1), mark(X2))
MARK(sel(X1, X2)) → MARK(X1)
MARK(sel(X1, X2)) → MARK(X2)
MARK(minus(X1, X2)) → A__MINUS(mark(X1), mark(X2))
MARK(minus(X1, X2)) → MARK(X1)
MARK(minus(X1, X2)) → MARK(X2)
MARK(quot(X1, X2)) → A__QUOT(mark(X1), mark(X2))
MARK(quot(X1, X2)) → MARK(X1)
MARK(quot(X1, X2)) → MARK(X2)
MARK(zWquot(X1, X2)) → A__ZWQUOT(mark(X1), mark(X2))
MARK(zWquot(X1, X2)) → MARK(X1)
MARK(zWquot(X1, X2)) → MARK(X2)
MARK(cons(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)

The TRS R consists of the following rules:

a__from(X) → cons(mark(X), from(s(X)))
a__sel(0, cons(X, XS)) → mark(X)
a__sel(s(N), cons(X, XS)) → a__sel(mark(N), mark(XS))
a__minus(X, 0) → 0
a__minus(s(X), s(Y)) → a__minus(mark(X), mark(Y))
a__quot(0, s(Y)) → 0
a__quot(s(X), s(Y)) → s(a__quot(a__minus(mark(X), mark(Y)), s(mark(Y))))
a__zWquot(XS, nil) → nil
a__zWquot(nil, XS) → nil
a__zWquot(cons(X, XS), cons(Y, YS)) → cons(a__quot(mark(X), mark(Y)), zWquot(XS, YS))
mark(from(X)) → a__from(mark(X))
mark(sel(X1, X2)) → a__sel(mark(X1), mark(X2))
mark(minus(X1, X2)) → a__minus(mark(X1), mark(X2))
mark(quot(X1, X2)) → a__quot(mark(X1), mark(X2))
mark(zWquot(X1, X2)) → a__zWquot(mark(X1), mark(X2))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__from(X) → from(X)
a__sel(X1, X2) → sel(X1, X2)
a__minus(X1, X2) → minus(X1, X2)
a__quot(X1, X2) → quot(X1, X2)
a__zWquot(X1, X2) → zWquot(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.

(3) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

A__QUOT(s(X), s(Y)) → A__QUOT(a__minus(mark(X), mark(Y)), s(mark(Y)))

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
A__FROM(x1)  =  A__FROM
MARK(x1)  =  MARK
A__SEL(x1, x2)  =  A__SEL
0  =  0
cons(x1, x2)  =  cons
s(x1)  =  s
mark(x1)  =  mark
A__MINUS(x1, x2)  =  A__MINUS
A__QUOT(x1, x2)  =  x1
a__minus(x1, x2)  =  a__minus
A__ZWQUOT(x1, x2)  =  A__ZWQUOT
from(x1)  =  from
sel(x1, x2)  =  sel
minus(x1, x2)  =  minus
quot(x1, x2)  =  quot
zWquot(x1, x2)  =  x1
a__quot(x1, x2)  =  a__quot
a__from(x1)  =  x1
a__sel(x1, x2)  =  a__sel
a__zWquot(x1, x2)  =  x1
nil  =  nil

Recursive path order with status [RPO].
Quasi-Precedence:

[A_FROM, MARK, A_SEL, s, mark, A_MINUS, A_ZWQUOT, sel, a_quot, a_sel] > [0, a_minus] > minus > [cons, from, nil]
[A_FROM, MARK, A_SEL, s, mark, A_MINUS, A_ZWQUOT, sel, a_quot, a_sel] > quot > [cons, from, nil]

Status:

MARK: []
sel: []
minus: multiset
A_MINUS: []
a_quot: []
A_FROM: []
A_SEL: []
A_ZWQUOT: []
s: []
a_minus: multiset
0: multiset
from: multiset
quot: multiset
cons: multiset
a_sel: []
mark: []
nil: multiset

The following usable rules [FROCOS05] were oriented:

a__minus(X1, X2) → minus(X1, X2)
a__quot(X1, X2) → quot(X1, X2)
a__from(X) → from(X)
a__sel(X1, X2) → sel(X1, X2)
a__zWquot(X1, X2) → zWquot(X1, X2)
mark(quot(X1, X2)) → a__quot(mark(X1), mark(X2))
mark(zWquot(X1, X2)) → a__zWquot(mark(X1), mark(X2))
a__sel(0, cons(X, XS)) → mark(X)
a__sel(s(N), cons(X, XS)) → a__sel(mark(N), mark(XS))
mark(sel(X1, X2)) → a__sel(mark(X1), mark(X2))
mark(minus(X1, X2)) → a__minus(mark(X1), mark(X2))
mark(0) → 0
mark(nil) → nil
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
a__quot(s(X), s(Y)) → s(a__quot(a__minus(mark(X), mark(Y)), s(mark(Y))))
a__quot(0, s(Y)) → 0
a__minus(s(X), s(Y)) → a__minus(mark(X), mark(Y))
a__minus(X, 0) → 0
mark(from(X)) → a__from(mark(X))
a__zWquot(cons(X, XS), cons(Y, YS)) → cons(a__quot(mark(X), mark(Y)), zWquot(XS, YS))
a__zWquot(nil, XS) → nil
a__zWquot(XS, nil) → nil
a__from(X) → cons(mark(X), from(s(X)))

(4) Obligation:

Q DP problem:
The TRS P consists of the following rules:

A__FROM(X) → MARK(X)
A__SEL(0, cons(X, XS)) → MARK(X)
A__SEL(s(N), cons(X, XS)) → A__SEL(mark(N), mark(XS))
A__SEL(s(N), cons(X, XS)) → MARK(N)
A__SEL(s(N), cons(X, XS)) → MARK(XS)
A__MINUS(s(X), s(Y)) → A__MINUS(mark(X), mark(Y))
A__MINUS(s(X), s(Y)) → MARK(X)
A__MINUS(s(X), s(Y)) → MARK(Y)
A__QUOT(s(X), s(Y)) → A__MINUS(mark(X), mark(Y))
A__QUOT(s(X), s(Y)) → MARK(X)
A__QUOT(s(X), s(Y)) → MARK(Y)
A__ZWQUOT(cons(X, XS), cons(Y, YS)) → A__QUOT(mark(X), mark(Y))
A__ZWQUOT(cons(X, XS), cons(Y, YS)) → MARK(X)
A__ZWQUOT(cons(X, XS), cons(Y, YS)) → MARK(Y)
MARK(from(X)) → A__FROM(mark(X))
MARK(from(X)) → MARK(X)
MARK(sel(X1, X2)) → A__SEL(mark(X1), mark(X2))
MARK(sel(X1, X2)) → MARK(X1)
MARK(sel(X1, X2)) → MARK(X2)
MARK(minus(X1, X2)) → A__MINUS(mark(X1), mark(X2))
MARK(minus(X1, X2)) → MARK(X1)
MARK(minus(X1, X2)) → MARK(X2)
MARK(quot(X1, X2)) → A__QUOT(mark(X1), mark(X2))
MARK(quot(X1, X2)) → MARK(X1)
MARK(quot(X1, X2)) → MARK(X2)
MARK(zWquot(X1, X2)) → A__ZWQUOT(mark(X1), mark(X2))
MARK(zWquot(X1, X2)) → MARK(X1)
MARK(zWquot(X1, X2)) → MARK(X2)
MARK(cons(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)

The TRS R consists of the following rules:

a__from(X) → cons(mark(X), from(s(X)))
a__sel(0, cons(X, XS)) → mark(X)
a__sel(s(N), cons(X, XS)) → a__sel(mark(N), mark(XS))
a__minus(X, 0) → 0
a__minus(s(X), s(Y)) → a__minus(mark(X), mark(Y))
a__quot(0, s(Y)) → 0
a__quot(s(X), s(Y)) → s(a__quot(a__minus(mark(X), mark(Y)), s(mark(Y))))
a__zWquot(XS, nil) → nil
a__zWquot(nil, XS) → nil
a__zWquot(cons(X, XS), cons(Y, YS)) → cons(a__quot(mark(X), mark(Y)), zWquot(XS, YS))
mark(from(X)) → a__from(mark(X))
mark(sel(X1, X2)) → a__sel(mark(X1), mark(X2))
mark(minus(X1, X2)) → a__minus(mark(X1), mark(X2))
mark(quot(X1, X2)) → a__quot(mark(X1), mark(X2))
mark(zWquot(X1, X2)) → a__zWquot(mark(X1), mark(X2))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__from(X) → from(X)
a__sel(X1, X2) → sel(X1, X2)
a__minus(X1, X2) → minus(X1, X2)
a__quot(X1, X2) → quot(X1, X2)
a__zWquot(X1, X2) → zWquot(X1, X2)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.