Certification Problem
Input (TPDB TRS_Standard/Strategy_removed_mixed_05/test9)
The rewrite relation of the following TRS is considered.
|
f(0,1,X) |
→ |
h(X,X) |
(1) |
|
h(0,X) |
→ |
f(0,X,X) |
(2) |
|
g(X,Y) |
→ |
X |
(3) |
|
g(X,Y) |
→ |
Y |
(4) |
Property / Task
Prove or disprove termination.Answer / Result
No.Proof (by AProVE @ termCOMP 2023)
1 Dependency Pair Transformation
The following set of initial dependency pairs has been identified.
|
f#(0,1,X) |
→ |
h#(X,X) |
(5) |
|
h#(0,X) |
→ |
f#(0,X,X) |
(6) |
It remains to prove infiniteness of the resulting DP problem.
1.1 Loop
The following loop proves infiniteness of the DP problem.
| t0
|
= |
h#(g(1,0),g(1,0)) |
|
→R
|
h#(0,g(1,0)) |
|
→P
|
f#(0,g(1,0),g(1,0)) |
|
→R
|
f#(0,1,g(1,0)) |
|
→P
|
h#(g(1,0),g(1,0)) |
|
= |
t4
|
where t4 =
t0