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

Q is empty.

(1) DependencyPairsProof (EQUIVALENT transformation)

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

(2) Obligation:

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

APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs))), app(app(filter, f), xs))
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs)))
APP(app(filter, f), app(app(cons, x), xs)) → APP(if, app(f, x))
APP(app(filter, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(cons, x), app(app(filter, f), xs))
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(filter, f), xs)

The TRS R consists of the following rules:

app(app(app(if, true), x), y) → x
app(app(app(if, false), x), y) → y
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs))), app(app(filter, f), xs))

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

(3) DependencyGraphProof (EQUIVALENT transformation)

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

(4) Obligation:

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

APP(app(filter, f), app(app(cons, x), xs)) → APP(app(filter, f), xs)
APP(app(filter, f), app(app(cons, x), xs)) → APP(f, x)

The TRS R consists of the following rules:

app(app(app(if, true), x), y) → x
app(app(app(if, false), x), y) → y
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs))), app(app(filter, f), xs))

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

(5) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].

The following pairs can be oriented strictly and are deleted.

APP(app(filter, f), app(app(cons, x), xs)) → APP(f, x)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
APP(x1, x2)  =  APP(x1)

Tags:
APP has tags [1,0]

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Combined order from the following AFS and order.
app(x1, x2)  =  app(x2)
filter  =  filter
cons  =  cons

Recursive path order with status [RPO].
Quasi-Precedence:

cons > [app₁, filter]

Status:

app₁: multiset
filter: multiset
cons: multiset

The following usable rules [FROCOS05] were oriented: none

(6) Obligation:

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

APP(app(filter, f), app(app(cons, x), xs)) → APP(app(filter, f), xs)

The TRS R consists of the following rules:

app(app(app(if, true), x), y) → x
app(app(app(if, false), x), y) → y
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(if, app(f, x)), app(app(cons, x), app(app(filter, f), xs))), app(app(filter, f), xs))

Q is empty.
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(filter, f), app(app(cons, x), xs)) → APP(app(filter, f), xs)

The remaining pairs can at least be oriented weakly.
Used ordering: SCNP Order with the following components:
Level mapping:
Top level AFS:
APP(x1, x2)  =  APP(x2)

Tags:
APP has tags [0,1]

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Recursive path order with status [RPO].
Quasi-Precedence:

[app₂, cons]

Status:

app₂: multiset
filter: multiset
cons: multiset

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

Q is empty.
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