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

Termination of R to be shown.



   R
Dependency Pair Analysis



R contains the following Dependency Pairs:

ACTIVE(f(X, g(X), Y)) -> F(Y, Y, Y)
ACTIVE(g(X)) -> G(active(X))
ACTIVE(g(X)) -> ACTIVE(X)
G(mark(X)) -> G(X)
G(ok(X)) -> G(X)
PROPER(f(X1, X2, X3)) -> F(proper(X1), proper(X2), proper(X3))
PROPER(f(X1, X2, X3)) -> PROPER(X1)
PROPER(f(X1, X2, X3)) -> PROPER(X2)
PROPER(f(X1, X2, X3)) -> PROPER(X3)
PROPER(g(X)) -> G(proper(X))
PROPER(g(X)) -> PROPER(X)
F(ok(X1), ok(X2), ok(X3)) -> F(X1, X2, X3)
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.


   R
DPs
       →DP Problem 1
Argument Filtering and Ordering
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
Remaining


Dependency Pair:

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


Rules:


active(f(X, g(X), Y)) -> mark(f(Y, Y, Y))
active(g(b)) -> mark(c)
active(b) -> mark(c)
active(g(X)) -> g(active(X))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2, X3)) -> f(proper(X1), proper(X2), proper(X3))
proper(g(X)) -> g(proper(X))
proper(b) -> ok(b)
proper(c) -> ok(c)
f(ok(X1), ok(X2), ok(X3)) -> ok(f(X1, X2, X3))
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), ok(X3)) -> F(X1, X2, X3)


There are no usable rules w.r.t. to the AFS that need to be oriented.
Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
trivial

resulting in one new DP problem.
Used Argument Filtering System:
F(x1, x2, x3) -> F(x1, x2, x3)
ok(x1) -> ok(x1)


   R
DPs
       →DP Problem 1
AFS
           →DP Problem 6
Dependency Graph
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
Remaining


Dependency Pair:


Rules:


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





Using the Dependency Graph resulted in no new DP problems.


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
Argument Filtering and Ordering
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
Remaining


Dependency Pairs:

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


Rules:


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





The following dependency pairs can be strictly oriented:

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


There are no usable rules w.r.t. to the AFS that need to be oriented.
Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
trivial

resulting in one new DP problem.
Used Argument Filtering System:
G(x1) -> G(x1)
ok(x1) -> ok(x1)
mark(x1) -> mark(x1)


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
           →DP Problem 7
Dependency Graph
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
Remaining


Dependency Pair:


Rules:


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





Using the Dependency Graph resulted in no new DP problems.


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
Argument Filtering and Ordering
       →DP Problem 4
AFS
       →DP Problem 5
Remaining


Dependency Pair:

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


Rules:


active(f(X, g(X), Y)) -> mark(f(Y, Y, Y))
active(g(b)) -> mark(c)
active(b) -> mark(c)
active(g(X)) -> g(active(X))
g(mark(X)) -> mark(g(X))
g(ok(X)) -> ok(g(X))
proper(f(X1, X2, X3)) -> f(proper(X1), proper(X2), proper(X3))
proper(g(X)) -> g(proper(X))
proper(b) -> ok(b)
proper(c) -> ok(c)
f(ok(X1), ok(X2), ok(X3)) -> ok(f(X1, X2, X3))
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 AFS that need to be oriented.
Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
trivial

resulting in one new DP problem.
Used Argument Filtering System:
ACTIVE(x1) -> ACTIVE(x1)
g(x1) -> g(x1)


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
AFS
           →DP Problem 8
Dependency Graph
       →DP Problem 4
AFS
       →DP Problem 5
Remaining


Dependency Pair:


Rules:


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





Using the Dependency Graph resulted in no new DP problems.


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
Argument Filtering and Ordering
       →DP Problem 5
Remaining


Dependency Pairs:

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


Rules:


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





The following dependency pairs can be strictly oriented:

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


There are no usable rules w.r.t. to the AFS that need to be oriented.
Used ordering: Lexicographic Path Order with Non-Strict Precedence with Quasi Precedence:
trivial

resulting in one new DP problem.
Used Argument Filtering System:
PROPER(x1) -> PROPER(x1)
f(x1, x2, x3) -> f(x1, x2, x3)
g(x1) -> g(x1)


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
AFS
           →DP Problem 9
Dependency Graph
       →DP Problem 5
Remaining


Dependency Pair:


Rules:


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





Using the Dependency Graph resulted in no new DP problems.


   R
DPs
       →DP Problem 1
AFS
       →DP Problem 2
AFS
       →DP Problem 3
AFS
       →DP Problem 4
AFS
       →DP Problem 5
Remaining Obligation(s)




The following remains to be proven:
Dependency Pairs:

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


Rules:


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




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