Termination Proof using AProVE

Term Rewriting System R:
[x]
active(f(x)) -> mark(f(f(x)))
chk(no(f(x))) -> f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
chk(no(c)) -> active(c)
mat(f(x), f(y)) -> f(mat(x, y))
mat(f(x), c) -> no(c)
f(active(x)) -> active(f(x))
f(no(x)) -> no(f(x))
f(mark(x)) -> mark(f(x))
tp(mark(x)) -> tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))

Termination of R to be shown.

     ↳Dependency Pair Analysis

R contains the following Dependency Pairs:

ACTIVE(f(x)) -> F(f(x))
CHK(no(f(x))) -> F(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
CHK(no(f(x))) -> CHK(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x))
CHK(no(f(x))) -> MAT(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)
CHK(no(f(x))) -> F(f(f(f(f(f(f(f(f(f(X))))))))))
CHK(no(f(x))) -> F(f(f(f(f(f(f(f(f(X)))))))))
CHK(no(f(x))) -> F(f(f(f(f(f(f(f(X))))))))
CHK(no(f(x))) -> F(f(f(f(f(f(f(X)))))))
CHK(no(f(x))) -> F(f(f(f(f(f(X))))))
CHK(no(f(x))) -> F(f(f(f(f(X)))))
CHK(no(f(x))) -> F(f(f(f(X))))
CHK(no(f(x))) -> F(f(f(X)))
CHK(no(f(x))) -> F(f(X))
CHK(no(f(x))) -> F(X)
CHK(no(c)) -> ACTIVE(c)
MAT(f(x), f(y)) -> F(mat(x, y))
MAT(f(x), f(y)) -> MAT(x, y)
F(active(x)) -> ACTIVE(f(x))
F(active(x)) -> F(x)
F(no(x)) -> F(x)
F(mark(x)) -> F(x)
TP(mark(x)) -> TP(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
TP(mark(x)) -> CHK(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x))
TP(mark(x)) -> MAT(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)
TP(mark(x)) -> F(f(f(f(f(f(f(f(f(f(X))))))))))
TP(mark(x)) -> F(f(f(f(f(f(f(f(f(X)))))))))
TP(mark(x)) -> F(f(f(f(f(f(f(f(X))))))))
TP(mark(x)) -> F(f(f(f(f(f(f(X)))))))
TP(mark(x)) -> F(f(f(f(f(f(X))))))
TP(mark(x)) -> F(f(f(f(f(X)))))
TP(mark(x)) -> F(f(f(f(X))))
TP(mark(x)) -> F(f(f(X)))
TP(mark(x)) -> F(f(X))
TP(mark(x)) -> F(X)

Furthermore, R contains three SCCs.

     ↳DPs

       →DP Problem 1

         ↳Argument Filtering and Ordering

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳Remaining

Dependency Pairs:

F(mark(x)) -> F(x)
F(no(x)) -> F(x)
F(active(x)) -> F(x)
F(active(x)) -> ACTIVE(f(x))
ACTIVE(f(x)) -> F(f(x))

Rules:

active(f(x)) -> mark(f(f(x)))
chk(no(f(x))) -> f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
chk(no(c)) -> active(c)
mat(f(x), f(y)) -> f(mat(x, y))
mat(f(x), c) -> no(c)
f(active(x)) -> active(f(x))
f(no(x)) -> no(f(x))
f(mark(x)) -> mark(f(x))
tp(mark(x)) -> tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))

The following dependency pairs can be strictly oriented:

F(mark(x)) -> F(x)
F(no(x)) -> F(x)
F(active(x)) -> F(x)
F(active(x)) -> ACTIVE(f(x))

The following usable rules using the Ce-refinement can be oriented:

f(active(x)) -> active(f(x))
f(no(x)) -> no(f(x))
f(mark(x)) -> mark(f(x))
active(f(x)) -> mark(f(f(x)))

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

{active, mark}
{F, ACTIVE}

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

F(x₁) -> F(x₁)
active(x₁) -> active(x₁)
mark(x₁) -> mark(x₁)
no(x₁) -> no(x₁)
ACTIVE(x₁) -> ACTIVE(x₁)
f(x₁) -> x₁

     ↳DPs

       →DP Problem 1

         ↳AFS

           →DP Problem 4

             ↳Dependency Graph

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳Remaining

Dependency Pair:

ACTIVE(f(x)) -> F(f(x))

Rules:

active(f(x)) -> mark(f(f(x)))
chk(no(f(x))) -> f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
chk(no(c)) -> active(c)
mat(f(x), f(y)) -> f(mat(x, y))
mat(f(x), c) -> no(c)
f(active(x)) -> active(f(x))
f(no(x)) -> no(f(x))
f(mark(x)) -> mark(f(x))
tp(mark(x)) -> tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), 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

         ↳Remaining

Dependency Pair:

CHK(no(f(x))) -> CHK(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x))

Rules:

active(f(x)) -> mark(f(f(x)))
chk(no(f(x))) -> f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
chk(no(c)) -> active(c)
mat(f(x), f(y)) -> f(mat(x, y))
mat(f(x), c) -> no(c)
f(active(x)) -> active(f(x))
f(no(x)) -> no(f(x))
f(mark(x)) -> mark(f(x))
tp(mark(x)) -> tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))

The following dependency pair can be strictly oriented:

CHK(no(f(x))) -> CHK(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x))

The following usable rules using the Ce-refinement can be oriented:

mat(f(x), f(y)) -> f(mat(x, y))
mat(f(x), c) -> no(c)
f(active(x)) -> active(f(x))
f(no(x)) -> no(f(x))
f(mark(x)) -> mark(f(x))
active(f(x)) -> mark(f(f(x)))

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

{active, no, f, mat}

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

CHK(x₁) -> CHK(x₁)
no(x₁) -> no(x₁)
mat(x₁, x₂) -> mat(x₂)
f(x₁) -> f(x₁)
active(x₁) -> active(x₁)
mark(x₁) -> x₁

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

           →DP Problem 5

             ↳Dependency Graph

       →DP Problem 3

         ↳Remaining

Dependency Pair:

Rules:

active(f(x)) -> mark(f(f(x)))
chk(no(f(x))) -> f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
chk(no(c)) -> active(c)
mat(f(x), f(y)) -> f(mat(x, y))
mat(f(x), c) -> no(c)
f(active(x)) -> active(f(x))
f(no(x)) -> no(f(x))
f(mark(x)) -> mark(f(x))
tp(mark(x)) -> tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))

Using the Dependency Graph resulted in no new DP problems.

     ↳DPs

       →DP Problem 1

         ↳AFS

       →DP Problem 2

         ↳AFS

       →DP Problem 3

         ↳Remaining Obligation(s)

The following remains to be proven:
Dependency Pair:

TP(mark(x)) -> TP(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))

Rules:

active(f(x)) -> mark(f(f(x)))
chk(no(f(x))) -> f(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))
chk(no(c)) -> active(c)
mat(f(x), f(y)) -> f(mat(x, y))
mat(f(x), c) -> no(c)
f(active(x)) -> active(f(x))
f(no(x)) -> no(f(x))
f(mark(x)) -> mark(f(x))
tp(mark(x)) -> tp(chk(mat(f(f(f(f(f(f(f(f(f(f(X)))))))))), x)))

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