Termination w.r.t. Q proof of ../tpdb/TRS/TRCSR/MYNAT_nokinds

YES Termination w.r.t. Q proof of ../tpdb/TRS/TRCSR/MYNAT_nokinds_GM.trs
Termination w.r.t. Q of the following Term Rewriting System could be proven:

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

a__U11(tt, N) → mark(N)
a__U21(tt, M, N) → s(a__plus(mark(N), mark(M)))
a__U31(tt) → 0
a__U41(tt, M, N) → a__plus(a__x(mark(N), mark(M)), mark(N))
a__and(tt, X) → mark(X)
a__isNat(0) → tt
a__isNat(plus(V1, V2)) → a__and(a__isNat(V1), isNat(V2))
a__isNat(s(V1)) → a__isNat(V1)
a__isNat(x(V1, V2)) → a__and(a__isNat(V1), isNat(V2))
a__plus(N, 0) → a__U11(a__isNat(N), N)
a__plus(N, s(M)) → a__U21(a__and(a__isNat(M), isNat(N)), M, N)
a__x(N, 0) → a__U31(a__isNat(N))
a__x(N, s(M)) → a__U41(a__and(a__isNat(M), isNat(N)), M, N)
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(U21(X1, X2, X3)) → a__U21(mark(X1), X2, X3)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(U31(X)) → a__U31(mark(X))
mark(U41(X1, X2, X3)) → a__U41(mark(X1), X2, X3)
mark(x(X1, X2)) → a__x(mark(X1), mark(X2))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(0) → 0
a__U11(X1, X2) → U11(X1, X2)
a__U21(X1, X2, X3) → U21(X1, X2, X3)
a__plus(X1, X2) → plus(X1, X2)
a__U31(X) → U31(X)
a__U41(X1, X2, X3) → U41(X1, X2, X3)
a__x(X1, X2) → x(X1, X2)
a__and(X1, X2) → and(X1, X2)
a__isNat(X) → isNat(X)

Q is empty.

↳ QTRS

  ↳ DependencyPairsProof

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

a__U11(tt, N) → mark(N)
a__U21(tt, M, N) → s(a__plus(mark(N), mark(M)))
a__U31(tt) → 0
a__U41(tt, M, N) → a__plus(a__x(mark(N), mark(M)), mark(N))
a__and(tt, X) → mark(X)
a__isNat(0) → tt
a__isNat(plus(V1, V2)) → a__and(a__isNat(V1), isNat(V2))
a__isNat(s(V1)) → a__isNat(V1)
a__isNat(x(V1, V2)) → a__and(a__isNat(V1), isNat(V2))
a__plus(N, 0) → a__U11(a__isNat(N), N)
a__plus(N, s(M)) → a__U21(a__and(a__isNat(M), isNat(N)), M, N)
a__x(N, 0) → a__U31(a__isNat(N))
a__x(N, s(M)) → a__U41(a__and(a__isNat(M), isNat(N)), M, N)
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(U21(X1, X2, X3)) → a__U21(mark(X1), X2, X3)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(U31(X)) → a__U31(mark(X))
mark(U41(X1, X2, X3)) → a__U41(mark(X1), X2, X3)
mark(x(X1, X2)) → a__x(mark(X1), mark(X2))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(0) → 0
a__U11(X1, X2) → U11(X1, X2)
a__U21(X1, X2, X3) → U21(X1, X2, X3)
a__plus(X1, X2) → plus(X1, X2)
a__U31(X) → U31(X)
a__U41(X1, X2, X3) → U41(X1, X2, X3)
a__x(X1, X2) → x(X1, X2)
a__and(X1, X2) → and(X1, X2)
a__isNat(X) → isNat(X)

Q is empty.

Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:

MARK(x(X1, X2)) → A__X(mark(X1), mark(X2))
A__PLUS(N, 0) → A__ISNAT(N)
A__X(N, s(M)) → A__AND(a__isNat(M), isNat(N))
A__U21(tt, M, N) → MARK(M)
A__PLUS(N, s(M)) → A__AND(a__isNat(M), isNat(N))
A__ISNAT(plus(V1, V2)) → A__ISNAT(V1)
A__U21(tt, M, N) → A__PLUS(mark(N), mark(M))
A__ISNAT(x(V1, V2)) → A__ISNAT(V1)
MARK(U31(X)) → MARK(X)
MARK(U21(X1, X2, X3)) → A__U21(mark(X1), X2, X3)
MARK(plus(X1, X2)) → MARK(X2)
MARK(x(X1, X2)) → MARK(X2)
A__X(N, s(M)) → A__ISNAT(M)
A__U11(tt, N) → MARK(N)
MARK(isNat(X)) → A__ISNAT(X)
A__ISNAT(plus(V1, V2)) → A__AND(a__isNat(V1), isNat(V2))
A__PLUS(N, s(M)) → A__U21(a__and(a__isNat(M), isNat(N)), M, N)
MARK(plus(X1, X2)) → A__PLUS(mark(X1), mark(X2))
A__AND(tt, X) → MARK(X)
MARK(U41(X1, X2, X3)) → MARK(X1)
A__U41(tt, M, N) → A__PLUS(a__x(mark(N), mark(M)), mark(N))
MARK(and(X1, X2)) → MARK(X1)
A__U21(tt, M, N) → MARK(N)
A__U41(tt, M, N) → MARK(M)
MARK(U11(X1, X2)) → A__U11(mark(X1), X2)
A__X(N, s(M)) → A__U41(a__and(a__isNat(M), isNat(N)), M, N)
MARK(U21(X1, X2, X3)) → MARK(X1)
A__PLUS(N, 0) → A__U11(a__isNat(N), N)
MARK(U31(X)) → A__U31(mark(X))
MARK(U41(X1, X2, X3)) → A__U41(mark(X1), X2, X3)
A__ISNAT(s(V1)) → A__ISNAT(V1)
MARK(x(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)
MARK(and(X1, X2)) → A__AND(mark(X1), X2)
A__X(N, 0) → A__ISNAT(N)
A__U41(tt, M, N) → A__X(mark(N), mark(M))
A__X(N, 0) → A__U31(a__isNat(N))
MARK(U11(X1, X2)) → MARK(X1)
A__U41(tt, M, N) → MARK(N)
A__PLUS(N, s(M)) → A__ISNAT(M)
MARK(plus(X1, X2)) → MARK(X1)
A__ISNAT(x(V1, V2)) → A__AND(a__isNat(V1), isNat(V2))

The TRS R consists of the following rules:

a__U11(tt, N) → mark(N)
a__U21(tt, M, N) → s(a__plus(mark(N), mark(M)))
a__U31(tt) → 0
a__U41(tt, M, N) → a__plus(a__x(mark(N), mark(M)), mark(N))
a__and(tt, X) → mark(X)
a__isNat(0) → tt
a__isNat(plus(V1, V2)) → a__and(a__isNat(V1), isNat(V2))
a__isNat(s(V1)) → a__isNat(V1)
a__isNat(x(V1, V2)) → a__and(a__isNat(V1), isNat(V2))
a__plus(N, 0) → a__U11(a__isNat(N), N)
a__plus(N, s(M)) → a__U21(a__and(a__isNat(M), isNat(N)), M, N)
a__x(N, 0) → a__U31(a__isNat(N))
a__x(N, s(M)) → a__U41(a__and(a__isNat(M), isNat(N)), M, N)
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(U21(X1, X2, X3)) → a__U21(mark(X1), X2, X3)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(U31(X)) → a__U31(mark(X))
mark(U41(X1, X2, X3)) → a__U41(mark(X1), X2, X3)
mark(x(X1, X2)) → a__x(mark(X1), mark(X2))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(0) → 0
a__U11(X1, X2) → U11(X1, X2)
a__U21(X1, X2, X3) → U21(X1, X2, X3)
a__plus(X1, X2) → plus(X1, X2)
a__U31(X) → U31(X)
a__U41(X1, X2, X3) → U41(X1, X2, X3)
a__x(X1, X2) → x(X1, X2)
a__and(X1, X2) → and(X1, X2)
a__isNat(X) → isNat(X)

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

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

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

MARK(x(X1, X2)) → A__X(mark(X1), mark(X2))
A__PLUS(N, 0) → A__ISNAT(N)
A__X(N, s(M)) → A__AND(a__isNat(M), isNat(N))
A__U21(tt, M, N) → MARK(M)
A__PLUS(N, s(M)) → A__AND(a__isNat(M), isNat(N))
A__ISNAT(plus(V1, V2)) → A__ISNAT(V1)
A__U21(tt, M, N) → A__PLUS(mark(N), mark(M))
A__ISNAT(x(V1, V2)) → A__ISNAT(V1)
MARK(U31(X)) → MARK(X)
MARK(U21(X1, X2, X3)) → A__U21(mark(X1), X2, X3)
MARK(plus(X1, X2)) → MARK(X2)
MARK(x(X1, X2)) → MARK(X2)
A__X(N, s(M)) → A__ISNAT(M)
A__U11(tt, N) → MARK(N)
MARK(isNat(X)) → A__ISNAT(X)
A__ISNAT(plus(V1, V2)) → A__AND(a__isNat(V1), isNat(V2))
A__PLUS(N, s(M)) → A__U21(a__and(a__isNat(M), isNat(N)), M, N)
MARK(plus(X1, X2)) → A__PLUS(mark(X1), mark(X2))
A__AND(tt, X) → MARK(X)
MARK(U41(X1, X2, X3)) → MARK(X1)
A__U41(tt, M, N) → A__PLUS(a__x(mark(N), mark(M)), mark(N))
MARK(and(X1, X2)) → MARK(X1)
A__U21(tt, M, N) → MARK(N)
A__U41(tt, M, N) → MARK(M)
MARK(U11(X1, X2)) → A__U11(mark(X1), X2)
A__X(N, s(M)) → A__U41(a__and(a__isNat(M), isNat(N)), M, N)
MARK(U21(X1, X2, X3)) → MARK(X1)
A__PLUS(N, 0) → A__U11(a__isNat(N), N)
MARK(U31(X)) → A__U31(mark(X))
MARK(U41(X1, X2, X3)) → A__U41(mark(X1), X2, X3)
A__ISNAT(s(V1)) → A__ISNAT(V1)
MARK(x(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)
MARK(and(X1, X2)) → A__AND(mark(X1), X2)
A__X(N, 0) → A__ISNAT(N)
A__U41(tt, M, N) → A__X(mark(N), mark(M))
A__X(N, 0) → A__U31(a__isNat(N))
MARK(U11(X1, X2)) → MARK(X1)
A__U41(tt, M, N) → MARK(N)
A__PLUS(N, s(M)) → A__ISNAT(M)
MARK(plus(X1, X2)) → MARK(X1)
A__ISNAT(x(V1, V2)) → A__AND(a__isNat(V1), isNat(V2))

The TRS R consists of the following rules:

a__U11(tt, N) → mark(N)
a__U21(tt, M, N) → s(a__plus(mark(N), mark(M)))
a__U31(tt) → 0
a__U41(tt, M, N) → a__plus(a__x(mark(N), mark(M)), mark(N))
a__and(tt, X) → mark(X)
a__isNat(0) → tt
a__isNat(plus(V1, V2)) → a__and(a__isNat(V1), isNat(V2))
a__isNat(s(V1)) → a__isNat(V1)
a__isNat(x(V1, V2)) → a__and(a__isNat(V1), isNat(V2))
a__plus(N, 0) → a__U11(a__isNat(N), N)
a__plus(N, s(M)) → a__U21(a__and(a__isNat(M), isNat(N)), M, N)
a__x(N, 0) → a__U31(a__isNat(N))
a__x(N, s(M)) → a__U41(a__and(a__isNat(M), isNat(N)), M, N)
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(U21(X1, X2, X3)) → a__U21(mark(X1), X2, X3)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(U31(X)) → a__U31(mark(X))
mark(U41(X1, X2, X3)) → a__U41(mark(X1), X2, X3)
mark(x(X1, X2)) → a__x(mark(X1), mark(X2))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(0) → 0
a__U11(X1, X2) → U11(X1, X2)
a__U21(X1, X2, X3) → U21(X1, X2, X3)
a__plus(X1, X2) → plus(X1, X2)
a__U31(X) → U31(X)
a__U41(X1, X2, X3) → U41(X1, X2, X3)
a__x(X1, X2) → x(X1, X2)
a__and(X1, X2) → and(X1, X2)
a__isNat(X) → isNat(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 2 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

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

MARK(x(X1, X2)) → A__X(mark(X1), mark(X2))
A__PLUS(N, 0) → A__ISNAT(N)
A__X(N, s(M)) → A__AND(a__isNat(M), isNat(N))
A__U21(tt, M, N) → MARK(M)
A__PLUS(N, s(M)) → A__AND(a__isNat(M), isNat(N))
A__ISNAT(plus(V1, V2)) → A__ISNAT(V1)
A__U21(tt, M, N) → A__PLUS(mark(N), mark(M))
A__ISNAT(x(V1, V2)) → A__ISNAT(V1)
MARK(U31(X)) → MARK(X)
MARK(U21(X1, X2, X3)) → A__U21(mark(X1), X2, X3)
MARK(plus(X1, X2)) → MARK(X2)
MARK(x(X1, X2)) → MARK(X2)
A__X(N, s(M)) → A__ISNAT(M)
A__U11(tt, N) → MARK(N)
MARK(isNat(X)) → A__ISNAT(X)
A__PLUS(N, s(M)) → A__U21(a__and(a__isNat(M), isNat(N)), M, N)
A__ISNAT(plus(V1, V2)) → A__AND(a__isNat(V1), isNat(V2))
MARK(plus(X1, X2)) → A__PLUS(mark(X1), mark(X2))
A__AND(tt, X) → MARK(X)
MARK(U41(X1, X2, X3)) → MARK(X1)
A__U41(tt, M, N) → A__PLUS(a__x(mark(N), mark(M)), mark(N))
MARK(and(X1, X2)) → MARK(X1)
A__U21(tt, M, N) → MARK(N)
A__U41(tt, M, N) → MARK(M)
MARK(U11(X1, X2)) → A__U11(mark(X1), X2)
A__X(N, s(M)) → A__U41(a__and(a__isNat(M), isNat(N)), M, N)
MARK(U21(X1, X2, X3)) → MARK(X1)
A__PLUS(N, 0) → A__U11(a__isNat(N), N)
MARK(U41(X1, X2, X3)) → A__U41(mark(X1), X2, X3)
A__ISNAT(s(V1)) → A__ISNAT(V1)
MARK(x(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)
MARK(and(X1, X2)) → A__AND(mark(X1), X2)
A__X(N, 0) → A__ISNAT(N)
A__U41(tt, M, N) → A__X(mark(N), mark(M))
A__U41(tt, M, N) → MARK(N)
MARK(U11(X1, X2)) → MARK(X1)
A__PLUS(N, s(M)) → A__ISNAT(M)
MARK(plus(X1, X2)) → MARK(X1)
A__ISNAT(x(V1, V2)) → A__AND(a__isNat(V1), isNat(V2))

The TRS R consists of the following rules:

a__U11(tt, N) → mark(N)
a__U21(tt, M, N) → s(a__plus(mark(N), mark(M)))
a__U31(tt) → 0
a__U41(tt, M, N) → a__plus(a__x(mark(N), mark(M)), mark(N))
a__and(tt, X) → mark(X)
a__isNat(0) → tt
a__isNat(plus(V1, V2)) → a__and(a__isNat(V1), isNat(V2))
a__isNat(s(V1)) → a__isNat(V1)
a__isNat(x(V1, V2)) → a__and(a__isNat(V1), isNat(V2))
a__plus(N, 0) → a__U11(a__isNat(N), N)
a__plus(N, s(M)) → a__U21(a__and(a__isNat(M), isNat(N)), M, N)
a__x(N, 0) → a__U31(a__isNat(N))
a__x(N, s(M)) → a__U41(a__and(a__isNat(M), isNat(N)), M, N)
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(U21(X1, X2, X3)) → a__U21(mark(X1), X2, X3)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(U31(X)) → a__U31(mark(X))
mark(U41(X1, X2, X3)) → a__U41(mark(X1), X2, X3)
mark(x(X1, X2)) → a__x(mark(X1), mark(X2))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(0) → 0
a__U11(X1, X2) → U11(X1, X2)
a__U21(X1, X2, X3) → U21(X1, X2, X3)
a__plus(X1, X2) → plus(X1, X2)
a__U31(X) → U31(X)
a__U41(X1, X2, X3) → U41(X1, X2, X3)
a__x(X1, X2) → x(X1, X2)
a__and(X1, X2) → and(X1, X2)
a__isNat(X) → isNat(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We use the reduction pair processor [15].

The following pairs can be oriented strictly and are deleted.

MARK(x(X1, X2)) → A__X(mark(X1), mark(X2))
A__PLUS(N, 0) → A__ISNAT(N)
A__X(N, s(M)) → A__AND(a__isNat(M), isNat(N))
A__U21(tt, M, N) → MARK(M)
A__PLUS(N, s(M)) → A__AND(a__isNat(M), isNat(N))
A__ISNAT(plus(V1, V2)) → A__ISNAT(V1)
A__ISNAT(x(V1, V2)) → A__ISNAT(V1)
MARK(U21(X1, X2, X3)) → A__U21(mark(X1), X2, X3)
MARK(plus(X1, X2)) → MARK(X2)
MARK(x(X1, X2)) → MARK(X2)
A__X(N, s(M)) → A__ISNAT(M)
A__PLUS(N, s(M)) → A__U21(a__and(a__isNat(M), isNat(N)), M, N)
A__ISNAT(plus(V1, V2)) → A__AND(a__isNat(V1), isNat(V2))
MARK(plus(X1, X2)) → A__PLUS(mark(X1), mark(X2))
A__AND(tt, X) → MARK(X)
MARK(U41(X1, X2, X3)) → MARK(X1)
A__U41(tt, M, N) → A__PLUS(a__x(mark(N), mark(M)), mark(N))
MARK(and(X1, X2)) → MARK(X1)
A__U21(tt, M, N) → MARK(N)
A__U41(tt, M, N) → MARK(M)
MARK(U11(X1, X2)) → A__U11(mark(X1), X2)
A__X(N, s(M)) → A__U41(a__and(a__isNat(M), isNat(N)), M, N)
MARK(U21(X1, X2, X3)) → MARK(X1)
A__PLUS(N, 0) → A__U11(a__isNat(N), N)
MARK(U41(X1, X2, X3)) → A__U41(mark(X1), X2, X3)
A__ISNAT(s(V1)) → A__ISNAT(V1)
MARK(x(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)
MARK(and(X1, X2)) → A__AND(mark(X1), X2)
A__X(N, 0) → A__ISNAT(N)
A__U41(tt, M, N) → A__X(mark(N), mark(M))
A__U41(tt, M, N) → MARK(N)
MARK(U11(X1, X2)) → MARK(X1)
A__PLUS(N, s(M)) → A__ISNAT(M)
MARK(plus(X1, X2)) → MARK(X1)
A__ISNAT(x(V1, V2)) → A__AND(a__isNat(V1), isNat(V2))

The remaining pairs can at least be oriented weakly.

A__U21(tt, M, N) → A__PLUS(mark(N), mark(M))
MARK(U31(X)) → MARK(X)
A__U11(tt, N) → MARK(N)
MARK(isNat(X)) → A__ISNAT(X)

Used ordering: Combined order from the following AFS and order.
MARK(x1) = MARK(x1)
x(x1, x2) = x(x1, x2)
A__X(x1, x2) = A__X(x1, x2)
mark(x1) = x1
A__PLUS(x1, x2) = A__PLUS(x1, x2)
0 = 0
A__ISNAT(x1) = A__ISNAT(x1)
s(x1) = s(x1)
A__AND(x1, x2) = A__AND(x1, x2)
a__isNat(x1) = x1
isNat(x1) = x1
A__U21(x1, x2, x3) = A__U21(x2, x3)
tt = tt
plus(x1, x2) = plus(x1, x2)
U31(x1) = x1
U21(x1, x2, x3) = U21(x1, x2, x3)
A__U11(x1, x2) = A__U11(x2)
a__and(x1, x2) = a__and(x1, x2)
U41(x1, x2, x3) = U41(x1, x2, x3)
A__U41(x1, x2, x3) = A__U41(x1, x2, x3)
a__x(x1, x2) = a__x(x1, x2)
and(x1, x2) = and(x1, x2)
U11(x1, x2) = U11(x1, x2)
a__U31(x1) = x1
a__U41(x1, x2, x3) = a__U41(x1, x2, x3)
a__U21(x1, x2, x3) = a__U21(x1, x2, x3)
a__plus(x1, x2) = a__plus(x1, x2)
a__U11(x1, x2) = a__U11(x1, x2)

Recursive path order with status [2].
Quasi-Precedence:

[x₂, A_{_X₂}, U41₃, A_{_U41₃}, a_{_x₂}, a_{_{U41_3]}} > [MARK₁, A_{_PLUS₂}, A_{_ISNAT₁}, A_{_AND₂}, A_{_U21₂}, A_{_{U11_1]}} > [a_{_and₂}, and₂, U11₂, a_{_{U11_2]}}
[x₂, A_{_X₂}, U41₃, A_{_U41₃}, a_{_x₂}, a_{_{U41_3]}} > [plus₂, U21₃, a_{_U21₃}, a_{_{plus_2]}} > s₁ > [a_{_and₂}, and₂, U11₂, a_{_{U11_2]}}
[0, tt] > [plus₂, U21₃, a_{_U21₃}, a_{_{plus_2]}} > s₁ > [a_{_and₂}, and₂, U11₂, a_{_{U11_2]}}

Status:

a_{_U41₃}: [2,3,1]
a_{_U11₂}: multiset
A_{_U11₁}: multiset
U21₃: [3,2,1]
A_{_AND₂}: multiset
MARK₁: multiset
0: multiset
a_{_plus₂}: [1,2]
U41₃: [2,3,1]
x₂: [2,1]
A_{_X₂}: [2,1]
A_{_ISNAT₁}: multiset
tt: multiset
a_{_and₂}: multiset
a_{_x₂}: [2,1]
U11₂: multiset
A_{_U21₂}: multiset
and₂: multiset
a_{_U21₃}: [3,2,1]
plus₂: [1,2]
A_{_U41₃}: [2,3,1]
s₁: multiset
A_{_PLUS₂}: multiset

The following usable rules [17] were oriented:

a__x(N, 0) → a__U31(a__isNat(N))
a__and(X1, X2) → and(X1, X2)
a__U31(X) → U31(X)
mark(U31(X)) → a__U31(mark(X))
mark(s(X)) → s(mark(X))
a__U41(X1, X2, X3) → U41(X1, X2, X3)
a__U21(tt, M, N) → s(a__plus(mark(N), mark(M)))
mark(tt) → tt
a__plus(N, s(M)) → a__U21(a__and(a__isNat(M), isNat(N)), M, N)
a__x(X1, X2) → x(X1, X2)
a__plus(X1, X2) → plus(X1, X2)
mark(0) → 0
a__isNat(X) → isNat(X)
a__U31(tt) → 0
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(U41(X1, X2, X3)) → a__U41(mark(X1), X2, X3)
a__U11(tt, N) → mark(N)
a__isNat(x(V1, V2)) → a__and(a__isNat(V1), isNat(V2))
a__x(N, s(M)) → a__U41(a__and(a__isNat(M), isNat(N)), M, N)
mark(x(X1, X2)) → a__x(mark(X1), mark(X2))
a__and(tt, X) → mark(X)
a__U41(tt, M, N) → a__plus(a__x(mark(N), mark(M)), mark(N))
mark(isNat(X)) → a__isNat(X)
a__isNat(s(V1)) → a__isNat(V1)
a__plus(N, 0) → a__U11(a__isNat(N), N)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
a__isNat(plus(V1, V2)) → a__and(a__isNat(V1), isNat(V2))
a__U21(X1, X2, X3) → U21(X1, X2, X3)
mark(U21(X1, X2, X3)) → a__U21(mark(X1), X2, X3)
a__U11(X1, X2) → U11(X1, X2)
a__isNat(0) → tt

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ DependencyGraphProof

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

A__U11(tt, N) → MARK(N)
MARK(isNat(X)) → A__ISNAT(X)
A__U21(tt, M, N) → A__PLUS(mark(N), mark(M))
MARK(U31(X)) → MARK(X)

The TRS R consists of the following rules:

a__U11(tt, N) → mark(N)
a__U21(tt, M, N) → s(a__plus(mark(N), mark(M)))
a__U31(tt) → 0
a__U41(tt, M, N) → a__plus(a__x(mark(N), mark(M)), mark(N))
a__and(tt, X) → mark(X)
a__isNat(0) → tt
a__isNat(plus(V1, V2)) → a__and(a__isNat(V1), isNat(V2))
a__isNat(s(V1)) → a__isNat(V1)
a__isNat(x(V1, V2)) → a__and(a__isNat(V1), isNat(V2))
a__plus(N, 0) → a__U11(a__isNat(N), N)
a__plus(N, s(M)) → a__U21(a__and(a__isNat(M), isNat(N)), M, N)
a__x(N, 0) → a__U31(a__isNat(N))
a__x(N, s(M)) → a__U41(a__and(a__isNat(M), isNat(N)), M, N)
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(U21(X1, X2, X3)) → a__U21(mark(X1), X2, X3)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(U31(X)) → a__U31(mark(X))
mark(U41(X1, X2, X3)) → a__U41(mark(X1), X2, X3)
mark(x(X1, X2)) → a__x(mark(X1), mark(X2))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(0) → 0
a__U11(X1, X2) → U11(X1, X2)
a__U21(X1, X2, X3) → U21(X1, X2, X3)
a__plus(X1, X2) → plus(X1, X2)
a__U31(X) → U31(X)
a__U41(X1, X2, X3) → U41(X1, X2, X3)
a__x(X1, X2) → x(X1, X2)
a__and(X1, X2) → and(X1, X2)
a__isNat(X) → isNat(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph [15,17,22] contains 1 SCC with 3 less nodes.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ QDP

                  ↳ UsableRulesProof

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

MARK(U31(X)) → MARK(X)

The TRS R consists of the following rules:

a__U11(tt, N) → mark(N)
a__U21(tt, M, N) → s(a__plus(mark(N), mark(M)))
a__U31(tt) → 0
a__U41(tt, M, N) → a__plus(a__x(mark(N), mark(M)), mark(N))
a__and(tt, X) → mark(X)
a__isNat(0) → tt
a__isNat(plus(V1, V2)) → a__and(a__isNat(V1), isNat(V2))
a__isNat(s(V1)) → a__isNat(V1)
a__isNat(x(V1, V2)) → a__and(a__isNat(V1), isNat(V2))
a__plus(N, 0) → a__U11(a__isNat(N), N)
a__plus(N, s(M)) → a__U21(a__and(a__isNat(M), isNat(N)), M, N)
a__x(N, 0) → a__U31(a__isNat(N))
a__x(N, s(M)) → a__U41(a__and(a__isNat(M), isNat(N)), M, N)
mark(U11(X1, X2)) → a__U11(mark(X1), X2)
mark(U21(X1, X2, X3)) → a__U21(mark(X1), X2, X3)
mark(plus(X1, X2)) → a__plus(mark(X1), mark(X2))
mark(U31(X)) → a__U31(mark(X))
mark(U41(X1, X2, X3)) → a__U41(mark(X1), X2, X3)
mark(x(X1, X2)) → a__x(mark(X1), mark(X2))
mark(and(X1, X2)) → a__and(mark(X1), X2)
mark(isNat(X)) → a__isNat(X)
mark(tt) → tt
mark(s(X)) → s(mark(X))
mark(0) → 0
a__U11(X1, X2) → U11(X1, X2)
a__U21(X1, X2, X3) → U21(X1, X2, X3)
a__plus(X1, X2) → plus(X1, X2)
a__U31(X) → U31(X)
a__U41(X1, X2, X3) → U41(X1, X2, X3)
a__x(X1, X2) → x(X1, X2)
a__and(X1, X2) → and(X1, X2)
a__isNat(X) → isNat(X)

Q is empty.
We have to consider all minimal (P,Q,R)-chains.
We can use the usable rules and reduction pair processor [15] with the Ce-compatible extension of the polynomial order that maps every function symbol to the sum of its argument. Then, we can delete all non-usable rules [17] from R.

↳ QTRS

  ↳ DependencyPairsProof

    ↳ QDP

      ↳ DependencyGraphProof

        ↳ QDP

          ↳ QDPOrderProof

            ↳ QDP

              ↳ DependencyGraphProof

                ↳ QDP

                  ↳ UsableRulesProof

                    ↳ QDP

                      ↳ QDPSizeChangeProof

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

MARK(U31(X)) → MARK(X)

R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
By using the subterm criterion [20] together with the size-change analysis [32] we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

MARK(U31(X)) → MARK(X)
The graph contains the following edges 1 > 1