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

    ↳23 TRUE

  ↳24 QDP

    ↳25 QDPOrderProof (⇔)

    ↳26 QDP

    ↳27 QDPOrderProof (⇔)

    ↳28 QDP

    ↳29 PisEmptyProof (⇔)

    ↳30 TRUE

  ↳31 QDP

    ↳32 QDPOrderProof (⇔)

    ↳33 QDP

    ↳34 QDPOrderProof (⇔)

    ↳35 QDP

    ↳36 PisEmptyProof (⇔)

    ↳37 TRUE

  ↳38 QDP

    ↳39 QDPOrderProof (⇔)

    ↳40 QDP

    ↳41 QDPOrderProof (⇔)

    ↳42 QDP

    ↳43 PisEmptyProof (⇔)

    ↳44 TRUE

  ↳45 QDP

    ↳46 QDPOrderProof (⇔)

    ↳47 QDP

    ↳48 QDPOrderProof (⇔)

    ↳49 QDP

    ↳50 PisEmptyProof (⇔)

    ↳51 TRUE

  ↳52 QDP

    ↳53 QDPOrderProof (⇔)

    ↳54 QDP

    ↳55 QDPOrderProof (⇔)

    ↳56 QDP

    ↳57 PisEmptyProof (⇔)

    ↳58 TRUE

  ↳59 QDP

    ↳60 QDPOrderProof (⇔)

    ↳61 QDP

    ↳62 QDPOrderProof (⇔)

    ↳63 QDP

    ↳64 PisEmptyProof (⇔)

    ↳65 TRUE

  ↳66 QDP

    ↳67 QDPOrderProof (⇔)

    ↳68 QDP

    ↳69 PisEmptyProof (⇔)

    ↳70 TRUE

  ↳71 QDP

    ↳72 QDPOrderProof (⇔)

    ↳73 QDP

    ↳74 QDPOrderProof (⇔)

    ↳75 QDP

    ↳76 PisEmptyProof (⇔)

    ↳77 TRUE

  ↳78 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(U31(tt)) → mark(0)
active(U41(tt, M, N)) → mark(plus(x(N, M), N))
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(isNat(x(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(x(N, 0)) → mark(U31(isNat(N)))
active(x(N, s(M))) → mark(U41(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(U31(X)) → U31(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(x(X1, X2)) → x(active(X1), X2)
active(x(X1, X2)) → x(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))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
x(mark(X1), X2) → mark(x(X1, X2))
x(X1, mark(X2)) → mark(x(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(U31(X)) → U31(proper(X))
proper(0) → ok(0)
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(x(X1, X2)) → x(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
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))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
x(ok(X1), ok(X2)) → ok(x(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(U41(tt, M, N)) → PLUS(x(N, M), N)
ACTIVE(U41(tt, M, N)) → X(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(isNat(x(V1, V2))) → AND(isNat(V1), isNat(V2))
ACTIVE(isNat(x(V1, V2))) → ISNAT(V1)
ACTIVE(isNat(x(V1, V2))) → ISNAT(V2)
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(x(N, 0)) → U31¹(isNat(N))
ACTIVE(x(N, 0)) → ISNAT(N)
ACTIVE(x(N, s(M))) → U41¹(and(isNat(M), isNat(N)), M, N)
ACTIVE(x(N, s(M))) → AND(isNat(M), isNat(N))
ACTIVE(x(N, s(M))) → ISNAT(M)
ACTIVE(x(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(U31(X)) → U31¹(active(X))
ACTIVE(U31(X)) → ACTIVE(X)
ACTIVE(U41(X1, X2, X3)) → U41¹(active(X1), X2, X3)
ACTIVE(U41(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(x(X1, X2)) → X(active(X1), X2)
ACTIVE(x(X1, X2)) → ACTIVE(X1)
ACTIVE(x(X1, X2)) → X(X1, active(X2))
ACTIVE(x(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)
U31¹(mark(X)) → U31¹(X)
U41¹(mark(X1), X2, X3) → U41¹(X1, X2, X3)
X(mark(X1), X2) → X(X1, X2)
X(X1, mark(X2)) → X(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(U31(X)) → U31¹(proper(X))
PROPER(U31(X)) → PROPER(X)
PROPER(U41(X1, X2, X3)) → U41¹(proper(X1), proper(X2), proper(X3))
PROPER(U41(X1, X2, X3)) → PROPER(X1)
PROPER(U41(X1, X2, X3)) → PROPER(X2)
PROPER(U41(X1, X2, X3)) → PROPER(X3)
PROPER(x(X1, X2)) → X(proper(X1), proper(X2))
PROPER(x(X1, X2)) → PROPER(X1)
PROPER(x(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)
U31¹(ok(X)) → U31¹(X)
U41¹(ok(X1), ok(X2), ok(X3)) → U41¹(X1, X2, X3)
X(ok(X1), ok(X2)) → X(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(U31(tt)) → mark(0)
active(U41(tt, M, N)) → mark(plus(x(N, M), N))
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(isNat(x(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(x(N, 0)) → mark(U31(isNat(N)))
active(x(N, s(M))) → mark(U41(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(U31(X)) → U31(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(x(X1, X2)) → x(active(X1), X2)
active(x(X1, X2)) → x(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))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
x(mark(X1), X2) → mark(x(X1, X2))
x(X1, mark(X2)) → mark(x(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(U31(X)) → U31(proper(X))
proper(0) → ok(0)
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(x(X1, X2)) → x(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
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))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
x(ok(X1), ok(X2)) → ok(x(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 12 SCCs with 44 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(U31(tt)) → mark(0)
active(U41(tt, M, N)) → mark(plus(x(N, M), N))
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(isNat(x(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(x(N, 0)) → mark(U31(isNat(N)))
active(x(N, s(M))) → mark(U41(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(U31(X)) → U31(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(x(X1, X2)) → x(active(X1), X2)
active(x(X1, X2)) → x(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))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
x(mark(X1), X2) → mark(x(X1, X2))
x(X1, mark(X2)) → mark(x(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(U31(X)) → U31(proper(X))
proper(0) → ok(0)
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(x(X1, X2)) → x(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
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))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
x(ok(X1), ok(X2)) → ok(x(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)

Recursive Path Order [RPO].
Precedence:

trivial

The following usable rules [FROCOS05] were oriented: none

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

Recursive Path Order [RPO].
Precedence:

[AND₁, ok₁, mark₁]

The following usable rules [FROCOS05] were oriented: none

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

Recursive Path Order [RPO].
Precedence:

trivial

The following usable rules [FROCOS05] were oriented: none

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

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

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

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

Recursive Path Order [RPO].
Precedence:

[X₁, mark₁, ok₁]

The following usable rules [FROCOS05] were oriented: none

(19) Obligation:

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

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

X(mark(X1), X2) → X(X1, X2)

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

Recursive Path Order [RPO].
Precedence:

trivial

The following usable rules [FROCOS05] were oriented: none

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

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

(23) TRUE

(24) Obligation:

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

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

(25) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

Recursive Path Order [RPO].
Precedence:

[U41^1₁, ok₁, mark₁]

The following usable rules [FROCOS05] were oriented: none

(26) Obligation:

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

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

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

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

Recursive Path Order [RPO].
Precedence:

trivial

The following usable rules [FROCOS05] were oriented: none

(28) 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(U31(tt)) → mark(0)
active(U41(tt, M, N)) → mark(plus(x(N, M), N))
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(isNat(x(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(x(N, 0)) → mark(U31(isNat(N)))
active(x(N, s(M))) → mark(U41(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(U31(X)) → U31(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(x(X1, X2)) → x(active(X1), X2)
active(x(X1, X2)) → x(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))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
x(mark(X1), X2) → mark(x(X1, X2))
x(X1, mark(X2)) → mark(x(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(U31(X)) → U31(proper(X))
proper(0) → ok(0)
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(x(X1, X2)) → x(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
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))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
x(ok(X1), ok(X2)) → ok(x(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) PisEmptyProof (EQUIVALENT transformation)

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

(30) TRUE

(31) Obligation:

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

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

(32) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U31¹(ok(X)) → U31¹(X)

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

Recursive Path Order [RPO].
Precedence:

trivial

The following usable rules [FROCOS05] were oriented: none

(33) Obligation:

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

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

U31¹(mark(X)) → U31¹(X)

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

Recursive Path Order [RPO].
Precedence:

trivial

The following usable rules [FROCOS05] were oriented: none

(35) Obligation:

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

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

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

(37) TRUE

(38) Obligation:

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

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

(39) 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)
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(x2)
mark(x1) = mark(x1)
ok(x1) = ok(x1)

Recursive Path Order [RPO].
Precedence:

[PLUS₁, mark₁, ok₁]

The following usable rules [FROCOS05] were oriented: none

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

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

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

Recursive Path Order [RPO].
Precedence:

trivial

The following usable rules [FROCOS05] were oriented: none

(42) 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(U31(tt)) → mark(0)
active(U41(tt, M, N)) → mark(plus(x(N, M), N))
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(isNat(x(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(x(N, 0)) → mark(U31(isNat(N)))
active(x(N, s(M))) → mark(U41(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(U31(X)) → U31(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(x(X1, X2)) → x(active(X1), X2)
active(x(X1, X2)) → x(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))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
x(mark(X1), X2) → mark(x(X1, X2))
x(X1, mark(X2)) → mark(x(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(U31(X)) → U31(proper(X))
proper(0) → ok(0)
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(x(X1, X2)) → x(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
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))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
x(ok(X1), ok(X2)) → ok(x(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) PisEmptyProof (EQUIVALENT transformation)

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

(44) TRUE

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

(46) 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)
mark(x1) = x1

Recursive Path Order [RPO].
Precedence:

trivial

The following usable rules [FROCOS05] were oriented: none

(47) Obligation:

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

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

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

Recursive Path Order [RPO].
Precedence:

trivial

The following usable rules [FROCOS05] were oriented: none

(49) 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(U31(tt)) → mark(0)
active(U41(tt, M, N)) → mark(plus(x(N, M), N))
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(isNat(x(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(x(N, 0)) → mark(U31(isNat(N)))
active(x(N, s(M))) → mark(U41(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(U31(X)) → U31(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(x(X1, X2)) → x(active(X1), X2)
active(x(X1, X2)) → x(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))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
x(mark(X1), X2) → mark(x(X1, X2))
x(X1, mark(X2)) → mark(x(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(U31(X)) → U31(proper(X))
proper(0) → ok(0)
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(x(X1, X2)) → x(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
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))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
x(ok(X1), ok(X2)) → ok(x(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) PisEmptyProof (EQUIVALENT transformation)

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

(51) TRUE

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

(53) 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) = U21¹(x3)
ok(x1) = ok(x1)
mark(x1) = mark(x1)

Recursive Path Order [RPO].
Precedence:

[U21^1₁, ok₁, mark₁]

The following usable rules [FROCOS05] were oriented: none

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

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

Recursive Path Order [RPO].
Precedence:

trivial

The following usable rules [FROCOS05] were oriented: none

(56) 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(U31(tt)) → mark(0)
active(U41(tt, M, N)) → mark(plus(x(N, M), N))
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(isNat(x(V1, V2))) → mark(and(isNat(V1), isNat(V2)))
active(plus(N, 0)) → mark(U11(isNat(N), N))
active(plus(N, s(M))) → mark(U21(and(isNat(M), isNat(N)), M, N))
active(x(N, 0)) → mark(U31(isNat(N)))
active(x(N, s(M))) → mark(U41(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(U31(X)) → U31(active(X))
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(x(X1, X2)) → x(active(X1), X2)
active(x(X1, X2)) → x(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))
U31(mark(X)) → mark(U31(X))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
x(mark(X1), X2) → mark(x(X1, X2))
x(X1, mark(X2)) → mark(x(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(U31(X)) → U31(proper(X))
proper(0) → ok(0)
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(x(X1, X2)) → x(proper(X1), proper(X2))
proper(and(X1, X2)) → and(proper(X1), proper(X2))
proper(isNat(X)) → isNat(proper(X))
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))
U31(ok(X)) → ok(U31(X))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
x(ok(X1), ok(X2)) → ok(x(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) PisEmptyProof (EQUIVALENT transformation)

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

(58) TRUE

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

(60) 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(x1)

Recursive Path Order [RPO].
Precedence:

[U11^1₁, ok₁, mark₁]

The following usable rules [FROCOS05] were oriented: none

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

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

Recursive Path Order [RPO].
Precedence:

trivial

The following usable rules [FROCOS05] were oriented: none

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

(64) PisEmptyProof (EQUIVALENT transformation)

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

(65) TRUE

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

(67) 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(s(X)) → PROPER(X)
PROPER(plus(X1, X2)) → PROPER(X1)
PROPER(plus(X1, X2)) → PROPER(X2)
PROPER(U31(X)) → PROPER(X)
PROPER(U41(X1, X2, X3)) → PROPER(X1)
PROPER(U41(X1, X2, X3)) → PROPER(X2)
PROPER(U41(X1, X2, X3)) → PROPER(X3)
PROPER(x(X1, X2)) → PROPER(X1)
PROPER(x(X1, X2)) → PROPER(X2)
PROPER(and(X1, X2)) → PROPER(X1)
PROPER(and(X1, X2)) → PROPER(X2)
PROPER(isNat(X)) → PROPER(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Recursive Path Order [RPO].
Precedence:

U11₂ > [PROPER₁, U31₁, and₂]
U21₃ > [PROPER₁, U31₁, and₂]
s₁ > [PROPER₁, U31₁, and₂]
plus₂ > [PROPER₁, U31₁, and₂]
U41₃ > [PROPER₁, U31₁, and₂]
x₂ > [PROPER₁, U31₁, and₂]
isNat₁ > [PROPER₁, U31₁, and₂]

The following usable rules [FROCOS05] were oriented: none

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

(69) PisEmptyProof (EQUIVALENT transformation)

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

(70) TRUE

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

(72) 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(s(X)) → ACTIVE(X)
ACTIVE(plus(X1, X2)) → ACTIVE(X1)
ACTIVE(plus(X1, X2)) → ACTIVE(X2)
ACTIVE(U31(X)) → ACTIVE(X)
ACTIVE(x(X1, X2)) → ACTIVE(X1)
ACTIVE(x(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)
U11(x1, x2) = U11(x1)
s(x1) = s(x1)
plus(x1, x2) = plus(x1, x2)
U31(x1) = U31(x1)
U41(x1, x2, x3) = x1
x(x1, x2) = x(x1, x2)
and(x1, x2) = and(x1)

Recursive Path Order [RPO].
Precedence:

U21₁ > [ACTIVE₁, U11₁, plus₂]
s₁ > [ACTIVE₁, U11₁, plus₂]
U31₁ > [ACTIVE₁, U11₁, plus₂]
x₂ > [ACTIVE₁, U11₁, plus₂]
and₁ > [ACTIVE₁, U11₁, plus₂]

The following usable rules [FROCOS05] were oriented: none

(73) Obligation:

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

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

(74) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U41(X1, X2, X3)) → ACTIVE(X1)

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

Recursive Path Order [RPO].
Precedence:

trivial

The following usable rules [FROCOS05] were oriented: none

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

(76) PisEmptyProof (EQUIVALENT transformation)

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

(77) TRUE

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