Certification Problem

Input (TPDB TRS_Standard/AotoYamada_05/006)

The rewrite relation of the following TRS is considered.

app(app(mapbt,f),app(leaf,x)) app(leaf,app(f,x)) (1)
app(app(mapbt,f),app(app(app(branch,x),l),r)) app(app(app(branch,app(f,x)),app(app(mapbt,f),l)),app(app(mapbt,f),r)) (2)

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.
app#(app(mapbt,f),app(app(app(branch,x),l),r)) app#(app(branch,app(f,x)),app(app(mapbt,f),l)) (3)
app#(app(mapbt,f),app(app(app(branch,x),l),r)) app#(app(mapbt,f),r) (4)
app#(app(mapbt,f),app(leaf,x)) app#(leaf,app(f,x)) (5)
app#(app(mapbt,f),app(app(app(branch,x),l),r)) app#(app(mapbt,f),l) (6)
app#(app(mapbt,f),app(app(app(branch,x),l),r)) app#(branch,app(f,x)) (7)
app#(app(mapbt,f),app(app(app(branch,x),l),r)) app#(app(app(branch,app(f,x)),app(app(mapbt,f),l)),app(app(mapbt,f),r)) (8)
app#(app(mapbt,f),app(leaf,x)) app#(f,x) (9)
app#(app(mapbt,f),app(app(app(branch,x),l),r)) app#(f,x) (10)

1.1 Dependency Graph Processor

The dependency pairs are split into 1 component.