Certification Problem

Input (TPDB TRS_Standard/AProVE_06/nonterm)

The rewrite relation of the following TRS is considered.

f(s(s(s(s(s(s(s(s(x)))))))),y,y) → f(id(s(s(s(s(s(s(s(s(x))))))))),y,y) (1)
id(s(x)) → s(id(x)) (2)
id(0) → 0 (3)

Property / Task

Prove or disprove termination.

Answer / Result

No.

Proof (by AProVE @ termCOMP 2023)

1 Innermost Lhss Increase

We add the following left hand sides to the innermost strategy.
f(s(s(s(s(s(s(s(s(x0)))))))),x1,x1)
id(s(x0))
id(0)

1.1 Dependency Pair Transformation

The following set of initial dependency pairs has been identified.
f#(s(s(s(s(s(s(s(s(x)))))))),y,y) → f#(id(s(s(s(s(s(s(s(s(x))))))))),y,y) (4)
f#(s(s(s(s(s(s(s(s(x)))))))),y,y) → id#(s(s(s(s(s(s(s(s(x))))))))) (5)
id#(s(x)) → id#(x) (6)
It remains to prove infiniteness of the resulting DP problem.

1.1.1 Pair and Rule Removal

Some pairs and rules have been removed and it remains to prove infiniteness of the remaing problem. The following pairs have been deleted.
f#(s(s(s(s(s(s(s(s(x)))))))),y,y) → id#(s(s(s(s(s(s(s(s(x))))))))) (5)
id#(s(x)) → id#(x) (6)
and the following rules have been deleted.

1.1.1.1 Pair and Rule Removal

Some pairs and rules have been removed and it remains to prove infiniteness of the remaing problem. The following pairs have been deleted. and the following rules have been deleted.
f(s(s(s(s(s(s(s(s(x)))))))),y,y) → f(id(s(s(s(s(s(s(s(s(x))))))))),y,y) (1)

1.1.1.1.1 Innermost Lhss Removal Processor

We restrict the innermost strategy to the following left hand sides.

id(s(x0))
id(0)

1.1.1.1.1.1 Rewriting Processor

We rewrite the right hand side of the pair resulting in
→

1.1.1.1.1.1.1 Rewriting Processor

We rewrite the right hand side of the pair resulting in
→

1.1.1.1.1.1.1.1 Rewriting Processor

We rewrite the right hand side of the pair resulting in
→

1.1.1.1.1.1.1.1.1 Rewriting Processor

We rewrite the right hand side of the pair resulting in
→

1.1.1.1.1.1.1.1.1.1 Rewriting Processor

We rewrite the right hand side of the pair resulting in
→

1.1.1.1.1.1.1.1.1.1.1 Rewriting Processor

We rewrite the right hand side of the pair resulting in
→

1.1.1.1.1.1.1.1.1.1.1.1 Rewriting Processor

We rewrite the right hand side of the pair resulting in
→

1.1.1.1.1.1.1.1.1.1.1.1.1 Rewriting Processor

We rewrite the right hand side of the pair resulting in
→

1.1.1.1.1.1.1.1.1.1.1.1.1.1 Full Strategy Switch Processor

We have a locally confluent overlay TRS, no overlaps between P and R, and the strategy is less than innermost. Hence, it suffices to prove non-termination for the full rewrite relation.

Local Confluence Proof

All critical pairs are joinable within 0 step(s). 0

1.1.1.1.1.1.1.1.1.1.1.1.1.1.1 Loop

The following loop proves infiniteness of the DP problem.

t0 = f#(s(s(s(s(s(s(s(s(x)))))))),y,y)
→P f#(s(s(s(s(s(s(s(s(id(x))))))))),y,y)
= t1
where t1 = t0σ and σ = {x/id(x), y/y}