Termination w.r.t. Q proof of /tmp/tmpiw5h1J/PEANO_nosorts_noand

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

0 QTRS

↳1 DependencyPairsProof (⇔)

↳2 QDP

↳3 DependencyGraphProof (⇔)

↳4 AND

  ↳5 QDP

    ↳6 QDPOrderProof (⇔)

    ↳7 QDP

    ↳8 QDPOrderProof (⇔)

    ↳9 QDP

    ↳10 QDPOrderProof (⇔)

    ↳11 QDP

    ↳12 QDPOrderProof (⇔)

    ↳13 QDP

    ↳14 PisEmptyProof (⇔)

    ↳15 TRUE

  ↳16 QDP

    ↳17 QDPOrderProof (⇔)

    ↳18 QDP

    ↳19 QDPOrderProof (⇔)

    ↳20 QDP

    ↳21 PisEmptyProof (⇔)

    ↳22 TRUE

  ↳23 QDP

    ↳24 QDPOrderProof (⇔)

    ↳25 QDP

    ↳26 QDPOrderProof (⇔)

    ↳27 QDP

    ↳28 QDPOrderProof (⇔)

    ↳29 QDP

    ↳30 QDPOrderProof (⇔)

    ↳31 QDP

    ↳32 QDPOrderProof (⇔)

    ↳33 QDP

    ↳34 QDPOrderProof (⇔)

    ↳35 QDP

    ↳36 PisEmptyProof (⇔)

    ↳37 TRUE

  ↳38 QDP

    ↳39 QDPOrderProof (⇔)

    ↳40 QDP

    ↳41 QDPOrderProof (⇔)

    ↳42 QDP

    ↳43 QDPOrderProof (⇔)

    ↳44 QDP

    ↳45 QDPOrderProof (⇔)

    ↳46 QDP

    ↳47 QDPOrderProof (⇔)

    ↳48 QDP

    ↳49 QDPOrderProof (⇔)

    ↳50 QDP

    ↳51 PisEmptyProof (⇔)

    ↳52 TRUE

  ↳53 QDP

(0) Obligation:

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

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

Q is empty.

(1) DependencyPairsProof (EQUIVALENT transformation)

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

(2) Obligation:

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

ACTIVE(U11(tt, M, N)) → MARK(U12(tt, M, N))
ACTIVE(U11(tt, M, N)) → U12¹(tt, M, N)
ACTIVE(U12(tt, M, N)) → MARK(s(plus(N, M)))
ACTIVE(U12(tt, M, N)) → S(plus(N, M))
ACTIVE(U12(tt, M, N)) → PLUS(N, M)
ACTIVE(plus(N, 0)) → MARK(N)
ACTIVE(plus(N, s(M))) → MARK(U11(tt, M, N))
ACTIVE(plus(N, s(M))) → U11¹(tt, M, N)
MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
MARK(U11(X1, X2, X3)) → U11¹(mark(X1), X2, X3)
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(tt) → ACTIVE(tt)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
MARK(U12(X1, X2, X3)) → U12¹(mark(X1), X2, X3)
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(s(X)) → ACTIVE(s(mark(X)))
MARK(s(X)) → S(mark(X))
MARK(s(X)) → MARK(X)
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))
MARK(plus(X1, X2)) → PLUS(mark(X1), mark(X2))
MARK(plus(X1, X2)) → MARK(X1)
MARK(plus(X1, X2)) → MARK(X2)
MARK(0) → ACTIVE(0)
U11¹(mark(X1), X2, X3) → U11¹(X1, X2, X3)
U11¹(X1, mark(X2), X3) → U11¹(X1, X2, X3)
U11¹(X1, X2, mark(X3)) → U11¹(X1, X2, X3)
U11¹(active(X1), X2, X3) → U11¹(X1, X2, X3)
U11¹(X1, active(X2), X3) → U11¹(X1, X2, X3)
U11¹(X1, X2, active(X3)) → U11¹(X1, X2, X3)
U12¹(mark(X1), X2, X3) → U12¹(X1, X2, X3)
U12¹(X1, mark(X2), X3) → U12¹(X1, X2, X3)
U12¹(X1, X2, mark(X3)) → U12¹(X1, X2, X3)
U12¹(active(X1), X2, X3) → U12¹(X1, X2, X3)
U12¹(X1, active(X2), X3) → U12¹(X1, X2, X3)
U12¹(X1, X2, active(X3)) → U12¹(X1, X2, X3)
S(mark(X)) → S(X)
S(active(X)) → S(X)
PLUS(mark(X1), X2) → PLUS(X1, X2)
PLUS(X1, mark(X2)) → PLUS(X1, X2)
PLUS(active(X1), X2) → PLUS(X1, X2)
PLUS(X1, active(X2)) → PLUS(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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 5 SCCs with 10 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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.

PLUS(X1, active(X2)) → PLUS(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
PLUS(x1, x2) = x2
mark(x1) = x1
active(x1) = active(x1)

Recursive path order with status [RPO].
Precedence:

trivial

Status:

trivial

The following usable rules [FROCOS05] were oriented: none

(7) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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.

PLUS(X1, mark(X2)) → PLUS(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
PLUS(x1, x2) = x2
mark(x1) = mark(x1)

Recursive path order with status [RPO].
Precedence:

trivial

Status:

trivial

The following usable rules [FROCOS05] were oriented: none

(9) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(10) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PLUS(active(X1), X2) → PLUS(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
PLUS(x1, x2) = x1
mark(x1) = x1
active(x1) = active(x1)

Recursive path order with status [RPO].
Precedence:

trivial

Status:

trivial

The following usable rules [FROCOS05] were oriented: none

(11) Obligation:

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

PLUS(mark(X1), X2) → PLUS(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(12) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PLUS(mark(X1), X2) → PLUS(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
PLUS(x1, x2) = x1
mark(x1) = mark(x1)

Recursive path order with status [RPO].
Precedence:

trivial

Status:

trivial

The following usable rules [FROCOS05] were oriented: none

(13) Obligation:

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

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(14) PisEmptyProof (EQUIVALENT transformation)

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

(15) TRUE

(16) 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(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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.

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)

Recursive path order with status [RPO].
Precedence:

trivial

Status:

trivial

The following usable rules [FROCOS05] were oriented: none

(18) 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(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(19) 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) = x1
active(x1) = active(x1)

Recursive path order with status [RPO].
Precedence:

trivial

Status:

trivial

The following usable rules [FROCOS05] were oriented: none

(20) Obligation:

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

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(21) PisEmptyProof (EQUIVALENT transformation)

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

(22) TRUE

(23) Obligation:

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

U12¹(X1, mark(X2), X3) → U12¹(X1, X2, X3)
U12¹(mark(X1), X2, X3) → U12¹(X1, X2, X3)
U12¹(X1, X2, mark(X3)) → U12¹(X1, X2, X3)
U12¹(active(X1), X2, X3) → U12¹(X1, X2, X3)
U12¹(X1, active(X2), X3) → U12¹(X1, X2, X3)
U12¹(X1, X2, active(X3)) → U12¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(24) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U12¹(X1, X2, active(X3)) → U12¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U12¹(x1, x2, x3) = x3
mark(x1) = x1
active(x1) = active(x1)

Recursive path order with status [RPO].
Precedence:

trivial

Status:

trivial

The following usable rules [FROCOS05] were oriented: none

(25) Obligation:

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

U12¹(X1, mark(X2), X3) → U12¹(X1, X2, X3)
U12¹(mark(X1), X2, X3) → U12¹(X1, X2, X3)
U12¹(X1, X2, mark(X3)) → U12¹(X1, X2, X3)
U12¹(active(X1), X2, X3) → U12¹(X1, X2, X3)
U12¹(X1, active(X2), X3) → U12¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(26) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U12¹(X1, X2, mark(X3)) → U12¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U12¹(x1, x2, x3) = x3
mark(x1) = mark(x1)

Recursive path order with status [RPO].
Precedence:

trivial

Status:

trivial

The following usable rules [FROCOS05] were oriented: none

(27) Obligation:

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

U12¹(X1, mark(X2), X3) → U12¹(X1, X2, X3)
U12¹(mark(X1), X2, X3) → U12¹(X1, X2, X3)
U12¹(active(X1), X2, X3) → U12¹(X1, X2, X3)
U12¹(X1, active(X2), X3) → U12¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(28) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U12¹(X1, active(X2), X3) → U12¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U12¹(x1, x2, x3) = x2
mark(x1) = x1
active(x1) = active(x1)

Recursive path order with status [RPO].
Precedence:

trivial

Status:

trivial

The following usable rules [FROCOS05] were oriented: none

(29) Obligation:

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

U12¹(X1, mark(X2), X3) → U12¹(X1, X2, X3)
U12¹(mark(X1), X2, X3) → U12¹(X1, X2, X3)
U12¹(active(X1), X2, X3) → U12¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(30) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U12¹(X1, mark(X2), X3) → U12¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U12¹(x1, x2, x3) = x2
mark(x1) = mark(x1)

Recursive path order with status [RPO].
Precedence:

trivial

Status:

trivial

The following usable rules [FROCOS05] were oriented: none

(31) Obligation:

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

U12¹(mark(X1), X2, X3) → U12¹(X1, X2, X3)
U12¹(active(X1), X2, X3) → U12¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(32) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U12¹(active(X1), X2, X3) → U12¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U12¹(x1, x2, x3) = x1
mark(x1) = x1
active(x1) = active(x1)

Recursive path order with status [RPO].
Precedence:

trivial

Status:

trivial

The following usable rules [FROCOS05] were oriented: none

(33) Obligation:

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

U12¹(mark(X1), X2, X3) → U12¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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.

U12¹(mark(X1), X2, X3) → U12¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U12¹(x1, x2, x3) = x1
mark(x1) = mark(x1)

Recursive path order with status [RPO].
Precedence:

trivial

Status:

trivial

The following usable rules [FROCOS05] were oriented: none

(35) Obligation:

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

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(36) PisEmptyProof (EQUIVALENT transformation)

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

(37) TRUE

(38) Obligation:

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

U11¹(X1, mark(X2), X3) → U11¹(X1, X2, X3)
U11¹(mark(X1), X2, X3) → U11¹(X1, X2, X3)
U11¹(X1, X2, mark(X3)) → U11¹(X1, X2, X3)
U11¹(active(X1), X2, X3) → U11¹(X1, X2, X3)
U11¹(X1, active(X2), X3) → U11¹(X1, X2, X3)
U11¹(X1, X2, active(X3)) → U11¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(39) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U11¹(X1, X2, active(X3)) → U11¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U11¹(x1, x2, x3) = x3
mark(x1) = x1
active(x1) = active(x1)

Recursive path order with status [RPO].
Precedence:

trivial

Status:

trivial

The following usable rules [FROCOS05] were oriented: none

(40) Obligation:

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

U11¹(X1, mark(X2), X3) → U11¹(X1, X2, X3)
U11¹(mark(X1), X2, X3) → U11¹(X1, X2, X3)
U11¹(X1, X2, mark(X3)) → U11¹(X1, X2, X3)
U11¹(active(X1), X2, X3) → U11¹(X1, X2, X3)
U11¹(X1, active(X2), X3) → U11¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(41) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U11¹(X1, X2, mark(X3)) → U11¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U11¹(x1, x2, x3) = x3
mark(x1) = mark(x1)

Recursive path order with status [RPO].
Precedence:

trivial

Status:

trivial

The following usable rules [FROCOS05] were oriented: none

(42) Obligation:

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

U11¹(X1, mark(X2), X3) → U11¹(X1, X2, X3)
U11¹(mark(X1), X2, X3) → U11¹(X1, X2, X3)
U11¹(active(X1), X2, X3) → U11¹(X1, X2, X3)
U11¹(X1, active(X2), X3) → U11¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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.

U11¹(X1, active(X2), X3) → U11¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U11¹(x1, x2, x3) = x2
mark(x1) = x1
active(x1) = active(x1)

Recursive path order with status [RPO].
Precedence:

trivial

Status:

trivial

The following usable rules [FROCOS05] were oriented: none

(44) Obligation:

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

U11¹(X1, mark(X2), X3) → U11¹(X1, X2, X3)
U11¹(mark(X1), X2, X3) → U11¹(X1, X2, X3)
U11¹(active(X1), X2, X3) → U11¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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.

U11¹(X1, mark(X2), X3) → U11¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U11¹(x1, x2, x3) = x2
mark(x1) = mark(x1)

Recursive path order with status [RPO].
Precedence:

trivial

Status:

trivial

The following usable rules [FROCOS05] were oriented: none

(46) Obligation:

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

U11¹(mark(X1), X2, X3) → U11¹(X1, X2, X3)
U11¹(active(X1), X2, X3) → U11¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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.

U11¹(active(X1), X2, X3) → U11¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U11¹(x1, x2, x3) = x1
mark(x1) = x1
active(x1) = active(x1)

Recursive path order with status [RPO].
Precedence:

trivial

Status:

trivial

The following usable rules [FROCOS05] were oriented: none

(48) Obligation:

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

U11¹(mark(X1), X2, X3) → U11¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(49) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U11¹(mark(X1), X2, X3) → U11¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U11¹(x1, x2, x3) = x1
mark(x1) = mark(x1)

Recursive path order with status [RPO].
Precedence:

trivial

Status:

trivial

The following usable rules [FROCOS05] were oriented: none

(50) Obligation:

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

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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

(51) PisEmptyProof (EQUIVALENT transformation)

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

(52) TRUE

(53) Obligation:

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

MARK(U11(X1, X2, X3)) → ACTIVE(U11(mark(X1), X2, X3))
ACTIVE(U11(tt, M, N)) → MARK(U12(tt, M, N))
MARK(U11(X1, X2, X3)) → MARK(X1)
MARK(U12(X1, X2, X3)) → ACTIVE(U12(mark(X1), X2, X3))
ACTIVE(U12(tt, M, N)) → MARK(s(plus(N, M)))
MARK(U12(X1, X2, X3)) → MARK(X1)
MARK(s(X)) → ACTIVE(s(mark(X)))
ACTIVE(plus(N, 0)) → MARK(N)
MARK(s(X)) → MARK(X)
MARK(plus(X1, X2)) → ACTIVE(plus(mark(X1), mark(X2)))
ACTIVE(plus(N, s(M))) → MARK(U11(tt, M, N))
MARK(plus(X1, X2)) → MARK(X1)
MARK(plus(X1, X2)) → MARK(X2)

The TRS R consists of the following rules:

active(U11(tt, M, N)) → mark(U12(tt, M, N))
active(U12(tt, M, N)) → mark(s(plus(N, M)))
active(plus(N, 0)) → mark(N)
active(plus(N, s(M))) → mark(U11(tt, M, N))
mark(U11(X1, X2, X3)) → active(U11(mark(X1), X2, X3))
mark(tt) → active(tt)
mark(U12(X1, X2, X3)) → active(U12(mark(X1), X2, X3))
mark(s(X)) → active(s(mark(X)))
mark(plus(X1, X2)) → active(plus(mark(X1), mark(X2)))
mark(0) → active(0)
U11(mark(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, mark(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, mark(X3)) → U11(X1, X2, X3)
U11(active(X1), X2, X3) → U11(X1, X2, X3)
U11(X1, active(X2), X3) → U11(X1, X2, X3)
U11(X1, X2, active(X3)) → U11(X1, X2, X3)
U12(mark(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, mark(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, mark(X3)) → U12(X1, X2, X3)
U12(active(X1), X2, X3) → U12(X1, X2, X3)
U12(X1, active(X2), X3) → U12(X1, X2, X3)
U12(X1, X2, active(X3)) → U12(X1, X2, X3)
s(mark(X)) → s(X)
s(active(X)) → s(X)
plus(mark(X1), X2) → plus(X1, X2)
plus(X1, mark(X2)) → plus(X1, X2)
plus(active(X1), X2) → plus(X1, X2)
plus(X1, active(X2)) → plus(X1, X2)

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