Termination Proof using AProVE

Term Rewriting System R:
[x, y]
top1(free(x), y) -> top2(check(new(x)), y)
top1(free(x), y) -> top2(new(x), check(y))
top1(free(x), y) -> top2(check(x), new(y))
top1(free(x), y) -> top2(x, check(new(y)))
top2(x, free(y)) -> top1(check(new(x)), y)
top2(x, free(y)) -> top1(new(x), check(y))
top2(x, free(y)) -> top1(check(x), new(y))
top2(x, free(y)) -> top1(x, check(new(y)))
new(free(x)) -> free(new(x))
new(serve) -> free(serve)
old(free(x)) -> free(old(x))
old(serve) -> free(serve)
check(free(x)) -> free(check(x))
check(new(x)) -> new(check(x))
check(old(x)) -> old(check(x))
check(old(x)) -> old(x)

Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

TOP1(free(x), y) -> TOP2(check(new(x)), y)
TOP1(free(x), y) -> CHECK(new(x))
TOP1(free(x), y) -> NEW(x)
TOP1(free(x), y) -> TOP2(new(x), check(y))
TOP1(free(x), y) -> CHECK(y)
TOP1(free(x), y) -> TOP2(check(x), new(y))
TOP1(free(x), y) -> CHECK(x)
TOP1(free(x), y) -> NEW(y)
TOP1(free(x), y) -> TOP2(x, check(new(y)))
TOP1(free(x), y) -> CHECK(new(y))
TOP2(x, free(y)) -> TOP1(check(new(x)), y)
TOP2(x, free(y)) -> CHECK(new(x))
TOP2(x, free(y)) -> NEW(x)
TOP2(x, free(y)) -> TOP1(new(x), check(y))
TOP2(x, free(y)) -> CHECK(y)
TOP2(x, free(y)) -> TOP1(check(x), new(y))
TOP2(x, free(y)) -> CHECK(x)
TOP2(x, free(y)) -> NEW(y)
TOP2(x, free(y)) -> TOP1(x, check(new(y)))
TOP2(x, free(y)) -> CHECK(new(y))
NEW(free(x)) -> NEW(x)
OLD(free(x)) -> OLD(x)
CHECK(free(x)) -> CHECK(x)
CHECK(new(x)) -> NEW(check(x))
CHECK(new(x)) -> CHECK(x)
CHECK(old(x)) -> OLD(check(x))
CHECK(old(x)) -> CHECK(x)

Furthermore, R contains four SCCs.

     ↳DPs

       →DP Problem 1

         ↳Argument Filtering and Ordering

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳Remaining

Dependency Pair:

NEW(free(x)) -> NEW(x)

Rules:

top1(free(x), y) -> top2(check(new(x)), y)
top1(free(x), y) -> top2(new(x), check(y))
top1(free(x), y) -> top2(check(x), new(y))
top1(free(x), y) -> top2(x, check(new(y)))
top2(x, free(y)) -> top1(check(new(x)), y)
top2(x, free(y)) -> top1(new(x), check(y))
top2(x, free(y)) -> top1(check(x), new(y))
top2(x, free(y)) -> top1(x, check(new(y)))
new(free(x)) -> free(new(x))
new(serve) -> free(serve)
old(free(x)) -> free(old(x))
old(serve) -> free(serve)
check(free(x)) -> free(check(x))
check(new(x)) -> new(check(x))
check(old(x)) -> old(check(x))
check(old(x)) -> old(x)

The following dependency pair can be strictly oriented:

NEW(free(x)) -> NEW(x)

There are no usable rules w.r.t. to the AFS that need to be oriented.
Used ordering: Polynomial ordering with Polynomial interpretation:

POL(NEW(x₁)) = x₁

POL(free(x₁)) = 1 + x₁

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

NEW(x₁) -> NEW(x₁)
free(x₁) -> free(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

           →DP Problem 5

             ↳Dependency Graph

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳Remaining

Dependency Pair:

Rules:

top1(free(x), y) -> top2(check(new(x)), y)
top1(free(x), y) -> top2(new(x), check(y))
top1(free(x), y) -> top2(check(x), new(y))
top1(free(x), y) -> top2(x, check(new(y)))
top2(x, free(y)) -> top1(check(new(x)), y)
top2(x, free(y)) -> top1(new(x), check(y))
top2(x, free(y)) -> top1(check(x), new(y))
top2(x, free(y)) -> top1(x, check(new(y)))
new(free(x)) -> free(new(x))
new(serve) -> free(serve)
old(free(x)) -> free(old(x))
old(serve) -> free(serve)
check(free(x)) -> free(check(x))
check(new(x)) -> new(check(x))
check(old(x)) -> old(check(x))
check(old(x)) -> old(x)

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

       →DP Problem 4

         ↳Remaining

Dependency Pair:

OLD(free(x)) -> OLD(x)

Rules:

top1(free(x), y) -> top2(check(new(x)), y)
top1(free(x), y) -> top2(new(x), check(y))
top1(free(x), y) -> top2(check(x), new(y))
top1(free(x), y) -> top2(x, check(new(y)))
top2(x, free(y)) -> top1(check(new(x)), y)
top2(x, free(y)) -> top1(new(x), check(y))
top2(x, free(y)) -> top1(check(x), new(y))
top2(x, free(y)) -> top1(x, check(new(y)))
new(free(x)) -> free(new(x))
new(serve) -> free(serve)
old(free(x)) -> free(old(x))
old(serve) -> free(serve)
check(free(x)) -> free(check(x))
check(new(x)) -> new(check(x))
check(old(x)) -> old(check(x))
check(old(x)) -> old(x)

The following dependency pair can be strictly oriented:

OLD(free(x)) -> OLD(x)

There are no usable rules w.r.t. to the AFS that need to be oriented.
Used ordering: Polynomial ordering with Polynomial interpretation:

POL(free(x₁)) = 1 + x₁

POL(OLD(x₁)) = x₁

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

OLD(x₁) -> OLD(x₁)
free(x₁) -> free(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

           →DP Problem 6

             ↳Dependency Graph

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳Remaining

Dependency Pair:

Rules:

top1(free(x), y) -> top2(check(new(x)), y)
top1(free(x), y) -> top2(new(x), check(y))
top1(free(x), y) -> top2(check(x), new(y))
top1(free(x), y) -> top2(x, check(new(y)))
top2(x, free(y)) -> top1(check(new(x)), y)
top2(x, free(y)) -> top1(new(x), check(y))
top2(x, free(y)) -> top1(check(x), new(y))
top2(x, free(y)) -> top1(x, check(new(y)))
new(free(x)) -> free(new(x))
new(serve) -> free(serve)
old(free(x)) -> free(old(x))
old(serve) -> free(serve)
check(free(x)) -> free(check(x))
check(new(x)) -> new(check(x))
check(old(x)) -> old(check(x))
check(old(x)) -> old(x)

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

       →DP Problem 4

         ↳Remaining

Dependency Pairs:

CHECK(old(x)) -> CHECK(x)
CHECK(new(x)) -> CHECK(x)
CHECK(free(x)) -> CHECK(x)

Rules:

top1(free(x), y) -> top2(check(new(x)), y)
top1(free(x), y) -> top2(new(x), check(y))
top1(free(x), y) -> top2(check(x), new(y))
top1(free(x), y) -> top2(x, check(new(y)))
top2(x, free(y)) -> top1(check(new(x)), y)
top2(x, free(y)) -> top1(new(x), check(y))
top2(x, free(y)) -> top1(check(x), new(y))
top2(x, free(y)) -> top1(x, check(new(y)))
new(free(x)) -> free(new(x))
new(serve) -> free(serve)
old(free(x)) -> free(old(x))
old(serve) -> free(serve)
check(free(x)) -> free(check(x))
check(new(x)) -> new(check(x))
check(old(x)) -> old(check(x))
check(old(x)) -> old(x)

The following dependency pair can be strictly oriented:

CHECK(new(x)) -> CHECK(x)

There are no usable rules w.r.t. to the AFS that need to be oriented.
Used ordering: Polynomial ordering with Polynomial interpretation:

POL(old(x₁)) = x₁

POL(free(x₁)) = x₁

POL(CHECK(x₁)) = x₁

POL(new(x₁)) = 1 + x₁

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

CHECK(x₁) -> CHECK(x₁)
new(x₁) -> new(x₁)
old(x₁) -> old(x₁)
free(x₁) -> free(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

           →DP Problem 7

             ↳Argument Filtering and Ordering

       →DP Problem 4

         ↳Remaining

Dependency Pairs:

CHECK(old(x)) -> CHECK(x)
CHECK(free(x)) -> CHECK(x)

Rules:

top1(free(x), y) -> top2(check(new(x)), y)
top1(free(x), y) -> top2(new(x), check(y))
top1(free(x), y) -> top2(check(x), new(y))
top1(free(x), y) -> top2(x, check(new(y)))
top2(x, free(y)) -> top1(check(new(x)), y)
top2(x, free(y)) -> top1(new(x), check(y))
top2(x, free(y)) -> top1(check(x), new(y))
top2(x, free(y)) -> top1(x, check(new(y)))
new(free(x)) -> free(new(x))
new(serve) -> free(serve)
old(free(x)) -> free(old(x))
old(serve) -> free(serve)
check(free(x)) -> free(check(x))
check(new(x)) -> new(check(x))
check(old(x)) -> old(check(x))
check(old(x)) -> old(x)

The following dependency pair can be strictly oriented:

CHECK(old(x)) -> CHECK(x)

There are no usable rules w.r.t. to the AFS that need to be oriented.
Used ordering: Polynomial ordering with Polynomial interpretation:

POL(old(x₁)) = 1 + x₁

POL(free(x₁)) = x₁

POL(CHECK(x₁)) = x₁

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

CHECK(x₁) -> CHECK(x₁)
old(x₁) -> old(x₁)
free(x₁) -> free(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

           →DP Problem 7

             ↳AFS

...

               →DP Problem 8

                 ↳Argument Filtering and Ordering

       →DP Problem 4

         ↳Remaining

Dependency Pair:

CHECK(free(x)) -> CHECK(x)

Rules:

top1(free(x), y) -> top2(check(new(x)), y)
top1(free(x), y) -> top2(new(x), check(y))
top1(free(x), y) -> top2(check(x), new(y))
top1(free(x), y) -> top2(x, check(new(y)))
top2(x, free(y)) -> top1(check(new(x)), y)
top2(x, free(y)) -> top1(new(x), check(y))
top2(x, free(y)) -> top1(check(x), new(y))
top2(x, free(y)) -> top1(x, check(new(y)))
new(free(x)) -> free(new(x))
new(serve) -> free(serve)
old(free(x)) -> free(old(x))
old(serve) -> free(serve)
check(free(x)) -> free(check(x))
check(new(x)) -> new(check(x))
check(old(x)) -> old(check(x))
check(old(x)) -> old(x)

The following dependency pair can be strictly oriented:

CHECK(free(x)) -> CHECK(x)

There are no usable rules w.r.t. to the AFS that need to be oriented.
Used ordering: Polynomial ordering with Polynomial interpretation:

POL(free(x₁)) = 1 + x₁

POL(CHECK(x₁)) = x₁

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

CHECK(x₁) -> CHECK(x₁)
free(x₁) -> free(x₁)

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

           →DP Problem 7

             ↳AFS

...

               →DP Problem 9

                 ↳Dependency Graph

       →DP Problem 4

         ↳Remaining

Dependency Pair:

Rules:

top1(free(x), y) -> top2(check(new(x)), y)
top1(free(x), y) -> top2(new(x), check(y))
top1(free(x), y) -> top2(check(x), new(y))
top1(free(x), y) -> top2(x, check(new(y)))
top2(x, free(y)) -> top1(check(new(x)), y)
top2(x, free(y)) -> top1(new(x), check(y))
top2(x, free(y)) -> top1(check(x), new(y))
top2(x, free(y)) -> top1(x, check(new(y)))
new(free(x)) -> free(new(x))
new(serve) -> free(serve)
old(free(x)) -> free(old(x))
old(serve) -> free(serve)
check(free(x)) -> free(check(x))
check(new(x)) -> new(check(x))
check(old(x)) -> old(check(x))
check(old(x)) -> old(x)

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳AFS

       →DP Problem 4

         ↳Remaining Obligation(s)

The following remains to be proven:
Dependency Pairs:

TOP2(x, free(y)) -> TOP1(x, check(new(y)))
TOP1(free(x), y) -> TOP2(x, check(new(y)))
TOP2(x, free(y)) -> TOP1(check(x), new(y))
TOP1(free(x), y) -> TOP2(check(x), new(y))
TOP2(x, free(y)) -> TOP1(new(x), check(y))
TOP1(free(x), y) -> TOP2(new(x), check(y))
TOP2(x, free(y)) -> TOP1(check(new(x)), y)
TOP1(free(x), y) -> TOP2(check(new(x)), y)

Rules:

top1(free(x), y) -> top2(check(new(x)), y)
top1(free(x), y) -> top2(new(x), check(y))
top1(free(x), y) -> top2(check(x), new(y))
top1(free(x), y) -> top2(x, check(new(y)))
top2(x, free(y)) -> top1(check(new(x)), y)
top2(x, free(y)) -> top1(new(x), check(y))
top2(x, free(y)) -> top1(check(x), new(y))
top2(x, free(y)) -> top1(x, check(new(y)))
new(free(x)) -> free(new(x))
new(serve) -> free(serve)
old(free(x)) -> free(old(x))
old(serve) -> free(serve)
check(free(x)) -> free(check(x))
check(new(x)) -> new(check(x))
check(old(x)) -> old(check(x))
check(old(x)) -> old(x)

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

POL(old(x₁))	= x₁
POL(free(x₁))	= x₁
POL(CHECK(x₁))	= x₁
POL(new(x₁))	= 1 + x₁