(0) Obligation:

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

rev1(0, nil) → 0
rev1(s(X), nil) → s(X)
rev1(X, cons(Y, L)) → rev1(Y, L)
rev(nil) → nil
rev(cons(X, L)) → cons(rev1(X, L), rev2(X, L))
rev2(X, nil) → nil
rev2(X, cons(Y, L)) → rev(cons(X, rev(rev2(Y, L))))

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:

REV1(X, cons(Y, L)) → REV1(Y, L)
REV(cons(X, L)) → REV1(X, L)
REV(cons(X, L)) → REV2(X, L)
REV2(X, cons(Y, L)) → REV(cons(X, rev(rev2(Y, L))))
REV2(X, cons(Y, L)) → REV(rev2(Y, L))
REV2(X, cons(Y, L)) → REV2(Y, L)

The TRS R consists of the following rules:

rev1(0, nil) → 0
rev1(s(X), nil) → s(X)
rev1(X, cons(Y, L)) → rev1(Y, L)
rev(nil) → nil
rev(cons(X, L)) → cons(rev1(X, L), rev2(X, L))
rev2(X, nil) → nil
rev2(X, cons(Y, L)) → rev(cons(X, rev(rev2(Y, L))))

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 2 SCCs with 1 less node.

(4) Complex Obligation (AND)

(5) Obligation:

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

REV1(X, cons(Y, L)) → REV1(Y, L)

The TRS R consists of the following rules:

rev1(0, nil) → 0
rev1(s(X), nil) → s(X)
rev1(X, cons(Y, L)) → rev1(Y, L)
rev(nil) → nil
rev(cons(X, L)) → cons(rev1(X, L), rev2(X, L))
rev2(X, nil) → nil
rev2(X, cons(Y, L)) → rev(cons(X, rev(rev2(Y, L))))

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.


REV1(X, cons(Y, L)) → REV1(Y, L)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Quasi-Precedence:
cons2 > REV12

Status:
REV12: multiset
cons2: multiset


The following usable rules [FROCOS05] were oriented: none

(7) Obligation:

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

rev1(0, nil) → 0
rev1(s(X), nil) → s(X)
rev1(X, cons(Y, L)) → rev1(Y, L)
rev(nil) → nil
rev(cons(X, L)) → cons(rev1(X, L), rev2(X, L))
rev2(X, nil) → nil
rev2(X, cons(Y, L)) → rev(cons(X, rev(rev2(Y, L))))

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:

REV(cons(X, L)) → REV2(X, L)
REV2(X, cons(Y, L)) → REV(cons(X, rev(rev2(Y, L))))
REV2(X, cons(Y, L)) → REV(rev2(Y, L))
REV2(X, cons(Y, L)) → REV2(Y, L)

The TRS R consists of the following rules:

rev1(0, nil) → 0
rev1(s(X), nil) → s(X)
rev1(X, cons(Y, L)) → rev1(Y, L)
rev(nil) → nil
rev(cons(X, L)) → cons(rev1(X, L), rev2(X, L))
rev2(X, nil) → nil
rev2(X, cons(Y, L)) → rev(cons(X, rev(rev2(Y, L))))

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.


REV(cons(X, L)) → REV2(X, L)
REV2(X, cons(Y, L)) → REV(cons(X, rev(rev2(Y, L))))
REV2(X, cons(Y, L)) → REV(rev2(Y, L))
REV2(X, cons(Y, L)) → REV2(Y, L)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
REV(x1)  =  x1
cons(x1, x2)  =  cons(x2)
REV2(x1, x2)  =  REV2(x2)
rev(x1)  =  x1
rev2(x1, x2)  =  x2
nil  =  nil
rev1(x1, x2)  =  rev1
0  =  0
s(x1)  =  s(x1)

Recursive path order with status [RPO].
Quasi-Precedence:
cons1 > [REV21, rev1]
nil > [REV21, rev1]
0 > [REV21, rev1]
s1 > [REV21, rev1]

Status:
cons1: multiset
REV21: multiset
nil: multiset
rev1: multiset
0: multiset
s1: multiset


The following usable rules [FROCOS05] were oriented:

rev2(X, nil) → nil
rev2(X, cons(Y, L)) → rev(cons(X, rev(rev2(Y, L))))
rev(nil) → nil
rev(cons(X, L)) → cons(rev1(X, L), rev2(X, L))

(12) Obligation:

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

rev1(0, nil) → 0
rev1(s(X), nil) → s(X)
rev1(X, cons(Y, L)) → rev1(Y, L)
rev(nil) → nil
rev(cons(X, L)) → cons(rev1(X, L), rev2(X, L))
rev2(X, nil) → nil
rev2(X, cons(Y, L)) → rev(cons(X, rev(rev2(Y, L))))

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

(13) PisEmptyProof (EQUIVALENT transformation)

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

(14) TRUE