(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
and(tt, X) → activate(X)
plus(N, 0) → N
plus(N, s(M)) → s(plus(N, M))
activate(X) → X
Q is empty.
(1) Overlay + Local Confluence (EQUIVALENT transformation)
The TRS is overlay and locally confluent. By [NOC] we can switch to innermost.
(2) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
and(tt, X) → activate(X)
plus(N, 0) → N
plus(N, s(M)) → s(plus(N, M))
activate(X) → X
The set Q consists of the following terms:
and(tt, x0)
plus(x0, 0)
plus(x0, s(x1))
activate(x0)
(3) DependencyPairsProof (EQUIVALENT transformation)
Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
(4) Obligation:
Q DP problem:
The TRS P consists of the following rules:
AND(tt, X) → ACTIVATE(X)
PLUS(N, s(M)) → PLUS(N, M)
The TRS R consists of the following rules:
and(tt, X) → activate(X)
plus(N, 0) → N
plus(N, s(M)) → s(plus(N, M))
activate(X) → X
The set Q consists of the following terms:
and(tt, x0)
plus(x0, 0)
plus(x0, s(x1))
activate(x0)
We have to consider all minimal (P,Q,R)-chains.
(5) DependencyGraphProof (EQUIVALENT transformation)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node.
(6) Obligation:
Q DP problem:
The TRS P consists of the following rules:
PLUS(N, s(M)) → PLUS(N, M)
The TRS R consists of the following rules:
and(tt, X) → activate(X)
plus(N, 0) → N
plus(N, s(M)) → s(plus(N, M))
activate(X) → X
The set Q consists of the following terms:
and(tt, x0)
plus(x0, 0)
plus(x0, s(x1))
activate(x0)
We have to consider all minimal (P,Q,R)-chains.
(7) QDPOrderProof (EQUIVALENT transformation)
We use the reduction pair processor [LPAR04].
The following pairs can be oriented strictly and are deleted.
PLUS(N, s(M)) → PLUS(N, M)
The remaining pairs can at least be oriented weakly.
Used ordering: Lexicographic Path Order [LPO].
Precedence:
and2 > activate1 > PLUS2
tt > activate1 > PLUS2
plus2 > s1 > PLUS2
0 > PLUS2
The following usable rules [FROCOS05] were oriented:
and(tt, X) → activate(X)
plus(N, 0) → N
plus(N, s(M)) → s(plus(N, M))
activate(X) → X
(8) Obligation:
Q DP problem:
P is empty.
The TRS R consists of the following rules:
and(tt, X) → activate(X)
plus(N, 0) → N
plus(N, s(M)) → s(plus(N, M))
activate(X) → X
The set Q consists of the following terms:
and(tt, x0)
plus(x0, 0)
plus(x0, s(x1))
activate(x0)
We have to consider all minimal (P,Q,R)-chains.
(9) PisEmptyProof (EQUIVALENT transformation)
The TRS P is empty. Hence, there is no (P,Q,R) chain.
(10) TRUE