Term Rewriting System R:
[X, Y, Z]
plus(plus(X, Y), Z) -> plus(X, plus(Y, Z))
times(X, s(Y)) -> plus(X, times(Y, X))

Termination of R to be shown. 



   R
     ↳Dependency Pair Analysis



R contains the following Dependency Pairs:

PLUS(plus(X, Y), Z) -> PLUS(X, plus(Y, Z))
PLUS(plus(X, Y), Z) -> PLUS(Y, Z)
TIMES(X, s(Y)) -> PLUS(X, times(Y, X))
TIMES(X, s(Y)) -> TIMES(Y, X)

Furthermore, R contains two SCCs. 


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


Dependency Pairs:

PLUS(plus(X, Y), Z) -> PLUS(Y, Z)
PLUS(plus(X, Y), Z) -> PLUS(X, plus(Y, Z))


Rules:


plus(plus(X, Y), Z) -> plus(X, plus(Y, Z))
times(X, s(Y)) -> plus(X, times(Y, X))





The following dependency pairs can be strictly oriented:

PLUS(plus(X, Y), Z) -> PLUS(Y, Z)
PLUS(plus(X, Y), Z) -> PLUS(X, plus(Y, Z))


The following usable rule w.r.t. to the AFS can be oriented:

plus(plus(X, Y), Z) -> plus(X, plus(Y, Z))


Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
PLUS > plus

resulting in one new DP problem.
Used Argument Filtering System:
PLUS(x1, x2) -> PLUS(x1, x2)
plus(x1, x2) -> plus(x1, x2)


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


Dependency Pair:


Rules:


plus(plus(X, Y), Z) -> plus(X, plus(Y, Z))
times(X, s(Y)) -> plus(X, times(Y, X))





Using the Dependency Graph resulted in no new DP problems.


   R
     ↳DPs
       →DP Problem 1
         ↳AFS
       →DP Problem 2
         ↳Remaining Obligation(s)




The following remains to be proven:
Dependency Pair:

TIMES(X, s(Y)) -> TIMES(Y, X)


Rules:


plus(plus(X, Y), Z) -> plus(X, plus(Y, Z))
times(X, s(Y)) -> plus(X, times(Y, X))




Termination of R could not be shown.
Duration:
0:00 minutes