Termination Proof using AProVE

Term Rewriting System R:
[X, Y, X1, X2]
active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

ACTIVE(f(g(X), Y)) -> F(X, f(g(X), Y))
ACTIVE(f(X1, X2)) -> F(active(X1), X2)
ACTIVE(f(X1, X2)) -> ACTIVE(X1)
ACTIVE(g(X)) -> G(active(X))
ACTIVE(g(X)) -> ACTIVE(X)
F(mark(X1), X2) -> F(X1, X2)
F(ok(X1), ok(X2)) -> F(X1, X2)
G(mark(X)) -> G(X)
G(ok(X)) -> G(X)
PROPER(f(X1, X2)) -> F(proper(X1), proper(X2))
PROPER(f(X1, X2)) -> PROPER(X1)
PROPER(f(X1, X2)) -> PROPER(X2)
PROPER(g(X)) -> G(proper(X))
PROPER(g(X)) -> PROPER(X)
TOP(mark(X)) -> TOP(proper(X))
TOP(mark(X)) -> PROPER(X)
TOP(ok(X)) -> TOP(active(X))
TOP(ok(X)) -> ACTIVE(X)

Furthermore, R contains five SCCs.

     ↳DPs

       →DP Problem 1

         ↳Polynomial Ordering

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

Dependency Pairs:

F(ok(X1), ok(X2)) -> F(X1, X2)
F(mark(X1), X2) -> F(X1, X2)

Rules:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

The following dependency pair can be strictly oriented:

F(ok(X1), ok(X2)) -> F(X1, X2)

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(mark(x₁)) = 0

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

POL(F(x₁, x₂)) = x₂

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

           →DP Problem 6

             ↳Polynomial Ordering

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

Dependency Pair:

F(mark(X1), X2) -> F(X1, X2)

Rules:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

The following dependency pair can be strictly oriented:

F(mark(X1), X2) -> F(X1, X2)

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(mark(x₁)) = 1 + x₁

POL(F(x₁, x₂)) = x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

           →DP Problem 6

             ↳Polo

...

               →DP Problem 7

                 ↳Dependency Graph

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

Dependency Pair:

Rules:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polynomial Ordering

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

Dependency Pairs:

G(ok(X)) -> G(X)
G(mark(X)) -> G(X)

Rules:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

The following dependency pair can be strictly oriented:

G(ok(X)) -> G(X)

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(G(x₁)) = x₁

POL(mark(x₁)) = x₁

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

           →DP Problem 8

             ↳Polynomial Ordering

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

Dependency Pair:

G(mark(X)) -> G(X)

Rules:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

The following dependency pair can be strictly oriented:

G(mark(X)) -> G(X)

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(G(x₁)) = x₁

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

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

           →DP Problem 8

             ↳Polo

...

               →DP Problem 9

                 ↳Dependency Graph

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

Dependency Pair:

Rules:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polynomial Ordering

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

Dependency Pairs:

ACTIVE(g(X)) -> ACTIVE(X)
ACTIVE(f(X1, X2)) -> ACTIVE(X1)

Rules:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

The following dependency pair can be strictly oriented:

ACTIVE(g(X)) -> ACTIVE(X)

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(ACTIVE(x₁)) = x₁

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

POL(f(x₁, x₂)) = x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

           →DP Problem 10

             ↳Polynomial Ordering

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

Dependency Pair:

ACTIVE(f(X1, X2)) -> ACTIVE(X1)

Rules:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

The following dependency pair can be strictly oriented:

ACTIVE(f(X1, X2)) -> ACTIVE(X1)

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(ACTIVE(x₁)) = x₁

POL(f(x₁, x₂)) = 1 + x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

           →DP Problem 10

             ↳Polo

...

               →DP Problem 11

                 ↳Dependency Graph

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

Dependency Pair:

Rules:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polynomial Ordering

       →DP Problem 5

         ↳Nar

Dependency Pairs:

PROPER(g(X)) -> PROPER(X)
PROPER(f(X1, X2)) -> PROPER(X2)
PROPER(f(X1, X2)) -> PROPER(X1)

Rules:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

The following dependency pair can be strictly oriented:

PROPER(g(X)) -> PROPER(X)

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(g(x₁)) = 1 + x₁

POL(PROPER(x₁)) = x₁

POL(f(x₁, x₂)) = x₁ + x₂

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

           →DP Problem 12

             ↳Polynomial Ordering

       →DP Problem 5

         ↳Nar

Dependency Pairs:

PROPER(f(X1, X2)) -> PROPER(X2)
PROPER(f(X1, X2)) -> PROPER(X1)

Rules:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

The following dependency pairs can be strictly oriented:

PROPER(f(X1, X2)) -> PROPER(X2)
PROPER(f(X1, X2)) -> PROPER(X1)

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(PROPER(x₁)) = x₁

POL(f(x₁, x₂)) = 1 + x₁ + x₂

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

           →DP Problem 12

             ↳Polo

...

               →DP Problem 13

                 ↳Dependency Graph

       →DP Problem 5

         ↳Nar

Dependency Pair:

Rules:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Narrowing Transformation

Dependency Pairs:

TOP(ok(X)) -> TOP(active(X))
TOP(mark(X)) -> TOP(proper(X))

Rules:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

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

TOP(mark(X)) -> TOP(proper(X))

two new Dependency Pairs are created:

TOP(mark(f(X1', X2'))) -> TOP(f(proper(X1'), proper(X2')))
TOP(mark(g(X''))) -> TOP(g(proper(X'')))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

           →DP Problem 14

             ↳Narrowing Transformation

Dependency Pairs:

TOP(mark(g(X''))) -> TOP(g(proper(X'')))
TOP(mark(f(X1', X2'))) -> TOP(f(proper(X1'), proper(X2')))
TOP(ok(X)) -> TOP(active(X))

Rules:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

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

TOP(ok(X)) -> TOP(active(X))

three new Dependency Pairs are created:

TOP(ok(f(g(X''), Y'))) -> TOP(mark(f(X'', f(g(X''), Y'))))
TOP(ok(f(X1', X2'))) -> TOP(f(active(X1'), X2'))
TOP(ok(g(X''))) -> TOP(g(active(X'')))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

           →DP Problem 14

             ↳Nar

...

               →DP Problem 15

                 ↳Narrowing Transformation

Dependency Pairs:

TOP(ok(g(X''))) -> TOP(g(active(X'')))
TOP(ok(f(X1', X2'))) -> TOP(f(active(X1'), X2'))
TOP(ok(f(g(X''), Y'))) -> TOP(mark(f(X'', f(g(X''), Y'))))
TOP(mark(f(X1', X2'))) -> TOP(f(proper(X1'), proper(X2')))
TOP(mark(g(X''))) -> TOP(g(proper(X'')))

Rules:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

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

TOP(mark(f(X1', X2'))) -> TOP(f(proper(X1'), proper(X2')))

four new Dependency Pairs are created:

TOP(mark(f(f(X1'', X2''), X2'))) -> TOP(f(f(proper(X1''), proper(X2'')), proper(X2')))
TOP(mark(f(g(X'), X2'))) -> TOP(f(g(proper(X')), proper(X2')))
TOP(mark(f(X1', f(X1'', X2'')))) -> TOP(f(proper(X1'), f(proper(X1''), proper(X2''))))
TOP(mark(f(X1', g(X')))) -> TOP(f(proper(X1'), g(proper(X'))))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

           →DP Problem 14

             ↳Nar

...

               →DP Problem 16

                 ↳Narrowing Transformation

Dependency Pairs:

TOP(mark(f(X1', g(X')))) -> TOP(f(proper(X1'), g(proper(X'))))
TOP(mark(f(X1', f(X1'', X2'')))) -> TOP(f(proper(X1'), f(proper(X1''), proper(X2''))))
TOP(mark(f(g(X'), X2'))) -> TOP(f(g(proper(X')), proper(X2')))
TOP(ok(f(X1', X2'))) -> TOP(f(active(X1'), X2'))
TOP(mark(f(f(X1'', X2''), X2'))) -> TOP(f(f(proper(X1''), proper(X2'')), proper(X2')))
TOP(ok(f(g(X''), Y'))) -> TOP(mark(f(X'', f(g(X''), Y'))))
TOP(mark(g(X''))) -> TOP(g(proper(X'')))
TOP(ok(g(X''))) -> TOP(g(active(X'')))

Rules:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

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

TOP(mark(g(X''))) -> TOP(g(proper(X'')))

two new Dependency Pairs are created:

TOP(mark(g(f(X1', X2')))) -> TOP(g(f(proper(X1'), proper(X2'))))
TOP(mark(g(g(X')))) -> TOP(g(g(proper(X'))))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

           →DP Problem 14

             ↳Nar

...

               →DP Problem 17

                 ↳Narrowing Transformation

Dependency Pairs:

TOP(mark(g(g(X')))) -> TOP(g(g(proper(X'))))
TOP(mark(g(f(X1', X2')))) -> TOP(g(f(proper(X1'), proper(X2'))))
TOP(mark(f(X1', f(X1'', X2'')))) -> TOP(f(proper(X1'), f(proper(X1''), proper(X2''))))
TOP(mark(f(g(X'), X2'))) -> TOP(f(g(proper(X')), proper(X2')))
TOP(ok(g(X''))) -> TOP(g(active(X'')))
TOP(ok(f(X1', X2'))) -> TOP(f(active(X1'), X2'))
TOP(mark(f(f(X1'', X2''), X2'))) -> TOP(f(f(proper(X1''), proper(X2'')), proper(X2')))
TOP(ok(f(g(X''), Y'))) -> TOP(mark(f(X'', f(g(X''), Y'))))
TOP(mark(f(X1', g(X')))) -> TOP(f(proper(X1'), g(proper(X'))))

Rules:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

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

TOP(ok(f(X1', X2'))) -> TOP(f(active(X1'), X2'))

three new Dependency Pairs are created:

TOP(ok(f(f(g(X'), Y'), X2'))) -> TOP(f(mark(f(X', f(g(X'), Y'))), X2'))
TOP(ok(f(f(X1'', X2''), X2'))) -> TOP(f(f(active(X1''), X2''), X2'))
TOP(ok(f(g(X'), X2'))) -> TOP(f(g(active(X')), X2'))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

           →DP Problem 14

             ↳Nar

...

               →DP Problem 18

                 ↳Narrowing Transformation

Dependency Pairs:

TOP(ok(f(g(X'), X2'))) -> TOP(f(g(active(X')), X2'))
TOP(ok(f(f(X1'', X2''), X2'))) -> TOP(f(f(active(X1''), X2''), X2'))
TOP(ok(f(f(g(X'), Y'), X2'))) -> TOP(f(mark(f(X', f(g(X'), Y'))), X2'))
TOP(mark(g(f(X1', X2')))) -> TOP(g(f(proper(X1'), proper(X2'))))
TOP(mark(f(X1', g(X')))) -> TOP(f(proper(X1'), g(proper(X'))))
TOP(mark(f(X1', f(X1'', X2'')))) -> TOP(f(proper(X1'), f(proper(X1''), proper(X2''))))
TOP(mark(f(g(X'), X2'))) -> TOP(f(g(proper(X')), proper(X2')))
TOP(ok(g(X''))) -> TOP(g(active(X'')))
TOP(mark(f(f(X1'', X2''), X2'))) -> TOP(f(f(proper(X1''), proper(X2'')), proper(X2')))
TOP(ok(f(g(X''), Y'))) -> TOP(mark(f(X'', f(g(X''), Y'))))
TOP(mark(g(g(X')))) -> TOP(g(g(proper(X'))))

Rules:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

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

TOP(ok(g(X''))) -> TOP(g(active(X'')))

three new Dependency Pairs are created:

TOP(ok(g(f(g(X'), Y')))) -> TOP(g(mark(f(X', f(g(X'), Y')))))
TOP(ok(g(f(X1', X2')))) -> TOP(g(f(active(X1'), X2')))
TOP(ok(g(g(X')))) -> TOP(g(g(active(X'))))

The transformation is resulting in one new DP problem:

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

           →DP Problem 14

             ↳Nar

...

               →DP Problem 19

                 ↳Polynomial Ordering

Dependency Pairs:

TOP(ok(g(g(X')))) -> TOP(g(g(active(X'))))
TOP(ok(g(f(X1', X2')))) -> TOP(g(f(active(X1'), X2')))
TOP(ok(g(f(g(X'), Y')))) -> TOP(g(mark(f(X', f(g(X'), Y')))))
TOP(ok(f(f(X1'', X2''), X2'))) -> TOP(f(f(active(X1''), X2''), X2'))
TOP(ok(f(f(g(X'), Y'), X2'))) -> TOP(f(mark(f(X', f(g(X'), Y'))), X2'))
TOP(mark(g(g(X')))) -> TOP(g(g(proper(X'))))
TOP(mark(g(f(X1', X2')))) -> TOP(g(f(proper(X1'), proper(X2'))))
TOP(mark(f(X1', g(X')))) -> TOP(f(proper(X1'), g(proper(X'))))
TOP(mark(f(X1', f(X1'', X2'')))) -> TOP(f(proper(X1'), f(proper(X1''), proper(X2''))))
TOP(mark(f(g(X'), X2'))) -> TOP(f(g(proper(X')), proper(X2')))
TOP(mark(f(f(X1'', X2''), X2'))) -> TOP(f(f(proper(X1''), proper(X2'')), proper(X2')))
TOP(ok(f(g(X''), Y'))) -> TOP(mark(f(X'', f(g(X''), Y'))))
TOP(ok(f(g(X'), X2'))) -> TOP(f(g(active(X')), X2'))

Rules:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

The following dependency pairs can be strictly oriented:

TOP(ok(g(g(X')))) -> TOP(g(g(active(X'))))
TOP(ok(g(f(X1', X2')))) -> TOP(g(f(active(X1'), X2')))
TOP(ok(g(f(g(X'), Y')))) -> TOP(g(mark(f(X', f(g(X'), Y')))))
TOP(ok(f(f(X1'', X2''), X2'))) -> TOP(f(f(active(X1''), X2''), X2'))
TOP(ok(f(f(g(X'), Y'), X2'))) -> TOP(f(mark(f(X', f(g(X'), Y'))), X2'))
TOP(ok(f(g(X''), Y'))) -> TOP(mark(f(X'', f(g(X''), Y'))))
TOP(ok(f(g(X'), X2'))) -> TOP(f(g(active(X')), X2'))

Additionally, the following usable rules w.r.t. to the implicit AFS can be oriented:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(active(x₁)) = x₁

POL(proper(x₁)) = 0

POL(g(x₁)) = x₁

POL(mark(x₁)) = 0

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

POL(TOP(x₁)) = x₁

POL(f(x₁, x₂)) = x₂

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

           →DP Problem 14

             ↳Nar

...

               →DP Problem 20

                 ↳Polynomial Ordering

Dependency Pairs:

TOP(mark(g(g(X')))) -> TOP(g(g(proper(X'))))
TOP(mark(g(f(X1', X2')))) -> TOP(g(f(proper(X1'), proper(X2'))))
TOP(mark(f(X1', g(X')))) -> TOP(f(proper(X1'), g(proper(X'))))
TOP(mark(f(X1', f(X1'', X2'')))) -> TOP(f(proper(X1'), f(proper(X1''), proper(X2''))))
TOP(mark(f(g(X'), X2'))) -> TOP(f(g(proper(X')), proper(X2')))
TOP(mark(f(f(X1'', X2''), X2'))) -> TOP(f(f(proper(X1''), proper(X2'')), proper(X2')))

Rules:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

The following dependency pairs can be strictly oriented:

TOP(mark(g(g(X')))) -> TOP(g(g(proper(X'))))
TOP(mark(g(f(X1', X2')))) -> TOP(g(f(proper(X1'), proper(X2'))))
TOP(mark(f(X1', g(X')))) -> TOP(f(proper(X1'), g(proper(X'))))
TOP(mark(f(X1', f(X1'', X2'')))) -> TOP(f(proper(X1'), f(proper(X1''), proper(X2''))))
TOP(mark(f(g(X'), X2'))) -> TOP(f(g(proper(X')), proper(X2')))
TOP(mark(f(f(X1'', X2''), X2'))) -> TOP(f(f(proper(X1''), proper(X2'')), proper(X2')))

Additionally, the following usable rules w.r.t. to the implicit AFS can be oriented:

proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))

Used ordering: Polynomial ordering with Polynomial interpretation:

POL(proper(x₁)) = 0

POL(g(x₁)) = x₁

POL(mark(x₁)) = 1

POL(ok(x₁)) = 0

POL(TOP(x₁)) = x₁

POL(f(x₁, x₂)) = x₁

resulting in one new DP problem.

     ↳DPs

       →DP Problem 1

         ↳Polo

       →DP Problem 2

         ↳Polo

       →DP Problem 3

         ↳Polo

       →DP Problem 4

         ↳Polo

       →DP Problem 5

         ↳Nar

           →DP Problem 14

             ↳Nar

...

               →DP Problem 21

                 ↳Dependency Graph

Dependency Pair:

Rules:

active(f(g(X), Y)) -> mark(f(X, f(g(X), Y)))
active(f(X1, X2)) -> f(active(X1), X2)
active(g(X)) -> g(active(X))
f(mark(X1), X2) -> mark(f(X1, X2))
f(ok(X1), ok(X2)) -> ok(f(X1, X2))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2)) -> f(proper(X1), proper(X2))
proper(g(X)) -> g(proper(X))
top(mark(X)) -> top(proper(X))
top(ok(X)) -> top(active(X))

Using the Dependency Graph resulted in no new DP problems.

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

POL(mark(x₁))	= 0
POL(ok(x₁))	= 1 + x₁
POL(F(x₁, x₂))	= x₂

POL(G(x₁))	= x₁
POL(mark(x₁))	= x₁
POL(ok(x₁))	= 1 + x₁

POL(ACTIVE(x₁))	= x₁
POL(g(x₁))	= 1 + x₁
POL(f(x₁, x₂))	= x₁

POL(g(x₁))	= 1 + x₁
POL(PROPER(x₁))	= x₁
POL(f(x₁, x₂))	= x₁ + x₂