Certification Problem
Input (TPDB TRS_Standard/Transformed_CSR_04/Ex6_GM04_C)
The rewrite relation of the following TRS is considered.
active(c) |
→ |
mark(f(g(c))) |
(1) |
active(f(g(X))) |
→ |
mark(g(X)) |
(2) |
proper(c) |
→ |
ok(c) |
(3) |
proper(f(X)) |
→ |
f(proper(X)) |
(4) |
proper(g(X)) |
→ |
g(proper(X)) |
(5) |
f(ok(X)) |
→ |
ok(f(X)) |
(6) |
g(ok(X)) |
→ |
ok(g(X)) |
(7) |
top(mark(X)) |
→ |
top(proper(X)) |
(8) |
top(ok(X)) |
→ |
top(active(X)) |
(9) |
Property / Task
Prove or disprove termination.Answer / Result
Yes.Proof (by NaTT @ termCOMP 2023)
1 Dependency Pair Transformation
The following set of initial dependency pairs has been identified.
top#(ok(X)) |
→ |
top#(active(X)) |
(10) |
proper#(g(X)) |
→ |
proper#(X) |
(11) |
top#(mark(X)) |
→ |
top#(proper(X)) |
(12) |
proper#(f(X)) |
→ |
f#(proper(X)) |
(13) |
proper#(f(X)) |
→ |
proper#(X) |
(14) |
active#(c) |
→ |
f#(g(c)) |
(15) |
top#(mark(X)) |
→ |
proper#(X) |
(16) |
proper#(g(X)) |
→ |
g#(proper(X)) |
(17) |
top#(ok(X)) |
→ |
active#(X) |
(18) |
f#(ok(X)) |
→ |
f#(X) |
(19) |
active#(c) |
→ |
g#(c) |
(20) |
g#(ok(X)) |
→ |
g#(X) |
(21) |
1.1 Dependency Graph Processor
The dependency pairs are split into 4
components.
-
The
1st
component contains the
pair
top#(mark(X)) |
→ |
top#(proper(X)) |
(12) |
top#(ok(X)) |
→ |
top#(active(X)) |
(10) |
1.1.1 Reduction Pair Processor with Usable Rules
Using the Max-polynomial interpretation
[top(x1)] |
=
|
0 |
[top#(x1)] |
=
|
x1 + 0 |
[c] |
=
|
41655 |
[f(x1)] |
=
|
x1 + 2999 |
[proper(x1)] |
=
|
x1 + 1 |
[ok(x1)] |
=
|
x1 + 0 |
[mark(x1)] |
=
|
x1 + 2999 |
[f#(x1)] |
=
|
0 |
[g#(x1)] |
=
|
0 |
[proper#(x1)] |
=
|
0 |
[active(x1)] |
=
|
x1 + 0 |
[active#(x1)] |
=
|
0 |
[g(x1)] |
=
|
35657 |
together with the usable
rules
proper(f(X)) |
→ |
f(proper(X)) |
(4) |
active(c) |
→ |
mark(f(g(c))) |
(1) |
proper(c) |
→ |
ok(c) |
(3) |
proper(g(X)) |
→ |
g(proper(X)) |
(5) |
g(ok(X)) |
→ |
ok(g(X)) |
(7) |
f(ok(X)) |
→ |
ok(f(X)) |
(6) |
active(f(g(X))) |
→ |
mark(g(X)) |
(2) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
top#(mark(X)) |
→ |
top#(proper(X)) |
(12) |
could be deleted.
1.1.1.1 Dependency Graph Processor
The dependency pairs are split into 1
component.
-
The
2nd
component contains the
pair
proper#(f(X)) |
→ |
proper#(X) |
(14) |
proper#(g(X)) |
→ |
proper#(X) |
(11) |
1.1.2 Reduction Pair Processor with Usable Rules
Using the Max-polynomial interpretation
[top(x1)] |
=
|
0 |
[top#(x1)] |
=
|
x1 + 0 |
[c] |
=
|
1 |
[f(x1)] |
=
|
x1 + 2241 |
[proper(x1)] |
=
|
x1 + 3037 |
[ok(x1)] |
=
|
x1 + 3037 |
[mark(x1)] |
=
|
x1 + 0 |
[f#(x1)] |
=
|
0 |
[g#(x1)] |
=
|
0 |
[proper#(x1)] |
=
|
x1 + 0 |
[active(x1)] |
=
|
x1 + 2242 |
[active#(x1)] |
=
|
0 |
[g(x1)] |
=
|
x1 + 1 |
together with the usable
rules
proper(f(X)) |
→ |
f(proper(X)) |
(4) |
active(c) |
→ |
mark(f(g(c))) |
(1) |
proper(c) |
→ |
ok(c) |
(3) |
proper(g(X)) |
→ |
g(proper(X)) |
(5) |
g(ok(X)) |
→ |
ok(g(X)) |
(7) |
f(ok(X)) |
→ |
ok(f(X)) |
(6) |
active(f(g(X))) |
→ |
mark(g(X)) |
(2) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pairs
proper#(f(X)) |
→ |
proper#(X) |
(14) |
proper#(g(X)) |
→ |
proper#(X) |
(11) |
could be deleted.
1.1.2.1 Dependency Graph Processor
The dependency pairs are split into 0
components.
-
The
3rd
component contains the
pair
1.1.3 Reduction Pair Processor with Usable Rules
Using the Max-polynomial interpretation
[top(x1)] |
=
|
0 |
[top#(x1)] |
=
|
x1 + 0 |
[c] |
=
|
1 |
[f(x1)] |
=
|
x1 + 1 |
[proper(x1)] |
=
|
x1 + 38145 |
[ok(x1)] |
=
|
x1 + 38145 |
[mark(x1)] |
=
|
x1 + 0 |
[f#(x1)] |
=
|
0 |
[g#(x1)] |
=
|
x1 + 0 |
[proper#(x1)] |
=
|
0 |
[active(x1)] |
=
|
x1 + 36230 |
[active#(x1)] |
=
|
0 |
[g(x1)] |
=
|
x1 + 36229 |
together with the usable
rules
proper(f(X)) |
→ |
f(proper(X)) |
(4) |
active(c) |
→ |
mark(f(g(c))) |
(1) |
proper(c) |
→ |
ok(c) |
(3) |
proper(g(X)) |
→ |
g(proper(X)) |
(5) |
g(ok(X)) |
→ |
ok(g(X)) |
(7) |
f(ok(X)) |
→ |
ok(f(X)) |
(6) |
active(f(g(X))) |
→ |
mark(g(X)) |
(2) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
could be deleted.
1.1.3.1 Dependency Graph Processor
The dependency pairs are split into 0
components.
-
The
4th
component contains the
pair
1.1.4 Reduction Pair Processor with Usable Rules
Using the Max-polynomial interpretation
[top(x1)] |
=
|
0 |
[top#(x1)] |
=
|
x1 + 0 |
[c] |
=
|
1 |
[f(x1)] |
=
|
x1 + 1 |
[proper(x1)] |
=
|
x1 + 38145 |
[ok(x1)] |
=
|
x1 + 38145 |
[mark(x1)] |
=
|
x1 + 0 |
[f#(x1)] |
=
|
x1 + 0 |
[g#(x1)] |
=
|
0 |
[proper#(x1)] |
=
|
0 |
[active(x1)] |
=
|
x1 + 49486 |
[active#(x1)] |
=
|
0 |
[g(x1)] |
=
|
x1 + 49485 |
together with the usable
rules
proper(f(X)) |
→ |
f(proper(X)) |
(4) |
active(c) |
→ |
mark(f(g(c))) |
(1) |
proper(c) |
→ |
ok(c) |
(3) |
proper(g(X)) |
→ |
g(proper(X)) |
(5) |
g(ok(X)) |
→ |
ok(g(X)) |
(7) |
f(ok(X)) |
→ |
ok(f(X)) |
(6) |
active(f(g(X))) |
→ |
mark(g(X)) |
(2) |
(w.r.t. the implicit argument filter of the reduction pair),
the
pair
could be deleted.
1.1.4.1 Dependency Graph Processor
The dependency pairs are split into 0
components.