Termination w.r.t. Q proof of /tmp/tmprX1e9B/Ex3_3_25_Bor03

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

0 QTRS

↳1 DependencyPairsProof (⇔)

↳2 QDP

↳3 DependencyGraphProof (⇔)

↳4 AND

  ↳5 QDP

    ↳6 QDPOrderProof (⇔)

    ↳7 QDP

    ↳8 QDPOrderProof (⇔)

    ↳9 QDP

    ↳10 PisEmptyProof (⇔)

    ↳11 TRUE

  ↳12 QDP

    ↳13 QDPOrderProof (⇔)

    ↳14 QDP

    ↳15 QDPOrderProof (⇔)

    ↳16 QDP

    ↳17 PisEmptyProof (⇔)

    ↳18 TRUE

  ↳19 QDP

    ↳20 QDPOrderProof (⇔)

    ↳21 QDP

    ↳22 QDPOrderProof (⇔)

    ↳23 QDP

    ↳24 PisEmptyProof (⇔)

    ↳25 TRUE

  ↳26 QDP

    ↳27 QDPOrderProof (⇔)

    ↳28 QDP

    ↳29 QDPOrderProof (⇔)

    ↳30 QDP

    ↳31 PisEmptyProof (⇔)

    ↳32 TRUE

  ↳33 QDP

    ↳34 QDPOrderProof (⇔)

    ↳35 QDP

    ↳36 QDPOrderProof (⇔)

    ↳37 QDP

    ↳38 QDPOrderProof (⇔)

    ↳39 QDP

    ↳40 PisEmptyProof (⇔)

    ↳41 TRUE

  ↳42 QDP

    ↳43 QDPOrderProof (⇔)

    ↳44 QDP

    ↳45 QDPOrderProof (⇔)

    ↳46 QDP

    ↳47 QDPOrderProof (⇔)

    ↳48 QDP

    ↳49 PisEmptyProof (⇔)

    ↳50 TRUE

  ↳51 QDP

    ↳52 QDPOrderProof (⇔)

    ↳53 QDP

    ↳54 QDPOrderProof (⇔)

    ↳55 QDP

    ↳56 QDPOrderProof (⇔)

    ↳57 QDP

    ↳58 PisEmptyProof (⇔)

    ↳59 TRUE

(0) Obligation:

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

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(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:

ACTIVE(app(nil, YS)) → MARK(YS)
ACTIVE(app(cons(X, XS), YS)) → MARK(cons(X, app(XS, YS)))
ACTIVE(app(cons(X, XS), YS)) → CONS(X, app(XS, YS))
ACTIVE(app(cons(X, XS), YS)) → APP(XS, YS)
ACTIVE(from(X)) → MARK(cons(X, from(s(X))))
ACTIVE(from(X)) → CONS(X, from(s(X)))
ACTIVE(from(X)) → FROM(s(X))
ACTIVE(from(X)) → S(X)
ACTIVE(zWadr(nil, YS)) → MARK(nil)
ACTIVE(zWadr(XS, nil)) → MARK(nil)
ACTIVE(zWadr(cons(X, XS), cons(Y, YS))) → MARK(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
ACTIVE(zWadr(cons(X, XS), cons(Y, YS))) → CONS(app(Y, cons(X, nil)), zWadr(XS, YS))
ACTIVE(zWadr(cons(X, XS), cons(Y, YS))) → APP(Y, cons(X, nil))
ACTIVE(zWadr(cons(X, XS), cons(Y, YS))) → CONS(X, nil)
ACTIVE(zWadr(cons(X, XS), cons(Y, YS))) → ZWADR(XS, YS)
ACTIVE(prefix(L)) → MARK(cons(nil, zWadr(L, prefix(L))))
ACTIVE(prefix(L)) → CONS(nil, zWadr(L, prefix(L)))
ACTIVE(prefix(L)) → ZWADR(L, prefix(L))
MARK(app(X1, X2)) → ACTIVE(app(mark(X1), mark(X2)))
MARK(app(X1, X2)) → APP(mark(X1), mark(X2))
MARK(app(X1, X2)) → MARK(X1)
MARK(app(X1, X2)) → MARK(X2)
MARK(nil) → ACTIVE(nil)
MARK(cons(X1, X2)) → ACTIVE(cons(mark(X1), X2))
MARK(cons(X1, X2)) → CONS(mark(X1), X2)
MARK(cons(X1, X2)) → MARK(X1)
MARK(from(X)) → ACTIVE(from(mark(X)))
MARK(from(X)) → FROM(mark(X))
MARK(from(X)) → MARK(X)
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(s(X)) → S(mark(X))
MARK(s(X)) → MARK(X)
MARK(zWadr(X1, X2)) → ACTIVE(zWadr(mark(X1), mark(X2)))
MARK(zWadr(X1, X2)) → ZWADR(mark(X1), mark(X2))
MARK(zWadr(X1, X2)) → MARK(X1)
MARK(zWadr(X1, X2)) → MARK(X2)
MARK(prefix(X)) → ACTIVE(prefix(mark(X)))
MARK(prefix(X)) → PREFIX(mark(X))
MARK(prefix(X)) → MARK(X)
APP(mark(X1), X2) → APP(X1, X2)
APP(X1, mark(X2)) → APP(X1, X2)
APP(active(X1), X2) → APP(X1, X2)
APP(X1, active(X2)) → APP(X1, X2)
CONS(mark(X1), X2) → CONS(X1, X2)
CONS(X1, mark(X2)) → CONS(X1, X2)
CONS(active(X1), X2) → CONS(X1, X2)
CONS(X1, active(X2)) → CONS(X1, X2)
FROM(mark(X)) → FROM(X)
FROM(active(X)) → FROM(X)
S(mark(X)) → S(X)
S(active(X)) → S(X)
ZWADR(mark(X1), X2) → ZWADR(X1, X2)
ZWADR(X1, mark(X2)) → ZWADR(X1, X2)
ZWADR(active(X1), X2) → ZWADR(X1, X2)
ZWADR(X1, active(X2)) → ZWADR(X1, X2)
PREFIX(mark(X)) → PREFIX(X)
PREFIX(active(X)) → PREFIX(X)

The TRS R consists of the following rules:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(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 7 SCCs with 20 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

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

PREFIX(active(X)) → PREFIX(X)
PREFIX(mark(X)) → PREFIX(X)

The TRS R consists of the following rules:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(6) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PREFIX(mark(X)) → PREFIX(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
PREFIX(x1) = x1
active(x1) = x1
mark(x1) = mark(x1)
app(x1, x2) = app(x1, x2)
nil = nil
cons(x1, x2) = cons
from(x1) = from
s(x1) = s
zWadr(x1, x2) = zWadr(x1, x2)
prefix(x1) = prefix

Lexicographic path order with status [LPO].
Quasi-Precedence:

[from, s] > [mark₁, app₂, zWadr₂] > [nil, cons]
prefix > [mark₁, app₂, zWadr₂] > [nil, cons]

Status:

mark₁: [1]
app₂: [2,1]
nil: []
cons: []
from: []
s: []
zWadr₂: [2,1]
prefix: []

The following usable rules [FROCOS05] were oriented:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

(7) Obligation:

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

PREFIX(active(X)) → PREFIX(X)

The TRS R consists of the following rules:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(8) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PREFIX(active(X)) → PREFIX(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
PREFIX(x1) = PREFIX(x1)
active(x1) = active(x1)
app(x1, x2) = app(x1, x2)
nil = nil
mark(x1) = mark(x1)
cons(x1, x2) = cons
from(x1) = from
s(x1) = s
zWadr(x1, x2) = zWadr
prefix(x1) = prefix

Lexicographic path order with status [LPO].
Quasi-Precedence:

PREFIX₁ > [active₁, cons, s]
from > [app₂, nil, mark₁] > [active₁, cons, s]
prefix > zWadr > [app₂, nil, mark₁] > [active₁, cons, s]

Status:

PREFIX₁: [1]
active₁: [1]
app₂: [2,1]
nil: []
mark₁: [1]
cons: []
from: []
s: []
zWadr: []
prefix: []

The following usable rules [FROCOS05] were oriented:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

(9) Obligation:

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

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(10) PisEmptyProof (EQUIVALENT transformation)

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

(11) TRUE

(12) Obligation:

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

ZWADR(X1, mark(X2)) → ZWADR(X1, X2)
ZWADR(mark(X1), X2) → ZWADR(X1, X2)
ZWADR(active(X1), X2) → ZWADR(X1, X2)
ZWADR(X1, active(X2)) → ZWADR(X1, X2)

The TRS R consists of the following rules:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(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.

ZWADR(mark(X1), X2) → ZWADR(X1, X2)
ZWADR(active(X1), X2) → ZWADR(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ZWADR(x1, x2) = x1
mark(x1) = mark(x1)
active(x1) = active(x1)
app(x1, x2) = app(x1, x2)
nil = nil
cons(x1, x2) = cons
from(x1) = from
s(x1) = s
zWadr(x1, x2) = zWadr
prefix(x1) = prefix

Lexicographic path order with status [LPO].
Quasi-Precedence:

from > [mark₁, app₂] > nil > [active₁, cons]
s > [mark₁, app₂] > nil > [active₁, cons]
prefix > zWadr > [mark₁, app₂] > nil > [active₁, cons]

Status:

mark₁: [1]
active₁: [1]
app₂: [2,1]
nil: []
cons: []
from: []
s: []
zWadr: []
prefix: []

The following usable rules [FROCOS05] were oriented:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

(14) Obligation:

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

ZWADR(X1, mark(X2)) → ZWADR(X1, X2)
ZWADR(X1, active(X2)) → ZWADR(X1, X2)

The TRS R consists of the following rules:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(15) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ZWADR(X1, mark(X2)) → ZWADR(X1, X2)
ZWADR(X1, active(X2)) → ZWADR(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ZWADR(x1, x2) = x2
mark(x1) = mark(x1)
active(x1) = active(x1)
app(x1, x2) = app(x1, x2)
nil = nil
cons(x1, x2) = cons
from(x1) = from
s(x1) = s
zWadr(x1, x2) = zWadr(x1, x2)
prefix(x1) = prefix

Lexicographic path order with status [LPO].
Quasi-Precedence:

from > [mark₁, app₂, zWadr₂] > [active₁, s] > [nil, cons]
prefix > [mark₁, app₂, zWadr₂] > [active₁, s] > [nil, cons]

Status:

mark₁: [1]
active₁: [1]
app₂: [2,1]
nil: []
cons: []
from: []
s: []
zWadr₂: [1,2]
prefix: []

The following usable rules [FROCOS05] were oriented:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

(16) Obligation:

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

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(17) PisEmptyProof (EQUIVALENT transformation)

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

(18) TRUE

(19) Obligation:

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

S(active(X)) → S(X)
S(mark(X)) → S(X)

The TRS R consists of the following rules:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(20) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

S(mark(X)) → S(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
S(x1) = x1
active(x1) = x1
mark(x1) = mark(x1)
app(x1, x2) = app(x1, x2)
nil = nil
cons(x1, x2) = cons
from(x1) = from
s(x1) = s
zWadr(x1, x2) = zWadr(x1, x2)
prefix(x1) = prefix

Lexicographic path order with status [LPO].
Quasi-Precedence:

[from, s] > [mark₁, app₂, zWadr₂] > [nil, cons]
prefix > [mark₁, app₂, zWadr₂] > [nil, cons]

Status:

mark₁: [1]
app₂: [2,1]
nil: []
cons: []
from: []
s: []
zWadr₂: [2,1]
prefix: []

The following usable rules [FROCOS05] were oriented:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

(21) Obligation:

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

S(active(X)) → S(X)

The TRS R consists of the following rules:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(22) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

S(active(X)) → S(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
S(x1) = S(x1)
active(x1) = active(x1)
app(x1, x2) = app(x1, x2)
nil = nil
mark(x1) = mark(x1)
cons(x1, x2) = cons
from(x1) = from
s(x1) = s
zWadr(x1, x2) = zWadr
prefix(x1) = prefix

Lexicographic path order with status [LPO].
Quasi-Precedence:

S₁ > [active₁, cons, s]
from > [app₂, nil, mark₁] > [active₁, cons, s]
prefix > zWadr > [app₂, nil, mark₁] > [active₁, cons, s]

Status:

S₁: [1]
active₁: [1]
app₂: [2,1]
nil: []
mark₁: [1]
cons: []
from: []
s: []
zWadr: []
prefix: []

The following usable rules [FROCOS05] were oriented:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

(23) Obligation:

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

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(24) PisEmptyProof (EQUIVALENT transformation)

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

(25) TRUE

(26) Obligation:

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

FROM(active(X)) → FROM(X)
FROM(mark(X)) → FROM(X)

The TRS R consists of the following rules:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(27) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

FROM(mark(X)) → FROM(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
FROM(x1) = x1
active(x1) = x1
mark(x1) = mark(x1)
app(x1, x2) = app(x1, x2)
nil = nil
cons(x1, x2) = cons
from(x1) = from
s(x1) = s
zWadr(x1, x2) = zWadr(x1, x2)
prefix(x1) = prefix

Lexicographic path order with status [LPO].
Quasi-Precedence:

[from, s] > [mark₁, app₂, zWadr₂] > [nil, cons]
prefix > [mark₁, app₂, zWadr₂] > [nil, cons]

Status:

mark₁: [1]
app₂: [2,1]
nil: []
cons: []
from: []
s: []
zWadr₂: [2,1]
prefix: []

The following usable rules [FROCOS05] were oriented:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

(28) Obligation:

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

FROM(active(X)) → FROM(X)

The TRS R consists of the following rules:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(29) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

FROM(active(X)) → FROM(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
FROM(x1) = FROM(x1)
active(x1) = active(x1)
app(x1, x2) = app(x1, x2)
nil = nil
mark(x1) = mark(x1)
cons(x1, x2) = cons
from(x1) = from
s(x1) = s
zWadr(x1, x2) = zWadr
prefix(x1) = prefix

Lexicographic path order with status [LPO].
Quasi-Precedence:

FROM₁ > [active₁, cons, s]
from > [app₂, nil, mark₁] > [active₁, cons, s]
prefix > zWadr > [app₂, nil, mark₁] > [active₁, cons, s]

Status:

FROM₁: [1]
active₁: [1]
app₂: [2,1]
nil: []
mark₁: [1]
cons: []
from: []
s: []
zWadr: []
prefix: []

The following usable rules [FROCOS05] were oriented:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

(30) Obligation:

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

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(31) PisEmptyProof (EQUIVALENT transformation)

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

(32) TRUE

(33) Obligation:

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

CONS(X1, mark(X2)) → CONS(X1, X2)
CONS(mark(X1), X2) → CONS(X1, X2)
CONS(active(X1), X2) → CONS(X1, X2)
CONS(X1, active(X2)) → CONS(X1, X2)

The TRS R consists of the following rules:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(34) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

CONS(mark(X1), X2) → CONS(X1, X2)
CONS(active(X1), X2) → CONS(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
CONS(x1, x2) = x1
mark(x1) = mark(x1)
active(x1) = active(x1)
app(x1, x2) = app(x1, x2)
nil = nil
cons(x1, x2) = cons
from(x1) = from
s(x1) = s
zWadr(x1, x2) = zWadr
prefix(x1) = prefix

Lexicographic path order with status [LPO].
Quasi-Precedence:

from > [mark₁, app₂] > nil > [active₁, cons]
s > [mark₁, app₂] > nil > [active₁, cons]
prefix > zWadr > [mark₁, app₂] > nil > [active₁, cons]

Status:

mark₁: [1]
active₁: [1]
app₂: [2,1]
nil: []
cons: []
from: []
s: []
zWadr: []
prefix: []

The following usable rules [FROCOS05] were oriented:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

(35) Obligation:

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

CONS(X1, mark(X2)) → CONS(X1, X2)
CONS(X1, active(X2)) → CONS(X1, X2)

The TRS R consists of the following rules:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(36) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

CONS(X1, mark(X2)) → CONS(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
CONS(x1, x2) = x2
mark(x1) = mark(x1)
active(x1) = x1
app(x1, x2) = app(x2)
nil = nil
cons(x1, x2) = cons
from(x1) = from(x1)
s(x1) = s
zWadr(x1, x2) = zWadr(x1)
prefix(x1) = prefix

Lexicographic path order with status [LPO].
Quasi-Precedence:

prefix > [mark₁, app₁, nil, cons, from₁, s, zWadr₁]

Status:

mark₁: [1]
app₁: [1]
nil: []
cons: []
from₁: [1]
s: []
zWadr₁: [1]
prefix: []

The following usable rules [FROCOS05] were oriented:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

(37) Obligation:

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

CONS(X1, active(X2)) → CONS(X1, X2)

The TRS R consists of the following rules:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(38) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

CONS(X1, active(X2)) → CONS(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
CONS(x1, x2) = CONS(x2)
active(x1) = active(x1)
app(x1, x2) = app(x1, x2)
nil = nil
mark(x1) = mark(x1)
cons(x1, x2) = cons
from(x1) = from
s(x1) = s
zWadr(x1, x2) = zWadr
prefix(x1) = prefix

Lexicographic path order with status [LPO].
Quasi-Precedence:

[from, s] > [app₂, mark₁] > active₁ > [CONS₁, cons]
[zWadr, prefix] > nil > [app₂, mark₁] > active₁ > [CONS₁, cons]

Status:

CONS₁: [1]
active₁: [1]
app₂: [2,1]
nil: []
mark₁: [1]
cons: []
from: []
s: []
zWadr: []
prefix: []

The following usable rules [FROCOS05] were oriented:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

(39) Obligation:

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

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(40) PisEmptyProof (EQUIVALENT transformation)

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

(41) TRUE

(42) Obligation:

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

APP(X1, mark(X2)) → APP(X1, X2)
APP(mark(X1), X2) → APP(X1, X2)
APP(active(X1), X2) → APP(X1, X2)
APP(X1, active(X2)) → APP(X1, X2)

The TRS R consists of the following rules:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(43) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

APP(mark(X1), X2) → APP(X1, X2)
APP(active(X1), X2) → APP(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
APP(x1, x2) = x1
mark(x1) = mark(x1)
active(x1) = active(x1)
app(x1, x2) = app(x1, x2)
nil = nil
cons(x1, x2) = cons
from(x1) = from
s(x1) = s
zWadr(x1, x2) = zWadr
prefix(x1) = prefix

Lexicographic path order with status [LPO].
Quasi-Precedence:

from > [mark₁, app₂] > nil > [active₁, cons]
s > [mark₁, app₂] > nil > [active₁, cons]
prefix > zWadr > [mark₁, app₂] > nil > [active₁, cons]

Status:

mark₁: [1]
active₁: [1]
app₂: [2,1]
nil: []
cons: []
from: []
s: []
zWadr: []
prefix: []

The following usable rules [FROCOS05] were oriented:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

(44) Obligation:

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

APP(X1, mark(X2)) → APP(X1, X2)
APP(X1, active(X2)) → APP(X1, X2)

The TRS R consists of the following rules:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(45) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

APP(X1, mark(X2)) → APP(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
APP(x1, x2) = x2
mark(x1) = mark(x1)
active(x1) = x1
app(x1, x2) = app(x2)
nil = nil
cons(x1, x2) = cons
from(x1) = from(x1)
s(x1) = s
zWadr(x1, x2) = zWadr(x1)
prefix(x1) = prefix

Lexicographic path order with status [LPO].
Quasi-Precedence:

prefix > [mark₁, app₁, nil, cons, from₁, s, zWadr₁]

Status:

mark₁: [1]
app₁: [1]
nil: []
cons: []
from₁: [1]
s: []
zWadr₁: [1]
prefix: []

The following usable rules [FROCOS05] were oriented:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

(46) Obligation:

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

APP(X1, active(X2)) → APP(X1, X2)

The TRS R consists of the following rules:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(47) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

APP(X1, active(X2)) → APP(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
APP(x1, x2) = APP(x2)
active(x1) = active(x1)
app(x1, x2) = app(x1, x2)
nil = nil
mark(x1) = mark(x1)
cons(x1, x2) = cons
from(x1) = from
s(x1) = s
zWadr(x1, x2) = zWadr
prefix(x1) = prefix

Lexicographic path order with status [LPO].
Quasi-Precedence:

[from, s] > [app₂, mark₁] > active₁ > [APP₁, cons]
[zWadr, prefix] > nil > [app₂, mark₁] > active₁ > [APP₁, cons]

Status:

APP₁: [1]
active₁: [1]
app₂: [2,1]
nil: []
mark₁: [1]
cons: []
from: []
s: []
zWadr: []
prefix: []

The following usable rules [FROCOS05] were oriented:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

(48) Obligation:

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

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(49) PisEmptyProof (EQUIVALENT transformation)

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

(50) TRUE

(51) Obligation:

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

MARK(app(X1, X2)) → ACTIVE(app(mark(X1), mark(X2)))
ACTIVE(app(nil, YS)) → MARK(YS)
MARK(app(X1, X2)) → MARK(X1)
MARK(app(X1, X2)) → MARK(X2)
MARK(cons(X1, X2)) → ACTIVE(cons(mark(X1), X2))
ACTIVE(app(cons(X, XS), YS)) → MARK(cons(X, app(XS, YS)))
MARK(cons(X1, X2)) → MARK(X1)
MARK(from(X)) → ACTIVE(from(mark(X)))
ACTIVE(from(X)) → MARK(cons(X, from(s(X))))
MARK(from(X)) → MARK(X)
MARK(s(X)) → ACTIVE(s(mark(X)))
ACTIVE(zWadr(cons(X, XS), cons(Y, YS))) → MARK(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
MARK(s(X)) → MARK(X)
MARK(zWadr(X1, X2)) → ACTIVE(zWadr(mark(X1), mark(X2)))
ACTIVE(prefix(L)) → MARK(cons(nil, zWadr(L, prefix(L))))
MARK(zWadr(X1, X2)) → MARK(X1)
MARK(zWadr(X1, X2)) → MARK(X2)
MARK(prefix(X)) → ACTIVE(prefix(mark(X)))
MARK(prefix(X)) → MARK(X)

The TRS R consists of the following rules:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(52) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(app(X1, X2)) → ACTIVE(app(mark(X1), mark(X2)))
ACTIVE(app(nil, YS)) → MARK(YS)
MARK(app(X1, X2)) → MARK(X1)
MARK(app(X1, X2)) → MARK(X2)
MARK(cons(X1, X2)) → ACTIVE(cons(mark(X1), X2))
ACTIVE(app(cons(X, XS), YS)) → MARK(cons(X, app(XS, YS)))
MARK(from(X)) → ACTIVE(from(mark(X)))
ACTIVE(from(X)) → MARK(cons(X, from(s(X))))
MARK(from(X)) → MARK(X)
MARK(s(X)) → ACTIVE(s(mark(X)))
ACTIVE(zWadr(cons(X, XS), cons(Y, YS))) → MARK(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
MARK(zWadr(X1, X2)) → ACTIVE(zWadr(mark(X1), mark(X2)))
ACTIVE(prefix(L)) → MARK(cons(nil, zWadr(L, prefix(L))))
MARK(zWadr(X1, X2)) → MARK(X1)
MARK(zWadr(X1, X2)) → MARK(X2)
MARK(prefix(X)) → ACTIVE(prefix(mark(X)))
MARK(prefix(X)) → 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)
ACTIVE(x1) = x1
mark(x1) = x1
nil = nil
cons(x1, x2) = x1
from(x1) = from(x1)
s(x1) = x1
zWadr(x1, x2) = zWadr(x1, x2)
prefix(x1) = prefix(x1)
active(x1) = x1

Lexicographic path order with status [LPO].
Quasi-Precedence:

from₁ > [MARK₁, nil]
[zWadr₂, prefix₁] > app₂ > [MARK₁, nil]

Status:

MARK₁: [1]
app₂: [1,2]
nil: []
from₁: [1]
zWadr₂: [1,2]
prefix₁: [1]

The following usable rules [FROCOS05] were oriented:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

(53) Obligation:

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

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

The TRS R consists of the following rules:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(54) 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.
MARK(x1) = x1
cons(x1, x2) = x1
s(x1) = s(x1)
active(x1) = x1
app(x1, x2) = app(x1, x2)
nil = nil
mark(x1) = x1
from(x1) = from(x1)
zWadr(x1, x2) = zWadr(x1, x2)
prefix(x1) = prefix

Lexicographic path order with status [LPO].
Quasi-Precedence:

from₁ > s₁
[zWadr₂, prefix] > app₂
[zWadr₂, prefix] > nil

Status:

s₁: [1]
app₂: [1,2]
nil: []
from₁: [1]
zWadr₂: [2,1]
prefix: []

The following usable rules [FROCOS05] were oriented:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

(55) 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:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(56) 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)
active(x1) = x1
app(x1, x2) = app(x1, x2)
nil = nil
mark(x1) = x1
from(x1) = from(x1)
s(x1) = s
zWadr(x1, x2) = zWadr(x1, x2)
prefix(x1) = prefix

Lexicographic path order with status [LPO].
Quasi-Precedence:

[from₁, s] > cons₁ > nil
[zWadr₂, prefix] > app₂ > cons₁ > nil

Status:

cons₁: [1]
app₂: [1,2]
nil: []
from₁: [1]
s: []
zWadr₂: [2,1]
prefix: []

The following usable rules [FROCOS05] were oriented:

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

(57) Obligation:

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

active(app(nil, YS)) → mark(YS)
active(app(cons(X, XS), YS)) → mark(cons(X, app(XS, YS)))
active(from(X)) → mark(cons(X, from(s(X))))
active(zWadr(nil, YS)) → mark(nil)
active(zWadr(XS, nil)) → mark(nil)
active(zWadr(cons(X, XS), cons(Y, YS))) → mark(cons(app(Y, cons(X, nil)), zWadr(XS, YS)))
active(prefix(L)) → mark(cons(nil, zWadr(L, prefix(L))))
mark(app(X1, X2)) → active(app(mark(X1), mark(X2)))
mark(nil) → active(nil)
mark(cons(X1, X2)) → active(cons(mark(X1), X2))
mark(from(X)) → active(from(mark(X)))
mark(s(X)) → active(s(mark(X)))
mark(zWadr(X1, X2)) → active(zWadr(mark(X1), mark(X2)))
mark(prefix(X)) → active(prefix(mark(X)))
app(mark(X1), X2) → app(X1, X2)
app(X1, mark(X2)) → app(X1, X2)
app(active(X1), X2) → app(X1, X2)
app(X1, active(X2)) → app(X1, X2)
cons(mark(X1), X2) → cons(X1, X2)
cons(X1, mark(X2)) → cons(X1, X2)
cons(active(X1), X2) → cons(X1, X2)
cons(X1, active(X2)) → cons(X1, X2)
from(mark(X)) → from(X)
from(active(X)) → from(X)
s(mark(X)) → s(X)
s(active(X)) → s(X)
zWadr(mark(X1), X2) → zWadr(X1, X2)
zWadr(X1, mark(X2)) → zWadr(X1, X2)
zWadr(active(X1), X2) → zWadr(X1, X2)
zWadr(X1, active(X2)) → zWadr(X1, X2)
prefix(mark(X)) → prefix(X)
prefix(active(X)) → prefix(X)

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

(58) PisEmptyProof (EQUIVALENT transformation)

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

(0) Obligation:

(1) DependencyPairsProof (EQUIVALENT transformation)

(2) Obligation:

(3) DependencyGraphProof (EQUIVALENT transformation)

(4) Complex Obligation (AND)

(5) Obligation:

(6) QDPOrderProof (EQUIVALENT transformation)

(7) Obligation:

(8) QDPOrderProof (EQUIVALENT transformation)

(9) Obligation:

(10) PisEmptyProof (EQUIVALENT transformation)

(11) TRUE

(12) Obligation:

(13) QDPOrderProof (EQUIVALENT transformation)

(14) Obligation:

(15) QDPOrderProof (EQUIVALENT transformation)

(16) Obligation:

(17) PisEmptyProof (EQUIVALENT transformation)

(18) TRUE

(19) Obligation:

(20) QDPOrderProof (EQUIVALENT transformation)

(21) Obligation:

(22) QDPOrderProof (EQUIVALENT transformation)

(23) Obligation:

(24) PisEmptyProof (EQUIVALENT transformation)

(25) TRUE

(26) Obligation:

(27) QDPOrderProof (EQUIVALENT transformation)

(28) Obligation:

(29) QDPOrderProof (EQUIVALENT transformation)

(30) Obligation:

(31) PisEmptyProof (EQUIVALENT transformation)

(32) TRUE

(33) Obligation:

(34) QDPOrderProof (EQUIVALENT transformation)

(35) Obligation:

(36) QDPOrderProof (EQUIVALENT transformation)

(37) Obligation:

(38) QDPOrderProof (EQUIVALENT transformation)

(39) Obligation:

(40) PisEmptyProof (EQUIVALENT transformation)

(41) TRUE

(42) Obligation:

(43) QDPOrderProof (EQUIVALENT transformation)

(44) Obligation:

(45) QDPOrderProof (EQUIVALENT transformation)

(46) Obligation:

(47) QDPOrderProof (EQUIVALENT transformation)

(48) Obligation:

(49) PisEmptyProof (EQUIVALENT transformation)

(50) TRUE

(51) Obligation:

(52) QDPOrderProof (EQUIVALENT transformation)

(53) Obligation:

(54) QDPOrderProof (EQUIVALENT transformation)

(55) Obligation:

(56) QDPOrderProof (EQUIVALENT transformation)

(57) Obligation:

(58) PisEmptyProof (EQUIVALENT transformation)

(59) TRUE