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

0 QTRS
↳1 DependencyPairsProof (⇔)
↳2 QDP
↳3 DependencyGraphProof (⇔)
↳4 QDP
↳5 QDPOrderProof (⇔)
↳6 QDP
↳7 DependencyGraphProof (⇔)
↳8 AND
    ↳9 QDP
        ↳10 QDPOrderProof (⇔)
        ↳11 QDP
        ↳12 PisEmptyProof (⇔)
        ↳13 TRUE
    ↳14 QDP
        ↳15 QDPOrderProof (⇔)
        ↳16 QDP
        ↳17 PisEmptyProof (⇔)
        ↳18 TRUE

(0) Obligation:

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

terms(N) → cons(recip(sqr(N)), n__terms(s(N)))
sqr(0) → 0
sqr(s(X)) → s(n__add(sqr(activate(X)), dbl(activate(X))))
dbl(0) → 0
dbl(s(X)) → s(n__s(n__dbl(activate(X))))
add(0, X) → X
add(s(X), Y) → s(n__add(activate(X), Y))
first(0, X) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(activate(X), activate(Z)))
terms(X) → n__terms(X)
add(X1, X2) → n__add(X1, X2)
s(X) → n__s(X)
dbl(X) → n__dbl(X)
first(X1, X2) → n__first(X1, X2)
activate(n__terms(X)) → terms(X)
activate(n__add(X1, X2)) → add(X1, X2)
activate(n__s(X)) → s(X)
activate(n__dbl(X)) → dbl(X)
activate(n__first(X1, X2)) → first(X1, X2)
activate(X) → 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:

TERMS(N) → SQR(N)
TERMS(N) → S(N)
SQR(s(X)) → S(n__add(sqr(activate(X)), dbl(activate(X))))
SQR(s(X)) → SQR(activate(X))
SQR(s(X)) → ACTIVATE(X)
SQR(s(X)) → DBL(activate(X))
DBL(s(X)) → S(n__s(n__dbl(activate(X))))
DBL(s(X)) → ACTIVATE(X)
ADD(s(X), Y) → S(n__add(activate(X), Y))
ADD(s(X), Y) → ACTIVATE(X)
FIRST(s(X), cons(Y, Z)) → ACTIVATE(X)
FIRST(s(X), cons(Y, Z)) → ACTIVATE(Z)
ACTIVATE(n__terms(X)) → TERMS(X)
ACTIVATE(n__add(X1, X2)) → ADD(X1, X2)
ACTIVATE(n__s(X)) → S(X)
ACTIVATE(n__dbl(X)) → DBL(X)
ACTIVATE(n__first(X1, X2)) → FIRST(X1, X2)

The TRS R consists of the following rules:

terms(N) → cons(recip(sqr(N)), n__terms(s(N)))
sqr(0) → 0
sqr(s(X)) → s(n__add(sqr(activate(X)), dbl(activate(X))))
dbl(0) → 0
dbl(s(X)) → s(n__s(n__dbl(activate(X))))
add(0, X) → X
add(s(X), Y) → s(n__add(activate(X), Y))
first(0, X) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(activate(X), activate(Z)))
terms(X) → n__terms(X)
add(X1, X2) → n__add(X1, X2)
s(X) → n__s(X)
dbl(X) → n__dbl(X)
first(X1, X2) → n__first(X1, X2)
activate(n__terms(X)) → terms(X)
activate(n__add(X1, X2)) → add(X1, X2)
activate(n__s(X)) → s(X)
activate(n__dbl(X)) → dbl(X)
activate(n__first(X1, X2)) → first(X1, X2)
activate(X) → X

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 1 SCC with 5 less nodes.

(4) Obligation:

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

SQR(s(X)) → SQR(activate(X))
SQR(s(X)) → ACTIVATE(X)
ACTIVATE(n__terms(X)) → TERMS(X)
TERMS(N) → SQR(N)
SQR(s(X)) → DBL(activate(X))
DBL(s(X)) → ACTIVATE(X)
ACTIVATE(n__add(X1, X2)) → ADD(X1, X2)
ADD(s(X), Y) → ACTIVATE(X)
ACTIVATE(n__dbl(X)) → DBL(X)
ACTIVATE(n__first(X1, X2)) → FIRST(X1, X2)
FIRST(s(X), cons(Y, Z)) → ACTIVATE(X)
FIRST(s(X), cons(Y, Z)) → ACTIVATE(Z)

The TRS R consists of the following rules:

terms(N) → cons(recip(sqr(N)), n__terms(s(N)))
sqr(0) → 0
sqr(s(X)) → s(n__add(sqr(activate(X)), dbl(activate(X))))
dbl(0) → 0
dbl(s(X)) → s(n__s(n__dbl(activate(X))))
add(0, X) → X
add(s(X), Y) → s(n__add(activate(X), Y))
first(0, X) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(activate(X), activate(Z)))
terms(X) → n__terms(X)
add(X1, X2) → n__add(X1, X2)
s(X) → n__s(X)
dbl(X) → n__dbl(X)
first(X1, X2) → n__first(X1, X2)
activate(n__terms(X)) → terms(X)
activate(n__add(X1, X2)) → add(X1, X2)
activate(n__s(X)) → s(X)
activate(n__dbl(X)) → dbl(X)
activate(n__first(X1, X2)) → first(X1, X2)
activate(X) → 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.


SQR(s(X)) → ACTIVATE(X)
ACTIVATE(n__terms(X)) → TERMS(X)
TERMS(N) → SQR(N)
SQR(s(X)) → DBL(activate(X))
ACTIVATE(n__add(X1, X2)) → ADD(X1, X2)
ADD(s(X), Y) → ACTIVATE(X)
ACTIVATE(n__first(X1, X2)) → FIRST(X1, X2)
FIRST(s(X), cons(Y, Z)) → ACTIVATE(X)
FIRST(s(X), cons(Y, Z)) → ACTIVATE(Z)
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
SQR(x0, x1)  =  SQR(x1)
ACTIVATE(x0, x1)  =  ACTIVATE(x0, x1)
TERMS(x0, x1)  =  TERMS(x0, x1)
DBL(x0, x1)  =  DBL(x1)
ADD(x0, x1, x2)  =  ADD(x1)
FIRST(x0, x1, x2)  =  FIRST(x1, x2)

Tags:
SQR has argument tags [0,8] and root tag 3
ACTIVATE has argument tags [0,2] and root tag 4
TERMS has argument tags [10,14] and root tag 0
DBL has argument tags [12,2] and root tag 4
ADD has argument tags [0,2,0] and root tag 7
FIRST has argument tags [4,2,2] and root tag 7

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Combined order from the following AFS and order.
SQR(x1)  =  SQR
s(x1)  =  x1
activate(x1)  =  x1
ACTIVATE(x1)  =  x1
n__terms(x1)  =  n__terms(x1)
TERMS(x1)  =  TERMS
DBL(x1)  =  DBL
n__add(x1, x2)  =  n__add(x1, x2)
ADD(x1, x2)  =  ADD(x2)
n__dbl(x1)  =  x1
n__first(x1, x2)  =  n__first(x1, x2)
FIRST(x1, x2)  =  FIRST(x1)
cons(x1, x2)  =  x2
terms(x1)  =  terms(x1)
add(x1, x2)  =  add(x1, x2)
n__s(x1)  =  x1
dbl(x1)  =  x1
first(x1, x2)  =  first(x1, x2)
recip(x1)  =  recip(x1)
sqr(x1)  =  sqr
0  =  0
nil  =  nil

Recursive path order with status [RPO].
Quasi-Precedence:
SQR > DBL
[nterms1, terms1] > TERMS
[nterms1, terms1] > recip1
[nfirst2, first2]
[sqr, 0, nil] > [nadd2, add2]

Status:
SQR: multiset
nterms1: multiset
TERMS: []
DBL: []
nadd2: [2,1]
ADD1: multiset
nfirst2: multiset
FIRST1: multiset
terms1: multiset
add2: [2,1]
first2: multiset
recip1: multiset
sqr: multiset
0: multiset
nil: multiset


The following usable rules [FROCOS05] were oriented: none

(6) Obligation:

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

SQR(s(X)) → SQR(activate(X))
DBL(s(X)) → ACTIVATE(X)
ACTIVATE(n__dbl(X)) → DBL(X)

The TRS R consists of the following rules:

terms(N) → cons(recip(sqr(N)), n__terms(s(N)))
sqr(0) → 0
sqr(s(X)) → s(n__add(sqr(activate(X)), dbl(activate(X))))
dbl(0) → 0
dbl(s(X)) → s(n__s(n__dbl(activate(X))))
add(0, X) → X
add(s(X), Y) → s(n__add(activate(X), Y))
first(0, X) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(activate(X), activate(Z)))
terms(X) → n__terms(X)
add(X1, X2) → n__add(X1, X2)
s(X) → n__s(X)
dbl(X) → n__dbl(X)
first(X1, X2) → n__first(X1, X2)
activate(n__terms(X)) → terms(X)
activate(n__add(X1, X2)) → add(X1, X2)
activate(n__s(X)) → s(X)
activate(n__dbl(X)) → dbl(X)
activate(n__first(X1, X2)) → first(X1, X2)
activate(X) → X

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

(7) DependencyGraphProof (EQUIVALENT transformation)

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

(8) Complex Obligation (AND)

(9) Obligation:

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

ACTIVATE(n__dbl(X)) → DBL(X)
DBL(s(X)) → ACTIVATE(X)

The TRS R consists of the following rules:

terms(N) → cons(recip(sqr(N)), n__terms(s(N)))
sqr(0) → 0
sqr(s(X)) → s(n__add(sqr(activate(X)), dbl(activate(X))))
dbl(0) → 0
dbl(s(X)) → s(n__s(n__dbl(activate(X))))
add(0, X) → X
add(s(X), Y) → s(n__add(activate(X), Y))
first(0, X) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(activate(X), activate(Z)))
terms(X) → n__terms(X)
add(X1, X2) → n__add(X1, X2)
s(X) → n__s(X)
dbl(X) → n__dbl(X)
first(X1, X2) → n__first(X1, X2)
activate(n__terms(X)) → terms(X)
activate(n__add(X1, X2)) → add(X1, X2)
activate(n__s(X)) → s(X)
activate(n__dbl(X)) → dbl(X)
activate(n__first(X1, X2)) → first(X1, X2)
activate(X) → X

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

(10) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


ACTIVATE(n__dbl(X)) → DBL(X)
DBL(s(X)) → ACTIVATE(X)
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
ACTIVATE(x0, x1)  =  ACTIVATE(x0)
DBL(x0, x1)  =  DBL(x0, x1)

Tags:
ACTIVATE has argument tags [3,0] and root tag 1
DBL has argument tags [3,3] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Combined order from the following AFS and order.
ACTIVATE(x1)  =  x1
n__dbl(x1)  =  x1
DBL(x1)  =  DBL
s(x1)  =  s(x1)

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

Status:
DBL: multiset
s1: multiset


The following usable rules [FROCOS05] were oriented: none

(11) Obligation:

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

terms(N) → cons(recip(sqr(N)), n__terms(s(N)))
sqr(0) → 0
sqr(s(X)) → s(n__add(sqr(activate(X)), dbl(activate(X))))
dbl(0) → 0
dbl(s(X)) → s(n__s(n__dbl(activate(X))))
add(0, X) → X
add(s(X), Y) → s(n__add(activate(X), Y))
first(0, X) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(activate(X), activate(Z)))
terms(X) → n__terms(X)
add(X1, X2) → n__add(X1, X2)
s(X) → n__s(X)
dbl(X) → n__dbl(X)
first(X1, X2) → n__first(X1, X2)
activate(n__terms(X)) → terms(X)
activate(n__add(X1, X2)) → add(X1, X2)
activate(n__s(X)) → s(X)
activate(n__dbl(X)) → dbl(X)
activate(n__first(X1, X2)) → first(X1, X2)
activate(X) → X

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

(12) PisEmptyProof (EQUIVALENT transformation)

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

(13) TRUE

(14) Obligation:

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

SQR(s(X)) → SQR(activate(X))

The TRS R consists of the following rules:

terms(N) → cons(recip(sqr(N)), n__terms(s(N)))
sqr(0) → 0
sqr(s(X)) → s(n__add(sqr(activate(X)), dbl(activate(X))))
dbl(0) → 0
dbl(s(X)) → s(n__s(n__dbl(activate(X))))
add(0, X) → X
add(s(X), Y) → s(n__add(activate(X), Y))
first(0, X) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(activate(X), activate(Z)))
terms(X) → n__terms(X)
add(X1, X2) → n__add(X1, X2)
s(X) → n__s(X)
dbl(X) → n__dbl(X)
first(X1, X2) → n__first(X1, X2)
activate(n__terms(X)) → terms(X)
activate(n__add(X1, X2)) → add(X1, X2)
activate(n__s(X)) → s(X)
activate(n__dbl(X)) → dbl(X)
activate(n__first(X1, X2)) → first(X1, X2)
activate(X) → X

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

(15) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


SQR(s(X)) → SQR(activate(X))
The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
SQR(x0, x1)  =  SQR(x0, x1)

Tags:
SQR has argument tags [0,0] and root tag 0

Comparison: DMS
Underlying order for the size change arcs and the rules of R:
Combined order from the following AFS and order.
SQR(x1)  =  SQR
s(x1)  =  s(x1)
activate(x1)  =  x1
n__terms(x1)  =  x1
terms(x1)  =  x1
n__add(x1, x2)  =  n__add(x1, x2)
add(x1, x2)  =  add(x1, x2)
n__s(x1)  =  n__s(x1)
n__dbl(x1)  =  n__dbl(x1)
dbl(x1)  =  dbl(x1)
n__first(x1, x2)  =  x1
first(x1, x2)  =  x1
cons(x1, x2)  =  cons
recip(x1)  =  recip
sqr(x1)  =  x1
0  =  0
nil  =  nil

Recursive path order with status [RPO].
Quasi-Precedence:
SQR > cons
[nadd2, add2] > [s1, ns1] > cons
[ndbl1, dbl1] > [s1, ns1] > cons
[ndbl1, dbl1] > [0, nil] > cons
recip > cons

Status:
SQR: []
s1: multiset
nadd2: [1,2]
add2: [1,2]
ns1: multiset
ndbl1: [1]
dbl1: [1]
cons: multiset
recip: multiset
0: multiset
nil: multiset


The following usable rules [FROCOS05] were oriented: none

(16) Obligation:

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

terms(N) → cons(recip(sqr(N)), n__terms(s(N)))
sqr(0) → 0
sqr(s(X)) → s(n__add(sqr(activate(X)), dbl(activate(X))))
dbl(0) → 0
dbl(s(X)) → s(n__s(n__dbl(activate(X))))
add(0, X) → X
add(s(X), Y) → s(n__add(activate(X), Y))
first(0, X) → nil
first(s(X), cons(Y, Z)) → cons(Y, n__first(activate(X), activate(Z)))
terms(X) → n__terms(X)
add(X1, X2) → n__add(X1, X2)
s(X) → n__s(X)
dbl(X) → n__dbl(X)
first(X1, X2) → n__first(X1, X2)
activate(n__terms(X)) → terms(X)
activate(n__add(X1, X2)) → add(X1, X2)
activate(n__s(X)) → s(X)
activate(n__dbl(X)) → dbl(X)
activate(n__first(X1, X2)) → first(X1, X2)
activate(X) → X

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

(17) PisEmptyProof (EQUIVALENT transformation)

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

(18) TRUE