Termination w.r.t. Q proof of /tmp/tmpiveEck/PEANO_nokinds_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 PisEmptyProof (⇔)

    ↳9 TRUE

  ↳10 QDP

    ↳11 QDPOrderProof (⇔)

    ↳12 QDP

    ↳13 DependencyGraphProof (⇔)

    ↳14 QDP

    ↳15 QDPOrderProof (⇔)

    ↳16 QDP

(0) Obligation:

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

a__U11(tt, V2) → a__U12(a__isNat(V2))
a__U12(tt) → tt
a__U21(tt) → tt
a__U31(tt, N) → mark(N)
a__U41(tt, M, N) → a__U42(a__isNat(N), M, N)
a__U42(tt, M, N) → s(a__plus(mark(N), mark(M)))
a__isNat(0) → tt
a__isNat(plus(V1, V2)) → a__U11(a__isNat(V1), V2)
a__isNat(s(V1)) → a__U21(a__isNat(V1))
a__plus(N, 0) → a__U31(a__isNat(N), N)
a__plus(N, s(M)) → a__U41(a__isNat(M), M, N)
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(U12(X)) → a__U12(mark(X))
mark(isNat(X)) → a__isNat(X)
mark(U21(X)) → a__U21(mark(X))
mark(U31(X1, X2)) → a__U31(mark(X1), X2)
mark(U41(X1, X2, X3)) → a__U41(mark(X1), X2, X3)
mark(U42(X1, X2, X3)) → a__U42(mark(X1), X2, X3)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(0) → 0
a__U11(X1, X2) → U11(X1, X2)
a__U12(X) → U12(X)
a__isNat(X) → isNat(X)
a__U21(X) → U21(X)
a__U31(X1, X2) → U31(X1, X2)
a__U41(X1, X2, X3) → U41(X1, X2, X3)
a__U42(X1, X2, X3) → U42(X1, X2, X3)
a__plus(X1, 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:

A__U11(tt, V2) → A__U12(a__isNat(V2))
A__U11(tt, V2) → A__ISNAT(V2)
A__U31(tt, N) → MARK(N)
A__U41(tt, M, N) → A__U42(a__isNat(N), M, N)
A__U41(tt, M, N) → A__ISNAT(N)
A__U42(tt, M, N) → A__PLUS(mark(N), mark(M))
A__U42(tt, M, N) → MARK(N)
A__U42(tt, M, N) → MARK(M)
A__ISNAT(plus(V1, V2)) → A__U11(a__isNat(V1), V2)
A__ISNAT(plus(V1, V2)) → A__ISNAT(V1)
A__ISNAT(s(V1)) → A__U21(a__isNat(V1))
A__ISNAT(s(V1)) → A__ISNAT(V1)
A__PLUS(N, 0) → A__U31(a__isNat(N), N)
A__PLUS(N, 0) → A__ISNAT(N)
A__PLUS(N, s(M)) → A__U41(a__isNat(M), M, N)
A__PLUS(N, s(M)) → A__ISNAT(M)
MARK(U11(X1, X2)) → A__U11(mark(X1), X2)
MARK(U11(X1, X2)) → MARK(X1)
MARK(U12(X)) → A__U12(mark(X))
MARK(U12(X)) → MARK(X)
MARK(isNat(X)) → A__ISNAT(X)
MARK(U21(X)) → A__U21(mark(X))
MARK(U21(X)) → MARK(X)
MARK(U31(X1, X2)) → A__U31(mark(X1), X2)
MARK(U31(X1, X2)) → MARK(X1)
MARK(U41(X1, X2, X3)) → A__U41(mark(X1), X2, X3)
MARK(U41(X1, X2, X3)) → MARK(X1)
MARK(U42(X1, X2, X3)) → A__U42(mark(X1), X2, X3)
MARK(U42(X1, X2, X3)) → MARK(X1)
MARK(plus(X1, X2)) → A__PLUS(mark(X1), mark(X2))
MARK(plus(X1, X2)) → MARK(X1)
MARK(plus(X1, X2)) → MARK(X2)
MARK(s(X)) → MARK(X)

The TRS R consists of the following rules:

a__U11(tt, V2) → a__U12(a__isNat(V2))
a__U12(tt) → tt
a__U21(tt) → tt
a__U31(tt, N) → mark(N)
a__U41(tt, M, N) → a__U42(a__isNat(N), M, N)
a__U42(tt, M, N) → s(a__plus(mark(N), mark(M)))
a__isNat(0) → tt
a__isNat(plus(V1, V2)) → a__U11(a__isNat(V1), V2)
a__isNat(s(V1)) → a__U21(a__isNat(V1))
a__plus(N, 0) → a__U31(a__isNat(N), N)
a__plus(N, s(M)) → a__U41(a__isNat(M), M, N)
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(U12(X)) → a__U12(mark(X))
mark(isNat(X)) → a__isNat(X)
mark(U21(X)) → a__U21(mark(X))
mark(U31(X1, X2)) → a__U31(mark(X1), X2)
mark(U41(X1, X2, X3)) → a__U41(mark(X1), X2, X3)
mark(U42(X1, X2, X3)) → a__U42(mark(X1), X2, X3)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(0) → 0
a__U11(X1, X2) → U11(X1, X2)
a__U12(X) → U12(X)
a__isNat(X) → isNat(X)
a__U21(X) → U21(X)
a__U31(X1, X2) → U31(X1, X2)
a__U41(X1, X2, X3) → U41(X1, X2, X3)
a__U42(X1, X2, X3) → U42(X1, X2, X3)
a__plus(X1, 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 2 SCCs with 9 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

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

A__U11(tt, V2) → A__ISNAT(V2)
A__ISNAT(plus(V1, V2)) → A__U11(a__isNat(V1), V2)
A__ISNAT(plus(V1, V2)) → A__ISNAT(V1)
A__ISNAT(s(V1)) → A__ISNAT(V1)

The TRS R consists of the following rules:

a__U11(tt, V2) → a__U12(a__isNat(V2))
a__U12(tt) → tt
a__U21(tt) → tt
a__U31(tt, N) → mark(N)
a__U41(tt, M, N) → a__U42(a__isNat(N), M, N)
a__U42(tt, M, N) → s(a__plus(mark(N), mark(M)))
a__isNat(0) → tt
a__isNat(plus(V1, V2)) → a__U11(a__isNat(V1), V2)
a__isNat(s(V1)) → a__U21(a__isNat(V1))
a__plus(N, 0) → a__U31(a__isNat(N), N)
a__plus(N, s(M)) → a__U41(a__isNat(M), M, N)
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(U12(X)) → a__U12(mark(X))
mark(isNat(X)) → a__isNat(X)
mark(U21(X)) → a__U21(mark(X))
mark(U31(X1, X2)) → a__U31(mark(X1), X2)
mark(U41(X1, X2, X3)) → a__U41(mark(X1), X2, X3)
mark(U42(X1, X2, X3)) → a__U42(mark(X1), X2, X3)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(0) → 0
a__U11(X1, X2) → U11(X1, X2)
a__U12(X) → U12(X)
a__isNat(X) → isNat(X)
a__U21(X) → U21(X)
a__U31(X1, X2) → U31(X1, X2)
a__U41(X1, X2, X3) → U41(X1, X2, X3)
a__U42(X1, X2, X3) → U42(X1, X2, X3)
a__plus(X1, 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.

A__U11(tt, V2) → A__ISNAT(V2)
A__ISNAT(plus(V1, V2)) → A__U11(a__isNat(V1), V2)
A__ISNAT(plus(V1, V2)) → A__ISNAT(V1)
A__ISNAT(s(V1)) → A__ISNAT(V1)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
A__U11(x1, x2) = A__U11(x1, x2)
tt = tt
A__ISNAT(x1) = A__ISNAT(x1)
plus(x1, x2) = plus(x1, x2)
a__isNat(x1) = a__isNat
s(x1) = s(x1)
a__U11(x1, x2) = x1
a__U12(x1) = x1
a__U21(x1) = x1
a__U31(x1, x2) = a__U31(x2)
mark(x1) = x1
a__U41(x1, x2, x3) = a__U41(x1, x2, x3)
a__U42(x1, x2, x3) = a__U42(x1, x2, x3)
a__plus(x1, x2) = a__plus(x1, x2)
0 = 0
U11(x1, x2) = x1
U12(x1) = x1
isNat(x1) = isNat
U21(x1) = x1
U31(x1, x2) = U31(x2)
U41(x1, x2, x3) = U41(x1, x2, x3)
U42(x1, x2, x3) = U42(x1, x2, x3)

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

[plus₂, a_{_U41₃}, a_{_U42₃}, a_{_plus₂}, U41₃, U42₃] > A_{_U11₂} > A_{_ISNAT₁} > [tt, a_{_isNat}, isNat]
[plus₂, a_{_U41₃}, a_{_U42₃}, a_{_plus₂}, U41₃, U42₃] > s₁ > [tt, a_{_isNat}, isNat]
[plus₂, a_{_U41₃}, a_{_U42₃}, a_{_plus₂}, U41₃, U42₃] > [a_{_U31₁}, U31₁]

Status:

A_{_U11₂}: multiset
tt: multiset
A_{_ISNAT₁}: multiset
plus₂: multiset
a_{_isNat}: multiset
s₁: multiset
a_{_U31₁}: multiset
a_{_U41₃}: multiset
a_{_U42₃}: multiset
a_{_plus₂}: multiset
0: multiset
isNat: multiset
U31₁: multiset
U41₃: multiset
U42₃: multiset

The following usable rules [FROCOS05] were oriented:

a__U11(tt, V2) → a__U12(a__isNat(V2))
a__U12(tt) → tt
a__U21(tt) → tt
a__U31(tt, N) → mark(N)
a__U41(tt, M, N) → a__U42(a__isNat(N), M, N)
a__U42(tt, M, N) → s(a__plus(mark(N), mark(M)))
a__isNat(0) → tt
a__isNat(plus(V1, V2)) → a__U11(a__isNat(V1), V2)
a__isNat(s(V1)) → a__U21(a__isNat(V1))
a__plus(N, 0) → a__U31(a__isNat(N), N)
a__plus(N, s(M)) → a__U41(a__isNat(M), M, N)
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(U12(X)) → a__U12(mark(X))
mark(isNat(X)) → a__isNat(X)
mark(U21(X)) → a__U21(mark(X))
mark(U31(X1, X2)) → a__U31(mark(X1), X2)
mark(U41(X1, X2, X3)) → a__U41(mark(X1), X2, X3)
mark(U42(X1, X2, X3)) → a__U42(mark(X1), X2, X3)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(0) → 0
a__U11(X1, X2) → U11(X1, X2)
a__U12(X) → U12(X)
a__isNat(X) → isNat(X)
a__U21(X) → U21(X)
a__U31(X1, X2) → U31(X1, X2)
a__U41(X1, X2, X3) → U41(X1, X2, X3)
a__U42(X1, X2, X3) → U42(X1, X2, X3)
a__plus(X1, X2) → plus(X1, X2)

(7) Obligation:

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

a__U11(tt, V2) → a__U12(a__isNat(V2))
a__U12(tt) → tt
a__U21(tt) → tt
a__U31(tt, N) → mark(N)
a__U41(tt, M, N) → a__U42(a__isNat(N), M, N)
a__U42(tt, M, N) → s(a__plus(mark(N), mark(M)))
a__isNat(0) → tt
a__isNat(plus(V1, V2)) → a__U11(a__isNat(V1), V2)
a__isNat(s(V1)) → a__U21(a__isNat(V1))
a__plus(N, 0) → a__U31(a__isNat(N), N)
a__plus(N, s(M)) → a__U41(a__isNat(M), M, N)
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(U12(X)) → a__U12(mark(X))
mark(isNat(X)) → a__isNat(X)
mark(U21(X)) → a__U21(mark(X))
mark(U31(X1, X2)) → a__U31(mark(X1), X2)
mark(U41(X1, X2, X3)) → a__U41(mark(X1), X2, X3)
mark(U42(X1, X2, X3)) → a__U42(mark(X1), X2, X3)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(0) → 0
a__U11(X1, X2) → U11(X1, X2)
a__U12(X) → U12(X)
a__isNat(X) → isNat(X)
a__U21(X) → U21(X)
a__U31(X1, X2) → U31(X1, X2)
a__U41(X1, X2, X3) → U41(X1, X2, X3)
a__U42(X1, X2, X3) → U42(X1, X2, X3)
a__plus(X1, X2) → plus(X1, X2)

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

(8) PisEmptyProof (EQUIVALENT transformation)

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

(9) TRUE

(10) Obligation:

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

MARK(U11(X1, X2)) → MARK(X1)
MARK(U12(X)) → MARK(X)
MARK(U21(X)) → MARK(X)
MARK(U31(X1, X2)) → A__U31(mark(X1), X2)
A__U31(tt, N) → MARK(N)
MARK(U31(X1, X2)) → MARK(X1)
MARK(U41(X1, X2, X3)) → A__U41(mark(X1), X2, X3)
A__U41(tt, M, N) → A__U42(a__isNat(N), M, N)
A__U42(tt, M, N) → A__PLUS(mark(N), mark(M))
A__PLUS(N, 0) → A__U31(a__isNat(N), N)
A__PLUS(N, s(M)) → A__U41(a__isNat(M), M, N)
A__U42(tt, M, N) → MARK(N)
MARK(U41(X1, X2, X3)) → MARK(X1)
MARK(U42(X1, X2, X3)) → A__U42(mark(X1), X2, X3)
A__U42(tt, M, N) → MARK(M)
MARK(U42(X1, X2, X3)) → MARK(X1)
MARK(plus(X1, X2)) → A__PLUS(mark(X1), mark(X2))
MARK(plus(X1, X2)) → MARK(X1)
MARK(plus(X1, X2)) → MARK(X2)
MARK(s(X)) → MARK(X)

The TRS R consists of the following rules:

a__U11(tt, V2) → a__U12(a__isNat(V2))
a__U12(tt) → tt
a__U21(tt) → tt
a__U31(tt, N) → mark(N)
a__U41(tt, M, N) → a__U42(a__isNat(N), M, N)
a__U42(tt, M, N) → s(a__plus(mark(N), mark(M)))
a__isNat(0) → tt
a__isNat(plus(V1, V2)) → a__U11(a__isNat(V1), V2)
a__isNat(s(V1)) → a__U21(a__isNat(V1))
a__plus(N, 0) → a__U31(a__isNat(N), N)
a__plus(N, s(M)) → a__U41(a__isNat(M), M, N)
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(U12(X)) → a__U12(mark(X))
mark(isNat(X)) → a__isNat(X)
mark(U21(X)) → a__U21(mark(X))
mark(U31(X1, X2)) → a__U31(mark(X1), X2)
mark(U41(X1, X2, X3)) → a__U41(mark(X1), X2, X3)
mark(U42(X1, X2, X3)) → a__U42(mark(X1), X2, X3)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(0) → 0
a__U11(X1, X2) → U11(X1, X2)
a__U12(X) → U12(X)
a__isNat(X) → isNat(X)
a__U21(X) → U21(X)
a__U31(X1, X2) → U31(X1, X2)
a__U41(X1, X2, X3) → U41(X1, X2, X3)
a__U42(X1, X2, X3) → U42(X1, X2, X3)
a__plus(X1, X2) → plus(X1, X2)

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

(11) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(U31(X1, X2)) → A__U31(mark(X1), X2)
A__U31(tt, N) → MARK(N)
MARK(U31(X1, X2)) → MARK(X1)
MARK(U41(X1, X2, X3)) → A__U41(mark(X1), X2, X3)
A__U41(tt, M, N) → A__U42(a__isNat(N), M, N)
A__PLUS(N, 0) → A__U31(a__isNat(N), N)
A__PLUS(N, s(M)) → A__U41(a__isNat(M), M, N)
A__U42(tt, M, N) → MARK(N)
MARK(U41(X1, X2, X3)) → MARK(X1)
MARK(U42(X1, X2, X3)) → A__U42(mark(X1), X2, X3)
A__U42(tt, M, N) → MARK(M)
MARK(U42(X1, X2, X3)) → MARK(X1)
MARK(plus(X1, X2)) → A__PLUS(mark(X1), mark(X2))
MARK(plus(X1, X2)) → MARK(X1)
MARK(plus(X1, X2)) → MARK(X2)
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) = MARK(x1)
U11(x1, x2) = x1
U12(x1) = x1
U21(x1) = x1
U31(x1, x2) = U31(x1, x2)
A__U31(x1, x2) = A__U31(x1, x2)
mark(x1) = x1
tt = tt
U41(x1, x2, x3) = U41(x1, x2, x3)
A__U41(x1, x2, x3) = A__U41(x1, x2, x3)
A__U42(x1, x2, x3) = A__U42(x2, x3)
a__isNat(x1) = a__isNat
A__PLUS(x1, x2) = A__PLUS(x1, x2)
0 = 0
s(x1) = s(x1)
U42(x1, x2, x3) = U42(x1, x2, x3)
plus(x1, x2) = plus(x1, x2)
a__U11(x1, x2) = x1
a__U12(x1) = x1
a__U21(x1) = x1
a__U31(x1, x2) = a__U31(x1, x2)
a__U41(x1, x2, x3) = a__U41(x1, x2, x3)
a__U42(x1, x2, x3) = a__U42(x1, x2, x3)
a__plus(x1, x2) = a__plus(x1, x2)
isNat(x1) = isNat

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

0 > [U31₂, A_{_U31₂}, tt, U41₃, A_{_U41₃}, A_{_U42₂}, a_{_isNat}, A_{_PLUS₂}, U42₃, plus₂, a_{_U31₂}, a_{_U41₃}, a_{_U42₃}, a_{_plus₂}, isNat] > MARK₁
0 > [U31₂, A_{_U31₂}, tt, U41₃, A_{_U41₃}, A_{_U42₂}, a_{_isNat}, A_{_PLUS₂}, U42₃, plus₂, a_{_U31₂}, a_{_U41₃}, a_{_U42₃}, a_{_plus₂}, isNat] > s₁

Status:

MARK₁: [1]
U31₂: [1,2]
A_{_U31₂}: [1,2]
tt: multiset
U41₃: [2,3,1]
A_{_U41₃}: [2,3,1]
A_{_U42₂}: [1,2]
a_{_isNat}: []
A_{_PLUS₂}: [2,1]
0: multiset
s₁: [1]
U42₃: [2,3,1]
plus₂: [2,1]
a_{_U31₂}: [1,2]
a_{_U41₃}: [2,3,1]
a_{_U42₃}: [2,3,1]
a_{_plus₂}: [2,1]
isNat: []

The following usable rules [FROCOS05] were oriented:

a__U11(tt, V2) → a__U12(a__isNat(V2))
a__U12(tt) → tt
a__U21(tt) → tt
a__U31(tt, N) → mark(N)
a__U41(tt, M, N) → a__U42(a__isNat(N), M, N)
a__U42(tt, M, N) → s(a__plus(mark(N), mark(M)))
a__isNat(0) → tt
a__isNat(plus(V1, V2)) → a__U11(a__isNat(V1), V2)
a__isNat(s(V1)) → a__U21(a__isNat(V1))
a__plus(N, 0) → a__U31(a__isNat(N), N)
a__plus(N, s(M)) → a__U41(a__isNat(M), M, N)
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(U12(X)) → a__U12(mark(X))
mark(isNat(X)) → a__isNat(X)
mark(U21(X)) → a__U21(mark(X))
mark(U31(X1, X2)) → a__U31(mark(X1), X2)
mark(U41(X1, X2, X3)) → a__U41(mark(X1), X2, X3)
mark(U42(X1, X2, X3)) → a__U42(mark(X1), X2, X3)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(0) → 0
a__U11(X1, X2) → U11(X1, X2)
a__U12(X) → U12(X)
a__isNat(X) → isNat(X)
a__U21(X) → U21(X)
a__U31(X1, X2) → U31(X1, X2)
a__U41(X1, X2, X3) → U41(X1, X2, X3)
a__U42(X1, X2, X3) → U42(X1, X2, X3)
a__plus(X1, X2) → plus(X1, X2)

(12) Obligation:

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

MARK(U11(X1, X2)) → MARK(X1)
MARK(U12(X)) → MARK(X)
MARK(U21(X)) → MARK(X)
A__U42(tt, M, N) → A__PLUS(mark(N), mark(M))

The TRS R consists of the following rules:

a__U11(tt, V2) → a__U12(a__isNat(V2))
a__U12(tt) → tt
a__U21(tt) → tt
a__U31(tt, N) → mark(N)
a__U41(tt, M, N) → a__U42(a__isNat(N), M, N)
a__U42(tt, M, N) → s(a__plus(mark(N), mark(M)))
a__isNat(0) → tt
a__isNat(plus(V1, V2)) → a__U11(a__isNat(V1), V2)
a__isNat(s(V1)) → a__U21(a__isNat(V1))
a__plus(N, 0) → a__U31(a__isNat(N), N)
a__plus(N, s(M)) → a__U41(a__isNat(M), M, N)
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(U12(X)) → a__U12(mark(X))
mark(isNat(X)) → a__isNat(X)
mark(U21(X)) → a__U21(mark(X))
mark(U31(X1, X2)) → a__U31(mark(X1), X2)
mark(U41(X1, X2, X3)) → a__U41(mark(X1), X2, X3)
mark(U42(X1, X2, X3)) → a__U42(mark(X1), X2, X3)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(0) → 0
a__U11(X1, X2) → U11(X1, X2)
a__U12(X) → U12(X)
a__isNat(X) → isNat(X)
a__U21(X) → U21(X)
a__U31(X1, X2) → U31(X1, X2)
a__U41(X1, X2, X3) → U41(X1, X2, X3)
a__U42(X1, X2, X3) → U42(X1, X2, X3)
a__plus(X1, X2) → plus(X1, X2)

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

(13) DependencyGraphProof (EQUIVALENT transformation)

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

(14) Obligation:

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

MARK(U12(X)) → MARK(X)
MARK(U11(X1, X2)) → MARK(X1)
MARK(U21(X)) → MARK(X)

The TRS R consists of the following rules:

a__U11(tt, V2) → a__U12(a__isNat(V2))
a__U12(tt) → tt
a__U21(tt) → tt
a__U31(tt, N) → mark(N)
a__U41(tt, M, N) → a__U42(a__isNat(N), M, N)
a__U42(tt, M, N) → s(a__plus(mark(N), mark(M)))
a__isNat(0) → tt
a__isNat(plus(V1, V2)) → a__U11(a__isNat(V1), V2)
a__isNat(s(V1)) → a__U21(a__isNat(V1))
a__plus(N, 0) → a__U31(a__isNat(N), N)
a__plus(N, s(M)) → a__U41(a__isNat(M), M, N)
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(U12(X)) → a__U12(mark(X))
mark(isNat(X)) → a__isNat(X)
mark(U21(X)) → a__U21(mark(X))
mark(U31(X1, X2)) → a__U31(mark(X1), X2)
mark(U41(X1, X2, X3)) → a__U41(mark(X1), X2, X3)
mark(U42(X1, X2, X3)) → a__U42(mark(X1), X2, X3)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(0) → 0
a__U11(X1, X2) → U11(X1, X2)
a__U12(X) → U12(X)
a__isNat(X) → isNat(X)
a__U21(X) → U21(X)
a__U31(X1, X2) → U31(X1, X2)
a__U41(X1, X2, X3) → U41(X1, X2, X3)
a__U42(X1, X2, X3) → U42(X1, X2, X3)
a__plus(X1, X2) → plus(X1, X2)

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.

MARK(U12(X)) → MARK(X)
MARK(U11(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
U12(x1) = U12(x1)
U11(x1, x2) = U11(x1, x2)
U21(x1) = x1
a__U11(x1, x2) = a__U11(x1, x2)
tt = tt
a__U12(x1) = a__U12(x1)
a__isNat(x1) = a__isNat(x1)
a__U21(x1) = x1
a__U31(x1, x2) = a__U31(x2)
mark(x1) = x1
a__U41(x1, x2, x3) = a__U41(x2, x3)
a__U42(x1, x2, x3) = a__U42(x2, x3)
s(x1) = x1
a__plus(x1, x2) = a__plus(x1, x2)
0 = 0
plus(x1, x2) = plus(x1, x2)
isNat(x1) = isNat(x1)
U31(x1, x2) = U31(x2)
U41(x1, x2, x3) = U41(x2, x3)
U42(x1, x2, x3) = U42(x2, x3)

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

[a_{_U31₁}, a_{_U41₂}, a_{_U42₂}, a_{_plus₂}, plus₂, U31₁, U41₂, U42₂] > [U11₂, a_{_U11₂}, a_{_isNat₁}, isNat₁] > tt > [U12₁, a_{_U12₁}]
0 > [U12₁, a_{_U12₁}]

Status:

U12₁: multiset
U11₂: multiset
a_{_U11₂}: multiset
tt: multiset
a_{_U12₁}: multiset
a_{_isNat₁}: multiset
a_{_U31₁}: multiset
a_{_U41₂}: multiset
a_{_U42₂}: multiset
a_{_plus₂}: multiset
0: multiset
plus₂: multiset
isNat₁: multiset
U31₁: multiset
U41₂: multiset
U42₂: multiset

The following usable rules [FROCOS05] were oriented:

a__U11(tt, V2) → a__U12(a__isNat(V2))
a__U12(tt) → tt
a__U21(tt) → tt
a__U31(tt, N) → mark(N)
a__U41(tt, M, N) → a__U42(a__isNat(N), M, N)
a__U42(tt, M, N) → s(a__plus(mark(N), mark(M)))
a__isNat(0) → tt
a__isNat(plus(V1, V2)) → a__U11(a__isNat(V1), V2)
a__isNat(s(V1)) → a__U21(a__isNat(V1))
a__plus(N, 0) → a__U31(a__isNat(N), N)
a__plus(N, s(M)) → a__U41(a__isNat(M), M, N)
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(U12(X)) → a__U12(mark(X))
mark(isNat(X)) → a__isNat(X)
mark(U21(X)) → a__U21(mark(X))
mark(U31(X1, X2)) → a__U31(mark(X1), X2)
mark(U41(X1, X2, X3)) → a__U41(mark(X1), X2, X3)
mark(U42(X1, X2, X3)) → a__U42(mark(X1), X2, X3)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(0) → 0
a__U11(X1, X2) → U11(X1, X2)
a__U12(X) → U12(X)
a__isNat(X) → isNat(X)
a__U21(X) → U21(X)
a__U31(X1, X2) → U31(X1, X2)
a__U41(X1, X2, X3) → U41(X1, X2, X3)
a__U42(X1, X2, X3) → U42(X1, X2, X3)
a__plus(X1, X2) → plus(X1, X2)

(16) Obligation:

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

MARK(U21(X)) → MARK(X)

The TRS R consists of the following rules:

a__U11(tt, V2) → a__U12(a__isNat(V2))
a__U12(tt) → tt
a__U21(tt) → tt
a__U31(tt, N) → mark(N)
a__U41(tt, M, N) → a__U42(a__isNat(N), M, N)
a__U42(tt, M, N) → s(a__plus(mark(N), mark(M)))
a__isNat(0) → tt
a__isNat(plus(V1, V2)) → a__U11(a__isNat(V1), V2)
a__isNat(s(V1)) → a__U21(a__isNat(V1))
a__plus(N, 0) → a__U31(a__isNat(N), N)
a__plus(N, s(M)) → a__U41(a__isNat(M), M, N)
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(U12(X)) → a__U12(mark(X))
mark(isNat(X)) → a__isNat(X)
mark(U21(X)) → a__U21(mark(X))
mark(U31(X1, X2)) → a__U31(mark(X1), X2)
mark(U41(X1, X2, X3)) → a__U41(mark(X1), X2, X3)
mark(U42(X1, X2, X3)) → a__U42(mark(X1), X2, X3)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(0) → 0
a__U11(X1, X2) → U11(X1, X2)
a__U12(X) → U12(X)
a__isNat(X) → isNat(X)
a__U21(X) → U21(X)
a__U31(X1, X2) → U31(X1, X2)
a__U41(X1, X2, X3) → U41(X1, X2, X3)
a__U42(X1, X2, X3) → U42(X1, X2, X3)
a__plus(X1, X2) → plus(X1, X2)

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