(0) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
sqr(0) → 0
sqr(s(x)) → +(sqr(x), s(double(x)))
double(0) → 0
double(s(x)) → s(s(double(x)))
+(x, 0) → x
+(x, s(y)) → s(+(x, y))
sqr(s(x)) → s(+(sqr(x), double(x)))
Q is empty.
(1) Overlay + Local Confluence (EQUIVALENT transformation)
The TRS is overlay and locally confluent. By [NOC] we can switch to innermost.
(2) Obligation:
Q restricted rewrite system:
The TRS R consists of the following rules:
sqr(0) → 0
sqr(s(x)) → +(sqr(x), s(double(x)))
double(0) → 0
double(s(x)) → s(s(double(x)))
+(x, 0) → x
+(x, s(y)) → s(+(x, y))
sqr(s(x)) → s(+(sqr(x), double(x)))
The set Q consists of the following terms:
sqr(0)
sqr(s(x0))
double(0)
double(s(x0))
+(x0, 0)
+(x0, s(x1))
(3) DependencyPairsProof (EQUIVALENT transformation)
Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.
(4) Obligation:
Q DP problem:
The TRS P consists of the following rules:
SQR(s(x)) → +1(sqr(x), s(double(x)))
SQR(s(x)) → SQR(x)
SQR(s(x)) → DOUBLE(x)
DOUBLE(s(x)) → DOUBLE(x)
+1(x, s(y)) → +1(x, y)
SQR(s(x)) → +1(sqr(x), double(x))
The TRS R consists of the following rules:
sqr(0) → 0
sqr(s(x)) → +(sqr(x), s(double(x)))
double(0) → 0
double(s(x)) → s(s(double(x)))
+(x, 0) → x
+(x, s(y)) → s(+(x, y))
sqr(s(x)) → s(+(sqr(x), double(x)))
The set Q consists of the following terms:
sqr(0)
sqr(s(x0))
double(0)
double(s(x0))
+(x0, 0)
+(x0, s(x1))
We have to consider all minimal (P,Q,R)-chains.
(5) DependencyGraphProof (EQUIVALENT transformation)
The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 3 SCCs with 3 less nodes.
(6) Complex Obligation (AND)
(7) Obligation:
Q DP problem:
The TRS P consists of the following rules:
+1(x, s(y)) → +1(x, y)
The TRS R consists of the following rules:
sqr(0) → 0
sqr(s(x)) → +(sqr(x), s(double(x)))
double(0) → 0
double(s(x)) → s(s(double(x)))
+(x, 0) → x
+(x, s(y)) → s(+(x, y))
sqr(s(x)) → s(+(sqr(x), double(x)))
The set Q consists of the following terms:
sqr(0)
sqr(s(x0))
double(0)
double(s(x0))
+(x0, 0)
+(x0, s(x1))
We have to consider all minimal (P,Q,R)-chains.
(8) UsableRulesProof (EQUIVALENT transformation)
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.
(9) Obligation:
Q DP problem:
The TRS P consists of the following rules:
+1(x, s(y)) → +1(x, y)
R is empty.
The set Q consists of the following terms:
sqr(0)
sqr(s(x0))
double(0)
double(s(x0))
+(x0, 0)
+(x0, s(x1))
We have to consider all minimal (P,Q,R)-chains.
(10) QReductionProof (EQUIVALENT transformation)
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].
sqr(0)
sqr(s(x0))
double(0)
double(s(x0))
+(x0, 0)
+(x0, s(x1))
(11) Obligation:
Q DP problem:
The TRS P consists of the following rules:
+1(x, s(y)) → +1(x, y)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(12) QDPSizeChangeProof (EQUIVALENT transformation)
By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.
From the DPs we obtained the following set of size-change graphs:
- +1(x, s(y)) → +1(x, y)
The graph contains the following edges 1 >= 1, 2 > 2
(13) TRUE
(14) Obligation:
Q DP problem:
The TRS P consists of the following rules:
DOUBLE(s(x)) → DOUBLE(x)
The TRS R consists of the following rules:
sqr(0) → 0
sqr(s(x)) → +(sqr(x), s(double(x)))
double(0) → 0
double(s(x)) → s(s(double(x)))
+(x, 0) → x
+(x, s(y)) → s(+(x, y))
sqr(s(x)) → s(+(sqr(x), double(x)))
The set Q consists of the following terms:
sqr(0)
sqr(s(x0))
double(0)
double(s(x0))
+(x0, 0)
+(x0, s(x1))
We have to consider all minimal (P,Q,R)-chains.
(15) UsableRulesProof (EQUIVALENT transformation)
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.
(16) Obligation:
Q DP problem:
The TRS P consists of the following rules:
DOUBLE(s(x)) → DOUBLE(x)
R is empty.
The set Q consists of the following terms:
sqr(0)
sqr(s(x0))
double(0)
double(s(x0))
+(x0, 0)
+(x0, s(x1))
We have to consider all minimal (P,Q,R)-chains.
(17) QReductionProof (EQUIVALENT transformation)
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].
sqr(0)
sqr(s(x0))
double(0)
double(s(x0))
+(x0, 0)
+(x0, s(x1))
(18) Obligation:
Q DP problem:
The TRS P consists of the following rules:
DOUBLE(s(x)) → DOUBLE(x)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(19) QDPSizeChangeProof (EQUIVALENT transformation)
By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.
From the DPs we obtained the following set of size-change graphs:
- DOUBLE(s(x)) → DOUBLE(x)
The graph contains the following edges 1 > 1
(20) TRUE
(21) Obligation:
Q DP problem:
The TRS P consists of the following rules:
SQR(s(x)) → SQR(x)
The TRS R consists of the following rules:
sqr(0) → 0
sqr(s(x)) → +(sqr(x), s(double(x)))
double(0) → 0
double(s(x)) → s(s(double(x)))
+(x, 0) → x
+(x, s(y)) → s(+(x, y))
sqr(s(x)) → s(+(sqr(x), double(x)))
The set Q consists of the following terms:
sqr(0)
sqr(s(x0))
double(0)
double(s(x0))
+(x0, 0)
+(x0, s(x1))
We have to consider all minimal (P,Q,R)-chains.
(22) UsableRulesProof (EQUIVALENT transformation)
As all Q-normal forms are R-normal forms we are in the innermost case. Hence, by the usable rules processor [LPAR04] we can delete all non-usable rules [FROCOS05] from R.
(23) Obligation:
Q DP problem:
The TRS P consists of the following rules:
SQR(s(x)) → SQR(x)
R is empty.
The set Q consists of the following terms:
sqr(0)
sqr(s(x0))
double(0)
double(s(x0))
+(x0, 0)
+(x0, s(x1))
We have to consider all minimal (P,Q,R)-chains.
(24) QReductionProof (EQUIVALENT transformation)
We deleted the following terms from Q as each root-symbol of these terms does neither occur in P nor in R.[THIEMANN].
sqr(0)
sqr(s(x0))
double(0)
double(s(x0))
+(x0, 0)
+(x0, s(x1))
(25) Obligation:
Q DP problem:
The TRS P consists of the following rules:
SQR(s(x)) → SQR(x)
R is empty.
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
(26) QDPSizeChangeProof (EQUIVALENT transformation)
By using the subterm criterion [SUBTERM_CRITERION] together with the size-change analysis [AAECC05] we have proven that there are no infinite chains for this DP problem.
From the DPs we obtained the following set of size-change graphs:
- SQR(s(x)) → SQR(x)
The graph contains the following edges 1 > 1
(27) TRUE