(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) QDPSizeChangeProof (EQUIVALENT transformation)

We used the following order and afs together with the size-change analysis [AAECC05] to show that there are no infinite chains for this DP problem.

Order:Homeomorphic Embedding Order

AFS:
cons(x1, x2)  =  cons(x2)

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

  • REV1(X, cons(Y, L)) → REV1(Y, L) (allowed arguments on rhs = {1, 2})
    The graph contains the following edges 2 > 2

We oriented the following set of usable rules [AAECC05,FROCOS05]. none

(7) TRUE

(8) 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.

(9) QDPSizeChangeProof (EQUIVALENT transformation)

We used the following order together with the size-change analysis [AAECC05] to show that there are no infinite chains for this DP problem.

Order:Polynomial interpretation [POLO]:


POL(0) = 0   
POL(cons(x1, x2)) = 1 + x2   
POL(nil) = 0   
POL(rev(x1)) = x1   
POL(rev1(x1, x2)) = 0   
POL(rev2(x1, x2)) = x2   
POL(s(x1)) = 0   

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

  • REV2(X, cons(Y, L)) → REV2(Y, L) (allowed arguments on rhs = {1, 2})
    The graph contains the following edges 2 > 2

  • REV(cons(X, L)) → REV2(X, L) (allowed arguments on rhs = {1, 2})
    The graph contains the following edges 1 > 2

  • REV2(X, cons(Y, L)) → REV(cons(X, rev(rev2(Y, L)))) (allowed arguments on rhs = {1})
    The graph contains the following edges 2 >= 1

  • REV2(X, cons(Y, L)) → REV(rev2(Y, L)) (allowed arguments on rhs = {1})
    The graph contains the following edges 2 > 1

We oriented the following set of usable rules [AAECC05,FROCOS05].


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))

(10) TRUE