Termination w.r.t. Q proof of /tmp/tmp7rzYDZ/PEANO_nokinds_noand

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

0 QTRS

↳1 DependencyPairsProof (⇔)

↳2 QDP

↳3 DependencyGraphProof (⇔)

↳4 AND

  ↳5 QDP

    ↳6 QDPOrderProof (⇔)

    ↳7 QDP

    ↳8 PisEmptyProof (⇔)

    ↳9 TRUE

  ↳10 QDP

    ↳11 QDPOrderProof (⇔)

    ↳12 QDP

    ↳13 QDPOrderProof (⇔)

    ↳14 QDP

    ↳15 QDPOrderProof (⇔)

    ↳16 QDP

    ↳17 PisEmptyProof (⇔)

    ↳18 TRUE

  ↳19 QDP

    ↳20 QDPOrderProof (⇔)

    ↳21 QDP

    ↳22 QDPOrderProof (⇔)

    ↳23 QDP

    ↳24 PisEmptyProof (⇔)

    ↳25 TRUE

  ↳26 QDP

    ↳27 QDPOrderProof (⇔)

    ↳28 QDP

    ↳29 QDPOrderProof (⇔)

    ↳30 QDP

    ↳31 PisEmptyProof (⇔)

    ↳32 TRUE

  ↳33 QDP

    ↳34 QDPOrderProof (⇔)

    ↳35 QDP

    ↳36 QDPOrderProof (⇔)

    ↳37 QDP

    ↳38 PisEmptyProof (⇔)

    ↳39 TRUE

  ↳40 QDP

    ↳41 QDPOrderProof (⇔)

    ↳42 QDP

    ↳43 QDPOrderProof (⇔)

    ↳44 QDP

    ↳45 PisEmptyProof (⇔)

    ↳46 TRUE

  ↳47 QDP

    ↳48 QDPOrderProof (⇔)

    ↳49 QDP

    ↳50 QDPOrderProof (⇔)

    ↳51 QDP

    ↳52 PisEmptyProof (⇔)

    ↳53 TRUE

  ↳54 QDP

    ↳55 QDPOrderProof (⇔)

    ↳56 QDP

    ↳57 QDPOrderProof (⇔)

    ↳58 QDP

    ↳59 PisEmptyProof (⇔)

    ↳60 TRUE

  ↳61 QDP

    ↳62 QDPOrderProof (⇔)

    ↳63 QDP

    ↳64 QDPOrderProof (⇔)

    ↳65 QDP

    ↳66 PisEmptyProof (⇔)

    ↳67 TRUE

  ↳68 QDP

    ↳69 QDPOrderProof (⇔)

    ↳70 QDP

    ↳71 QDPOrderProof (⇔)

    ↳72 QDP

    ↳73 QDPOrderProof (⇔)

    ↳74 QDP

    ↳75 QDPOrderProof (⇔)

    ↳76 QDP

    ↳77 PisEmptyProof (⇔)

    ↳78 TRUE

  ↳79 QDP

    ↳80 QDPOrderProof (⇔)

    ↳81 QDP

    ↳82 QDPOrderProof (⇔)

    ↳83 QDP

    ↳84 QDPOrderProof (⇔)

    ↳85 QDP

    ↳86 QDPOrderProof (⇔)

    ↳87 QDP

    ↳88 PisEmptyProof (⇔)

    ↳89 TRUE

  ↳90 QDP

(0) Obligation:

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

active(U11(tt, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X)) → U12(active(X))
active(U21(X)) → U21(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(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))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X)) → mark(U12(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(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))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X)) → U12(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U21(X)) → U21(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X)) → ok(U12(X))
isNat(ok(X)) → ok(isNat(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
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(U11(tt, V2)) → U12¹(isNat(V2))
ACTIVE(U11(tt, V2)) → ISNAT(V2)
ACTIVE(U41(tt, M, N)) → U42¹(isNat(N), M, N)
ACTIVE(U41(tt, M, N)) → ISNAT(N)
ACTIVE(U42(tt, M, N)) → S(plus(N, M))
ACTIVE(U42(tt, M, N)) → PLUS(N, M)
ACTIVE(isNat(plus(V1, V2))) → U11¹(isNat(V1), V2)
ACTIVE(isNat(plus(V1, V2))) → ISNAT(V1)
ACTIVE(isNat(s(V1))) → U21¹(isNat(V1))
ACTIVE(isNat(s(V1))) → ISNAT(V1)
ACTIVE(plus(N, 0)) → U31¹(isNat(N), N)
ACTIVE(plus(N, 0)) → ISNAT(N)
ACTIVE(plus(N, s(M))) → U41¹(isNat(M), M, N)
ACTIVE(plus(N, s(M))) → ISNAT(M)
ACTIVE(U11(X1, X2)) → U11¹(active(X1), X2)
ACTIVE(U11(X1, X2)) → ACTIVE(X1)
ACTIVE(U12(X)) → U12¹(active(X))
ACTIVE(U12(X)) → ACTIVE(X)
ACTIVE(U21(X)) → U21¹(active(X))
ACTIVE(U21(X)) → ACTIVE(X)
ACTIVE(U31(X1, X2)) → U31¹(active(X1), X2)
ACTIVE(U31(X1, X2)) → ACTIVE(X1)
ACTIVE(U41(X1, X2, X3)) → U41¹(active(X1), X2, X3)
ACTIVE(U41(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U42(X1, X2, X3)) → U42¹(active(X1), X2, X3)
ACTIVE(U42(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)
U11¹(mark(X1), X2) → U11¹(X1, X2)
U12¹(mark(X)) → U12¹(X)
U21¹(mark(X)) → U21¹(X)
U31¹(mark(X1), X2) → U31¹(X1, X2)
U41¹(mark(X1), X2, X3) → U41¹(X1, X2, X3)
U42¹(mark(X1), X2, X3) → U42¹(X1, X2, X3)
S(mark(X)) → S(X)
PLUS(mark(X1), X2) → PLUS(X1, X2)
PLUS(X1, mark(X2)) → PLUS(X1, X2)
PROPER(U11(X1, X2)) → U11¹(proper(X1), proper(X2))
PROPER(U11(X1, X2)) → PROPER(X1)
PROPER(U11(X1, X2)) → PROPER(X2)
PROPER(U12(X)) → U12¹(proper(X))
PROPER(U12(X)) → PROPER(X)
PROPER(isNat(X)) → ISNAT(proper(X))
PROPER(isNat(X)) → PROPER(X)
PROPER(U21(X)) → U21¹(proper(X))
PROPER(U21(X)) → PROPER(X)
PROPER(U31(X1, X2)) → U31¹(proper(X1), proper(X2))
PROPER(U31(X1, X2)) → PROPER(X1)
PROPER(U31(X1, X2)) → PROPER(X2)
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(U42(X1, X2, X3)) → U42¹(proper(X1), proper(X2), proper(X3))
PROPER(U42(X1, X2, X3)) → PROPER(X1)
PROPER(U42(X1, X2, X3)) → PROPER(X2)
PROPER(U42(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)
U11¹(ok(X1), ok(X2)) → U11¹(X1, X2)
U12¹(ok(X)) → U12¹(X)
ISNAT(ok(X)) → ISNAT(X)
U21¹(ok(X)) → U21¹(X)
U31¹(ok(X1), ok(X2)) → U31¹(X1, X2)
U41¹(ok(X1), ok(X2), ok(X3)) → U41¹(X1, X2, X3)
U42¹(ok(X1), ok(X2), ok(X3)) → U42¹(X1, X2, X3)
S(ok(X)) → S(X)
PLUS(ok(X1), ok(X2)) → PLUS(X1, X2)
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, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X)) → U12(active(X))
active(U21(X)) → U21(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(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))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X)) → mark(U12(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(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))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X)) → U12(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U21(X)) → U21(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X)) → ok(U12(X))
isNat(ok(X)) → ok(isNat(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
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 34 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, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X)) → U12(active(X))
active(U21(X)) → U21(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(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))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X)) → mark(U12(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(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))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X)) → U12(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U21(X)) → U21(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X)) → ok(U12(X))
isNat(ok(X)) → ok(isNat(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
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) = ISNAT(x1)
ok(x1) = ok(x1)
active(x1) = active(x1)
U11(x1, x2) = U11(x2)
tt = tt
mark(x1) = x1
U12(x1) = U12(x1)
isNat(x1) = x1
U21(x1) = x1
U31(x1, x2) = x2
U41(x1, x2, x3) = U41(x1, x2, x3)
U42(x1, x2, x3) = U42(x2, x3)
s(x1) = s(x1)
plus(x1, x2) = plus(x1, x2)
0 = 0
proper(x1) = proper(x1)
top(x1) = top

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

active₁ > [U12₁, U41₃, U42₂, plus₂, proper₁] > [tt, s₁, 0] > [ok₁, U11₁]

Status:

ISNAT₁: [1]
ok₁: [1]
active₁: [1]
U11₁: [1]
tt: []
U12₁: [1]
U41₃: [2,1,3]
U42₂: [1,2]
s₁: [1]
plus₂: [2,1]
0: []
proper₁: [1]
top: []

The following usable rules [FROCOS05] were oriented:

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

(7) Obligation:

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

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

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

PLUS(ok(X1), ok(X2)) → PLUS(X1, X2)

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

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

PLUS₁ > [ok₁, U11₁, tt, isNat₁, s₁, 0]
[proper₁, top] > [active₁, U12₁, plus₂] > U21₁ > [ok₁, U11₁, tt, isNat₁, s₁, 0]
[proper₁, top] > [active₁, U12₁, plus₂] > U41₃ > U42₂ > [ok₁, U11₁, tt, isNat₁, s₁, 0]

Status:

PLUS₁: [1]
ok₁: [1]
active₁: [1]
U11₁: [1]
tt: []
U12₁: [1]
isNat₁: [1]
U21₁: [1]
U41₃: [2,1,3]
U42₂: [2,1]
s₁: [1]
plus₂: [1,2]
0: []
proper₁: [1]
top: []

The following usable rules [FROCOS05] were oriented:

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

(12) Obligation:

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

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

The TRS R consists of the following rules:

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

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

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

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

[active₁, plus₂] > U11₁ > [tt, isNat, U31₂, 0] > [U42₃, s₁] > mark₁
[active₁, plus₂] > U41₃ > [U42₃, s₁] > mark₁
top > mark₁

Status:

mark₁: [1]
active₁: [1]
U11₁: [1]
tt: []
isNat: []
U31₂: [1,2]
U41₃: [3,1,2]
U42₃: [2,1,3]
s₁: [1]
plus₂: [1,2]
0: []
top: []

The following usable rules [FROCOS05] were oriented:

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

(14) 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, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X)) → U12(active(X))
active(U21(X)) → U21(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(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))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X)) → mark(U12(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(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))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X)) → U12(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U21(X)) → U21(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X)) → ok(U12(X))
isNat(ok(X)) → ok(isNat(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
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) 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) = PLUS(x1, x2)
mark(x1) = mark(x1)
active(x1) = active(x1)
U11(x1, x2) = U11(x1)
tt = tt
U12(x1) = U12(x1)
isNat(x1) = isNat
U21(x1) = U21(x1)
U31(x1, x2) = U31(x1, x2)
U41(x1, x2, x3) = U41(x1, x2, x3)
U42(x1, x2, x3) = U42(x1, x2, x3)
s(x1) = s(x1)
plus(x1, x2) = plus(x1, x2)
0 = 0
proper(x1) = x1
ok(x1) = x1
top(x1) = top

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

0 > [active₁, U12₁, U31₂, U41₃, U42₃, plus₂, top] > [PLUS₂, mark₁, U11₁, U21₁, s₁] > [tt, isNat]

Status:

PLUS₂: [1,2]
mark₁: [1]
active₁: [1]
U11₁: [1]
tt: []
U12₁: [1]
isNat: []
U21₁: [1]
U31₂: [1,2]
U41₃: [3,1,2]
U42₃: [1,2,3]
s₁: [1]
plus₂: [1,2]
0: []
top: []

The following usable rules [FROCOS05] were oriented:

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

(16) Obligation:

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

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

(17) PisEmptyProof (EQUIVALENT transformation)

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

(18) TRUE

(19) Obligation:

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

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

The TRS R consists of the following rules:

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

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

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

[active₁, s₁, proper₁, top] > [tt, U41₃, U42₃, plus₂] > [S₁, ok₁, U12₁, isNat₁, U21₁, U31₁]
[active₁, s₁, proper₁, top] > 0

Status:

S₁: [1]
ok₁: [1]
active₁: [1]
tt: []
U12₁: [1]
isNat₁: [1]
U21₁: [1]
U31₁: [1]
U41₃: [2,1,3]
U42₃: [3,2,1]
s₁: [1]
plus₂: [1,2]
0: []
proper₁: [1]
top: []

The following usable rules [FROCOS05] were oriented:

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

(21) Obligation:

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

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

The TRS R consists of the following rules:

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

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

(22) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

0 > [U11₁, isNat, U31₂, U41₃, U42₃, plus₂, proper₁] > [mark₁, U12₁] > tt
top > active₁ > [U11₁, isNat, U31₂, U41₃, U42₃, plus₂, proper₁] > [mark₁, U12₁] > tt

Status:

S₁: [1]
mark₁: [1]
active₁: [1]
U11₁: [1]
tt: []
U12₁: [1]
isNat: []
U31₂: [2,1]
U41₃: [2,1,3]
U42₃: [1,2,3]
plus₂: [2,1]
0: []
proper₁: [1]
top: []

The following usable rules [FROCOS05] were oriented:

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

(23) Obligation:

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

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

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

(24) PisEmptyProof (EQUIVALENT transformation)

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

(25) TRUE

(26) Obligation:

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

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

The TRS R consists of the following rules:

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

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

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

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

U42^1₁ > [tt, isNat]
active₁ > [U31₂, U41₃, U42₃, plus₂] > [mark₁, U11₁, U12₁, U21₁] > top > [tt, isNat]
0 > [tt, isNat]

Status:

U42^1₁: [1]
mark₁: [1]
active₁: [1]
U11₁: [1]
tt: []
U12₁: [1]
isNat: []
U21₁: [1]
U31₂: [1,2]
U41₃: [1,2,3]
U42₃: [3,2,1]
plus₂: [1,2]
0: []
top: []

The following usable rules [FROCOS05] were oriented:

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

(28) Obligation:

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

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

The TRS R consists of the following rules:

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

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

(29) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

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

top > [active₁, tt, U21₁, U41₂, U42₂, plus₂, proper₁] > [ok₁, isNat₁, U31₁, 0]

Status:

ok₁: [1]
active₁: [1]
tt: []
isNat₁: [1]
U21₁: [1]
U31₁: [1]
U41₂: [1,2]
U42₂: [1,2]
plus₂: [2,1]
0: []
proper₁: [1]
top: []

The following usable rules [FROCOS05] were oriented:

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

(30) Obligation:

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

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

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

(31) PisEmptyProof (EQUIVALENT transformation)

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

(32) TRUE

(33) Obligation:

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

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

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

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

U41^1₁ > top
[active₁, U11₂, U12₁] > U31₂ > [mark₁, U21₁] > tt > top
[active₁, U11₂, U12₁] > U41₃ > [U42₃, plus₂] > [mark₁, U21₁] > tt > top
[active₁, U11₂, U12₁] > s₁ > [mark₁, U21₁] > tt > top
0 > [mark₁, U21₁] > tt > top

Status:

U41^1₁: [1]
mark₁: [1]
active₁: [1]
U11₂: [2,1]
tt: []
U12₁: [1]
U21₁: [1]
U31₂: [1,2]
U41₃: [1,3,2]
U42₃: [2,3,1]
s₁: [1]
plus₂: [1,2]
0: []
top: []

The following usable rules [FROCOS05] were oriented:

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

(35) Obligation:

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

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

The TRS R consists of the following rules:

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

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

(36) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

[active₁, U11₂, U12₁, U31₂, plus₂, 0, proper₁, top] > U41₃ > [tt, U42₃] > [ok₁, isNat₁] > mark₁

Status:

ok₁: [1]
active₁: [1]
U11₂: [2,1]
tt: []
mark₁: [1]
U12₁: [1]
isNat₁: [1]
U31₂: [1,2]
U41₃: [1,3,2]
U42₃: [1,2,3]
plus₂: [1,2]
0: []
proper₁: [1]
top: []

The following usable rules [FROCOS05] were oriented:

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

(37) Obligation:

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

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

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

(38) PisEmptyProof (EQUIVALENT transformation)

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

(39) TRUE

(40) Obligation:

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

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

The TRS R consists of the following rules:

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

U31¹(ok(X1), ok(X2)) → U31¹(X1, X2)

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

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

[active₁, U41₂, U42₂, plus₂, proper₁] > U11₂ > U12₁ > [ok₁, isNat₁] > tt
[active₁, U41₂, U42₂, plus₂, proper₁] > U31₂ > [ok₁, isNat₁] > tt
[active₁, U41₂, U42₂, plus₂, proper₁] > s₁ > [ok₁, isNat₁] > tt
[active₁, U41₂, U42₂, plus₂, proper₁] > 0

Status:

ok₁: [1]
active₁: [1]
U11₂: [1,2]
tt: []
U12₁: [1]
isNat₁: [1]
U31₂: [2,1]
U41₂: [1,2]
U42₂: [2,1]
s₁: [1]
plus₂: [1,2]
0: []
proper₁: [1]
top: []

The following usable rules [FROCOS05] were oriented:

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

(42) Obligation:

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

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

The TRS R consists of the following rules:

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

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

(43) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

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

0 > [active₁, U31₂, U41₃, U42₃, s₁, plus₂, top] > [U31^1₂, mark₁, U11₁, U12₁, U21₁] > tt > isNat

Status:

U31^1₂: [1,2]
mark₁: [1]
active₁: [1]
U11₁: [1]
tt: []
U12₁: [1]
isNat: []
U21₁: [1]
U31₂: [1,2]
U41₃: [3,1,2]
U42₃: [2,3,1]
s₁: [1]
plus₂: [2,1]
0: []
top: []

The following usable rules [FROCOS05] were oriented:

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

(44) Obligation:

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

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

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

(45) PisEmptyProof (EQUIVALENT transformation)

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

(46) TRUE

(47) Obligation:

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

U21¹(ok(X)) → U21¹(X)
U21¹(mark(X)) → U21¹(X)

The TRS R consists of the following rules:

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

U21¹(ok(X)) → U21¹(X)

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

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

[active₁, s₁, proper₁, top] > [tt, U41₃, U42₃, plus₂] > [U21^1₁, ok₁, U12₁, isNat₁, U21₁, U31₁]
[active₁, s₁, proper₁, top] > 0

Status:

U21^1₁: [1]
ok₁: [1]
active₁: [1]
tt: []
U12₁: [1]
isNat₁: [1]
U21₁: [1]
U31₁: [1]
U41₃: [2,1,3]
U42₃: [3,2,1]
s₁: [1]
plus₂: [1,2]
0: []
proper₁: [1]
top: []

The following usable rules [FROCOS05] were oriented:

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

(49) Obligation:

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

U21¹(mark(X)) → U21¹(X)

The TRS R consists of the following rules:

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

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

(50) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U21¹(mark(X)) → U21¹(X)

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

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

0 > [U11₁, isNat, U31₂, U41₃, U42₃, plus₂, proper₁] > [mark₁, U12₁] > tt
top > active₁ > [U11₁, isNat, U31₂, U41₃, U42₃, plus₂, proper₁] > [mark₁, U12₁] > tt

Status:

U21^1₁: [1]
mark₁: [1]
active₁: [1]
U11₁: [1]
tt: []
U12₁: [1]
isNat: []
U31₂: [2,1]
U41₃: [2,1,3]
U42₃: [1,2,3]
plus₂: [2,1]
0: []
proper₁: [1]
top: []

The following usable rules [FROCOS05] were oriented:

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

(51) Obligation:

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

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

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

(52) PisEmptyProof (EQUIVALENT transformation)

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

(53) TRUE

(54) Obligation:

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

U12¹(ok(X)) → U12¹(X)
U12¹(mark(X)) → U12¹(X)

The TRS R consists of the following rules:

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

U12¹(ok(X)) → U12¹(X)

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

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

[active₁, s₁, proper₁, top] > [tt, U41₃, U42₃, plus₂] > [U12^1₁, ok₁, U12₁, isNat₁, U21₁, U31₁]
[active₁, s₁, proper₁, top] > 0

Status:

U12^1₁: [1]
ok₁: [1]
active₁: [1]
tt: []
U12₁: [1]
isNat₁: [1]
U21₁: [1]
U31₁: [1]
U41₃: [2,1,3]
U42₃: [3,2,1]
s₁: [1]
plus₂: [1,2]
0: []
proper₁: [1]
top: []

The following usable rules [FROCOS05] were oriented:

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

(56) Obligation:

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

U12¹(mark(X)) → U12¹(X)

The TRS R consists of the following rules:

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

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

(57) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

U12¹(mark(X)) → U12¹(X)

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

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

0 > [U11₁, isNat, U31₂, U41₃, U42₃, plus₂, proper₁] > [mark₁, U12₁] > tt
top > active₁ > [U11₁, isNat, U31₂, U41₃, U42₃, plus₂, proper₁] > [mark₁, U12₁] > tt

Status:

U12^1₁: [1]
mark₁: [1]
active₁: [1]
U11₁: [1]
tt: []
U12₁: [1]
isNat: []
U31₂: [2,1]
U41₃: [2,1,3]
U42₃: [1,2,3]
plus₂: [2,1]
0: []
proper₁: [1]
top: []

The following usable rules [FROCOS05] were oriented:

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

(58) Obligation:

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

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

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

(59) PisEmptyProof (EQUIVALENT transformation)

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

(60) TRUE

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

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

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

[active₁, U11₂, U12₁, proper₁] > U31₂ > [U11^1₁, ok₁, mark, tt, s₁, plus₁, 0]
[active₁, U11₂, U12₁, proper₁] > U41₁ > isNat₁ > [U11^1₁, ok₁, mark, tt, s₁, plus₁, 0]
[active₁, U11₂, U12₁, proper₁] > U41₁ > U42₃ > [U11^1₁, ok₁, mark, tt, s₁, plus₁, 0]
top > [U11^1₁, ok₁, mark, tt, s₁, plus₁, 0]

Status:

U11^1₁: [1]
ok₁: [1]
mark: []
active₁: [1]
U11₂: [2,1]
tt: []
U12₁: [1]
isNat₁: [1]
U31₂: [1,2]
U41₁: [1]
U42₃: [3,1,2]
s₁: [1]
plus₁: [1]
0: []
proper₁: [1]
top: []

The following usable rules [FROCOS05] were oriented:

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

(63) 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, V2)) → mark(U12(isNat(V2)))
active(U12(tt)) → mark(tt)
active(U21(tt)) → mark(tt)
active(U31(tt, N)) → mark(N)
active(U41(tt, M, N)) → mark(U42(isNat(N), M, N))
active(U42(tt, M, N)) → mark(s(plus(N, M)))
active(isNat(0)) → mark(tt)
active(isNat(plus(V1, V2))) → mark(U11(isNat(V1), V2))
active(isNat(s(V1))) → mark(U21(isNat(V1)))
active(plus(N, 0)) → mark(U31(isNat(N), N))
active(plus(N, s(M))) → mark(U41(isNat(M), M, N))
active(U11(X1, X2)) → U11(active(X1), X2)
active(U12(X)) → U12(active(X))
active(U21(X)) → U21(active(X))
active(U31(X1, X2)) → U31(active(X1), X2)
active(U41(X1, X2, X3)) → U41(active(X1), X2, X3)
active(U42(X1, X2, X3)) → U42(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))
U11(mark(X1), X2) → mark(U11(X1, X2))
U12(mark(X)) → mark(U12(X))
U21(mark(X)) → mark(U21(X))
U31(mark(X1), X2) → mark(U31(X1, X2))
U41(mark(X1), X2, X3) → mark(U41(X1, X2, X3))
U42(mark(X1), X2, X3) → mark(U42(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))
proper(U11(X1, X2)) → U11(proper(X1), proper(X2))
proper(tt) → ok(tt)
proper(U12(X)) → U12(proper(X))
proper(isNat(X)) → isNat(proper(X))
proper(U21(X)) → U21(proper(X))
proper(U31(X1, X2)) → U31(proper(X1), proper(X2))
proper(U41(X1, X2, X3)) → U41(proper(X1), proper(X2), proper(X3))
proper(U42(X1, X2, X3)) → U42(proper(X1), proper(X2), proper(X3))
proper(s(X)) → s(proper(X))
proper(plus(X1, X2)) → plus(proper(X1), proper(X2))
proper(0) → ok(0)
U11(ok(X1), ok(X2)) → ok(U11(X1, X2))
U12(ok(X)) → ok(U12(X))
isNat(ok(X)) → ok(isNat(X))
U21(ok(X)) → ok(U21(X))
U31(ok(X1), ok(X2)) → ok(U31(X1, X2))
U41(ok(X1), ok(X2), ok(X3)) → ok(U41(X1, X2, X3))
U42(ok(X1), ok(X2), ok(X3)) → ok(U42(X1, X2, X3))
s(ok(X)) → ok(s(X))
plus(ok(X1), ok(X2)) → ok(plus(X1, X2))
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) 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) = U11¹(x1, x2)
mark(x1) = mark(x1)
active(x1) = active(x1)
U11(x1, x2) = U11(x1)
tt = tt
U12(x1) = U12(x1)
isNat(x1) = isNat
U21(x1) = U21(x1)
U31(x1, x2) = U31(x1, x2)
U41(x1, x2, x3) = U41(x1, x2, x3)
U42(x1, x2, x3) = U42(x1, x2, x3)
s(x1) = s(x1)
plus(x1, x2) = plus(x1, x2)
0 = 0
proper(x1) = x1
ok(x1) = x1
top(x1) = top

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

0 > [active₁, U12₁, U31₂, U41₃, U42₃, plus₂, top] > [U11^1₂, mark₁, U11₁, U21₁, s₁] > [tt, isNat]

Status:

U11^1₂: [1,2]
mark₁: [1]
active₁: [1]
U11₁: [1]
tt: []
U12₁: [1]
isNat: []
U21₁: [1]
U31₂: [1,2]
U41₃: [3,1,2]
U42₃: [1,2,3]
s₁: [1]
plus₂: [1,2]
0: []
top: []

The following usable rules [FROCOS05] were oriented:

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

(65) Obligation:

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

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

(66) PisEmptyProof (EQUIVALENT transformation)

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

(67) TRUE

(68) 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(U12(X)) → PROPER(X)
PROPER(isNat(X)) → PROPER(X)
PROPER(U21(X)) → PROPER(X)
PROPER(U31(X1, X2)) → PROPER(X1)
PROPER(U31(X1, X2)) → PROPER(X2)
PROPER(U41(X1, X2, X3)) → PROPER(X1)
PROPER(U41(X1, X2, X3)) → PROPER(X2)
PROPER(U41(X1, X2, X3)) → PROPER(X3)
PROPER(U42(X1, X2, X3)) → PROPER(X1)
PROPER(U42(X1, X2, X3)) → PROPER(X2)
PROPER(U42(X1, X2, X3)) → PROPER(X3)
PROPER(s(X)) → PROPER(X)
PROPER(plus(X1, X2)) → PROPER(X1)
PROPER(plus(X1, X2)) → PROPER(X2)

The TRS R consists of the following rules:

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

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

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

[proper₁, top] > [U31₂, U41₃, active₁] > [tt, 0] > plus₂
[proper₁, top] > [U31₂, U41₃, active₁] > mark > U11₂ > plus₂
[proper₁, top] > [U31₂, U41₃, active₁] > mark > U42₃ > plus₂

Status:

U11₂: [1,2]
U31₂: [2,1]
U41₃: [1,3,2]
U42₃: [2,1,3]
plus₂: [1,2]
active₁: [1]
tt: []
mark: []
0: []
proper₁: [1]
top: []

The following usable rules [FROCOS05] were oriented:

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

(70) Obligation:

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

PROPER(U12(X)) → PROPER(X)
PROPER(isNat(X)) → PROPER(X)
PROPER(U21(X)) → PROPER(X)
PROPER(s(X)) → PROPER(X)

The TRS R consists of the following rules:

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

(71) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

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

[s₁, 0, proper₁] > [PROPER₁, isNat₁] > [tt, mark, U31, U42]
top > [tt, mark, U31, U42]

Status:

PROPER₁: [1]
isNat₁: [1]
s₁: [1]
tt: []
mark: []
U31: []
U42: []
0: []
proper₁: [1]
top: []

The following usable rules [FROCOS05] were oriented:

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

(72) Obligation:

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

PROPER(U12(X)) → PROPER(X)
PROPER(U21(X)) → PROPER(X)

The TRS R consists of the following rules:

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

(73) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(U12(X)) → PROPER(X)

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

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

PROPER₁ > [tt, U42₁]
[U12₁, active₁] > [U11₁, isNat, s] > [tt, U42₁]
0 > [U11₁, isNat, s] > [tt, U42₁]
top > [tt, U42₁]

Status:

PROPER₁: [1]
U12₁: [1]
active₁: [1]
U11₁: [1]
tt: []
isNat: []
U42₁: [1]
s: []
0: []
top: []

The following usable rules [FROCOS05] were oriented:

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

(74) Obligation:

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

PROPER(U21(X)) → PROPER(X)

The TRS R consists of the following rules:

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

(75) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

PROPER(U21(X)) → PROPER(X)

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

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

PROPER₁ > [U21₁, s₁]
U31₂ > [U11, tt, mark, U12] > [U21₁, s₁]
U42₃ > [isNat, plus₂] > [U11, tt, mark, U12] > [U21₁, s₁]
0 > [U21₁, s₁]
top > [U21₁, s₁]

Status:

PROPER₁: [1]
U21₁: [1]
U11: []
tt: []
mark: []
U12: []
isNat: []
U31₂: [2,1]
U42₃: [1,2,3]
s₁: [1]
plus₂: [2,1]
0: []
top: []

The following usable rules [FROCOS05] were oriented:

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

(76) Obligation:

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

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

(77) PisEmptyProof (EQUIVALENT transformation)

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

(78) TRUE

(79) Obligation:

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

ACTIVE(U12(X)) → ACTIVE(X)
ACTIVE(U11(X1, X2)) → ACTIVE(X1)
ACTIVE(U21(X)) → ACTIVE(X)
ACTIVE(U31(X1, X2)) → ACTIVE(X1)
ACTIVE(U41(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U42(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(s(X)) → ACTIVE(X)
ACTIVE(plus(X1, X2)) → ACTIVE(X1)
ACTIVE(plus(X1, X2)) → ACTIVE(X2)

The TRS R consists of the following rules:

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

(80) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U31(X1, X2)) → ACTIVE(X1)
ACTIVE(U41(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(U42(X1, X2, X3)) → ACTIVE(X1)
ACTIVE(plus(X1, X2)) → ACTIVE(X1)
ACTIVE(plus(X1, X2)) → ACTIVE(X2)

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

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

[active₁, tt] > [U41₃, plus₂] > U31₂ > mark₁
[active₁, tt] > [U41₃, plus₂] > U42₃ > mark₁
[active₁, tt] > isNat > mark₁
0 > mark₁
top > mark₁

Status:

U31₂: [1,2]
U41₃: [3,2,1]
U42₃: [2,1,3]
plus₂: [1,2]
active₁: [1]
tt: []
mark₁: [1]
isNat: []
0: []
top: []

The following usable rules [FROCOS05] were oriented:

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

(81) Obligation:

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

ACTIVE(U12(X)) → ACTIVE(X)
ACTIVE(U11(X1, X2)) → ACTIVE(X1)
ACTIVE(U21(X)) → ACTIVE(X)
ACTIVE(s(X)) → ACTIVE(X)

The TRS R consists of the following rules:

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

(82) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVE(U12(X)) → ACTIVE(X)
ACTIVE(U21(X)) → ACTIVE(X)

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

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

[active₁, U31₂, U41₃, U42₃, plus₂, top] > U21₁ > [tt, isNat] > [U12₁, mark₁]

Status:

ACTIVE₁: [1]
U12₁: [1]
U21₁: [1]
active₁: [1]
tt: []
mark₁: [1]
isNat: []
U31₂: [2,1]
U41₃: [3,2,1]
U42₃: [3,1,2]
plus₂: [2,1]
0: []
top: []

The following usable rules [FROCOS05] were oriented:

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

(83) Obligation:

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

ACTIVE(U11(X1, X2)) → ACTIVE(X1)
ACTIVE(s(X)) → ACTIVE(X)

The TRS R consists of the following rules:

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

(84) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

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

[active₁, U12₁, U41₃, U42₂, plus₂, proper₁] > U21₁ > [s₁, tt, isNat]
[active₁, U12₁, U41₃, U42₂, plus₂, proper₁] > 0 > U31₂ > [s₁, tt, isNat]
top > [s₁, tt, isNat]

Status:

s₁: [1]
active₁: [1]
tt: []
U12₁: [1]
isNat: []
U21₁: [1]
U31₂: [1,2]
U41₃: [1,2,3]
U42₂: [1,2]
plus₂: [1,2]
0: []
proper₁: [1]
top: []

The following usable rules [FROCOS05] were oriented:

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

(85) Obligation:

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

ACTIVE(U11(X1, X2)) → ACTIVE(X1)

The TRS R consists of the following rules:

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

(86) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

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

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

[0, proper₁] > [active₁, U31₂, U41₃, U42₃, plus₂] > [ACTIVE₁, U11₁, tt, mark₁, U12₁, isNat]
top > [active₁, U31₂, U41₃, U42₃, plus₂] > [ACTIVE₁, U11₁, tt, mark₁, U12₁, isNat]

Status:

ACTIVE₁: [1]
U11₁: [1]
active₁: [1]
tt: []
mark₁: [1]
U12₁: [1]
isNat: []
U31₂: [1,2]
U41₃: [1,2,3]
U42₃: [2,1,3]
plus₂: [2,1]
0: []
proper₁: [1]
top: []

The following usable rules [FROCOS05] were oriented:

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

(87) Obligation:

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

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

(88) PisEmptyProof (EQUIVALENT transformation)

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

(89) TRUE

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