(0) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(mapbt, f), app(leaf, x)) → app(leaf, app(f, x))
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))

Q is empty.

(1) Overlay + Local Confluence (EQUIVALENT transformation)

The TRS is overlay and locally confluent. By [NOC] we can switch to innermost.

(2) Obligation:

Q restricted rewrite system:
The TRS R consists of the following rules:

app(app(mapbt, f), app(leaf, x)) → app(leaf, app(f, x))
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))

The set Q consists of the following terms:

app(app(mapbt, x0), app(leaf, x1))
app(app(mapbt, x0), app(app(app(branch, x1), x2), x3))

(3) DependencyPairsProof (EQUIVALENT transformation)

Using Dependency Pairs [AG00,LPAR04] we result in the following initial DP problem.

(4) Obligation:

Q DP problem:
The TRS P consists of the following rules:

APP(app(mapbt, f), app(leaf, x)) → APP(leaf, app(f, x))
APP(app(mapbt, f), app(leaf, x)) → APP(f, x)
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))
APP(app(mapbt, f), app(app(app(branch, x), l), r)) → APP(app(branch, app(f, x)), app(app(mapbt, f), l))
APP(app(mapbt, f), app(app(app(branch, x), l), r)) → APP(branch, app(f, x))
APP(app(mapbt, f), app(app(app(branch, x), l), r)) → APP(f, x)
APP(app(mapbt, f), app(app(app(branch, x), l), r)) → APP(app(mapbt, f), l)
APP(app(mapbt, f), app(app(app(branch, x), l), r)) → APP(app(mapbt, f), r)

The TRS R consists of the following rules:

app(app(mapbt, f), app(leaf, x)) → app(leaf, app(f, x))
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))

The set Q consists of the following terms:

app(app(mapbt, x0), app(leaf, x1))
app(app(mapbt, x0), app(app(app(branch, x1), x2), x3))

We have to consider all minimal (P,Q,R)-chains.

(5) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 1 SCC with 4 less nodes.

(6) Obligation:

Q DP problem:
The TRS P consists of the following rules:

APP(app(mapbt, f), app(app(app(branch, x), l), r)) → APP(f, x)
APP(app(mapbt, f), app(leaf, x)) → APP(f, x)
APP(app(mapbt, f), app(app(app(branch, x), l), r)) → APP(app(mapbt, f), l)
APP(app(mapbt, f), app(app(app(branch, x), l), r)) → APP(app(mapbt, f), r)

The TRS R consists of the following rules:

app(app(mapbt, f), app(leaf, x)) → app(leaf, app(f, x))
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))

The set Q consists of the following terms:

app(app(mapbt, x0), app(leaf, x1))
app(app(mapbt, x0), app(app(app(branch, x1), x2), x3))

We have to consider all minimal (P,Q,R)-chains.

(7) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


APP(app(mapbt, f), app(app(app(branch, x), l), r)) → APP(f, x)
APP(app(mapbt, f), app(leaf, x)) → APP(f, x)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
APP(x1, x2)  =  x1
app(x1, x2)  =  app(x2)
mapbt  =  mapbt
branch  =  branch
leaf  =  leaf

Recursive path order with status [RPO].
Precedence:
mapbt > app1
branch > app1
leaf > app1

Status:
app1: [1]
mapbt: multiset
branch: multiset
leaf: multiset

The following usable rules [FROCOS05] were oriented:

app(app(mapbt, f), app(leaf, x)) → app(leaf, app(f, x))
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) Obligation:

Q DP problem:
The TRS P consists of the following rules:

APP(app(mapbt, f), app(app(app(branch, x), l), r)) → APP(app(mapbt, f), l)
APP(app(mapbt, f), app(app(app(branch, x), l), r)) → APP(app(mapbt, f), r)

The TRS R consists of the following rules:

app(app(mapbt, f), app(leaf, x)) → app(leaf, app(f, x))
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))

The set Q consists of the following terms:

app(app(mapbt, x0), app(leaf, x1))
app(app(mapbt, x0), app(app(app(branch, x1), x2), x3))

We have to consider all minimal (P,Q,R)-chains.