Term Rewriting System R:
[x, y]
double(0) -> 0
double(s(x)) -> s(s(double(x)))
double(x) -> +(x, x)
+(x, 0) -> x
+(x, s(y)) -> s(+(x, y))
+(s(x), y) -> s(+(x, y))

Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

DOUBLE(s(x)) -> DOUBLE(x)
DOUBLE(x) -> +'(x, x)
+'(x, s(y)) -> +'(x, y)
+'(s(x), y) -> +'(x, y)

Furthermore, R contains two SCCs. 


   R
     ↳DPs
       →DP Problem 1
         ↳Argument Filtering and Ordering
       →DP Problem 2
         ↳AFS


Dependency Pairs:

+'(s(x), y) -> +'(x, y)
+'(x, s(y)) -> +'(x, y)


Rules:


double(0) -> 0
double(s(x)) -> s(s(double(x)))
double(x) -> +(x, x)
+(x, 0) -> x
+(x, s(y)) -> s(+(x, y))
+(s(x), y) -> s(+(x, y))





The following dependency pairs can be strictly oriented:

+'(s(x), y) -> +'(x, y)
+'(x, s(y)) -> +'(x, y)


There are no usable rules w.r.t. to the AFS that need to be oriented.
Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:
+'(x1, x2) -> +'(x1, x2)
s(x1) -> s(x1)


   R
     ↳DPs
       →DP Problem 1
         ↳AFS
           →DP Problem 3
             ↳Dependency Graph
       →DP Problem 2
         ↳AFS


Dependency Pair:


Rules:


double(0) -> 0
double(s(x)) -> s(s(double(x)))
double(x) -> +(x, x)
+(x, 0) -> x
+(x, s(y)) -> s(+(x, y))
+(s(x), y) -> s(+(x, y))





Using the Dependency Graph resulted in no new DP problems.


   R
     ↳DPs
       →DP Problem 1
         ↳AFS
       →DP Problem 2
         ↳Argument Filtering and Ordering


Dependency Pair:

DOUBLE(s(x)) -> DOUBLE(x)


Rules:


double(0) -> 0
double(s(x)) -> s(s(double(x)))
double(x) -> +(x, x)
+(x, 0) -> x
+(x, s(y)) -> s(+(x, y))
+(s(x), y) -> s(+(x, y))





The following dependency pair can be strictly oriented:

DOUBLE(s(x)) -> DOUBLE(x)


There are no usable rules w.r.t. to the AFS that need to be oriented.
Used ordering: Homeomorphic Embedding Order with EMB
resulting in one new DP problem.
Used Argument Filtering System:
DOUBLE(x1) -> DOUBLE(x1)
s(x1) -> s(x1)


   R
     ↳DPs
       →DP Problem 1
         ↳AFS
       →DP Problem 2
         ↳AFS
           →DP Problem 4
             ↳Dependency Graph


Dependency Pair:


Rules:


double(0) -> 0
double(s(x)) -> s(s(double(x)))
double(x) -> +(x, x)
+(x, 0) -> x
+(x, s(y)) -> s(+(x, y))
+(s(x), y) -> s(+(x, y))





Using the Dependency Graph resulted in no new DP problems.

Termination of R successfully shown.
Duration:
0:00 minutes