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`
`         ↳Polynomial Ordering`
`       →DP Problem 2`
`         ↳FwdInst`

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))

There are no usable rules w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
 POL(plus(x1, x2)) =  1 + x1 + x2 POL(PLUS(x1, x2)) =  x1

resulting in one new DP problem.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Polo`
`           →DP Problem 3`
`             ↳Dependency Graph`
`       →DP Problem 2`
`         ↳FwdInst`

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`
`         ↳Polo`
`       →DP Problem 2`
`         ↳Forward Instantiation Transformation`

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))

On this DP problem, a Forward Instantiation SCC transformation can be performed.
As a result of transforming the rule

TIMES(X, s(Y)) -> TIMES(Y, X)
one new Dependency Pair is created:

TIMES(s(Y''), s(Y0)) -> TIMES(Y0, s(Y''))

The transformation is resulting in one new DP problem:

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Polo`
`       →DP Problem 2`
`         ↳FwdInst`
`           →DP Problem 4`
`             ↳Forward Instantiation Transformation`

Dependency Pair:

TIMES(s(Y''), s(Y0)) -> TIMES(Y0, s(Y''))

Rules:

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

On this DP problem, a Forward Instantiation SCC transformation can be performed.
As a result of transforming the rule

TIMES(s(Y''), s(Y0)) -> TIMES(Y0, s(Y''))
one new Dependency Pair is created:

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

The transformation is resulting in one new DP problem:

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Polo`
`       →DP Problem 2`
`         ↳FwdInst`
`           →DP Problem 4`
`             ↳FwdInst`
`             ...`
`               →DP Problem 5`
`                 ↳Polynomial Ordering`

Dependency Pair:

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

Rules:

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

The following dependency pair can be strictly oriented:

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

There are no usable rules w.r.t. to the implicit AFS that need to be oriented.

Used ordering: Polynomial ordering with Polynomial interpretation:
 POL(TIMES(x1, x2)) =  1 + x1 + x2 POL(s(x1)) =  1 + x1

resulting in one new DP problem.

`   R`
`     ↳DPs`
`       →DP Problem 1`
`         ↳Polo`
`       →DP Problem 2`
`         ↳FwdInst`
`           →DP Problem 4`
`             ↳FwdInst`
`             ...`
`               →DP Problem 6`
`                 ↳Dependency Graph`

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.

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