Termination w.r.t. Q proof of Transformed_CSR_04_PEANO_complete

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

0 QTRS

↳1 QTRSToCSRProof (⇔, 0 ms)

↳2 CSR

↳3 CSRRRRProof (⇔, 67 ms)

↳4 CSR

↳5 CSRRRRProof (⇔, 0 ms)

↳6 CSR

↳7 CSRRRRProof (⇔, 0 ms)

↳8 CSR

↳9 CSRRRRProof (⇔, 4 ms)

↳10 CSR

↳11 CSRRRRProof (⇔, 0 ms)

↳12 CSR

↳13 CSRRRRProof (⇔, 0 ms)

↳14 CSR

↳15 CSRRRRProof (⇔, 0 ms)

↳16 CSR

↳17 CSRRRRProof (⇔, 0 ms)

↳18 CSR

↳19 CSRRRRProof (⇔, 0 ms)

↳20 CSR

↳21 CSRRRRProof (⇔, 0 ms)

↳22 CSR

↳23 RisEmptyProof (⇔, 0 ms)

↳24 YES

(0) Obligation:

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

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

Q is empty.

(1) QTRSToCSRProof (EQUIVALENT transformation)

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

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

Q is empty.
Special symbols used for the transformation (see [GM04]):
top: top, active: active, mark: mark, ok: ok, proper: proper
The replacement map contains the following entries:

U11: {1}
tt: empty set
U12: {1}
isNat: empty set
U13: {1}
U21: {1}
U22: {1}
U31: {1}
U41: {1}
s: {1}
plus: {1, 2}
and: {1}
0: empty set
isNatKind: empty set
The QTRS contained all rules created by the complete Giesl-Middeldorp transformation. Therefore, the inverse transformation is complete (and sound).

(2) Obligation:

Context-sensitive rewrite system:
The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNat(V1), V2)
U12(tt, V2) → U13(isNat(V2))
U13(tt) → tt
U21(tt, V1) → U22(isNat(V1))
U22(tt) → tt
U31(tt, N) → N
U41(tt, M, N) → s(plus(N, M))
and(tt, X) → X
isNat(0) → tt
isNat(plus(V1, V2)) → U11(and(isNatKind(V1), isNatKind(V2)), V1, V2)
isNat(s(V1)) → U21(isNatKind(V1), V1)
isNatKind(0) → tt
isNatKind(plus(V1, V2)) → and(isNatKind(V1), isNatKind(V2))
isNatKind(s(V1)) → isNatKind(V1)
plus(N, 0) → U31(and(isNat(N), isNatKind(N)), N)
plus(N, s(M)) → U41(and(and(isNat(M), isNatKind(M)), and(isNat(N), isNatKind(N))), M, N)

The replacement map contains the following entries:

U11: {1}
tt: empty set
U12: {1}
isNat: empty set
U13: {1}
U21: {1}
U22: {1}
U31: {1}
U41: {1}
s: {1}
plus: {1, 2}
and: {1}
0: empty set
isNatKind: empty set

(3) CSRRRRProof (EQUIVALENT transformation)

The following CSR is given: Context-sensitive rewrite system:
The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNat(V1), V2)
U12(tt, V2) → U13(isNat(V2))
U13(tt) → tt
U21(tt, V1) → U22(isNat(V1))
U22(tt) → tt
U31(tt, N) → N
U41(tt, M, N) → s(plus(N, M))
and(tt, X) → X
isNat(0) → tt
isNat(plus(V1, V2)) → U11(and(isNatKind(V1), isNatKind(V2)), V1, V2)
isNat(s(V1)) → U21(isNatKind(V1), V1)
isNatKind(0) → tt
isNatKind(plus(V1, V2)) → and(isNatKind(V1), isNatKind(V2))
isNatKind(s(V1)) → isNatKind(V1)
plus(N, 0) → U31(and(isNat(N), isNatKind(N)), N)
plus(N, s(M)) → U41(and(and(isNat(M), isNatKind(M)), and(isNat(N), isNatKind(N))), M, N)

The replacement map contains the following entries:

U11: {1}
tt: empty set
U12: {1}
isNat: empty set
U13: {1}
U21: {1}
U22: {1}
U31: {1}
U41: {1}
s: {1}
plus: {1, 2}
and: {1}
0: empty set
isNatKind: empty set
Used ordering:
Polynomial interpretation [POLO]:

POL(0) = 1
POL(U11(x₁, x₂, x₃)) = x₁
POL(U12(x₁, x₂)) = x₁
POL(U13(x₁)) = x₁
POL(U21(x₁, x₂)) = x₁
POL(U22(x₁)) = x₁
POL(U31(x₁, x₂)) = x₁ + x₂
POL(U41(x₁, x₂, x₃)) = 1 + x₁ + x₂ + x₃
POL(and(x₁, x₂)) = x₁ + x₂
POL(isNat(x₁)) = 0
POL(isNatKind(x₁)) = 0
POL(plus(x₁, x₂)) = x₁ + x₂
POL(s(x₁)) = 1 + x₁
POL(tt) = 0

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

plus(N, 0) → U31(and(isNat(N), isNatKind(N)), N)

(4) Obligation:

Context-sensitive rewrite system:
The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNat(V1), V2)
U12(tt, V2) → U13(isNat(V2))
U13(tt) → tt
U21(tt, V1) → U22(isNat(V1))
U22(tt) → tt
U31(tt, N) → N
U41(tt, M, N) → s(plus(N, M))
and(tt, X) → X
isNat(0) → tt
isNat(plus(V1, V2)) → U11(and(isNatKind(V1), isNatKind(V2)), V1, V2)
isNat(s(V1)) → U21(isNatKind(V1), V1)
isNatKind(0) → tt
isNatKind(plus(V1, V2)) → and(isNatKind(V1), isNatKind(V2))
isNatKind(s(V1)) → isNatKind(V1)
plus(N, s(M)) → U41(and(and(isNat(M), isNatKind(M)), and(isNat(N), isNatKind(N))), M, N)

The replacement map contains the following entries:

U11: {1}
tt: empty set
U12: {1}
isNat: empty set
U13: {1}
U21: {1}
U22: {1}
U31: {1}
U41: {1}
s: {1}
plus: {1, 2}
and: {1}
0: empty set
isNatKind: empty set

(5) CSRRRRProof (EQUIVALENT transformation)

The following CSR is given: Context-sensitive rewrite system:
The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNat(V1), V2)
U12(tt, V2) → U13(isNat(V2))
U13(tt) → tt
U21(tt, V1) → U22(isNat(V1))
U22(tt) → tt
U31(tt, N) → N
U41(tt, M, N) → s(plus(N, M))
and(tt, X) → X
isNat(0) → tt
isNat(plus(V1, V2)) → U11(and(isNatKind(V1), isNatKind(V2)), V1, V2)
isNat(s(V1)) → U21(isNatKind(V1), V1)
isNatKind(0) → tt
isNatKind(plus(V1, V2)) → and(isNatKind(V1), isNatKind(V2))
isNatKind(s(V1)) → isNatKind(V1)
plus(N, s(M)) → U41(and(and(isNat(M), isNatKind(M)), and(isNat(N), isNatKind(N))), M, N)

The replacement map contains the following entries:

POL(0) = 0
POL(U11(x₁, x₂, x₃)) = x₁
POL(U12(x₁, x₂)) = x₁
POL(U13(x₁)) = x₁
POL(U21(x₁, x₂)) = x₁
POL(U22(x₁)) = x₁
POL(U31(x₁, x₂)) = 1 + x₁ + x₂
POL(U41(x₁, x₂, x₃)) = x₁ + x₂ + x₃
POL(and(x₁, x₂)) = x₁ + x₂
POL(isNat(x₁)) = 0
POL(isNatKind(x₁)) = 0
POL(plus(x₁, x₂)) = x₁ + x₂
POL(s(x₁)) = x₁
POL(tt) = 0

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

U31(tt, N) → N

(6) Obligation:

Context-sensitive rewrite system:
The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNat(V1), V2)
U12(tt, V2) → U13(isNat(V2))
U13(tt) → tt
U21(tt, V1) → U22(isNat(V1))
U22(tt) → tt
U41(tt, M, N) → s(plus(N, M))
and(tt, X) → X
isNat(0) → tt
isNat(plus(V1, V2)) → U11(and(isNatKind(V1), isNatKind(V2)), V1, V2)
isNat(s(V1)) → U21(isNatKind(V1), V1)
isNatKind(0) → tt
isNatKind(plus(V1, V2)) → and(isNatKind(V1), isNatKind(V2))
isNatKind(s(V1)) → isNatKind(V1)
plus(N, s(M)) → U41(and(and(isNat(M), isNatKind(M)), and(isNat(N), isNatKind(N))), M, N)

The replacement map contains the following entries:

U11: {1}
tt: empty set
U12: {1}
isNat: empty set
U13: {1}
U21: {1}
U22: {1}
U41: {1}
s: {1}
plus: {1, 2}
and: {1}
0: empty set
isNatKind: empty set

(7) CSRRRRProof (EQUIVALENT transformation)

The following CSR is given: Context-sensitive rewrite system:
The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNat(V1), V2)
U12(tt, V2) → U13(isNat(V2))
U13(tt) → tt
U21(tt, V1) → U22(isNat(V1))
U22(tt) → tt
U41(tt, M, N) → s(plus(N, M))
and(tt, X) → X
isNat(0) → tt
isNat(plus(V1, V2)) → U11(and(isNatKind(V1), isNatKind(V2)), V1, V2)
isNat(s(V1)) → U21(isNatKind(V1), V1)
isNatKind(0) → tt
isNatKind(plus(V1, V2)) → and(isNatKind(V1), isNatKind(V2))
isNatKind(s(V1)) → isNatKind(V1)
plus(N, s(M)) → U41(and(and(isNat(M), isNatKind(M)), and(isNat(N), isNatKind(N))), M, N)

The replacement map contains the following entries:

U11: {1}
tt: empty set
U12: {1}
isNat: empty set
U13: {1}
U21: {1}
U22: {1}
U41: {1}
s: {1}
plus: {1, 2}
and: {1}
0: empty set
isNatKind: empty set
Used ordering:
Polynomial interpretation [POLO]:

POL(0) = 2
POL(U11(x₁, x₂, x₃)) = x₁
POL(U12(x₁, x₂)) = x₁
POL(U13(x₁)) = x₁
POL(U21(x₁, x₂)) = 2·x₁
POL(U22(x₁)) = 2·x₁
POL(U41(x₁, x₂, x₃)) = 2 + 2·x₁ + 2·x₂ + x₃
POL(and(x₁, x₂)) = x₁ + 2·x₂
POL(isNat(x₁)) = 0
POL(isNatKind(x₁)) = 0
POL(plus(x₁, x₂)) = x₁ + 2·x₂
POL(s(x₁)) = 2 + x₁
POL(tt) = 0

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

plus(N, s(M)) → U41(and(and(isNat(M), isNatKind(M)), and(isNat(N), isNatKind(N))), M, N)

(8) Obligation:

Context-sensitive rewrite system:
The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNat(V1), V2)
U12(tt, V2) → U13(isNat(V2))
U13(tt) → tt
U21(tt, V1) → U22(isNat(V1))
U22(tt) → tt
U41(tt, M, N) → s(plus(N, M))
and(tt, X) → X
isNat(0) → tt
isNat(plus(V1, V2)) → U11(and(isNatKind(V1), isNatKind(V2)), V1, V2)
isNat(s(V1)) → U21(isNatKind(V1), V1)
isNatKind(0) → tt
isNatKind(plus(V1, V2)) → and(isNatKind(V1), isNatKind(V2))
isNatKind(s(V1)) → isNatKind(V1)

The replacement map contains the following entries:

U11: {1}
tt: empty set
U12: {1}
isNat: empty set
U13: {1}
U21: {1}
U22: {1}
U41: {1}
s: {1}
plus: {1, 2}
and: {1}
0: empty set
isNatKind: empty set

(9) CSRRRRProof (EQUIVALENT transformation)

The following CSR is given: Context-sensitive rewrite system:
The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNat(V1), V2)
U12(tt, V2) → U13(isNat(V2))
U13(tt) → tt
U21(tt, V1) → U22(isNat(V1))
U22(tt) → tt
U41(tt, M, N) → s(plus(N, M))
and(tt, X) → X
isNat(0) → tt
isNat(plus(V1, V2)) → U11(and(isNatKind(V1), isNatKind(V2)), V1, V2)
isNat(s(V1)) → U21(isNatKind(V1), V1)
isNatKind(0) → tt
isNatKind(plus(V1, V2)) → and(isNatKind(V1), isNatKind(V2))
isNatKind(s(V1)) → isNatKind(V1)

The replacement map contains the following entries:

U11: {1}
tt: empty set
U12: {1}
isNat: empty set
U13: {1}
U21: {1}
U22: {1}
U41: {1}
s: {1}
plus: {1, 2}
and: {1}
0: empty set
isNatKind: empty set
Used ordering:
Polynomial interpretation [POLO]:

POL(0) = 0
POL(U11(x₁, x₂, x₃)) = x₁ + x₂ + x₃
POL(U12(x₁, x₂)) = x₁ + x₂
POL(U13(x₁)) = x₁
POL(U21(x₁, x₂)) = x₁ + x₂
POL(U22(x₁)) = x₁
POL(U41(x₁, x₂, x₃)) = 1 + x₁ + x₂ + x₃
POL(and(x₁, x₂)) = x₁ + x₂
POL(isNat(x₁)) = x₁
POL(isNatKind(x₁)) = 0
POL(plus(x₁, x₂)) = 1 + x₁ + x₂
POL(s(x₁)) = x₁
POL(tt) = 0

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

isNat(plus(V1, V2)) → U11(and(isNatKind(V1), isNatKind(V2)), V1, V2)

(10) Obligation:

Context-sensitive rewrite system:
The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNat(V1), V2)
U12(tt, V2) → U13(isNat(V2))
U13(tt) → tt
U21(tt, V1) → U22(isNat(V1))
U22(tt) → tt
U41(tt, M, N) → s(plus(N, M))
and(tt, X) → X
isNat(0) → tt
isNat(s(V1)) → U21(isNatKind(V1), V1)
isNatKind(0) → tt
isNatKind(plus(V1, V2)) → and(isNatKind(V1), isNatKind(V2))
isNatKind(s(V1)) → isNatKind(V1)

The replacement map contains the following entries:

U11: {1}
tt: empty set
U12: {1}
isNat: empty set
U13: {1}
U21: {1}
U22: {1}
U41: {1}
s: {1}
plus: {1, 2}
and: {1}
0: empty set
isNatKind: empty set

(11) CSRRRRProof (EQUIVALENT transformation)

The following CSR is given: Context-sensitive rewrite system:
The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNat(V1), V2)
U12(tt, V2) → U13(isNat(V2))
U13(tt) → tt
U21(tt, V1) → U22(isNat(V1))
U22(tt) → tt
U41(tt, M, N) → s(plus(N, M))
and(tt, X) → X
isNat(0) → tt
isNat(s(V1)) → U21(isNatKind(V1), V1)
isNatKind(0) → tt
isNatKind(plus(V1, V2)) → and(isNatKind(V1), isNatKind(V2))
isNatKind(s(V1)) → isNatKind(V1)

The replacement map contains the following entries:

U11: {1}
tt: empty set
U12: {1}
isNat: empty set
U13: {1}
U21: {1}
U22: {1}
U41: {1}
s: {1}
plus: {1, 2}
and: {1}
0: empty set
isNatKind: empty set
Used ordering:
Polynomial interpretation [POLO]:

POL(0) = 0
POL(U11(x₁, x₂, x₃)) = 1 + x₁ + x₂ + x₃
POL(U12(x₁, x₂)) = 1 + x₁ + x₂
POL(U13(x₁)) = x₁
POL(U21(x₁, x₂)) = x₁ + x₂
POL(U22(x₁)) = x₁
POL(U41(x₁, x₂, x₃)) = 1 + x₁ + x₂ + x₃
POL(and(x₁, x₂)) = x₁ + x₂
POL(isNat(x₁)) = x₁
POL(isNatKind(x₁)) = 0
POL(plus(x₁, x₂)) = x₁ + x₂
POL(s(x₁)) = 1 + x₁
POL(tt) = 0

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

U12(tt, V2) → U13(isNat(V2))
isNat(s(V1)) → U21(isNatKind(V1), V1)

(12) Obligation:

Context-sensitive rewrite system:
The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNat(V1), V2)
U13(tt) → tt
U21(tt, V1) → U22(isNat(V1))
U22(tt) → tt
U41(tt, M, N) → s(plus(N, M))
and(tt, X) → X
isNat(0) → tt
isNatKind(0) → tt
isNatKind(plus(V1, V2)) → and(isNatKind(V1), isNatKind(V2))
isNatKind(s(V1)) → isNatKind(V1)

The replacement map contains the following entries:

U11: {1}
tt: empty set
U12: {1}
isNat: empty set
U13: {1}
U21: {1}
U22: {1}
U41: {1}
s: {1}
plus: {1, 2}
and: {1}
0: empty set
isNatKind: empty set

(13) CSRRRRProof (EQUIVALENT transformation)

The following CSR is given: Context-sensitive rewrite system:
The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNat(V1), V2)
U13(tt) → tt
U21(tt, V1) → U22(isNat(V1))
U22(tt) → tt
U41(tt, M, N) → s(plus(N, M))
and(tt, X) → X
isNat(0) → tt
isNatKind(0) → tt
isNatKind(plus(V1, V2)) → and(isNatKind(V1), isNatKind(V2))
isNatKind(s(V1)) → isNatKind(V1)

The replacement map contains the following entries:

U11: {1}
tt: empty set
U12: {1}
isNat: empty set
U13: {1}
U21: {1}
U22: {1}
U41: {1}
s: {1}
plus: {1, 2}
and: {1}
0: empty set
isNatKind: empty set
Used ordering:
Polynomial interpretation [POLO]:

POL(0) = 1
POL(U11(x₁, x₂, x₃)) = 1 + x₁ + x₂ + x₃
POL(U12(x₁, x₂)) = 1 + x₁
POL(U13(x₁)) = 1 + x₁
POL(U21(x₁, x₂)) = 1 + x₁ + x₂
POL(U22(x₁)) = x₁
POL(U41(x₁, x₂, x₃)) = 1 + x₁ + x₂ + x₃
POL(and(x₁, x₂)) = x₁ + x₂
POL(isNat(x₁)) = x₁
POL(isNatKind(x₁)) = 0
POL(plus(x₁, x₂)) = 1 + x₁ + x₂
POL(s(x₁)) = x₁
POL(tt) = 0

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

U13(tt) → tt
U21(tt, V1) → U22(isNat(V1))
isNat(0) → tt

(14) Obligation:

Context-sensitive rewrite system:
The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNat(V1), V2)
U22(tt) → tt
U41(tt, M, N) → s(plus(N, M))
and(tt, X) → X
isNatKind(0) → tt
isNatKind(plus(V1, V2)) → and(isNatKind(V1), isNatKind(V2))
isNatKind(s(V1)) → isNatKind(V1)

The replacement map contains the following entries:

U11: {1}
tt: empty set
U12: {1}
isNat: empty set
U22: {1}
U41: {1}
s: {1}
plus: {1, 2}
and: {1}
0: empty set
isNatKind: empty set

(15) CSRRRRProof (EQUIVALENT transformation)

The following CSR is given: Context-sensitive rewrite system:
The TRS R consists of the following rules:

U11(tt, V1, V2) → U12(isNat(V1), V2)
U22(tt) → tt
U41(tt, M, N) → s(plus(N, M))
and(tt, X) → X
isNatKind(0) → tt
isNatKind(plus(V1, V2)) → and(isNatKind(V1), isNatKind(V2))
isNatKind(s(V1)) → isNatKind(V1)

The replacement map contains the following entries:

U11: {1}
tt: empty set
U12: {1}
isNat: empty set
U22: {1}
U41: {1}
s: {1}
plus: {1, 2}
and: {1}
0: empty set
isNatKind: empty set
Used ordering:
Polynomial interpretation [POLO]:

POL(0) = 1
POL(U11(x₁, x₂, x₃)) = x₁ + x₂ + x₃
POL(U12(x₁, x₂)) = x₁
POL(U22(x₁)) = 1 + x₁
POL(U41(x₁, x₂, x₃)) = 1 + x₁ + x₂ + x₃
POL(and(x₁, x₂)) = x₁ + x₂
POL(isNat(x₁)) = 0
POL(isNatKind(x₁)) = x₁
POL(plus(x₁, x₂)) = x₁ + x₂
POL(s(x₁)) = x₁
POL(tt) = 1

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

U11(tt, V1, V2) → U12(isNat(V1), V2)
U22(tt) → tt
U41(tt, M, N) → s(plus(N, M))
and(tt, X) → X

(16) Obligation:

Context-sensitive rewrite system:
The TRS R consists of the following rules:

isNatKind(0) → tt
isNatKind(plus(V1, V2)) → and(isNatKind(V1), isNatKind(V2))
isNatKind(s(V1)) → isNatKind(V1)

The replacement map contains the following entries:

tt: empty set
s: {1}
plus: {1, 2}
and: {1}
0: empty set
isNatKind: empty set

(17) CSRRRRProof (EQUIVALENT transformation)

The following CSR is given: Context-sensitive rewrite system:
The TRS R consists of the following rules:

isNatKind(0) → tt
isNatKind(plus(V1, V2)) → and(isNatKind(V1), isNatKind(V2))
isNatKind(s(V1)) → isNatKind(V1)

The replacement map contains the following entries:

tt: empty set
s: {1}
plus: {1, 2}
and: {1}
0: empty set
isNatKind: empty set
Used ordering:
Polynomial interpretation [POLO]:

POL(0) = 0
POL(and(x₁, x₂)) = x₁
POL(isNatKind(x₁)) = 1 + x₁
POL(plus(x₁, x₂)) = x₁ + x₂
POL(s(x₁)) = x₁
POL(tt) = 0

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

isNatKind(0) → tt

(18) Obligation:

Context-sensitive rewrite system:
The TRS R consists of the following rules:

isNatKind(plus(V1, V2)) → and(isNatKind(V1), isNatKind(V2))
isNatKind(s(V1)) → isNatKind(V1)

The replacement map contains the following entries:

s: {1}
plus: {1, 2}
and: {1}
isNatKind: empty set

(19) CSRRRRProof (EQUIVALENT transformation)

The following CSR is given: Context-sensitive rewrite system:
The TRS R consists of the following rules:

isNatKind(plus(V1, V2)) → and(isNatKind(V1), isNatKind(V2))
isNatKind(s(V1)) → isNatKind(V1)

The replacement map contains the following entries:

s: {1}
plus: {1, 2}
and: {1}
isNatKind: empty set
Used ordering:
Polynomial interpretation [POLO]:

POL(and(x₁, x₂)) = x₁
POL(isNatKind(x₁)) = x₁
POL(plus(x₁, x₂)) = 1 + x₁ + x₂
POL(s(x₁)) = x₁

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

isNatKind(plus(V1, V2)) → and(isNatKind(V1), isNatKind(V2))

(20) Obligation:

Context-sensitive rewrite system:
The TRS R consists of the following rules:

isNatKind(s(V1)) → isNatKind(V1)

The replacement map contains the following entries:

s: {1}
isNatKind: empty set

(21) CSRRRRProof (EQUIVALENT transformation)

The following CSR is given: Context-sensitive rewrite system:
The TRS R consists of the following rules:

isNatKind(s(V1)) → isNatKind(V1)

The replacement map contains the following entries:

s: {1}
isNatKind: empty set
Used ordering:
Polynomial interpretation [POLO]:

POL(isNatKind(x₁)) = x₁
POL(s(x₁)) = 1 + x₁

With this ordering the following rules can be removed by the rule removal processor [LPAR04] because they are oriented strictly:

isNatKind(s(V1)) → isNatKind(V1)

(22) Obligation:

Context-sensitive rewrite system:
R is empty.

(23) RisEmptyProof (EQUIVALENT transformation)

The CSR R is empty. Hence, termination is trivially proven.

(0) Obligation:

(1) QTRSToCSRProof (EQUIVALENT transformation)

(2) Obligation:

(3) CSRRRRProof (EQUIVALENT transformation)

(4) Obligation:

(5) CSRRRRProof (EQUIVALENT transformation)

(6) Obligation:

(7) CSRRRRProof (EQUIVALENT transformation)

(8) Obligation:

(9) CSRRRRProof (EQUIVALENT transformation)

(10) Obligation:

(11) CSRRRRProof (EQUIVALENT transformation)

(12) Obligation:

(13) CSRRRRProof (EQUIVALENT transformation)

(14) Obligation:

(15) CSRRRRProof (EQUIVALENT transformation)

(16) Obligation:

(17) CSRRRRProof (EQUIVALENT transformation)

(18) Obligation:

(19) CSRRRRProof (EQUIVALENT transformation)

(20) Obligation:

(21) CSRRRRProof (EQUIVALENT transformation)

(22) Obligation:

(23) RisEmptyProof (EQUIVALENT transformation)

(24) YES