Certification Problem

Input (TPDB TRS_Standard/SK90/2.34)

The rewrite relation of the following TRS is considered.

if(true,x,y)	→	x	(1)
if(false,x,y)	→	y	(2)
if(x,y,y)	→	y	(3)
if(if(x,y,z),u,v)	→	if(x,if(y,u,v),if(z,u,v))	(4)

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.

if^#(if(x,y,z),u,v)	→	if^#(y,u,v)	(5)
if^#(if(x,y,z),u,v)	→	if^#(z,u,v)	(6)
if^#(if(x,y,z),u,v)	→	if^#(x,if(y,u,v),if(z,u,v))	(7)

1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.

The 1^st component contains the pair

if^#(if(x,y,z),u,v) → if^#(x,if(y,u,v),if(z,u,v)) (7)

if^#(if(x,y,z),u,v) → if^#(z,u,v) (6)

if^#(if(x,y,z),u,v) → if^#(y,u,v) (5)

1.1.1 Reduction Pair Processor with Usable Rules
Using the Max-polynomial interpretation

[v] = 1

[u] = 2438

[false] = 19306

[true] = 44083

[if(x₁, x₂, x₃)] = x₁ + x₂ + x₃ + 38978

[if^#(x₁, x₂, x₃)] = x₁ + 0

having no usable rules (w.r.t. the implicit argument filter of the reduction pair), the pairs

if^#(if(x,y,z),u,v) → if^#(x,if(y,u,v),if(z,u,v)) (7)

if^#(if(x,y,z),u,v) → if^#(z,u,v) (6)

if^#(if(x,y,z),u,v) → if^#(y,u,v) (5)

could be deleted.
1.1.1.1 Dependency Graph Processor

The dependency pairs are split into 0 components.