Termination Proof using AProVE

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

Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

+'(s(x), y) -> +'(x, y)
+'(p(x), y) -> +'(x, y)
MINUS(s(x)) -> MINUS(x)
MINUS(p(x)) -> MINUS(x)
*'(s(x), y) -> +'(*(x, y), y)
*'(s(x), y) -> *'(x, y)
*'(p(x), y) -> +'(*(x, y), minus(y))
*'(p(x), y) -> *'(x, y)
*'(p(x), y) -> MINUS(y)

Furthermore, R contains three SCCs.

     ↳DPs

       →DP Problem 1

         ↳Argument Filtering and Ordering

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

Dependency Pairs:

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

Rules:

+(0, y) -> y
+(s(x), y) -> s(+(x, y))
+(p(x), y) -> p(+(x, y))
minus(0) -> 0
minus(s(x)) -> p(minus(x))
minus(p(x)) -> s(minus(x))
*(0, y) -> 0
*(s(x), y) -> +(*(x, y), y)
*(p(x), y) -> +(*(x, y), minus(y))

The following dependency pairs can be strictly oriented:

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

The following rules can be oriented:

+(0, y) -> y
+(s(x), y) -> s(+(x, y))
+(p(x), y) -> p(+(x, y))
minus(0) -> 0
minus(s(x)) -> p(minus(x))
minus(p(x)) -> s(minus(x))
*(0, y) -> 0
*(s(x), y) -> +(*(x, y), y)
*(p(x), y) -> +(*(x, y), minus(y))

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

* > + > {p, minus, s}

resulting in one new DP problem.
Used Argument Filtering System:

+'(x₁, x₂) -> +'(x₁, x₂)
p(x₁) -> p(x₁)
s(x₁) -> s(x₁)
+(x₁, x₂) -> +(x₁, x₂)
minus(x₁) -> minus(x₁)
*(x₁, x₂) -> *(x₁, x₂)

     ↳DPs

       →DP Problem 1

         ↳AFS

           →DP Problem 4

             ↳Dependency Graph

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

Dependency Pair:

Rules:

+(0, y) -> y
+(s(x), y) -> s(+(x, y))
+(p(x), y) -> p(+(x, y))
minus(0) -> 0
minus(s(x)) -> p(minus(x))
minus(p(x)) -> s(minus(x))
*(0, y) -> 0
*(s(x), y) -> +(*(x, y), y)
*(p(x), y) -> +(*(x, y), minus(y))

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳Argument Filtering and Ordering

       →DP Problem 3

         ↳AFS

Dependency Pairs:

MINUS(p(x)) -> MINUS(x)
MINUS(s(x)) -> MINUS(x)

Rules:

+(0, y) -> y
+(s(x), y) -> s(+(x, y))
+(p(x), y) -> p(+(x, y))
minus(0) -> 0
minus(s(x)) -> p(minus(x))
minus(p(x)) -> s(minus(x))
*(0, y) -> 0
*(s(x), y) -> +(*(x, y), y)
*(p(x), y) -> +(*(x, y), minus(y))

The following dependency pairs can be strictly oriented:

MINUS(p(x)) -> MINUS(x)
MINUS(s(x)) -> MINUS(x)

The following rules can be oriented:

+(0, y) -> y
+(s(x), y) -> s(+(x, y))
+(p(x), y) -> p(+(x, y))
minus(0) -> 0
minus(s(x)) -> p(minus(x))
minus(p(x)) -> s(minus(x))
*(0, y) -> 0
*(s(x), y) -> +(*(x, y), y)
*(p(x), y) -> +(*(x, y), minus(y))

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

* > + > p
* > + > s
* > minus > p
* > minus > s

resulting in one new DP problem.
Used Argument Filtering System:

MINUS(x₁) -> MINUS(x₁)
p(x₁) -> p(x₁)
s(x₁) -> s(x₁)
+(x₁, x₂) -> +(x₁, x₂)
minus(x₁) -> minus(x₁)
*(x₁, x₂) -> *(x₁, x₂)

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

           →DP Problem 5

             ↳Dependency Graph

       →DP Problem 3

         ↳AFS

Dependency Pair:

Rules:

+(0, y) -> y
+(s(x), y) -> s(+(x, y))
+(p(x), y) -> p(+(x, y))
minus(0) -> 0
minus(s(x)) -> p(minus(x))
minus(p(x)) -> s(minus(x))
*(0, y) -> 0
*(s(x), y) -> +(*(x, y), y)
*(p(x), y) -> +(*(x, y), minus(y))

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳Argument Filtering and Ordering

Dependency Pairs:

*'(p(x), y) -> *'(x, y)
*'(s(x), y) -> *'(x, y)

Rules:

+(0, y) -> y
+(s(x), y) -> s(+(x, y))
+(p(x), y) -> p(+(x, y))
minus(0) -> 0
minus(s(x)) -> p(minus(x))
minus(p(x)) -> s(minus(x))
*(0, y) -> 0
*(s(x), y) -> +(*(x, y), y)
*(p(x), y) -> +(*(x, y), minus(y))

The following dependency pairs can be strictly oriented:

*'(p(x), y) -> *'(x, y)
*'(s(x), y) -> *'(x, y)

The following rules can be oriented:

+(0, y) -> y
+(s(x), y) -> s(+(x, y))
+(p(x), y) -> p(+(x, y))
minus(0) -> 0
minus(s(x)) -> p(minus(x))
minus(p(x)) -> s(minus(x))
*(0, y) -> 0
*(s(x), y) -> +(*(x, y), y)
*(p(x), y) -> +(*(x, y), minus(y))

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

* > + > {p, minus, s}

resulting in one new DP problem.
Used Argument Filtering System:

*'(x₁, x₂) -> *'(x₁, x₂)
s(x₁) -> s(x₁)
p(x₁) -> p(x₁)
+(x₁, x₂) -> +(x₁, x₂)
minus(x₁) -> minus(x₁)
*(x₁, x₂) -> *(x₁, x₂)

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

           →DP Problem 6

             ↳Dependency Graph

Dependency Pair:

Rules:

+(0, y) -> y
+(s(x), y) -> s(+(x, y))
+(p(x), y) -> p(+(x, y))
minus(0) -> 0
minus(s(x)) -> p(minus(x))
minus(p(x)) -> s(minus(x))
*(0, y) -> 0
*(s(x), y) -> +(*(x, y), y)
*(p(x), y) -> +(*(x, y), minus(y))

Using the Dependency Graph resulted in no new DP problems.

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