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

0 QTRS
↳1 DependencyPairsProof (⇔)
↳2 QDP
↳3 DependencyGraphProof (⇔)
↳4 QDP
↳5 QDPOrderProof (⇔)
↳6 QDP
↳7 DependencyGraphProof (⇔)
↳8 QDP
↳9 QDPOrderProof (⇔)
↳10 QDP
↳11 QDPOrderProof (⇔)
↳12 QDP
↳13 QDPOrderProof (⇔)
↳14 QDP
↳15 DependencyGraphProof (⇔)
↳16 QDP
↳17 QDPOrderProof (⇔)
↳18 QDP
↳19 PisEmptyProof (⇔)
↳20 TRUE

(0) Obligation:

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

a__app(nil, YS) → mark(YS)
a__app(cons(X, XS), YS) → cons(mark(X), app(XS, YS))
a__from(X) → cons(mark(X), from(s(X)))
a__zWadr(nil, YS) → nil
a__zWadr(XS, nil) → nil
a__zWadr(cons(X, XS), cons(Y, YS)) → cons(a__app(mark(Y), cons(mark(X), nil)), zWadr(XS, YS))
a__prefix(L) → cons(nil, zWadr(L, prefix(L)))
mark(app(X1, X2)) → a__app(mark(X1), mark(X2))
mark(from(X)) → a__from(mark(X))
mark(zWadr(X1, X2)) → a__zWadr(mark(X1), mark(X2))
mark(prefix(X)) → a__prefix(mark(X))
mark(nil) → nil
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
a__app(X1, X2) → app(X1, X2)
a__from(X) → from(X)
a__zWadr(X1, X2) → zWadr(X1, X2)
a__prefix(X) → prefix(X)

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__APP(nil, YS) → MARK(YS)
A__APP(cons(X, XS), YS) → MARK(X)
A__FROM(X) → MARK(X)
A__ZWADR(cons(X, XS), cons(Y, YS)) → A__APP(mark(Y), cons(mark(X), nil))
A__ZWADR(cons(X, XS), cons(Y, YS)) → MARK(Y)
A__ZWADR(cons(X, XS), cons(Y, YS)) → MARK(X)
MARK(app(X1, X2)) → A__APP(mark(X1), mark(X2))
MARK(app(X1, X2)) → MARK(X1)
MARK(app(X1, X2)) → MARK(X2)
MARK(from(X)) → A__FROM(mark(X))
MARK(from(X)) → MARK(X)
MARK(zWadr(X1, X2)) → A__ZWADR(mark(X1), mark(X2))
MARK(zWadr(X1, X2)) → MARK(X1)
MARK(zWadr(X1, X2)) → MARK(X2)
MARK(prefix(X)) → A__PREFIX(mark(X))
MARK(prefix(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)

The TRS R consists of the following rules:

a__app(nil, YS) → mark(YS)
a__app(cons(X, XS), YS) → cons(mark(X), app(XS, YS))
a__from(X) → cons(mark(X), from(s(X)))
a__zWadr(nil, YS) → nil
a__zWadr(XS, nil) → nil
a__zWadr(cons(X, XS), cons(Y, YS)) → cons(a__app(mark(Y), cons(mark(X), nil)), zWadr(XS, YS))
a__prefix(L) → cons(nil, zWadr(L, prefix(L)))
mark(app(X1, X2)) → a__app(mark(X1), mark(X2))
mark(from(X)) → a__from(mark(X))
mark(zWadr(X1, X2)) → a__zWadr(mark(X1), mark(X2))
mark(prefix(X)) → a__prefix(mark(X))
mark(nil) → nil
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
a__app(X1, X2) → app(X1, X2)
a__from(X) → from(X)
a__zWadr(X1, X2) → zWadr(X1, X2)
a__prefix(X) → prefix(X)

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

(3) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node.

(4) Obligation:

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

MARK(app(X1, X2)) → A__APP(mark(X1), mark(X2))
A__APP(nil, YS) → MARK(YS)
MARK(app(X1, X2)) → MARK(X1)
MARK(app(X1, X2)) → MARK(X2)
MARK(from(X)) → A__FROM(mark(X))
A__FROM(X) → MARK(X)
MARK(from(X)) → MARK(X)
MARK(zWadr(X1, X2)) → A__ZWADR(mark(X1), mark(X2))
A__ZWADR(cons(X, XS), cons(Y, YS)) → A__APP(mark(Y), cons(mark(X), nil))
A__APP(cons(X, XS), YS) → MARK(X)
MARK(zWadr(X1, X2)) → MARK(X1)
MARK(zWadr(X1, X2)) → MARK(X2)
MARK(prefix(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)
A__ZWADR(cons(X, XS), cons(Y, YS)) → MARK(Y)
A__ZWADR(cons(X, XS), cons(Y, YS)) → MARK(X)

The TRS R consists of the following rules:

a__app(nil, YS) → mark(YS)
a__app(cons(X, XS), YS) → cons(mark(X), app(XS, YS))
a__from(X) → cons(mark(X), from(s(X)))
a__zWadr(nil, YS) → nil
a__zWadr(XS, nil) → nil
a__zWadr(cons(X, XS), cons(Y, YS)) → cons(a__app(mark(Y), cons(mark(X), nil)), zWadr(XS, YS))
a__prefix(L) → cons(nil, zWadr(L, prefix(L)))
mark(app(X1, X2)) → a__app(mark(X1), mark(X2))
mark(from(X)) → a__from(mark(X))
mark(zWadr(X1, X2)) → a__zWadr(mark(X1), mark(X2))
mark(prefix(X)) → a__prefix(mark(X))
mark(nil) → nil
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
a__app(X1, X2) → app(X1, X2)
a__from(X) → from(X)
a__zWadr(X1, X2) → zWadr(X1, X2)
a__prefix(X) → prefix(X)

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

(5) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


MARK(app(X1, X2)) → A__APP(mark(X1), mark(X2))
A__APP(nil, YS) → MARK(YS)
MARK(app(X1, X2)) → MARK(X1)
MARK(app(X1, X2)) → MARK(X2)
MARK(zWadr(X1, X2)) → A__ZWADR(mark(X1), mark(X2))
A__APP(cons(X, XS), YS) → MARK(X)
MARK(zWadr(X1, X2)) → MARK(X1)
MARK(zWadr(X1, X2)) → MARK(X2)
A__ZWADR(cons(X, XS), cons(Y, YS)) → MARK(Y)
A__ZWADR(cons(X, XS), cons(Y, YS)) → MARK(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
MARK(x1)  =  MARK(x1)
app(x1, x2)  =  app(x1, x2)
A__APP(x1, x2)  =  A__APP(x1, x2)
mark(x1)  =  x1
nil  =  nil
from(x1)  =  x1
A__FROM(x1)  =  A__FROM(x1)
zWadr(x1, x2)  =  zWadr(x1, x2)
A__ZWADR(x1, x2)  =  A__ZWADR(x1, x2)
cons(x1, x2)  =  x1
prefix(x1)  =  x1
s(x1)  =  x1
a__app(x1, x2)  =  a__app(x1, x2)
a__from(x1)  =  x1
a__zWadr(x1, x2)  =  a__zWadr(x1, x2)
a__prefix(x1)  =  x1

Recursive Path Order [RPO].
Precedence:
[zWadr2, azWadr2] > [MARK1, app2, AAPP2, AFROM1, AZWADR2, aapp2] > nil


The following usable rules [FROCOS05] were oriented:

mark(app(X1, X2)) → a__app(mark(X1), mark(X2))
a__app(nil, YS) → mark(YS)
mark(from(X)) → a__from(mark(X))
a__zWadr(cons(X, XS), cons(Y, YS)) → cons(a__app(mark(Y), cons(mark(X), nil)), zWadr(XS, YS))
a__prefix(L) → cons(nil, zWadr(L, prefix(L)))
mark(nil) → nil
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(zWadr(X1, X2)) → a__zWadr(mark(X1), mark(X2))
mark(prefix(X)) → a__prefix(mark(X))
a__from(X) → from(X)
a__zWadr(X1, X2) → zWadr(X1, X2)
mark(s(X)) → s(mark(X))
a__app(X1, X2) → app(X1, X2)
a__zWadr(nil, YS) → nil
a__zWadr(XS, nil) → nil
a__app(cons(X, XS), YS) → cons(mark(X), app(XS, YS))
a__prefix(X) → prefix(X)
a__from(X) → cons(mark(X), from(s(X)))

(6) Obligation:

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

MARK(from(X)) → A__FROM(mark(X))
A__FROM(X) → MARK(X)
MARK(from(X)) → MARK(X)
A__ZWADR(cons(X, XS), cons(Y, YS)) → A__APP(mark(Y), cons(mark(X), nil))
MARK(prefix(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)

The TRS R consists of the following rules:

a__app(nil, YS) → mark(YS)
a__app(cons(X, XS), YS) → cons(mark(X), app(XS, YS))
a__from(X) → cons(mark(X), from(s(X)))
a__zWadr(nil, YS) → nil
a__zWadr(XS, nil) → nil
a__zWadr(cons(X, XS), cons(Y, YS)) → cons(a__app(mark(Y), cons(mark(X), nil)), zWadr(XS, YS))
a__prefix(L) → cons(nil, zWadr(L, prefix(L)))
mark(app(X1, X2)) → a__app(mark(X1), mark(X2))
mark(from(X)) → a__from(mark(X))
mark(zWadr(X1, X2)) → a__zWadr(mark(X1), mark(X2))
mark(prefix(X)) → a__prefix(mark(X))
mark(nil) → nil
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
a__app(X1, X2) → app(X1, X2)
a__from(X) → from(X)
a__zWadr(X1, X2) → zWadr(X1, X2)
a__prefix(X) → prefix(X)

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

(7) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node.

(8) Obligation:

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

A__FROM(X) → MARK(X)
MARK(from(X)) → A__FROM(mark(X))
MARK(from(X)) → MARK(X)
MARK(prefix(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)

The TRS R consists of the following rules:

a__app(nil, YS) → mark(YS)
a__app(cons(X, XS), YS) → cons(mark(X), app(XS, YS))
a__from(X) → cons(mark(X), from(s(X)))
a__zWadr(nil, YS) → nil
a__zWadr(XS, nil) → nil
a__zWadr(cons(X, XS), cons(Y, YS)) → cons(a__app(mark(Y), cons(mark(X), nil)), zWadr(XS, YS))
a__prefix(L) → cons(nil, zWadr(L, prefix(L)))
mark(app(X1, X2)) → a__app(mark(X1), mark(X2))
mark(from(X)) → a__from(mark(X))
mark(zWadr(X1, X2)) → a__zWadr(mark(X1), mark(X2))
mark(prefix(X)) → a__prefix(mark(X))
mark(nil) → nil
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
a__app(X1, X2) → app(X1, X2)
a__from(X) → from(X)
a__zWadr(X1, X2) → zWadr(X1, X2)
a__prefix(X) → prefix(X)

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

(9) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


MARK(prefix(X)) → MARK(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
A__FROM(x1)  =  A__FROM(x1)
MARK(x1)  =  MARK(x1)
from(x1)  =  x1
mark(x1)  =  x1
prefix(x1)  =  prefix(x1)
cons(x1, x2)  =  x1
s(x1)  =  x1
app(x1, x2)  =  app(x1, x2)
a__app(x1, x2)  =  a__app(x1, x2)
nil  =  nil
a__from(x1)  =  x1
a__zWadr(x1, x2)  =  a__zWadr(x1, x2)
zWadr(x1, x2)  =  zWadr(x1, x2)
a__prefix(x1)  =  a__prefix(x1)

Recursive Path Order [RPO].
Precedence:
[AFROM1, MARK1] > [app2, aapp2, azWadr2, zWadr2]
[prefix1, nil, aprefix1] > [app2, aapp2, azWadr2, zWadr2]


The following usable rules [FROCOS05] were oriented:

mark(app(X1, X2)) → a__app(mark(X1), mark(X2))
a__app(nil, YS) → mark(YS)
mark(from(X)) → a__from(mark(X))
a__zWadr(cons(X, XS), cons(Y, YS)) → cons(a__app(mark(Y), cons(mark(X), nil)), zWadr(XS, YS))
a__prefix(L) → cons(nil, zWadr(L, prefix(L)))
mark(nil) → nil
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(zWadr(X1, X2)) → a__zWadr(mark(X1), mark(X2))
mark(prefix(X)) → a__prefix(mark(X))
a__from(X) → from(X)
a__zWadr(X1, X2) → zWadr(X1, X2)
mark(s(X)) → s(mark(X))
a__app(X1, X2) → app(X1, X2)
a__zWadr(nil, YS) → nil
a__zWadr(XS, nil) → nil
a__app(cons(X, XS), YS) → cons(mark(X), app(XS, YS))
a__prefix(X) → prefix(X)
a__from(X) → cons(mark(X), from(s(X)))

(10) Obligation:

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

A__FROM(X) → MARK(X)
MARK(from(X)) → A__FROM(mark(X))
MARK(from(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)

The TRS R consists of the following rules:

a__app(nil, YS) → mark(YS)
a__app(cons(X, XS), YS) → cons(mark(X), app(XS, YS))
a__from(X) → cons(mark(X), from(s(X)))
a__zWadr(nil, YS) → nil
a__zWadr(XS, nil) → nil
a__zWadr(cons(X, XS), cons(Y, YS)) → cons(a__app(mark(Y), cons(mark(X), nil)), zWadr(XS, YS))
a__prefix(L) → cons(nil, zWadr(L, prefix(L)))
mark(app(X1, X2)) → a__app(mark(X1), mark(X2))
mark(from(X)) → a__from(mark(X))
mark(zWadr(X1, X2)) → a__zWadr(mark(X1), mark(X2))
mark(prefix(X)) → a__prefix(mark(X))
mark(nil) → nil
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
a__app(X1, X2) → app(X1, X2)
a__from(X) → from(X)
a__zWadr(X1, X2) → zWadr(X1, X2)
a__prefix(X) → prefix(X)

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

(11) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


MARK(s(X)) → MARK(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
A__FROM(x1)  =  x1
MARK(x1)  =  x1
from(x1)  =  x1
mark(x1)  =  x1
cons(x1, x2)  =  x1
s(x1)  =  s(x1)
app(x1, x2)  =  app(x1, x2)
a__app(x1, x2)  =  a__app(x1, x2)
nil  =  nil
a__from(x1)  =  x1
a__zWadr(x1, x2)  =  a__zWadr(x1, x2)
zWadr(x1, x2)  =  zWadr(x1, x2)
a__prefix(x1)  =  x1
prefix(x1)  =  x1

Recursive Path Order [RPO].
Precedence:
s1 > nil
[azWadr2, zWadr2] > [app2, aapp2] > nil


The following usable rules [FROCOS05] were oriented:

mark(app(X1, X2)) → a__app(mark(X1), mark(X2))
a__app(nil, YS) → mark(YS)
mark(from(X)) → a__from(mark(X))
a__zWadr(cons(X, XS), cons(Y, YS)) → cons(a__app(mark(Y), cons(mark(X), nil)), zWadr(XS, YS))
a__prefix(L) → cons(nil, zWadr(L, prefix(L)))
mark(nil) → nil
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(zWadr(X1, X2)) → a__zWadr(mark(X1), mark(X2))
mark(prefix(X)) → a__prefix(mark(X))
a__from(X) → from(X)
a__zWadr(X1, X2) → zWadr(X1, X2)
mark(s(X)) → s(mark(X))
a__app(X1, X2) → app(X1, X2)
a__zWadr(nil, YS) → nil
a__zWadr(XS, nil) → nil
a__app(cons(X, XS), YS) → cons(mark(X), app(XS, YS))
a__prefix(X) → prefix(X)
a__from(X) → cons(mark(X), from(s(X)))

(12) Obligation:

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

A__FROM(X) → MARK(X)
MARK(from(X)) → A__FROM(mark(X))
MARK(from(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)

The TRS R consists of the following rules:

a__app(nil, YS) → mark(YS)
a__app(cons(X, XS), YS) → cons(mark(X), app(XS, YS))
a__from(X) → cons(mark(X), from(s(X)))
a__zWadr(nil, YS) → nil
a__zWadr(XS, nil) → nil
a__zWadr(cons(X, XS), cons(Y, YS)) → cons(a__app(mark(Y), cons(mark(X), nil)), zWadr(XS, YS))
a__prefix(L) → cons(nil, zWadr(L, prefix(L)))
mark(app(X1, X2)) → a__app(mark(X1), mark(X2))
mark(from(X)) → a__from(mark(X))
mark(zWadr(X1, X2)) → a__zWadr(mark(X1), mark(X2))
mark(prefix(X)) → a__prefix(mark(X))
mark(nil) → nil
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
a__app(X1, X2) → app(X1, X2)
a__from(X) → from(X)
a__zWadr(X1, X2) → zWadr(X1, X2)
a__prefix(X) → prefix(X)

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

(13) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


MARK(from(X)) → A__FROM(mark(X))
MARK(from(X)) → MARK(X)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
A__FROM(x1)  =  A__FROM(x1)
MARK(x1)  =  MARK(x1)
from(x1)  =  from(x1)
mark(x1)  =  x1
cons(x1, x2)  =  x1
app(x1, x2)  =  app(x1, x2)
a__app(x1, x2)  =  a__app(x1, x2)
nil  =  nil
a__from(x1)  =  a__from(x1)
a__zWadr(x1, x2)  =  a__zWadr(x1, x2)
zWadr(x1, x2)  =  zWadr(x1, x2)
a__prefix(x1)  =  a__prefix
prefix(x1)  =  prefix
s(x1)  =  s(x1)

Recursive Path Order [RPO].
Precedence:
[AFROM1, MARK1]
[from1, afrom1]
[azWadr2, zWadr2] > [app2, aapp2]
[azWadr2, zWadr2] > nil
[aprefix, prefix] > nil


The following usable rules [FROCOS05] were oriented:

mark(app(X1, X2)) → a__app(mark(X1), mark(X2))
a__app(nil, YS) → mark(YS)
mark(from(X)) → a__from(mark(X))
a__zWadr(cons(X, XS), cons(Y, YS)) → cons(a__app(mark(Y), cons(mark(X), nil)), zWadr(XS, YS))
a__prefix(L) → cons(nil, zWadr(L, prefix(L)))
mark(nil) → nil
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(zWadr(X1, X2)) → a__zWadr(mark(X1), mark(X2))
mark(prefix(X)) → a__prefix(mark(X))
a__from(X) → from(X)
a__zWadr(X1, X2) → zWadr(X1, X2)
mark(s(X)) → s(mark(X))
a__app(X1, X2) → app(X1, X2)
a__zWadr(nil, YS) → nil
a__zWadr(XS, nil) → nil
a__app(cons(X, XS), YS) → cons(mark(X), app(XS, YS))
a__prefix(X) → prefix(X)
a__from(X) → cons(mark(X), from(s(X)))

(14) Obligation:

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

A__FROM(X) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)

The TRS R consists of the following rules:

a__app(nil, YS) → mark(YS)
a__app(cons(X, XS), YS) → cons(mark(X), app(XS, YS))
a__from(X) → cons(mark(X), from(s(X)))
a__zWadr(nil, YS) → nil
a__zWadr(XS, nil) → nil
a__zWadr(cons(X, XS), cons(Y, YS)) → cons(a__app(mark(Y), cons(mark(X), nil)), zWadr(XS, YS))
a__prefix(L) → cons(nil, zWadr(L, prefix(L)))
mark(app(X1, X2)) → a__app(mark(X1), mark(X2))
mark(from(X)) → a__from(mark(X))
mark(zWadr(X1, X2)) → a__zWadr(mark(X1), mark(X2))
mark(prefix(X)) → a__prefix(mark(X))
mark(nil) → nil
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
a__app(X1, X2) → app(X1, X2)
a__from(X) → from(X)
a__zWadr(X1, X2) → zWadr(X1, X2)
a__prefix(X) → prefix(X)

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

(15) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node.

(16) Obligation:

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

MARK(cons(X1, X2)) → MARK(X1)

The TRS R consists of the following rules:

a__app(nil, YS) → mark(YS)
a__app(cons(X, XS), YS) → cons(mark(X), app(XS, YS))
a__from(X) → cons(mark(X), from(s(X)))
a__zWadr(nil, YS) → nil
a__zWadr(XS, nil) → nil
a__zWadr(cons(X, XS), cons(Y, YS)) → cons(a__app(mark(Y), cons(mark(X), nil)), zWadr(XS, YS))
a__prefix(L) → cons(nil, zWadr(L, prefix(L)))
mark(app(X1, X2)) → a__app(mark(X1), mark(X2))
mark(from(X)) → a__from(mark(X))
mark(zWadr(X1, X2)) → a__zWadr(mark(X1), mark(X2))
mark(prefix(X)) → a__prefix(mark(X))
mark(nil) → nil
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
a__app(X1, X2) → app(X1, X2)
a__from(X) → from(X)
a__zWadr(X1, X2) → zWadr(X1, X2)
a__prefix(X) → prefix(X)

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

(17) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


MARK(cons(X1, X2)) → MARK(X1)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
MARK(x1)  =  x1
cons(x1, x2)  =  cons(x1, x2)

Recursive Path Order [RPO].
Precedence:
trivial


The following usable rules [FROCOS05] were oriented: none

(18) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

a__app(nil, YS) → mark(YS)
a__app(cons(X, XS), YS) → cons(mark(X), app(XS, YS))
a__from(X) → cons(mark(X), from(s(X)))
a__zWadr(nil, YS) → nil
a__zWadr(XS, nil) → nil
a__zWadr(cons(X, XS), cons(Y, YS)) → cons(a__app(mark(Y), cons(mark(X), nil)), zWadr(XS, YS))
a__prefix(L) → cons(nil, zWadr(L, prefix(L)))
mark(app(X1, X2)) → a__app(mark(X1), mark(X2))
mark(from(X)) → a__from(mark(X))
mark(zWadr(X1, X2)) → a__zWadr(mark(X1), mark(X2))
mark(prefix(X)) → a__prefix(mark(X))
mark(nil) → nil
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(s(X)) → s(mark(X))
a__app(X1, X2) → app(X1, X2)
a__from(X) → from(X)
a__zWadr(X1, X2) → zWadr(X1, X2)
a__prefix(X) → prefix(X)

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

(19) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(20) TRUE