Termination w.r.t. Q of the given QTRS could be proven:

(0) Obligation:

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

app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)

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(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)

The set Q consists of the following terms:

app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(filtersub, true), x0), app(app(cons, x1), x2))
app(app(app(filtersub, false), x0), app(app(cons, x1), x2))

(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(filter, f), app(app(cons, y), ys)) → APP(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
APP(app(filter, f), app(app(cons, y), ys)) → APP(app(filtersub, app(f, y)), f)
APP(app(filter, f), app(app(cons, y), ys)) → APP(filtersub, app(f, y))
APP(app(filter, f), app(app(cons, y), ys)) → APP(f, y)
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(app(cons, y), app(app(filter, f), ys))
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(filter, f)
APP(app(app(filtersub, false), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
APP(app(app(filtersub, false), f), app(app(cons, y), ys)) → APP(filter, f)

The TRS R consists of the following rules:

app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)

The set Q consists of the following terms:

app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(filtersub, true), x0), app(app(cons, x1), x2))
app(app(app(filtersub, false), x0), app(app(cons, x1), x2))

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 6 less nodes.

(6) Obligation:

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

APP(app(app(filtersub, true), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
APP(app(filter, f), app(app(cons, y), ys)) → APP(f, y)
APP(app(app(filtersub, false), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)

The TRS R consists of the following rules:

app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)

The set Q consists of the following terms:

app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(filtersub, true), x0), app(app(cons, x1), x2))
app(app(app(filtersub, false), x0), app(app(cons, x1), x2))

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(app(filtersub, true), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)
APP(app(filter, f), app(app(cons, y), ys)) → APP(f, y)
APP(app(app(filtersub, false), f), app(app(cons, y), ys)) → APP(app(filter, f), ys)

The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
APP(x1, x2)  =  APP(x2)
app(x1, x2)  =  app(x1, x2)
filtersub  =  filtersub
true  =  true
cons  =  cons
filter  =  filter
false  =  false

Lexicographic path order with status [LPO].
Precedence:

filtersub > app₂ > APP₁
true > app₂ > APP₁
cons > APP₁
filter > APP₁

Status:

APP₁: [1]
cons: []
true: []
false: []
app₂: [2,1]
filtersub: []
filter: []

The following usable rules [FROCOS05] were oriented: none

(8) Obligation:

Q DP problem:
P is empty.
The TRS R consists of the following rules:

app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, y), ys)) → app(app(app(filtersub, app(f, y)), f), app(app(cons, y), ys))
app(app(app(filtersub, true), f), app(app(cons, y), ys)) → app(app(cons, y), app(app(filter, f), ys))
app(app(app(filtersub, false), f), app(app(cons, y), ys)) → app(app(filter, f), ys)

The set Q consists of the following terms:

app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(filtersub, true), x0), app(app(cons, x1), x2))
app(app(app(filtersub, false), x0), app(app(cons, x1), x2))

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

(9) PisEmptyProof (EQUIVALENT transformation)

The TRS P is empty. Hence, there is no (P,Q,R) chain.

(10) TRUE