Termination w.r.t. Q proof of /tmp/tmpyhDqa7/MYNAT_nokinds

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

0 QTRS

↳1 DependencyPairsProof (⇔)

↳2 QDP

↳3 DependencyGraphProof (⇔)

↳4 QDP

↳5 QDPOrderProof (⇔)

↳6 QDP

↳7 DependencyGraphProof (⇔)

↳8 TRUE

(0) Obligation:

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

U11(tt, N) → activate(N)
U21(tt, M, N) → s(plus(activate(N), activate(M)))
U31(tt) → 0
U41(tt, M, N) → plus(x(activate(N), activate(M)), activate(N))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → and(isNat(activate(V1)), n__isNat(activate(V2)))
isNat(n__s(V1)) → isNat(activate(V1))
isNat(n__x(V1, V2)) → and(isNat(activate(V1)), n__isNat(activate(V2)))
plus(N, 0) → U11(isNat(N), N)
plus(N, s(M)) → U21(and(isNat(M), n__isNat(N)), M, N)
x(N, 0) → U31(isNat(N))
x(N, s(M)) → U41(and(isNat(M), n__isNat(N)), M, N)
0 → n__0
plus(X1, X2) → n__plus(X1, X2)
isNat(X) → n__isNat(X)
s(X) → n__s(X)
x(X1, X2) → n__x(X1, X2)
activate(n__0) → 0
activate(n__plus(X1, X2)) → plus(X1, X2)
activate(n__isNat(X)) → isNat(X)
activate(n__s(X)) → s(X)
activate(n__x(X1, X2)) → x(X1, X2)
activate(X) → 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:

U11¹(tt, N) → ACTIVATE(N)
U21¹(tt, M, N) → S(plus(activate(N), activate(M)))
U21¹(tt, M, N) → PLUS(activate(N), activate(M))
U21¹(tt, M, N) → ACTIVATE(N)
U21¹(tt, M, N) → ACTIVATE(M)
U31¹(tt) → 0¹
U41¹(tt, M, N) → PLUS(x(activate(N), activate(M)), activate(N))
U41¹(tt, M, N) → X(activate(N), activate(M))
U41¹(tt, M, N) → ACTIVATE(N)
U41¹(tt, M, N) → ACTIVATE(M)
AND(tt, X) → ACTIVATE(X)
ISNAT(n__plus(V1, V2)) → AND(isNat(activate(V1)), n__isNat(activate(V2)))
ISNAT(n__plus(V1, V2)) → ISNAT(activate(V1))
ISNAT(n__plus(V1, V2)) → ACTIVATE(V1)
ISNAT(n__plus(V1, V2)) → ACTIVATE(V2)
ISNAT(n__s(V1)) → ISNAT(activate(V1))
ISNAT(n__s(V1)) → ACTIVATE(V1)
ISNAT(n__x(V1, V2)) → AND(isNat(activate(V1)), n__isNat(activate(V2)))
ISNAT(n__x(V1, V2)) → ISNAT(activate(V1))
ISNAT(n__x(V1, V2)) → ACTIVATE(V1)
ISNAT(n__x(V1, V2)) → ACTIVATE(V2)
PLUS(N, 0) → U11¹(isNat(N), N)
PLUS(N, 0) → ISNAT(N)
PLUS(N, s(M)) → U21¹(and(isNat(M), n__isNat(N)), M, N)
PLUS(N, s(M)) → AND(isNat(M), n__isNat(N))
PLUS(N, s(M)) → ISNAT(M)
X(N, 0) → U31¹(isNat(N))
X(N, 0) → ISNAT(N)
X(N, s(M)) → U41¹(and(isNat(M), n__isNat(N)), M, N)
X(N, s(M)) → AND(isNat(M), n__isNat(N))
X(N, s(M)) → ISNAT(M)
ACTIVATE(n__0) → 0¹
ACTIVATE(n__plus(X1, X2)) → PLUS(X1, X2)
ACTIVATE(n__isNat(X)) → ISNAT(X)
ACTIVATE(n__s(X)) → S(X)
ACTIVATE(n__x(X1, X2)) → X(X1, X2)

The TRS R consists of the following rules:

U11(tt, N) → activate(N)
U21(tt, M, N) → s(plus(activate(N), activate(M)))
U31(tt) → 0
U41(tt, M, N) → plus(x(activate(N), activate(M)), activate(N))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → and(isNat(activate(V1)), n__isNat(activate(V2)))
isNat(n__s(V1)) → isNat(activate(V1))
isNat(n__x(V1, V2)) → and(isNat(activate(V1)), n__isNat(activate(V2)))
plus(N, 0) → U11(isNat(N), N)
plus(N, s(M)) → U21(and(isNat(M), n__isNat(N)), M, N)
x(N, 0) → U31(isNat(N))
x(N, s(M)) → U41(and(isNat(M), n__isNat(N)), M, N)
0 → n__0
plus(X1, X2) → n__plus(X1, X2)
isNat(X) → n__isNat(X)
s(X) → n__s(X)
x(X1, X2) → n__x(X1, X2)
activate(n__0) → 0
activate(n__plus(X1, X2)) → plus(X1, X2)
activate(n__isNat(X)) → isNat(X)
activate(n__s(X)) → s(X)
activate(n__x(X1, X2)) → x(X1, X2)
activate(X) → 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 1 SCC with 5 less nodes.

(4) Obligation:

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

ACTIVATE(n__plus(X1, X2)) → PLUS(X1, X2)
PLUS(N, 0) → U11¹(isNat(N), N)
U11¹(tt, N) → ACTIVATE(N)
ACTIVATE(n__isNat(X)) → ISNAT(X)
ISNAT(n__plus(V1, V2)) → AND(isNat(activate(V1)), n__isNat(activate(V2)))
AND(tt, X) → ACTIVATE(X)
ACTIVATE(n__x(X1, X2)) → X(X1, X2)
X(N, 0) → ISNAT(N)
ISNAT(n__plus(V1, V2)) → ISNAT(activate(V1))
ISNAT(n__plus(V1, V2)) → ACTIVATE(V1)
ISNAT(n__plus(V1, V2)) → ACTIVATE(V2)
ISNAT(n__s(V1)) → ISNAT(activate(V1))
ISNAT(n__s(V1)) → ACTIVATE(V1)
ISNAT(n__x(V1, V2)) → AND(isNat(activate(V1)), n__isNat(activate(V2)))
ISNAT(n__x(V1, V2)) → ISNAT(activate(V1))
ISNAT(n__x(V1, V2)) → ACTIVATE(V1)
ISNAT(n__x(V1, V2)) → ACTIVATE(V2)
X(N, s(M)) → U41¹(and(isNat(M), n__isNat(N)), M, N)
U41¹(tt, M, N) → PLUS(x(activate(N), activate(M)), activate(N))
PLUS(N, 0) → ISNAT(N)
PLUS(N, s(M)) → U21¹(and(isNat(M), n__isNat(N)), M, N)
U21¹(tt, M, N) → PLUS(activate(N), activate(M))
PLUS(N, s(M)) → AND(isNat(M), n__isNat(N))
PLUS(N, s(M)) → ISNAT(M)
U21¹(tt, M, N) → ACTIVATE(N)
U21¹(tt, M, N) → ACTIVATE(M)
U41¹(tt, M, N) → X(activate(N), activate(M))
X(N, s(M)) → AND(isNat(M), n__isNat(N))
X(N, s(M)) → ISNAT(M)
U41¹(tt, M, N) → ACTIVATE(N)
U41¹(tt, M, N) → ACTIVATE(M)

The TRS R consists of the following rules:

U11(tt, N) → activate(N)
U21(tt, M, N) → s(plus(activate(N), activate(M)))
U31(tt) → 0
U41(tt, M, N) → plus(x(activate(N), activate(M)), activate(N))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → and(isNat(activate(V1)), n__isNat(activate(V2)))
isNat(n__s(V1)) → isNat(activate(V1))
isNat(n__x(V1, V2)) → and(isNat(activate(V1)), n__isNat(activate(V2)))
plus(N, 0) → U11(isNat(N), N)
plus(N, s(M)) → U21(and(isNat(M), n__isNat(N)), M, N)
x(N, 0) → U31(isNat(N))
x(N, s(M)) → U41(and(isNat(M), n__isNat(N)), M, N)
0 → n__0
plus(X1, X2) → n__plus(X1, X2)
isNat(X) → n__isNat(X)
s(X) → n__s(X)
x(X1, X2) → n__x(X1, X2)
activate(n__0) → 0
activate(n__plus(X1, X2)) → plus(X1, X2)
activate(n__isNat(X)) → isNat(X)
activate(n__s(X)) → s(X)
activate(n__x(X1, X2)) → x(X1, X2)
activate(X) → X

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

(5) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

ACTIVATE(n__plus(X1, X2)) → PLUS(X1, X2)
PLUS(N, 0) → U11¹(isNat(N), N)
ISNAT(n__plus(V1, V2)) → AND(isNat(activate(V1)), n__isNat(activate(V2)))
AND(tt, X) → ACTIVATE(X)
ACTIVATE(n__x(X1, X2)) → X(X1, X2)
X(N, 0) → ISNAT(N)
ISNAT(n__plus(V1, V2)) → ISNAT(activate(V1))
ISNAT(n__plus(V1, V2)) → ACTIVATE(V1)
ISNAT(n__plus(V1, V2)) → ACTIVATE(V2)
ISNAT(n__s(V1)) → ISNAT(activate(V1))
ISNAT(n__s(V1)) → ACTIVATE(V1)
ISNAT(n__x(V1, V2)) → AND(isNat(activate(V1)), n__isNat(activate(V2)))
ISNAT(n__x(V1, V2)) → ISNAT(activate(V1))
ISNAT(n__x(V1, V2)) → ACTIVATE(V1)
ISNAT(n__x(V1, V2)) → ACTIVATE(V2)
X(N, s(M)) → U41¹(and(isNat(M), n__isNat(N)), M, N)
U41¹(tt, M, N) → PLUS(x(activate(N), activate(M)), activate(N))
PLUS(N, 0) → ISNAT(N)
PLUS(N, s(M)) → U21¹(and(isNat(M), n__isNat(N)), M, N)
PLUS(N, s(M)) → AND(isNat(M), n__isNat(N))
PLUS(N, s(M)) → ISNAT(M)
U21¹(tt, M, N) → ACTIVATE(N)
U21¹(tt, M, N) → ACTIVATE(M)
U41¹(tt, M, N) → X(activate(N), activate(M))
X(N, s(M)) → AND(isNat(M), n__isNat(N))
X(N, s(M)) → ISNAT(M)
U41¹(tt, M, N) → ACTIVATE(N)
U41¹(tt, M, N) → ACTIVATE(M)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
ACTIVATE(x1) = ACTIVATE(x1)
n__plus(x1, x2) = n__plus(x1, x2)
PLUS(x1, x2) = PLUS(x1, x2)
0 = 0
U11¹(x1, x2) = U11¹(x2)
isNat(x1) = x1
tt = tt
n__isNat(x1) = x1
ISNAT(x1) = ISNAT(x1)
AND(x1, x2) = AND(x1, x2)
activate(x1) = x1
n__x(x1, x2) = n__x(x1, x2)
X(x1, x2) = X(x1, x2)
n__s(x1) = n__s(x1)
s(x1) = s(x1)
U41¹(x1, x2, x3) = U41¹(x1, x2, x3)
and(x1, x2) = and(x1, x2)
x(x1, x2) = x(x1, x2)
U21¹(x1, x2, x3) = U21¹(x2, x3)
n__0 = n__0
plus(x1, x2) = plus(x1, x2)
U11(x1, x2) = U11(x1, x2)
U41(x1, x2, x3) = U41(x1, x2, x3)
U31(x1) = U31(x1)
U21(x1, x2, x3) = U21(x1, x2, x3)

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

[n_{_x₂}, X₂, U41^1₃, x₂, U41₃] > [n_{_plus₂}, plus₂, U21₃] > [PLUS₂, n_{_s₁}, s₁, U21^1₂] > AND₂ > [ACTIVATE₁, U11^1₁, tt, ISNAT₁, U11₂]
[n_{_x₂}, X₂, U41^1₃, x₂, U41₃] > [n_{_plus₂}, plus₂, U21₃] > [PLUS₂, n_{_s₁}, s₁, U21^1₂] > and₂ > [ACTIVATE₁, U11^1₁, tt, ISNAT₁, U11₂]
[n_{_x₂}, X₂, U41^1₃, x₂, U41₃] > U31₁ > [0, n_₀] > [ACTIVATE₁, U11^1₁, tt, ISNAT₁, U11₂]

Status:

ACTIVATE₁: [1]
n_{_plus₂}: [1,2]
PLUS₂: [1,2]
0: []
U11^1₁: [1]
tt: []
ISNAT₁: [1]
AND₂: [1,2]
n_{_x₂}: [1,2]
X₂: [1,2]
n_{_s₁}: [1]
s₁: [1]
U41^1₃: [3,2,1]
and₂: [2,1]
x₂: [1,2]
U21^1₂: [2,1]
n_₀: []
plus₂: [1,2]
U11₂: [2,1]
U41₃: [3,2,1]
U31₁: [1]
U21₃: [3,2,1]

The following usable rules [FROCOS05] were oriented:

isNat(n__0) → tt
activate(n__plus(X1, X2)) → plus(X1, X2)
plus(N, 0) → U11(isNat(N), N)
U11(tt, N) → activate(N)
activate(n__isNat(X)) → isNat(X)
isNat(n__plus(V1, V2)) → and(isNat(activate(V1)), n__isNat(activate(V2)))
and(tt, X) → activate(X)
activate(n__x(X1, X2)) → x(X1, X2)
x(N, s(M)) → U41(and(isNat(M), n__isNat(N)), M, N)
U41(tt, M, N) → plus(x(activate(N), activate(M)), activate(N))
isNat(n__s(V1)) → isNat(activate(V1))
isNat(n__x(V1, V2)) → and(isNat(activate(V1)), n__isNat(activate(V2)))
isNat(X) → n__isNat(X)
activate(n__0) → 0
activate(n__s(X)) → s(X)
activate(X) → X
x(N, 0) → U31(isNat(N))
x(X1, X2) → n__x(X1, X2)
plus(X1, X2) → n__plus(X1, X2)
plus(N, s(M)) → U21(and(isNat(M), n__isNat(N)), M, N)
U21(tt, M, N) → s(plus(activate(N), activate(M)))
s(X) → n__s(X)
U31(tt) → 0
0 → n__0

(6) Obligation:

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

U11¹(tt, N) → ACTIVATE(N)
ACTIVATE(n__isNat(X)) → ISNAT(X)
U21¹(tt, M, N) → PLUS(activate(N), activate(M))

The TRS R consists of the following rules:

U11(tt, N) → activate(N)
U21(tt, M, N) → s(plus(activate(N), activate(M)))
U31(tt) → 0
U41(tt, M, N) → plus(x(activate(N), activate(M)), activate(N))
and(tt, X) → activate(X)
isNat(n__0) → tt
isNat(n__plus(V1, V2)) → and(isNat(activate(V1)), n__isNat(activate(V2)))
isNat(n__s(V1)) → isNat(activate(V1))
isNat(n__x(V1, V2)) → and(isNat(activate(V1)), n__isNat(activate(V2)))
plus(N, 0) → U11(isNat(N), N)
plus(N, s(M)) → U21(and(isNat(M), n__isNat(N)), M, N)
x(N, 0) → U31(isNat(N))
x(N, s(M)) → U41(and(isNat(M), n__isNat(N)), M, N)
0 → n__0
plus(X1, X2) → n__plus(X1, X2)
isNat(X) → n__isNat(X)
s(X) → n__s(X)
x(X1, X2) → n__x(X1, X2)
activate(n__0) → 0
activate(n__plus(X1, X2)) → plus(X1, X2)
activate(n__isNat(X)) → isNat(X)
activate(n__s(X)) → s(X)
activate(n__x(X1, X2)) → x(X1, X2)
activate(X) → X

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

(7) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 3 less nodes.

(0) Obligation:

(1) DependencyPairsProof (EQUIVALENT transformation)

(2) Obligation:

(3) DependencyGraphProof (EQUIVALENT transformation)

(4) Obligation:

(5) QDPOrderProof (EQUIVALENT transformation)

(6) Obligation:

(7) DependencyGraphProof (EQUIVALENT transformation)

(8) TRUE