Termination w.r.t. Q proof of /tmp/tmpQBBHFA/PEANO_nokinds

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 QDPOrderProof (⇔)

    ↳14 QDP

    ↳15 PisEmptyProof (⇔)

    ↳16 TRUE

  ↳17 QDP

    ↳18 QDPOrderProof (⇔)

    ↳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 PisEmptyProof (⇔)

    ↳39 TRUE

  ↳40 QDP

    ↳41 QDPOrderProof (⇔)

    ↳42 QDP

    ↳43 QDPOrderProof (⇔)

    ↳44 QDP

    ↳45 PisEmptyProof (⇔)

    ↳46 TRUE

  ↳47 QDP

    ↳48 QDPOrderProof (⇔)

    ↳49 QDP

    ↳50 QDPOrderProof (⇔)

    ↳51 QDP

    ↳52 QDPOrderProof (⇔)

    ↳53 QDP

    ↳54 PisEmptyProof (⇔)

    ↳55 TRUE

  ↳56 QDP

    ↳57 QDPOrderProof (⇔)

    ↳58 QDP

    ↳59 QDPOrderProof (⇔)

    ↳60 QDP

    ↳61 PisEmptyProof (⇔)

    ↳62 TRUE

  ↳63 QDP

(0) Obligation:

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

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(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(U21(tt, M, N)) → S(plus(N, M))
ACTIVE(U21(tt, M, N)) → PLUS(N, M)
ACTIVE(isNat(plus(V1, V2))) → AND(isNat(V1), isNat(V2))
ACTIVE(isNat(plus(V1, V2))) → ISNAT(V1)
ACTIVE(isNat(plus(V1, V2))) → ISNAT(V2)
ACTIVE(isNat(s(V1))) → ISNAT(V1)
ACTIVE(plus(N, 0)) → U11¹(isNat(N), N)
ACTIVE(plus(N, 0)) → ISNAT(N)
ACTIVE(plus(N, s(M))) → U21¹(and(isNat(M), isNat(N)), M, N)
ACTIVE(plus(N, s(M))) → AND(isNat(M), isNat(N))
ACTIVE(plus(N, s(M))) → ISNAT(M)
ACTIVE(plus(N, s(M))) → ISNAT(N)
ACTIVE(U11(X1, X2)) → U11¹(active(X1), X2)
ACTIVE(U11(X1, X2)) → ACTIVE(X1)
ACTIVE(U21(X1, X2, X3)) → U21¹(active(X1), X2, X3)
ACTIVE(U21(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(s(X)) → S(active(X))
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(plus(X1, X2)) → PLUS(active(X1), X2)
ACTIVE(plus(X1, X2)) → ACTIVE(X1)
ACTIVE(plus(X1, X2)) → PLUS(X1, active(X2))
ACTIVE(plus(X1, X2)) → ACTIVE(X2)
ACTIVE(and(X1, X2)) → AND(active(X1), X2)
ACTIVE(and(X1, X2)) → ACTIVE(X1)
U11¹(mark(X1), X2) → U11¹(X1, X2)
U21¹(mark(X1), X2, X3) → U21¹(X1, X2, X3)
S(mark(X)) → S(X)
PLUS(mark(X1), X2) → PLUS(X1, X2)
PLUS(X1, mark(X2)) → PLUS(X1, X2)
AND(mark(X1), X2) → AND(X1, X2)
PROPER(U11(X1, X2)) → U11¹(proper(X1), proper(X2))
PROPER(U11(X1, X2)) → PROPER(X1)
PROPER(U11(X1, X2)) → PROPER(X2)
PROPER(U21(X1, X2, X3)) → U21¹(proper(X1), proper(X2), proper(X3))
PROPER(U21(X1, X2, X3)) → PROPER(X1)
PROPER(U21(X1, X2, X3)) → PROPER(X2)
PROPER(U21(X1, X2, X3)) → PROPER(X3)
PROPER(s(X)) → S(proper(X))
PROPER(s(X)) → PROPER(X)
PROPER(plus(X1, X2)) → PLUS(proper(X1), proper(X2))
PROPER(plus(X1, X2)) → PROPER(X1)
PROPER(plus(X1, X2)) → PROPER(X2)
PROPER(and(X1, X2)) → AND(proper(X1), proper(X2))
PROPER(and(X1, X2)) → PROPER(X1)
PROPER(and(X1, X2)) → PROPER(X2)
PROPER(isNat(X)) → ISNAT(proper(X))
PROPER(isNat(X)) → PROPER(X)
U11¹(ok(X1), ok(X2)) → U11¹(X1, X2)
U21¹(ok(X1), ok(X2), ok(X3)) → U21¹(X1, X2, X3)
S(ok(X)) → S(X)
PLUS(ok(X1), ok(X2)) → PLUS(X1, X2)
AND(ok(X1), ok(X2)) → AND(X1, X2)
ISNAT(ok(X)) → ISNAT(X)
TOP(mark(X)) → TOP(proper(X))
TOP(mark(X)) → PROPER(X)
TOP(ok(X)) → TOP(active(X))
TOP(ok(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(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 9 SCCs with 26 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

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

ISNAT(ok(X)) → ISNAT(X)

The TRS R consists of the following rules:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(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.

ISNAT(ok(X)) → ISNAT(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ISNAT(x1) = x1
ok(x1) = ok(x1)
active(x1) = x1
U11(x1, x2) = U11(x2)
tt = tt
mark(x1) = x1
U21(x1, x2, x3) = U21(x2, x3)
s(x1) = x1
plus(x1, x2) = plus(x1, x2)
and(x1, x2) = and(x2)
isNat(x1) = x1
0 = 0
proper(x1) = proper(x1)
top(x1) = top

Recursive Path Order [RPO].
Precedence:

proper₁ > [U21₂, plus₂] > [ok₁, U11₁, tt, and₁, top]
proper₁ > 0 > [ok₁, U11₁, tt, and₁, top]

The following usable rules [FROCOS05] were oriented:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(7) Obligation:

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

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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:

AND(ok(X1), ok(X2)) → AND(X1, X2)
AND(mark(X1), X2) → AND(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(11) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

AND(ok(X1), ok(X2)) → AND(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
AND(x1, x2) = AND(x2)
ok(x1) = ok(x1)
mark(x1) = mark
active(x1) = active(x1)
U11(x1, x2) = U11(x2)
tt = tt
U21(x1, x2, x3) = x3
s(x1) = x1
plus(x1, x2) = x1
and(x1, x2) = and(x2)
isNat(x1) = isNat(x1)
0 = 0
proper(x1) = proper(x1)
top(x1) = top

Recursive Path Order [RPO].
Precedence:

0 > tt > [AND₁, ok₁, mark, active₁, U11₁, and₁, isNat₁, proper₁, top]

The following usable rules [FROCOS05] were oriented:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(12) Obligation:

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

AND(mark(X1), X2) → AND(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(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.

AND(mark(X1), X2) → AND(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
AND(x1, x2) = x1
mark(x1) = mark(x1)
active(x1) = active(x1)
U11(x1, x2) = U11(x1, x2)
tt = tt
U21(x1, x2, x3) = U21(x1, x2, x3)
s(x1) = s(x1)
plus(x1, x2) = plus(x1, x2)
and(x1, x2) = and(x1, x2)
isNat(x1) = isNat(x1)
0 = 0
proper(x1) = x1
ok(x1) = ok
top(x1) = top

Recursive Path Order [RPO].
Precedence:

active₁ > plus₂ > U11₂ > [mark₁, tt, isNat₁, ok, top]
active₁ > plus₂ > U21₃ > s₁ > [mark₁, tt, isNat₁, ok, top]
active₁ > plus₂ > and₂ > [mark₁, tt, isNat₁, ok, top]
0 > U11₂ > [mark₁, tt, isNat₁, ok, top]

The following usable rules [FROCOS05] were oriented:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(14) Obligation:

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

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(15) PisEmptyProof (EQUIVALENT transformation)

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

(16) TRUE

(17) 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(ok(X1), ok(X2)) → PLUS(X1, X2)

The TRS R consists of the following rules:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(18) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PLUS(ok(X1), ok(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) = PLUS(x1, x2)
mark(x1) = x1
ok(x1) = ok(x1)
active(x1) = active(x1)
U11(x1, x2) = U11(x2)
tt = tt
U21(x1, x2, x3) = U21(x2, x3)
s(x1) = x1
plus(x1, x2) = plus(x1, x2)
and(x1, x2) = x2
isNat(x1) = isNat(x1)
0 = 0
proper(x1) = proper(x1)
top(x1) = top

Recursive Path Order [RPO].
Precedence:

0 > tt > [active₁, plus₂] > U21₂ > [ok₁, U11₁] > [PLUS₂, top]
0 > [isNat₁, proper₁] > [active₁, plus₂] > U21₂ > [ok₁, U11₁] > [PLUS₂, top]

The following usable rules [FROCOS05] were oriented:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(19) 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)

The TRS R consists of the following rules:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(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.

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) = PLUS(x2)
mark(x1) = mark(x1)
active(x1) = active(x1)
U11(x1, x2) = U11(x1, x2)
tt = tt
U21(x1, x2, x3) = U21(x1, x2, x3)
s(x1) = s(x1)
plus(x1, x2) = plus(x1, x2)
and(x1, x2) = and(x1, x2)
isNat(x1) = isNat
0 = 0
proper(x1) = x1
ok(x1) = ok
top(x1) = top

Recursive Path Order [RPO].
Precedence:

0 > [active₁, U11₂, tt, U21₃, s₁, plus₂] > and₂ > [PLUS₁, mark₁, isNat, ok, top]

The following usable rules [FROCOS05] were oriented:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(21) 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, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(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.

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)
active(x1) = active(x1)
U11(x1, x2) = U11(x1, x2)
tt = tt
U21(x1, x2, x3) = U21(x1, x2, x3)
s(x1) = s(x1)
plus(x1, x2) = plus(x1, x2)
and(x1, x2) = and(x1, x2)
isNat(x1) = isNat(x1)
0 = 0
proper(x1) = x1
ok(x1) = ok
top(x1) = top

Recursive Path Order [RPO].
Precedence:

active₁ > plus₂ > U11₂ > [mark₁, tt, isNat₁, ok, top]
active₁ > plus₂ > U21₃ > s₁ > [mark₁, tt, isNat₁, ok, top]
active₁ > plus₂ > and₂ > [mark₁, tt, isNat₁, ok, top]
0 > U11₂ > [mark₁, tt, isNat₁, ok, top]

The following usable rules [FROCOS05] were oriented:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(23) Obligation:

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

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(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:

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

The TRS R consists of the following rules:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(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.

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
ok(x1) = x1
mark(x1) = mark(x1)
active(x1) = active(x1)
U11(x1, x2) = U11(x1, x2)
tt = tt
U21(x1, x2, x3) = U21(x1, x2, x3)
s(x1) = s(x1)
plus(x1, x2) = plus(x1, x2)
and(x1, x2) = and(x1, x2)
isNat(x1) = isNat
0 = 0
proper(x1) = x1
top(x1) = top

Recursive Path Order [RPO].
Precedence:

0 > [active₁, U11₂, tt, U21₃, plus₂] > s₁ > [mark₁, isNat, top]
0 > [active₁, U11₂, tt, U21₃, plus₂] > and₂ > [mark₁, isNat, top]

The following usable rules [FROCOS05] were oriented:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(28) Obligation:

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

S(ok(X)) → S(X)

The TRS R consists of the following rules:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(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.

S(ok(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
ok(x1) = ok(x1)
active(x1) = x1
U11(x1, x2) = U11(x2)
tt = tt
mark(x1) = x1
U21(x1, x2, x3) = U21(x2, x3)
s(x1) = x1
plus(x1, x2) = plus(x1, x2)
and(x1, x2) = and(x2)
isNat(x1) = x1
0 = 0
proper(x1) = proper(x1)
top(x1) = top

Recursive Path Order [RPO].
Precedence:

proper₁ > [U21₂, plus₂] > [ok₁, U11₁, tt, and₁, top]
proper₁ > 0 > [ok₁, U11₁, tt, and₁, top]

The following usable rules [FROCOS05] were oriented:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(30) Obligation:

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

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(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:

U21¹(ok(X1), ok(X2), ok(X3)) → U21¹(X1, X2, X3)
U21¹(mark(X1), X2, X3) → U21¹(X1, X2, X3)

The TRS R consists of the following rules:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(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.

U21¹(ok(X1), ok(X2), ok(X3)) → U21¹(X1, X2, X3)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U21¹(x1, x2, x3) = x3
ok(x1) = ok(x1)
mark(x1) = mark
active(x1) = active(x1)
U11(x1, x2) = U11(x2)
tt = tt
U21(x1, x2, x3) = x3
s(x1) = x1
plus(x1, x2) = x1
and(x1, x2) = and(x2)
isNat(x1) = isNat(x1)
0 = 0
proper(x1) = proper(x1)
top(x1) = top

Recursive Path Order [RPO].
Precedence:

0 > tt > [ok₁, mark, active₁, U11₁, and₁, isNat₁, proper₁, top]

The following usable rules [FROCOS05] were oriented:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(35) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(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.

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

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U21¹(x1, x2, x3) = x1
mark(x1) = mark(x1)
active(x1) = active(x1)
U11(x1, x2) = U11(x1, x2)
tt = tt
U21(x1, x2, x3) = U21(x1, x2, x3)
s(x1) = x1
plus(x1, x2) = plus(x1, x2)
and(x1, x2) = and(x1, x2)
isNat(x1) = isNat(x1)
0 = 0
proper(x1) = x1
ok(x1) = ok
top(x1) = top

Recursive Path Order [RPO].
Precedence:

0 > [active₁, isNat₁] > U11₂ > [mark₁, tt, ok, top]
0 > [active₁, isNat₁] > [U21₃, plus₂] > [mark₁, tt, ok, top]
0 > [active₁, isNat₁] > and₂ > [mark₁, tt, ok, top]

The following usable rules [FROCOS05] were oriented:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(37) Obligation:

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

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(38) PisEmptyProof (EQUIVALENT transformation)

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

(39) TRUE

(40) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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¹(ok(X1), ok(X2)) → U11¹(X1, X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U11¹(x1, x2) = U11¹(x2)
ok(x1) = ok(x1)
mark(x1) = mark
active(x1) = active(x1)
U11(x1, x2) = U11(x2)
tt = tt
U21(x1, x2, x3) = x3
s(x1) = x1
plus(x1, x2) = x1
and(x1, x2) = and(x2)
isNat(x1) = isNat(x1)
0 = 0
proper(x1) = proper(x1)
top(x1) = top

Recursive Path Order [RPO].
Precedence:

0 > tt > [U11^1₁, ok₁, mark, active₁, U11₁, and₁, isNat₁, proper₁, top]

The following usable rules [FROCOS05] were oriented:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(42) Obligation:

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

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

The TRS R consists of the following rules:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(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.

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

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
U11¹(x1, x2) = x1
mark(x1) = mark(x1)
active(x1) = active(x1)
U11(x1, x2) = U11(x1, x2)
tt = tt
U21(x1, x2, x3) = U21(x1, x2, x3)
s(x1) = s(x1)
plus(x1, x2) = plus(x1, x2)
and(x1, x2) = and(x1, x2)
isNat(x1) = isNat(x1)
0 = 0
proper(x1) = x1
ok(x1) = ok
top(x1) = top

Recursive Path Order [RPO].
Precedence:

active₁ > plus₂ > U11₂ > [mark₁, tt, isNat₁, ok, top]
active₁ > plus₂ > U21₃ > s₁ > [mark₁, tt, isNat₁, ok, top]
active₁ > plus₂ > and₂ > [mark₁, tt, isNat₁, ok, top]
0 > U11₂ > [mark₁, tt, isNat₁, ok, top]

The following usable rules [FROCOS05] were oriented:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(44) Obligation:

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

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(45) PisEmptyProof (EQUIVALENT transformation)

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

(46) TRUE

(47) Obligation:

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

PROPER(U11(X1, X2)) → PROPER(X2)
PROPER(U11(X1, X2)) → PROPER(X1)
PROPER(U21(X1, X2, X3)) → PROPER(X1)
PROPER(U21(X1, X2, X3)) → PROPER(X2)
PROPER(U21(X1, X2, X3)) → PROPER(X3)
PROPER(s(X)) → PROPER(X)
PROPER(plus(X1, X2)) → PROPER(X1)
PROPER(plus(X1, X2)) → PROPER(X2)
PROPER(and(X1, X2)) → PROPER(X1)
PROPER(and(X1, X2)) → PROPER(X2)
PROPER(isNat(X)) → PROPER(X)

The TRS R consists of the following rules:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(48) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(U11(X1, X2)) → PROPER(X2)
PROPER(U11(X1, X2)) → PROPER(X1)
PROPER(U21(X1, X2, X3)) → PROPER(X1)
PROPER(U21(X1, X2, X3)) → PROPER(X2)
PROPER(U21(X1, X2, X3)) → PROPER(X3)
PROPER(plus(X1, X2)) → PROPER(X1)
PROPER(plus(X1, X2)) → PROPER(X2)
PROPER(and(X1, X2)) → PROPER(X1)
PROPER(and(X1, X2)) → PROPER(X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
PROPER(x1) = PROPER(x1)
U11(x1, x2) = U11(x1, x2)
U21(x1, x2, x3) = U21(x1, x2, x3)
s(x1) = x1
plus(x1, x2) = plus(x1, x2)
and(x1, x2) = and(x1, x2)
isNat(x1) = x1
active(x1) = x1
tt = tt
mark(x1) = mark
0 = 0
proper(x1) = x1
ok(x1) = ok
top(x1) = top

Recursive Path Order [RPO].
Precedence:

0 > tt > plus₂ > [PROPER₁, U11₂, U21₃, and₂, mark, ok, top]

The following usable rules [FROCOS05] were oriented:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(49) Obligation:

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

PROPER(s(X)) → PROPER(X)
PROPER(isNat(X)) → PROPER(X)

The TRS R consists of the following rules:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(50) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(isNat(X)) → PROPER(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
PROPER(x1) = x1
s(x1) = x1
isNat(x1) = isNat(x1)
active(x1) = active(x1)
U11(x1, x2) = U11
tt = tt
mark(x1) = mark
U21(x1, x2, x3) = x3
plus(x1, x2) = plus
and(x1, x2) = and
0 = 0
proper(x1) = proper(x1)
ok(x1) = ok
top(x1) = top

Recursive Path Order [RPO].
Precedence:

0 > tt > plus > [isNat₁, active₁, U11, mark, and, proper₁, ok, top]

The following usable rules [FROCOS05] were oriented:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(51) Obligation:

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

PROPER(s(X)) → PROPER(X)

The TRS R consists of the following rules:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(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.

PROPER(s(X)) → PROPER(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
PROPER(x1) = x1
s(x1) = s(x1)
active(x1) = active(x1)
U11(x1, x2) = U11(x2)
tt = tt
mark(x1) = x1
U21(x1, x2, x3) = U21(x3)
plus(x1, x2) = x1
and(x1, x2) = and(x2)
isNat(x1) = isNat
0 = 0
proper(x1) = x1
ok(x1) = ok
top(x1) = top

Recursive Path Order [RPO].
Precedence:

active₁ > [s₁, U11₁, U21₁, and₁, ok, top]
isNat > [tt, 0] > [s₁, U11₁, U21₁, and₁, ok, top]

The following usable rules [FROCOS05] were oriented:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(53) Obligation:

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

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(54) PisEmptyProof (EQUIVALENT transformation)

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

(55) TRUE

(56) Obligation:

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

ACTIVE(U21(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U11(X1, X2)) → ACTIVE(X1)
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(plus(X1, X2)) → ACTIVE(X1)
ACTIVE(plus(X1, X2)) → ACTIVE(X2)
ACTIVE(and(X1, X2)) → ACTIVE(X1)

The TRS R consists of the following rules:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(57) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U21(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U11(X1, X2)) → ACTIVE(X1)
ACTIVE(plus(X1, X2)) → ACTIVE(X1)
ACTIVE(plus(X1, X2)) → ACTIVE(X2)
ACTIVE(and(X1, X2)) → ACTIVE(X1)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ACTIVE(x1) = ACTIVE(x1)
U21(x1, x2, x3) = U21(x1, x2, x3)
U11(x1, x2) = U11(x1, x2)
s(x1) = x1
plus(x1, x2) = plus(x1, x2)
and(x1, x2) = and(x1, x2)
active(x1) = x1
tt = tt
mark(x1) = mark
isNat(x1) = isNat(x1)
0 = 0
proper(x1) = x1
ok(x1) = ok
top(x1) = top

Recursive Path Order [RPO].
Precedence:

0 > tt > plus₂ > [ACTIVE₁, U21₃, U11₂, and₂, mark, isNat₁, ok, top]

The following usable rules [FROCOS05] were oriented:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(58) Obligation:

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

ACTIVE(s(X)) → ACTIVE(X)

The TRS R consists of the following rules:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(59) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(s(X)) → ACTIVE(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ACTIVE(x1) = x1
s(x1) = s(x1)
active(x1) = active(x1)
U11(x1, x2) = U11(x2)
tt = tt
mark(x1) = x1
U21(x1, x2, x3) = U21(x3)
plus(x1, x2) = x1
and(x1, x2) = and(x2)
isNat(x1) = isNat
0 = 0
proper(x1) = x1
ok(x1) = ok
top(x1) = top

Recursive Path Order [RPO].
Precedence:

active₁ > [s₁, U11₁, U21₁, and₁, ok, top]
isNat > [tt, 0] > [s₁, U11₁, U21₁, and₁, ok, top]

The following usable rules [FROCOS05] were oriented:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

(60) Obligation:

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

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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

(61) PisEmptyProof (EQUIVALENT transformation)

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

(62) TRUE

(63) Obligation:

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

TOP(ok(X)) → TOP(active(X))
TOP(mark(X)) → TOP(proper(X))

The TRS R consists of the following rules:

active(U11(tt, N)) → mark(N)
active(U21(tt, M, N)) → mark(s(plus(N, M)))
active(and(tt, X)) → mark(X)
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(isNat(s(V1))) → mark(isNat(V1))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U21(X1, X2, X3)) → U21(active(X1), X2, X3)
active(s(X)) → s(active(X))
active(plus(X1, X2)) → plus(active(X1), X2)
active(plus(X1, X2)) → plus(X1, active(X2))
active(and(X1, X2)) → and(active(X1), X2)
U11(mark(X1), X2) → mark(U11(X1, X2))
U21(mark(X1), X2, X3) → mark(U21(X1, X2, X3))
s(mark(X)) → mark(s(X))
plus(mark(X1), X2) → mark(plus(X1, X2))
plus(X1, mark(X2)) → mark(plus(X1, X2))
and(mark(X1), X2) → mark(and(X1, X2))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U21(X1, X2, X3)) → U21(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U21(ok(X1), ok(X2), ok(X3)) → ok(U21(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
and(ok(X1), ok(X2)) → ok(and(X1, X2))
isNat(ok(X)) → ok(isNat(X))
top(mark(X)) → top(proper(X))
top(ok(X)) → top(active(X))

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