Termination w.r.t. Q proof of /tmp/tmpm1SE32/ExSec11_1_Luc02a

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

0 QTRS

↳1 DependencyPairsProof (⇔)

↳2 QDP

↳3 QDPOrderProof (⇔)

↳4 QDP

↳5 QDPOrderProof (⇔)

↳6 QDP

↳7 QDPOrderProof (⇔)

↳8 QDP

↳9 DependencyGraphProof (⇔)

↳10 QDP

↳11 QDPOrderProof (⇔)

↳12 QDP

↳13 DependencyGraphProof (⇔)

↳14 AND

  ↳15 QDP

    ↳16 QDPOrderProof (⇔)

    ↳17 QDP

    ↳18 QDPOrderProof (⇔)

    ↳19 QDP

    ↳20 QDPOrderProof (⇔)

    ↳21 QDP

    ↳22 DependencyGraphProof (⇔)

    ↳23 QDP

    ↳24 QDPOrderProof (⇔)

    ↳25 QDP

    ↳26 QDPOrderProof (⇔)

    ↳27 QDP

    ↳28 QDPOrderProof (⇔)

    ↳29 QDP

    ↳30 QDPOrderProof (⇔)

    ↳31 QDP

    ↳32 QDPOrderProof (⇔)

    ↳33 QDP

    ↳34 QDPOrderProof (⇔)

    ↳35 QDP

    ↳36 DependencyGraphProof (⇔)

    ↳37 AND

      ↳38 QDP

        ↳39 QDPOrderProof (⇔)

        ↳40 QDP

        ↳41 QDPOrderProof (⇔)

        ↳42 QDP

        ↳43 QDPOrderProof (⇔)

        ↳44 QDP

        ↳45 DependencyGraphProof (⇔)

        ↳46 TRUE

      ↳47 QDP

        ↳48 QDPOrderProof (⇔)

        ↳49 QDP

        ↳50 PisEmptyProof (⇔)

        ↳51 TRUE

  ↳52 QDP

    ↳53 QDPOrderProof (⇔)

    ↳54 QDP

    ↳55 PisEmptyProof (⇔)

    ↳56 TRUE

(0) Obligation:

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

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(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:

A__TERMS(N) → A__SQR(mark(N))
A__TERMS(N) → MARK(N)
A__SQR(s(X)) → A__ADD(a__sqr(mark(X)), a__dbl(mark(X)))
A__SQR(s(X)) → A__SQR(mark(X))
A__SQR(s(X)) → MARK(X)
A__SQR(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → MARK(X)
A__ADD(0, X) → MARK(X)
A__ADD(s(X), Y) → A__ADD(mark(X), mark(Y))
A__ADD(s(X), Y) → MARK(X)
A__ADD(s(X), Y) → MARK(Y)
A__FIRST(s(X), cons(Y, Z)) → MARK(Y)
A__HALF(s(s(X))) → A__HALF(mark(X))
A__HALF(s(s(X))) → MARK(X)
A__HALF(dbl(X)) → MARK(X)
MARK(terms(X)) → A__TERMS(mark(X))
MARK(terms(X)) → MARK(X)
MARK(sqr(X)) → A__SQR(mark(X))
MARK(sqr(X)) → MARK(X)
MARK(add(X1, X2)) → A__ADD(mark(X1), mark(X2))
MARK(add(X1, X2)) → MARK(X1)
MARK(add(X1, X2)) → MARK(X2)
MARK(dbl(X)) → A__DBL(mark(X))
MARK(dbl(X)) → MARK(X)
MARK(first(X1, X2)) → A__FIRST(mark(X1), mark(X2))
MARK(first(X1, X2)) → MARK(X1)
MARK(first(X1, X2)) → MARK(X2)
MARK(half(X)) → A__HALF(mark(X))
MARK(half(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(recip(X)) → MARK(X)
MARK(s(X)) → MARK(X)

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(3) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(first(X1, X2)) → MARK(X1)

The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:

POL(A__TERMS(x₁)) = 0A + 0A · x₁

POL(A__SQR(x₁)) = -I + 0A · x₁

POL(mark(x₁)) = 0A + 0A · x₁

POL(MARK(x₁)) = 0A + 0A · x₁

POL(s(x₁)) = 0A + 0A · x₁

POL(A__ADD(x₁, x₂)) = 0A + 0A · x₁ + 0A · x₂

POL(a__sqr(x₁)) = 0A + 0A · x₁

POL(a__dbl(x₁)) = 0A + 0A · x₁

POL(A__DBL(x₁)) = -I + 0A · x₁

POL(0) = 0A

POL(A__FIRST(x₁, x₂)) = 1A + -I · x₁ + 0A · x₂

POL(cons(x₁, x₂)) = 0A + 0A · x₁ + -I · x₂

POL(A__HALF(x₁)) = -I + 0A · x₁

POL(dbl(x₁)) = 0A + 0A · x₁

POL(terms(x₁)) = -I + 0A · x₁

POL(sqr(x₁)) = 0A + 0A · x₁

POL(add(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(first(x₁, x₂)) = 1A + 1A · x₁ + 0A · x₂

POL(half(x₁)) = -I + 0A · x₁

POL(recip(x₁)) = 0A + 0A · x₁

POL(a__first(x₁, x₂)) = 1A + 1A · x₁ + 0A · x₂

POL(a__half(x₁)) = 0A + 0A · x₁

POL(a__terms(x₁)) = 0A + 0A · x₁

POL(a__add(x₁, x₂)) = 0A + 0A · x₁ + 0A · x₂

POL(nil) = 1A

The following usable rules [FROCOS05] were oriented:

a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(cons(X1, X2)) → cons(mark(X1), X2)
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(s(0)) → 0
a__half(0) → 0
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(dbl(X)) → mark(X)
a__add(0, X) → mark(X)
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(terms(X)) → a__terms(mark(X))
a__dbl(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__sqr(0) → 0
a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__first(0, X) → nil
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__dbl(s(X)) → s(s(a__dbl(mark(X))))

(4) Obligation:

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

A__TERMS(N) → A__SQR(mark(N))
A__TERMS(N) → MARK(N)
A__SQR(s(X)) → A__ADD(a__sqr(mark(X)), a__dbl(mark(X)))
A__SQR(s(X)) → A__SQR(mark(X))
A__SQR(s(X)) → MARK(X)
A__SQR(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → MARK(X)
A__ADD(0, X) → MARK(X)
A__ADD(s(X), Y) → A__ADD(mark(X), mark(Y))
A__ADD(s(X), Y) → MARK(X)
A__ADD(s(X), Y) → MARK(Y)
A__FIRST(s(X), cons(Y, Z)) → MARK(Y)
A__HALF(s(s(X))) → A__HALF(mark(X))
A__HALF(s(s(X))) → MARK(X)
A__HALF(dbl(X)) → MARK(X)
MARK(terms(X)) → A__TERMS(mark(X))
MARK(terms(X)) → MARK(X)
MARK(sqr(X)) → A__SQR(mark(X))
MARK(sqr(X)) → MARK(X)
MARK(add(X1, X2)) → A__ADD(mark(X1), mark(X2))
MARK(add(X1, X2)) → MARK(X1)
MARK(add(X1, X2)) → MARK(X2)
MARK(dbl(X)) → A__DBL(mark(X))
MARK(dbl(X)) → MARK(X)
MARK(first(X1, X2)) → A__FIRST(mark(X1), mark(X2))
MARK(first(X1, X2)) → MARK(X2)
MARK(half(X)) → A__HALF(mark(X))
MARK(half(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(recip(X)) → MARK(X)
MARK(s(X)) → MARK(X)

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(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.

MARK(first(X1, X2)) → MARK(X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:

POL(A__TERMS(x₁)) = 0A + 0A · x₁

POL(A__SQR(x₁)) = -I + 0A · x₁

POL(mark(x₁)) = -I + 0A · x₁

POL(MARK(x₁)) = -I + 0A · x₁

POL(s(x₁)) = 0A + 0A · x₁

POL(A__ADD(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(a__sqr(x₁)) = -I + 0A · x₁

POL(a__dbl(x₁)) = 0A + 0A · x₁

POL(A__DBL(x₁)) = 0A + 0A · x₁

POL(0) = 0A

POL(A__FIRST(x₁, x₂)) = 0A + 0A · x₁ + 0A · x₂

POL(cons(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(A__HALF(x₁)) = -I + 0A · x₁

POL(dbl(x₁)) = 0A + 0A · x₁

POL(terms(x₁)) = 0A + 0A · x₁

POL(sqr(x₁)) = -I + 0A · x₁

POL(add(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(first(x₁, x₂)) = 0A + 0A · x₁ + 1A · x₂

POL(half(x₁)) = 0A + 0A · x₁

POL(recip(x₁)) = 0A + 0A · x₁

POL(a__first(x₁, x₂)) = 0A + 0A · x₁ + 1A · x₂

POL(a__half(x₁)) = 0A + 0A · x₁

POL(a__terms(x₁)) = 0A + 0A · x₁

POL(a__add(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(nil) = 0A

The following usable rules [FROCOS05] were oriented:

a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(cons(X1, X2)) → cons(mark(X1), X2)
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(s(0)) → 0
a__half(0) → 0
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(dbl(X)) → mark(X)
a__add(0, X) → mark(X)
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(terms(X)) → a__terms(mark(X))
a__dbl(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__sqr(0) → 0
a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__first(0, X) → nil
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__dbl(s(X)) → s(s(a__dbl(mark(X))))

(6) Obligation:

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

A__TERMS(N) → A__SQR(mark(N))
A__TERMS(N) → MARK(N)
A__SQR(s(X)) → A__ADD(a__sqr(mark(X)), a__dbl(mark(X)))
A__SQR(s(X)) → A__SQR(mark(X))
A__SQR(s(X)) → MARK(X)
A__SQR(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → MARK(X)
A__ADD(0, X) → MARK(X)
A__ADD(s(X), Y) → A__ADD(mark(X), mark(Y))
A__ADD(s(X), Y) → MARK(X)
A__ADD(s(X), Y) → MARK(Y)
A__FIRST(s(X), cons(Y, Z)) → MARK(Y)
A__HALF(s(s(X))) → A__HALF(mark(X))
A__HALF(s(s(X))) → MARK(X)
A__HALF(dbl(X)) → MARK(X)
MARK(terms(X)) → A__TERMS(mark(X))
MARK(terms(X)) → MARK(X)
MARK(sqr(X)) → A__SQR(mark(X))
MARK(sqr(X)) → MARK(X)
MARK(add(X1, X2)) → A__ADD(mark(X1), mark(X2))
MARK(add(X1, X2)) → MARK(X1)
MARK(add(X1, X2)) → MARK(X2)
MARK(dbl(X)) → A__DBL(mark(X))
MARK(dbl(X)) → MARK(X)
MARK(first(X1, X2)) → A__FIRST(mark(X1), mark(X2))
MARK(half(X)) → A__HALF(mark(X))
MARK(half(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(recip(X)) → MARK(X)
MARK(s(X)) → MARK(X)

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

Q is empty.
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.

MARK(first(X1, X2)) → A__FIRST(mark(X1), mark(X2))

The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:

POL(A__TERMS(x₁)) = 0A + 0A · x₁

POL(A__SQR(x₁)) = 0A + 0A · x₁

POL(mark(x₁)) = 0A + 0A · x₁

POL(MARK(x₁)) = 0A + 0A · x₁

POL(s(x₁)) = -I + 0A · x₁

POL(A__ADD(x₁, x₂)) = 0A + 0A · x₁ + 0A · x₂

POL(a__sqr(x₁)) = 0A + 0A · x₁

POL(a__dbl(x₁)) = 0A + 0A · x₁

POL(A__DBL(x₁)) = 0A + 0A · x₁

POL(0) = 0A

POL(A__FIRST(x₁, x₂)) = 0A + 0A · x₁ + 0A · x₂

POL(cons(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(A__HALF(x₁)) = 0A + 0A · x₁

POL(dbl(x₁)) = -I + 0A · x₁

POL(terms(x₁)) = -I + 0A · x₁

POL(sqr(x₁)) = -I + 0A · x₁

POL(add(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(first(x₁, x₂)) = 1A + 1A · x₁ + 1A · x₂

POL(half(x₁)) = -I + 0A · x₁

POL(recip(x₁)) = -I + 0A · x₁

POL(a__first(x₁, x₂)) = 1A + 1A · x₁ + 1A · x₂

POL(a__half(x₁)) = 0A + 0A · x₁

POL(a__terms(x₁)) = 0A + 0A · x₁

POL(a__add(x₁, x₂)) = 0A + 0A · x₁ + 0A · x₂

POL(nil) = 1A

The following usable rules [FROCOS05] were oriented:

a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(cons(X1, X2)) → cons(mark(X1), X2)
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(s(0)) → 0
a__half(0) → 0
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(dbl(X)) → mark(X)
a__add(0, X) → mark(X)
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(terms(X)) → a__terms(mark(X))
a__dbl(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__sqr(0) → 0
a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__first(0, X) → nil
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__dbl(s(X)) → s(s(a__dbl(mark(X))))

(8) Obligation:

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

A__TERMS(N) → A__SQR(mark(N))
A__TERMS(N) → MARK(N)
A__SQR(s(X)) → A__ADD(a__sqr(mark(X)), a__dbl(mark(X)))
A__SQR(s(X)) → A__SQR(mark(X))
A__SQR(s(X)) → MARK(X)
A__SQR(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → MARK(X)
A__ADD(0, X) → MARK(X)
A__ADD(s(X), Y) → A__ADD(mark(X), mark(Y))
A__ADD(s(X), Y) → MARK(X)
A__ADD(s(X), Y) → MARK(Y)
A__FIRST(s(X), cons(Y, Z)) → MARK(Y)
A__HALF(s(s(X))) → A__HALF(mark(X))
A__HALF(s(s(X))) → MARK(X)
A__HALF(dbl(X)) → MARK(X)
MARK(terms(X)) → A__TERMS(mark(X))
MARK(terms(X)) → MARK(X)
MARK(sqr(X)) → A__SQR(mark(X))
MARK(sqr(X)) → MARK(X)
MARK(add(X1, X2)) → A__ADD(mark(X1), mark(X2))
MARK(add(X1, X2)) → MARK(X1)
MARK(add(X1, X2)) → MARK(X2)
MARK(dbl(X)) → A__DBL(mark(X))
MARK(dbl(X)) → MARK(X)
MARK(half(X)) → A__HALF(mark(X))
MARK(half(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(recip(X)) → MARK(X)
MARK(s(X)) → MARK(X)

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(9) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node.

(10) Obligation:

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

A__SQR(s(X)) → A__ADD(a__sqr(mark(X)), a__dbl(mark(X)))
A__ADD(0, X) → MARK(X)
MARK(terms(X)) → A__TERMS(mark(X))
A__TERMS(N) → A__SQR(mark(N))
A__SQR(s(X)) → A__SQR(mark(X))
A__SQR(s(X)) → MARK(X)
MARK(terms(X)) → MARK(X)
MARK(sqr(X)) → A__SQR(mark(X))
A__SQR(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → MARK(X)
MARK(sqr(X)) → MARK(X)
MARK(add(X1, X2)) → A__ADD(mark(X1), mark(X2))
A__ADD(s(X), Y) → A__ADD(mark(X), mark(Y))
A__ADD(s(X), Y) → MARK(X)
MARK(add(X1, X2)) → MARK(X1)
MARK(add(X1, X2)) → MARK(X2)
MARK(dbl(X)) → A__DBL(mark(X))
MARK(dbl(X)) → MARK(X)
MARK(half(X)) → A__HALF(mark(X))
A__HALF(s(s(X))) → A__HALF(mark(X))
A__HALF(s(s(X))) → MARK(X)
MARK(half(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(recip(X)) → MARK(X)
MARK(s(X)) → MARK(X)
A__HALF(dbl(X)) → MARK(X)
A__ADD(s(X), Y) → MARK(Y)
A__TERMS(N) → MARK(N)

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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.

MARK(half(X)) → A__HALF(mark(X))
MARK(half(X)) → MARK(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:

POL(A__SQR(x₁)) = 0A + 0A · x₁

POL(s(x₁)) = -I + 0A · x₁

POL(A__ADD(x₁, x₂)) = 0A + 0A · x₁ + 0A · x₂

POL(a__sqr(x₁)) = 0A + 0A · x₁

POL(mark(x₁)) = 0A + 0A · x₁

POL(a__dbl(x₁)) = 0A + 0A · x₁

POL(0) = 0A

POL(MARK(x₁)) = 0A + 0A · x₁

POL(terms(x₁)) = 0A + 0A · x₁

POL(A__TERMS(x₁)) = 0A + 0A · x₁

POL(sqr(x₁)) = -I + 0A · x₁

POL(A__DBL(x₁)) = 0A + 0A · x₁

POL(add(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(dbl(x₁)) = 0A + 0A · x₁

POL(half(x₁)) = 1A + 1A · x₁

POL(A__HALF(x₁)) = 0A + 0A · x₁

POL(cons(x₁, x₂)) = 0A + 0A · x₁ + 0A · x₂

POL(recip(x₁)) = -I + 0A · x₁

POL(a__first(x₁, x₂)) = 2A + 0A · x₁ + 2A · x₂

POL(first(x₁, x₂)) = 2A + 0A · x₁ + 2A · x₂

POL(a__half(x₁)) = 1A + 1A · x₁

POL(a__terms(x₁)) = 0A + 0A · x₁

POL(a__add(x₁, x₂)) = 0A + 0A · x₁ + 0A · x₂

POL(nil) = 0A

The following usable rules [FROCOS05] were oriented:

a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(cons(X1, X2)) → cons(mark(X1), X2)
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(s(0)) → 0
a__half(0) → 0
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(dbl(X)) → mark(X)
a__add(0, X) → mark(X)
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(terms(X)) → a__terms(mark(X))
a__dbl(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__sqr(0) → 0
a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__first(0, X) → nil
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__dbl(s(X)) → s(s(a__dbl(mark(X))))

(12) Obligation:

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

A__SQR(s(X)) → A__ADD(a__sqr(mark(X)), a__dbl(mark(X)))
A__ADD(0, X) → MARK(X)
MARK(terms(X)) → A__TERMS(mark(X))
A__TERMS(N) → A__SQR(mark(N))
A__SQR(s(X)) → A__SQR(mark(X))
A__SQR(s(X)) → MARK(X)
MARK(terms(X)) → MARK(X)
MARK(sqr(X)) → A__SQR(mark(X))
A__SQR(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → MARK(X)
MARK(sqr(X)) → MARK(X)
MARK(add(X1, X2)) → A__ADD(mark(X1), mark(X2))
A__ADD(s(X), Y) → A__ADD(mark(X), mark(Y))
A__ADD(s(X), Y) → MARK(X)
MARK(add(X1, X2)) → MARK(X1)
MARK(add(X1, X2)) → MARK(X2)
MARK(dbl(X)) → A__DBL(mark(X))
MARK(dbl(X)) → MARK(X)
A__HALF(s(s(X))) → A__HALF(mark(X))
A__HALF(s(s(X))) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(recip(X)) → MARK(X)
MARK(s(X)) → MARK(X)
A__HALF(dbl(X)) → MARK(X)
A__ADD(s(X), Y) → MARK(Y)
A__TERMS(N) → MARK(N)

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(13) DependencyGraphProof (EQUIVALENT transformation)

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

(14) Complex Obligation (AND)

(15) Obligation:

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

A__ADD(0, X) → MARK(X)
MARK(terms(X)) → A__TERMS(mark(X))
A__TERMS(N) → A__SQR(mark(N))
A__SQR(s(X)) → A__ADD(a__sqr(mark(X)), a__dbl(mark(X)))
A__ADD(s(X), Y) → A__ADD(mark(X), mark(Y))
A__ADD(s(X), Y) → MARK(X)
MARK(terms(X)) → MARK(X)
MARK(sqr(X)) → A__SQR(mark(X))
A__SQR(s(X)) → A__SQR(mark(X))
A__SQR(s(X)) → MARK(X)
MARK(sqr(X)) → MARK(X)
MARK(add(X1, X2)) → A__ADD(mark(X1), mark(X2))
A__ADD(s(X), Y) → MARK(Y)
MARK(add(X1, X2)) → MARK(X1)
MARK(add(X1, X2)) → MARK(X2)
MARK(dbl(X)) → A__DBL(mark(X))
A__DBL(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → MARK(X)
MARK(dbl(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(recip(X)) → MARK(X)
MARK(s(X)) → MARK(X)
A__SQR(s(X)) → A__DBL(mark(X))
A__TERMS(N) → MARK(N)

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(16) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

A__TERMS(N) → A__SQR(mark(N))

The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:

POL(A__ADD(x₁, x₂)) = 3A + 0A · x₁ + 0A · x₂

POL(0) = 0A

POL(MARK(x₁)) = 3A + 0A · x₁

POL(terms(x₁)) = 0A + 4A · x₁

POL(A__TERMS(x₁)) = 3A + 4A · x₁

POL(mark(x₁)) = -I + 0A · x₁

POL(A__SQR(x₁)) = -I + 3A · x₁

POL(s(x₁)) = 0A + 0A · x₁

POL(a__sqr(x₁)) = 0A + 3A · x₁

POL(a__dbl(x₁)) = 0A + 3A · x₁

POL(sqr(x₁)) = 0A + 3A · x₁

POL(add(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(dbl(x₁)) = 0A + 3A · x₁

POL(A__DBL(x₁)) = -I + 3A · x₁

POL(cons(x₁, x₂)) = -I + 0A · x₁ + -I · x₂

POL(recip(x₁)) = -I + 0A · x₁

POL(a__first(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(first(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(a__half(x₁)) = 0A + 4A · x₁

POL(half(x₁)) = 0A + 4A · x₁

POL(a__terms(x₁)) = 0A + 4A · x₁

POL(a__add(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(nil) = 0A

The following usable rules [FROCOS05] were oriented:

a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(cons(X1, X2)) → cons(mark(X1), X2)
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(s(0)) → 0
a__half(0) → 0
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(dbl(X)) → mark(X)
a__add(0, X) → mark(X)
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(terms(X)) → a__terms(mark(X))
a__dbl(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__sqr(0) → 0
a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__first(0, X) → nil
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__dbl(s(X)) → s(s(a__dbl(mark(X))))

(17) Obligation:

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

A__ADD(0, X) → MARK(X)
MARK(terms(X)) → A__TERMS(mark(X))
A__SQR(s(X)) → A__ADD(a__sqr(mark(X)), a__dbl(mark(X)))
A__ADD(s(X), Y) → A__ADD(mark(X), mark(Y))
A__ADD(s(X), Y) → MARK(X)
MARK(terms(X)) → MARK(X)
MARK(sqr(X)) → A__SQR(mark(X))
A__SQR(s(X)) → A__SQR(mark(X))
A__SQR(s(X)) → MARK(X)
MARK(sqr(X)) → MARK(X)
MARK(add(X1, X2)) → A__ADD(mark(X1), mark(X2))
A__ADD(s(X), Y) → MARK(Y)
MARK(add(X1, X2)) → MARK(X1)
MARK(add(X1, X2)) → MARK(X2)
MARK(dbl(X)) → A__DBL(mark(X))
A__DBL(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → MARK(X)
MARK(dbl(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(recip(X)) → MARK(X)
MARK(s(X)) → MARK(X)
A__SQR(s(X)) → A__DBL(mark(X))
A__TERMS(N) → MARK(N)

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(18) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

A__SQR(s(X)) → MARK(X)
A__SQR(s(X)) → A__DBL(mark(X))

The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:

POL(A__ADD(x₁, x₂)) = 1A + 1A · x₁ + 1A · x₂

POL(0) = 0A

POL(MARK(x₁)) = 1A + 1A · x₁

POL(terms(x₁)) = 0A + 1A · x₁

POL(A__TERMS(x₁)) = 1A + 1A · x₁

POL(mark(x₁)) = -I + 0A · x₁

POL(A__SQR(x₁)) = 1A + 2A · x₁

POL(s(x₁)) = 4A + 0A · x₁

POL(a__sqr(x₁)) = 0A + 1A · x₁

POL(a__dbl(x₁)) = 0A + 0A · x₁

POL(sqr(x₁)) = 0A + 1A · x₁

POL(add(x₁, x₂)) = 0A + 0A · x₁ + 0A · x₂

POL(dbl(x₁)) = 0A + 0A · x₁

POL(A__DBL(x₁)) = 0A + 1A · x₁

POL(cons(x₁, x₂)) = 0A + 0A · x₁ + -I · x₂

POL(recip(x₁)) = -I + 0A · x₁

POL(a__first(x₁, x₂)) = 0A + 0A · x₁ + 0A · x₂

POL(first(x₁, x₂)) = 0A + 0A · x₁ + 0A · x₂

POL(a__half(x₁)) = -I + 0A · x₁

POL(half(x₁)) = -I + 0A · x₁

POL(a__terms(x₁)) = 0A + 1A · x₁

POL(a__add(x₁, x₂)) = 0A + 0A · x₁ + 0A · x₂

POL(nil) = 0A

The following usable rules [FROCOS05] were oriented:

a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(cons(X1, X2)) → cons(mark(X1), X2)
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(s(0)) → 0
a__half(0) → 0
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(dbl(X)) → mark(X)
a__add(0, X) → mark(X)
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(terms(X)) → a__terms(mark(X))
a__dbl(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__sqr(0) → 0
a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__first(0, X) → nil
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__dbl(s(X)) → s(s(a__dbl(mark(X))))

(19) Obligation:

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

A__ADD(0, X) → MARK(X)
MARK(terms(X)) → A__TERMS(mark(X))
A__SQR(s(X)) → A__ADD(a__sqr(mark(X)), a__dbl(mark(X)))
A__ADD(s(X), Y) → A__ADD(mark(X), mark(Y))
A__ADD(s(X), Y) → MARK(X)
MARK(terms(X)) → MARK(X)
MARK(sqr(X)) → A__SQR(mark(X))
A__SQR(s(X)) → A__SQR(mark(X))
MARK(sqr(X)) → MARK(X)
MARK(add(X1, X2)) → A__ADD(mark(X1), mark(X2))
A__ADD(s(X), Y) → MARK(Y)
MARK(add(X1, X2)) → MARK(X1)
MARK(add(X1, X2)) → MARK(X2)
MARK(dbl(X)) → A__DBL(mark(X))
A__DBL(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → MARK(X)
MARK(dbl(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(recip(X)) → MARK(X)
MARK(s(X)) → MARK(X)
A__TERMS(N) → MARK(N)

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(20) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(terms(X)) → A__TERMS(mark(X))
MARK(terms(X)) → MARK(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:

POL(A__ADD(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(0) = 0A

POL(MARK(x₁)) = -I + 0A · x₁

POL(terms(x₁)) = 0A + 1A · x₁

POL(A__TERMS(x₁)) = -I + 0A · x₁

POL(mark(x₁)) = -I + 0A · x₁

POL(A__SQR(x₁)) = 0A + 0A · x₁

POL(s(x₁)) = 0A + 0A · x₁

POL(a__sqr(x₁)) = 0A + 0A · x₁

POL(a__dbl(x₁)) = 0A + 0A · x₁

POL(sqr(x₁)) = 0A + 0A · x₁

POL(add(x₁, x₂)) = 0A + 0A · x₁ + 0A · x₂

POL(dbl(x₁)) = 0A + 0A · x₁

POL(A__DBL(x₁)) = 0A + 0A · x₁

POL(cons(x₁, x₂)) = -I + 0A · x₁ + -I · x₂

POL(recip(x₁)) = -I + 0A · x₁

POL(a__first(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(first(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(a__half(x₁)) = -I + 0A · x₁

POL(half(x₁)) = -I + 0A · x₁

POL(a__terms(x₁)) = 0A + 1A · x₁

POL(a__add(x₁, x₂)) = 0A + 0A · x₁ + 0A · x₂

POL(nil) = 0A

The following usable rules [FROCOS05] were oriented:

a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(cons(X1, X2)) → cons(mark(X1), X2)
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(s(0)) → 0
a__half(0) → 0
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(dbl(X)) → mark(X)
a__add(0, X) → mark(X)
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(terms(X)) → a__terms(mark(X))
a__dbl(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__sqr(0) → 0
a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__first(0, X) → nil
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__dbl(s(X)) → s(s(a__dbl(mark(X))))

(21) Obligation:

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

A__ADD(0, X) → MARK(X)
A__SQR(s(X)) → A__ADD(a__sqr(mark(X)), a__dbl(mark(X)))
A__ADD(s(X), Y) → A__ADD(mark(X), mark(Y))
A__ADD(s(X), Y) → MARK(X)
MARK(sqr(X)) → A__SQR(mark(X))
A__SQR(s(X)) → A__SQR(mark(X))
MARK(sqr(X)) → MARK(X)
MARK(add(X1, X2)) → A__ADD(mark(X1), mark(X2))
A__ADD(s(X), Y) → MARK(Y)
MARK(add(X1, X2)) → MARK(X1)
MARK(add(X1, X2)) → MARK(X2)
MARK(dbl(X)) → A__DBL(mark(X))
A__DBL(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → MARK(X)
MARK(dbl(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(recip(X)) → MARK(X)
MARK(s(X)) → MARK(X)
A__TERMS(N) → MARK(N)

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(22) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 1 less node.

(23) Obligation:

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

MARK(sqr(X)) → A__SQR(mark(X))
A__SQR(s(X)) → A__ADD(a__sqr(mark(X)), a__dbl(mark(X)))
A__ADD(0, X) → MARK(X)
MARK(sqr(X)) → MARK(X)
MARK(add(X1, X2)) → A__ADD(mark(X1), mark(X2))
A__ADD(s(X), Y) → A__ADD(mark(X), mark(Y))
A__ADD(s(X), Y) → MARK(X)
MARK(add(X1, X2)) → MARK(X1)
MARK(add(X1, X2)) → MARK(X2)
MARK(dbl(X)) → A__DBL(mark(X))
A__DBL(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → MARK(X)
MARK(dbl(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(recip(X)) → MARK(X)
MARK(s(X)) → MARK(X)
A__ADD(s(X), Y) → MARK(Y)
A__SQR(s(X)) → A__SQR(mark(X))

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(24) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(recip(X)) → MARK(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:

POL(MARK(x₁)) = 0A + 0A · x₁

POL(sqr(x₁)) = 0A + 0A · x₁

POL(A__SQR(x₁)) = 0A + 0A · x₁

POL(mark(x₁)) = -I + 0A · x₁

POL(s(x₁)) = -I + 0A · x₁

POL(A__ADD(x₁, x₂)) = 0A + 0A · x₁ + 0A · x₂

POL(a__sqr(x₁)) = 0A + 0A · x₁

POL(a__dbl(x₁)) = 0A + 0A · x₁

POL(0) = 0A

POL(add(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(dbl(x₁)) = 0A + 0A · x₁

POL(A__DBL(x₁)) = 0A + 0A · x₁

POL(cons(x₁, x₂)) = -I + 0A · x₁ + -I · x₂

POL(recip(x₁)) = 1A + 1A · x₁

POL(a__first(x₁, x₂)) = -I + 1A · x₁ + 0A · x₂

POL(first(x₁, x₂)) = -I + 1A · x₁ + 0A · x₂

POL(a__half(x₁)) = -I + 0A · x₁

POL(half(x₁)) = -I + 0A · x₁

POL(a__terms(x₁)) = 2A + 1A · x₁

POL(terms(x₁)) = 2A + 1A · x₁

POL(a__add(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(nil) = 0A

The following usable rules [FROCOS05] were oriented:

a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(cons(X1, X2)) → cons(mark(X1), X2)
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(s(0)) → 0
a__half(0) → 0
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(dbl(X)) → mark(X)
a__add(0, X) → mark(X)
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(terms(X)) → a__terms(mark(X))
a__dbl(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__sqr(0) → 0
a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__first(0, X) → nil
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__dbl(s(X)) → s(s(a__dbl(mark(X))))

(25) Obligation:

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

MARK(sqr(X)) → A__SQR(mark(X))
A__SQR(s(X)) → A__ADD(a__sqr(mark(X)), a__dbl(mark(X)))
A__ADD(0, X) → MARK(X)
MARK(sqr(X)) → MARK(X)
MARK(add(X1, X2)) → A__ADD(mark(X1), mark(X2))
A__ADD(s(X), Y) → A__ADD(mark(X), mark(Y))
A__ADD(s(X), Y) → MARK(X)
MARK(add(X1, X2)) → MARK(X1)
MARK(add(X1, X2)) → MARK(X2)
MARK(dbl(X)) → A__DBL(mark(X))
A__DBL(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → MARK(X)
MARK(dbl(X)) → MARK(X)
MARK(cons(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)
A__ADD(s(X), Y) → MARK(Y)
A__SQR(s(X)) → A__SQR(mark(X))

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(26) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(cons(X1, X2)) → MARK(X1)

The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:

POL(MARK(x₁)) = -I + 0A · x₁

POL(sqr(x₁)) = -I + 0A · x₁

POL(A__SQR(x₁)) = -I + 0A · x₁

POL(mark(x₁)) = -I + 0A · x₁

POL(s(x₁)) = 0A + 0A · x₁

POL(A__ADD(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(a__sqr(x₁)) = -I + 0A · x₁

POL(a__dbl(x₁)) = -I + 0A · x₁

POL(0) = 0A

POL(add(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(dbl(x₁)) = -I + 0A · x₁

POL(A__DBL(x₁)) = -I + 0A · x₁

POL(cons(x₁, x₂)) = -I + 1A · x₁ + 0A · x₂

POL(a__first(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(first(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(a__half(x₁)) = 0A + 0A · x₁

POL(half(x₁)) = 0A + 0A · x₁

POL(a__terms(x₁)) = 1A + 0A · x₁

POL(terms(x₁)) = 1A + 0A · x₁

POL(a__add(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(recip(x₁)) = 0A + -I · x₁

POL(nil) = 0A

The following usable rules [FROCOS05] were oriented:

a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(cons(X1, X2)) → cons(mark(X1), X2)
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(s(0)) → 0
a__half(0) → 0
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(dbl(X)) → mark(X)
a__add(0, X) → mark(X)
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(terms(X)) → a__terms(mark(X))
a__dbl(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__sqr(0) → 0
a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__first(0, X) → nil
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__dbl(s(X)) → s(s(a__dbl(mark(X))))

(27) Obligation:

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

MARK(sqr(X)) → A__SQR(mark(X))
A__SQR(s(X)) → A__ADD(a__sqr(mark(X)), a__dbl(mark(X)))
A__ADD(0, X) → MARK(X)
MARK(sqr(X)) → MARK(X)
MARK(add(X1, X2)) → A__ADD(mark(X1), mark(X2))
A__ADD(s(X), Y) → A__ADD(mark(X), mark(Y))
A__ADD(s(X), Y) → MARK(X)
MARK(add(X1, X2)) → MARK(X1)
MARK(add(X1, X2)) → MARK(X2)
MARK(dbl(X)) → A__DBL(mark(X))
A__DBL(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → MARK(X)
MARK(dbl(X)) → MARK(X)
MARK(s(X)) → MARK(X)
A__ADD(s(X), Y) → MARK(Y)
A__SQR(s(X)) → A__SQR(mark(X))

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(28) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(sqr(X)) → MARK(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:

POL(MARK(x₁)) = -I + 0A · x₁

POL(sqr(x₁)) = -I + 1A · x₁

POL(A__SQR(x₁)) = -I + 1A · x₁

POL(mark(x₁)) = -I + 0A · x₁

POL(s(x₁)) = -I + 0A · x₁

POL(A__ADD(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(a__sqr(x₁)) = -I + 1A · x₁

POL(a__dbl(x₁)) = -I + 0A · x₁

POL(0) = 4A

POL(add(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(dbl(x₁)) = -I + 0A · x₁

POL(A__DBL(x₁)) = -I + 0A · x₁

POL(a__first(x₁, x₂)) = -I + 0A · x₁ + 1A · x₂

POL(first(x₁, x₂)) = -I + 0A · x₁ + 1A · x₂

POL(a__half(x₁)) = -I + 3A · x₁

POL(half(x₁)) = -I + 3A · x₁

POL(a__terms(x₁)) = 0A + 0A · x₁

POL(terms(x₁)) = 0A + 0A · x₁

POL(a__add(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(recip(x₁)) = 0A + -I · x₁

POL(nil) = 4A

POL(cons(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

The following usable rules [FROCOS05] were oriented:

a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(cons(X1, X2)) → cons(mark(X1), X2)
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(s(0)) → 0
a__half(0) → 0
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(dbl(X)) → mark(X)
a__add(0, X) → mark(X)
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(terms(X)) → a__terms(mark(X))
a__dbl(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__sqr(0) → 0
a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__first(0, X) → nil
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__dbl(s(X)) → s(s(a__dbl(mark(X))))

(29) Obligation:

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

MARK(sqr(X)) → A__SQR(mark(X))
A__SQR(s(X)) → A__ADD(a__sqr(mark(X)), a__dbl(mark(X)))
A__ADD(0, X) → MARK(X)
MARK(add(X1, X2)) → A__ADD(mark(X1), mark(X2))
A__ADD(s(X), Y) → A__ADD(mark(X), mark(Y))
A__ADD(s(X), Y) → MARK(X)
MARK(add(X1, X2)) → MARK(X1)
MARK(add(X1, X2)) → MARK(X2)
MARK(dbl(X)) → A__DBL(mark(X))
A__DBL(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → MARK(X)
MARK(dbl(X)) → MARK(X)
MARK(s(X)) → MARK(X)
A__ADD(s(X), Y) → MARK(Y)
A__SQR(s(X)) → A__SQR(mark(X))

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(30) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(dbl(X)) → MARK(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:

POL(MARK(x₁)) = -I + 0A · x₁

POL(sqr(x₁)) = 0A + 2A · x₁

POL(A__SQR(x₁)) = 0A + 2A · x₁

POL(mark(x₁)) = -I + 0A · x₁

POL(s(x₁)) = -I + 0A · x₁

POL(A__ADD(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(a__sqr(x₁)) = 0A + 2A · x₁

POL(a__dbl(x₁)) = 0A + 2A · x₁

POL(0) = 0A

POL(add(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(dbl(x₁)) = 0A + 2A · x₁

POL(A__DBL(x₁)) = 0A + 0A · x₁

POL(a__first(x₁, x₂)) = 2A + 0A · x₁ + -I · x₂

POL(first(x₁, x₂)) = 2A + 0A · x₁ + -I · x₂

POL(a__half(x₁)) = 0A + 0A · x₁

POL(half(x₁)) = 0A + 0A · x₁

POL(a__terms(x₁)) = 2A + -I · x₁

POL(terms(x₁)) = 2A + -I · x₁

POL(a__add(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(recip(x₁)) = 0A + -I · x₁

POL(nil) = 2A

POL(cons(x₁, x₂)) = 2A + -I · x₁ + -I · x₂

The following usable rules [FROCOS05] were oriented:

a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(cons(X1, X2)) → cons(mark(X1), X2)
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(s(0)) → 0
a__half(0) → 0
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(dbl(X)) → mark(X)
a__add(0, X) → mark(X)
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(terms(X)) → a__terms(mark(X))
a__dbl(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__sqr(0) → 0
a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__first(0, X) → nil
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__dbl(s(X)) → s(s(a__dbl(mark(X))))

(31) Obligation:

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

MARK(sqr(X)) → A__SQR(mark(X))
A__SQR(s(X)) → A__ADD(a__sqr(mark(X)), a__dbl(mark(X)))
A__ADD(0, X) → MARK(X)
MARK(add(X1, X2)) → A__ADD(mark(X1), mark(X2))
A__ADD(s(X), Y) → A__ADD(mark(X), mark(Y))
A__ADD(s(X), Y) → MARK(X)
MARK(add(X1, X2)) → MARK(X1)
MARK(add(X1, X2)) → MARK(X2)
MARK(dbl(X)) → A__DBL(mark(X))
A__DBL(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → MARK(X)
MARK(s(X)) → MARK(X)
A__ADD(s(X), Y) → MARK(Y)
A__SQR(s(X)) → A__SQR(mark(X))

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(32) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

A__ADD(0, X) → MARK(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:

POL(MARK(x₁)) = 0A + 0A · x₁

POL(sqr(x₁)) = -I + 1A · x₁

POL(A__SQR(x₁)) = 0A + 1A · x₁

POL(mark(x₁)) = -I + 0A · x₁

POL(s(x₁)) = -I + 0A · x₁

POL(A__ADD(x₁, x₂)) = 0A + 0A · x₁ + 1A · x₂

POL(a__sqr(x₁)) = -I + 1A · x₁

POL(a__dbl(x₁)) = -I + 0A · x₁

POL(0) = 1A

POL(add(x₁, x₂)) = -I + 0A · x₁ + 1A · x₂

POL(dbl(x₁)) = -I + 0A · x₁

POL(A__DBL(x₁)) = 0A + 0A · x₁

POL(a__first(x₁, x₂)) = 0A + -I · x₁ + -I · x₂

POL(first(x₁, x₂)) = 0A + -I · x₁ + -I · x₂

POL(a__half(x₁)) = 0A + 0A · x₁

POL(half(x₁)) = 0A + 0A · x₁

POL(a__terms(x₁)) = 0A + -I · x₁

POL(terms(x₁)) = 0A + -I · x₁

POL(a__add(x₁, x₂)) = -I + 0A · x₁ + 1A · x₂

POL(recip(x₁)) = -I + 0A · x₁

POL(nil) = 0A

POL(cons(x₁, x₂)) = 0A + -I · x₁ + 0A · x₂

The following usable rules [FROCOS05] were oriented:

a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(cons(X1, X2)) → cons(mark(X1), X2)
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(s(0)) → 0
a__half(0) → 0
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(dbl(X)) → mark(X)
a__add(0, X) → mark(X)
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(terms(X)) → a__terms(mark(X))
a__dbl(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__sqr(0) → 0
a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__first(0, X) → nil
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__dbl(s(X)) → s(s(a__dbl(mark(X))))

(33) Obligation:

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

MARK(sqr(X)) → A__SQR(mark(X))
A__SQR(s(X)) → A__ADD(a__sqr(mark(X)), a__dbl(mark(X)))
MARK(add(X1, X2)) → A__ADD(mark(X1), mark(X2))
A__ADD(s(X), Y) → A__ADD(mark(X), mark(Y))
A__ADD(s(X), Y) → MARK(X)
MARK(add(X1, X2)) → MARK(X1)
MARK(add(X1, X2)) → MARK(X2)
MARK(dbl(X)) → A__DBL(mark(X))
A__DBL(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → MARK(X)
MARK(s(X)) → MARK(X)
A__ADD(s(X), Y) → MARK(Y)
A__SQR(s(X)) → A__SQR(mark(X))

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(34) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(dbl(X)) → A__DBL(mark(X))

The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:

POL(MARK(x₁)) = -I + 0A · x₁

POL(sqr(x₁)) = -I + 1A · x₁

POL(A__SQR(x₁)) = -I + 1A · x₁

POL(mark(x₁)) = -I + 0A · x₁

POL(s(x₁)) = -I + 0A · x₁

POL(A__ADD(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(a__sqr(x₁)) = -I + 1A · x₁

POL(a__dbl(x₁)) = -I + 1A · x₁

POL(add(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(dbl(x₁)) = -I + 1A · x₁

POL(A__DBL(x₁)) = -I + 0A · x₁

POL(a__first(x₁, x₂)) = 1A + -I · x₁ + -I · x₂

POL(first(x₁, x₂)) = 1A + -I · x₁ + -I · x₂

POL(a__half(x₁)) = -I + 0A · x₁

POL(half(x₁)) = -I + 0A · x₁

POL(a__terms(x₁)) = -I + 0A · x₁

POL(terms(x₁)) = -I + 0A · x₁

POL(a__add(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(recip(x₁)) = 0A + 0A · x₁

POL(0) = 0A

POL(nil) = 0A

POL(cons(x₁, x₂)) = -I + -I · x₁ + 0A · x₂

The following usable rules [FROCOS05] were oriented:

a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(cons(X1, X2)) → cons(mark(X1), X2)
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(s(0)) → 0
a__half(0) → 0
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(dbl(X)) → mark(X)
a__add(0, X) → mark(X)
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(terms(X)) → a__terms(mark(X))
a__dbl(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__sqr(0) → 0
a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__first(0, X) → nil
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__dbl(s(X)) → s(s(a__dbl(mark(X))))

(35) Obligation:

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

MARK(sqr(X)) → A__SQR(mark(X))
A__SQR(s(X)) → A__ADD(a__sqr(mark(X)), a__dbl(mark(X)))
MARK(add(X1, X2)) → A__ADD(mark(X1), mark(X2))
A__ADD(s(X), Y) → A__ADD(mark(X), mark(Y))
A__ADD(s(X), Y) → MARK(X)
MARK(add(X1, X2)) → MARK(X1)
MARK(add(X1, X2)) → MARK(X2)
A__DBL(s(X)) → A__DBL(mark(X))
A__DBL(s(X)) → MARK(X)
MARK(s(X)) → MARK(X)
A__ADD(s(X), Y) → MARK(Y)
A__SQR(s(X)) → A__SQR(mark(X))

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(36) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 2 SCCs with 1 less node.

(37) Complex Obligation (AND)

(38) Obligation:

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

A__SQR(s(X)) → A__ADD(a__sqr(mark(X)), a__dbl(mark(X)))
A__ADD(s(X), Y) → A__ADD(mark(X), mark(Y))
A__ADD(s(X), Y) → MARK(X)
MARK(sqr(X)) → A__SQR(mark(X))
A__SQR(s(X)) → A__SQR(mark(X))
MARK(add(X1, X2)) → A__ADD(mark(X1), mark(X2))
A__ADD(s(X), Y) → MARK(Y)
MARK(add(X1, X2)) → MARK(X1)
MARK(add(X1, X2)) → MARK(X2)
MARK(s(X)) → MARK(X)

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(39) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

MARK(add(X1, X2)) → MARK(X2)

The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:

POL(A__SQR(x₁)) = 1A + 1A · x₁

POL(s(x₁)) = -I + 0A · x₁

POL(A__ADD(x₁, x₂)) = 0A + 0A · x₁ + 0A · x₂

POL(a__sqr(x₁)) = 1A + 1A · x₁

POL(mark(x₁)) = -I + 0A · x₁

POL(a__dbl(x₁)) = 0A + 0A · x₁

POL(MARK(x₁)) = -I + 0A · x₁

POL(sqr(x₁)) = 1A + 1A · x₁

POL(add(x₁, x₂)) = 1A + 0A · x₁ + 1A · x₂

POL(a__first(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(first(x₁, x₂)) = -I + 0A · x₁ + 0A · x₂

POL(a__half(x₁)) = 0A + 5A · x₁

POL(half(x₁)) = 0A + 5A · x₁

POL(a__terms(x₁)) = 0A + -I · x₁

POL(terms(x₁)) = 0A + -I · x₁

POL(a__add(x₁, x₂)) = 1A + 0A · x₁ + 1A · x₂

POL(dbl(x₁)) = 0A + 0A · x₁

POL(recip(x₁)) = -I + 0A · x₁

POL(0) = 1A

POL(nil) = 0A

POL(cons(x₁, x₂)) = 0A + -I · x₁ + 0A · x₂

The following usable rules [FROCOS05] were oriented:

a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(cons(X1, X2)) → cons(mark(X1), X2)
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(s(0)) → 0
a__half(0) → 0
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(dbl(X)) → mark(X)
a__add(0, X) → mark(X)
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(terms(X)) → a__terms(mark(X))
a__dbl(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__sqr(0) → 0
a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__first(0, X) → nil
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__dbl(s(X)) → s(s(a__dbl(mark(X))))

(40) Obligation:

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

A__SQR(s(X)) → A__ADD(a__sqr(mark(X)), a__dbl(mark(X)))
A__ADD(s(X), Y) → A__ADD(mark(X), mark(Y))
A__ADD(s(X), Y) → MARK(X)
MARK(sqr(X)) → A__SQR(mark(X))
A__SQR(s(X)) → A__SQR(mark(X))
MARK(add(X1, X2)) → A__ADD(mark(X1), mark(X2))
A__ADD(s(X), Y) → MARK(Y)
MARK(add(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(41) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

A__ADD(s(X), Y) → MARK(Y)

The remaining pairs can at least be oriented weakly.
Used ordering: Matrix interpretation [MATRO] with arctic natural numbers [ARCTIC]:

POL(A__SQR(x₁)) = 0A + 1A · x₁

POL(s(x₁)) = 0A + 0A · x₁

POL(A__ADD(x₁, x₂)) = -I + 0A · x₁ + 1A · x₂

POL(a__sqr(x₁)) = 0A + 1A · x₁

POL(mark(x₁)) = -I + 0A · x₁

POL(a__dbl(x₁)) = 0A + 0A · x₁

POL(MARK(x₁)) = -I + 0A · x₁

POL(sqr(x₁)) = 0A + 1A · x₁

POL(add(x₁, x₂)) = 0A + 0A · x₁ + 1A · x₂

POL(a__first(x₁, x₂)) = 0A + -I · x₁ + -I · x₂

POL(first(x₁, x₂)) = 0A + -I · x₁ + -I · x₂

POL(a__half(x₁)) = 0A + 0A · x₁

POL(half(x₁)) = 0A + 0A · x₁

POL(a__terms(x₁)) = 0A + -I · x₁

POL(terms(x₁)) = 0A + -I · x₁

POL(a__add(x₁, x₂)) = 0A + 0A · x₁ + 1A · x₂

POL(dbl(x₁)) = 0A + 0A · x₁

POL(recip(x₁)) = 0A + 0A · x₁

POL(0) = 0A

POL(nil) = 0A

POL(cons(x₁, x₂)) = 0A + -I · x₁ + -I · x₂

The following usable rules [FROCOS05] were oriented:

a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(cons(X1, X2)) → cons(mark(X1), X2)
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(s(0)) → 0
a__half(0) → 0
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(dbl(X)) → mark(X)
a__add(0, X) → mark(X)
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(terms(X)) → a__terms(mark(X))
a__dbl(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__sqr(0) → 0
a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__first(0, X) → nil
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__dbl(s(X)) → s(s(a__dbl(mark(X))))

(42) Obligation:

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

A__SQR(s(X)) → A__ADD(a__sqr(mark(X)), a__dbl(mark(X)))
A__ADD(s(X), Y) → A__ADD(mark(X), mark(Y))
A__ADD(s(X), Y) → MARK(X)
MARK(sqr(X)) → A__SQR(mark(X))
A__SQR(s(X)) → A__SQR(mark(X))
MARK(add(X1, X2)) → A__ADD(mark(X1), mark(X2))
MARK(add(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(43) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

A__SQR(s(X)) → A__ADD(a__sqr(mark(X)), a__dbl(mark(X)))
A__ADD(s(X), Y) → A__ADD(mark(X), mark(Y))
MARK(sqr(X)) → A__SQR(mark(X))
A__SQR(s(X)) → A__SQR(mark(X))
MARK(add(X1, X2)) → A__ADD(mark(X1), mark(X2))
MARK(add(X1, X2)) → MARK(X1)
MARK(s(X)) → MARK(X)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
A__SQR(x1) = A__SQR(x1)
s(x1) = s(x1)
A__ADD(x1, x2) = x1
a__sqr(x1) = a__sqr(x1)
mark(x1) = x1
a__dbl(x1) = a__dbl(x1)
MARK(x1) = MARK(x1)
sqr(x1) = sqr(x1)
add(x1, x2) = add(x1, x2)
a__first(x1, x2) = a__first(x1, x2)
first(x1, x2) = first(x1, x2)
a__half(x1) = x1
half(x1) = x1
a__terms(x1) = a__terms(x1)
terms(x1) = terms(x1)
a__add(x1, x2) = a__add(x1, x2)
dbl(x1) = dbl(x1)
recip(x1) = x1
0 = 0
nil = nil
cons(x1, x2) = cons

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

[A_{_SQR₁}, a_{_sqr₁}, sqr₁] > [a_{_dbl₁}, dbl₁] > [s₁, MARK₁]
[A_{_SQR₁}, a_{_sqr₁}, sqr₁] > [add₂, a_{_add₂}] > [s₁, MARK₁]
[A_{_SQR₁}, a_{_sqr₁}, sqr₁] > 0 > [s₁, MARK₁]
[a_{_first₂}, first₂] > nil > [s₁, MARK₁]
[a_{_first₂}, first₂] > cons > [s₁, MARK₁]
[a_{_terms₁}, terms₁] > cons > [s₁, MARK₁]

Status:

sqr₁: multiset
a_{_dbl₁}: multiset
a_{_add₂}: multiset
first₂: multiset
0: multiset
terms₁: multiset
a_{_first₂}: multiset
add₂: multiset
MARK₁: multiset
cons: multiset
a_{_terms₁}: multiset
dbl₁: multiset
s₁: multiset
A_{_SQR₁}: multiset
nil: multiset
a_{_sqr₁}: multiset

The following usable rules [FROCOS05] were oriented:

a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(cons(X1, X2)) → cons(mark(X1), X2)
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(s(0)) → 0
a__half(0) → 0
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(dbl(X)) → mark(X)
a__add(0, X) → mark(X)
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(terms(X)) → a__terms(mark(X))
a__dbl(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__sqr(0) → 0
a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__first(0, X) → nil
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__dbl(s(X)) → s(s(a__dbl(mark(X))))

(44) Obligation:

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

A__ADD(s(X), Y) → MARK(X)

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(45) DependencyGraphProof (EQUIVALENT transformation)

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

(46) TRUE

(47) Obligation:

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

A__DBL(s(X)) → A__DBL(mark(X))

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(48) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

A__DBL(s(X)) → A__DBL(mark(X))

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
A__DBL(x1) = A__DBL(x1)
s(x1) = s(x1)
mark(x1) = x1
a__first(x1, x2) = x1
first(x1, x2) = x1
a__half(x1) = a__half(x1)
half(x1) = half(x1)
a__terms(x1) = x1
terms(x1) = x1
a__sqr(x1) = a__sqr(x1)
sqr(x1) = sqr(x1)
a__add(x1, x2) = a__add(x1, x2)
add(x1, x2) = add(x1, x2)
a__dbl(x1) = a__dbl(x1)
dbl(x1) = dbl(x1)
recip(x1) = recip(x1)
0 = 0
nil = nil
cons(x1, x2) = cons

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

A_{_DBL₁} > cons
[a_{_sqr₁}, sqr₁] > [a_{_add₂}, add₂] > s₁ > [a_{_half₁}, half₁] > 0 > nil > cons
[a_{_sqr₁}, sqr₁] > [a_{_dbl₁}, dbl₁] > s₁ > [a_{_half₁}, half₁] > 0 > nil > cons
recip₁ > cons

Status:

sqr₁: [1]
a_{_dbl₁}: multiset
a_{_add₂}: multiset
a_{_half₁}: multiset
0: multiset
add₂: multiset
half₁: multiset
cons: multiset
A_{_DBL₁}: multiset
dbl₁: multiset
s₁: [1]
nil: multiset
recip₁: multiset
a_{_sqr₁}: [1]

The following usable rules [FROCOS05] were oriented:

a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(cons(X1, X2)) → cons(mark(X1), X2)
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(s(0)) → 0
a__half(0) → 0
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(dbl(X)) → mark(X)
a__add(0, X) → mark(X)
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(terms(X)) → a__terms(mark(X))
a__dbl(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__sqr(0) → 0
a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__first(0, X) → nil
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__dbl(s(X)) → s(s(a__dbl(mark(X))))

(49) Obligation:

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

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(50) PisEmptyProof (EQUIVALENT transformation)

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

(51) TRUE

(52) Obligation:

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

A__HALF(s(s(X))) → A__HALF(mark(X))

The TRS R consists of the following rules:

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(53) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

A__HALF(s(s(X))) → A__HALF(mark(X))

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
A__HALF(x1) = A__HALF(x1)
s(x1) = s(x1)
mark(x1) = x1
a__first(x1, x2) = x2
first(x1, x2) = x2
a__half(x1) = x1
half(x1) = x1
a__terms(x1) = a__terms
terms(x1) = terms
a__sqr(x1) = a__sqr(x1)
sqr(x1) = sqr(x1)
a__add(x1, x2) = a__add(x1, x2)
add(x1, x2) = add(x1, x2)
a__dbl(x1) = a__dbl(x1)
dbl(x1) = dbl(x1)
recip(x1) = recip
0 = 0
nil = nil
cons(x1, x2) = x1

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

A_{_HALF₁} > [s₁, nil]
[a_{_terms}, terms, recip] > [s₁, nil]
[a_{_sqr₁}, sqr₁] > [a_{_add₂}, add₂] > [s₁, nil]
[a_{_sqr₁}, sqr₁] > [a_{_dbl₁}, dbl₁] > 0 > [s₁, nil]

Status:

sqr₁: multiset
a_{_terms}: []
a_{_dbl₁}: [1]
a_{_add₂}: [2,1]
recip: []
0: multiset
add₂: [2,1]
A_{_HALF₁}: multiset
dbl₁: [1]
s₁: multiset
nil: multiset
a_{_sqr₁}: multiset
terms: []

The following usable rules [FROCOS05] were oriented:

a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(cons(X1, X2)) → cons(mark(X1), X2)
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(s(0)) → 0
a__half(0) → 0
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(dbl(X)) → mark(X)
a__add(0, X) → mark(X)
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(terms(X)) → a__terms(mark(X))
a__dbl(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__sqr(0) → 0
a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__first(0, X) → nil
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__dbl(s(X)) → s(s(a__dbl(mark(X))))

(54) Obligation:

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

a__terms(N) → cons(recip(a__sqr(mark(N))), terms(s(N)))
a__sqr(0) → 0
a__sqr(s(X)) → s(a__add(a__sqr(mark(X)), a__dbl(mark(X))))
a__dbl(0) → 0
a__dbl(s(X)) → s(s(a__dbl(mark(X))))
a__add(0, X) → mark(X)
a__add(s(X), Y) → s(a__add(mark(X), mark(Y)))
a__first(0, X) → nil
a__first(s(X), cons(Y, Z)) → cons(mark(Y), first(X, Z))
a__half(0) → 0
a__half(s(0)) → 0
a__half(s(s(X))) → s(a__half(mark(X)))
a__half(dbl(X)) → mark(X)
mark(terms(X)) → a__terms(mark(X))
mark(sqr(X)) → a__sqr(mark(X))
mark(add(X1, X2)) → a__add(mark(X1), mark(X2))
mark(dbl(X)) → a__dbl(mark(X))
mark(first(X1, X2)) → a__first(mark(X1), mark(X2))
mark(half(X)) → a__half(mark(X))
mark(cons(X1, X2)) → cons(mark(X1), X2)
mark(recip(X)) → recip(mark(X))
mark(s(X)) → s(mark(X))
mark(0) → 0
mark(nil) → nil
a__terms(X) → terms(X)
a__sqr(X) → sqr(X)
a__add(X1, X2) → add(X1, X2)
a__dbl(X) → dbl(X)
a__first(X1, X2) → first(X1, X2)
a__half(X) → half(X)

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

(55) PisEmptyProof (EQUIVALENT transformation)

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

(0) Obligation:

(1) DependencyPairsProof (EQUIVALENT transformation)

(2) Obligation:

(3) QDPOrderProof (EQUIVALENT transformation)

(4) Obligation:

(5) QDPOrderProof (EQUIVALENT transformation)

(6) Obligation:

(7) QDPOrderProof (EQUIVALENT transformation)

(8) Obligation:

(9) DependencyGraphProof (EQUIVALENT transformation)

(10) Obligation:

(11) QDPOrderProof (EQUIVALENT transformation)

(12) Obligation:

(13) DependencyGraphProof (EQUIVALENT transformation)

(14) Complex Obligation (AND)

(15) Obligation:

(16) QDPOrderProof (EQUIVALENT transformation)

(17) Obligation:

(18) QDPOrderProof (EQUIVALENT transformation)

(19) Obligation:

(20) QDPOrderProof (EQUIVALENT transformation)

(21) Obligation:

(22) DependencyGraphProof (EQUIVALENT transformation)

(23) Obligation:

(24) QDPOrderProof (EQUIVALENT transformation)

(25) Obligation:

(26) QDPOrderProof (EQUIVALENT transformation)

(27) Obligation:

(28) QDPOrderProof (EQUIVALENT transformation)

(29) Obligation:

(30) QDPOrderProof (EQUIVALENT transformation)

(31) Obligation:

(32) QDPOrderProof (EQUIVALENT transformation)

(33) Obligation:

(34) QDPOrderProof (EQUIVALENT transformation)

(35) Obligation:

(36) DependencyGraphProof (EQUIVALENT transformation)

(37) Complex Obligation (AND)

(38) Obligation:

(39) QDPOrderProof (EQUIVALENT transformation)

(40) Obligation:

(41) QDPOrderProof (EQUIVALENT transformation)

(42) Obligation:

(43) QDPOrderProof (EQUIVALENT transformation)

(44) Obligation:

(45) DependencyGraphProof (EQUIVALENT transformation)

(46) TRUE

(47) Obligation:

(48) QDPOrderProof (EQUIVALENT transformation)

(49) Obligation:

(50) PisEmptyProof (EQUIVALENT transformation)

(51) TRUE

(52) Obligation:

(53) QDPOrderProof (EQUIVALENT transformation)

(54) Obligation:

(55) PisEmptyProof (EQUIVALENT transformation)

(56) TRUE