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

0 QTRS
↳1 DependencyPairsProof (⇔)
↳2 QDP
↳3 DependencyGraphProof (⇔)
↳4 AND
  ↳5 QDP
    ↳6 QDPOrderProof (⇔)
    ↳7 QDP
    ↳8 PisEmptyProof (⇔)
    ↳9 TRUE
  ↳10 QDP
    ↳11 QDPOrderProof (⇔)
    ↳12 QDP
    ↳13 PisEmptyProof (⇔)
    ↳14 TRUE
  ↳15 QDP
    ↳16 QDPOrderProof (⇔)
    ↳17 QDP
    ↳18 DependencyGraphProof (⇔)
    ↳19 TRUE

(0) Obligation:

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

app(not, app(not, x)) → x
app(not, app(app(or, x), y)) → app(app(and, app(not, x)), app(not, y))
app(not, app(app(and, x), y)) → app(app(or, app(not, x)), app(not, y))
app(app(and, x), app(app(or, y), z)) → app(app(or, app(app(and, x), y)), app(app(and, x), z))
app(app(and, app(app(or, y), z)), x) → app(app(or, app(app(and, x), y)), app(app(and, x), z))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), 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(not, app(app(or, x), y)) → APP(app(and, app(not, x)), app(not, y))
APP(not, app(app(or, x), y)) → APP(and, app(not, x))
APP(not, app(app(or, x), y)) → APP(not, x)
APP(not, app(app(or, x), y)) → APP(not, y)
APP(not, app(app(and, x), y)) → APP(app(or, app(not, x)), app(not, y))
APP(not, app(app(and, x), y)) → APP(or, app(not, x))
APP(not, app(app(and, x), y)) → APP(not, x)
APP(not, app(app(and, x), y)) → APP(not, y)
APP(app(and, x), app(app(or, y), z)) → APP(app(or, app(app(and, x), y)), app(app(and, x), z))
APP(app(and, x), app(app(or, y), z)) → APP(or, app(app(and, x), y))
APP(app(and, x), app(app(or, y), z)) → APP(app(and, x), y)
APP(app(and, x), app(app(or, y), z)) → APP(app(and, x), z)
APP(app(and, app(app(or, y), z)), x) → APP(app(or, app(app(and, x), y)), app(app(and, x), z))
APP(app(and, app(app(or, y), z)), x) → APP(or, app(app(and, x), y))
APP(app(and, app(app(or, y), z)), x) → APP(app(and, x), y)
APP(app(and, app(app(or, y), z)), x) → APP(and, x)
APP(app(and, app(app(or, y), z)), x) → APP(app(and, x), z)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(cons, app(f, x)), app(app(map, f), xs))
APP(app(map, f), app(app(cons, x), xs)) → APP(cons, app(f, x))
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(app(filter2, app(f, x)), f), x), xs)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(filter2, app(f, x)), f), x)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(filter2, app(f, x)), f)
APP(app(filter, f), app(app(cons, x), xs)) → APP(filter2, app(f, x))
APP(app(filter, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(app(app(filter2, true), f), x), xs) → APP(app(cons, x), app(app(filter, f), xs))
APP(app(app(app(filter2, true), f), x), xs) → APP(cons, x)
APP(app(app(app(filter2, true), f), x), xs) → APP(app(filter, f), xs)
APP(app(app(app(filter2, true), f), x), xs) → APP(filter, f)
APP(app(app(app(filter2, false), f), x), xs) → APP(app(filter, f), xs)
APP(app(app(app(filter2, false), f), x), xs) → APP(filter, f)

The TRS R consists of the following rules:

app(not, app(not, x)) → x
app(not, app(app(or, x), y)) → app(app(and, app(not, x)), app(not, y))
app(not, app(app(and, x), y)) → app(app(or, app(not, x)), app(not, y))
app(app(and, x), app(app(or, y), z)) → app(app(or, app(app(and, x), y)), app(app(and, x), z))
app(app(and, app(app(or, y), z)), x) → app(app(or, app(app(and, x), y)), app(app(and, x), z))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), 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 3 SCCs with 18 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

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

APP(app(and, x), app(app(or, y), z)) → APP(app(and, x), z)
APP(app(and, x), app(app(or, y), z)) → APP(app(and, x), y)
APP(app(and, app(app(or, y), z)), x) → APP(app(and, x), y)
APP(app(and, app(app(or, y), z)), x) → APP(app(and, x), z)

The TRS R consists of the following rules:

app(not, app(not, x)) → x
app(not, app(app(or, x), y)) → app(app(and, app(not, x)), app(not, y))
app(not, app(app(and, x), y)) → app(app(or, app(not, x)), app(not, y))
app(app(and, x), app(app(or, y), z)) → app(app(or, app(app(and, x), y)), app(app(and, x), z))
app(app(and, app(app(or, y), z)), x) → app(app(or, app(app(and, x), y)), app(app(and, x), z))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

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

(6) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04]. Here, we combined the reduction pair processor with the A-transformation [FROCOS05] which results in the following intermediate Q-DP Problem.
The a-transformed P is

and1(x, or(y, z)) → and1(x, z)
and1(x, or(y, z)) → and1(x, y)
and1(or(y, z), x) → and1(x, y)
and1(or(y, z), x) → and1(x, z)

The a-transformed usable rules are
none


The following pairs can be oriented strictly and are deleted.


APP(app(and, x), app(app(or, y), z)) → APP(app(and, x), z)
APP(app(and, x), app(app(or, y), z)) → APP(app(and, x), y)
APP(app(and, app(app(or, y), z)), x) → APP(app(and, x), y)
APP(app(and, app(app(or, y), z)), x) → APP(app(and, x), z)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Quasi-Precedence:
[and12, or2]

Status:
or2: multiset
and12: multiset


The following usable rules [FROCOS05] were oriented: none

(7) Obligation:

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

app(not, app(not, x)) → x
app(not, app(app(or, x), y)) → app(app(and, app(not, x)), app(not, y))
app(not, app(app(and, x), y)) → app(app(or, app(not, x)), app(not, y))
app(app(and, x), app(app(or, y), z)) → app(app(or, app(app(and, x), y)), app(app(and, x), z))
app(app(and, app(app(or, y), z)), x) → app(app(or, app(app(and, x), y)), app(app(and, x), z))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

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

(8) PisEmptyProof (EQUIVALENT transformation)

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

(9) TRUE

(10) Obligation:

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

APP(not, app(app(or, x), y)) → APP(not, y)
APP(not, app(app(or, x), y)) → APP(not, x)
APP(not, app(app(and, x), y)) → APP(not, x)
APP(not, app(app(and, x), y)) → APP(not, y)

The TRS R consists of the following rules:

app(not, app(not, x)) → x
app(not, app(app(or, x), y)) → app(app(and, app(not, x)), app(not, y))
app(not, app(app(and, x), y)) → app(app(or, app(not, x)), app(not, y))
app(app(and, x), app(app(or, y), z)) → app(app(or, app(app(and, x), y)), app(app(and, x), z))
app(app(and, app(app(or, y), z)), x) → app(app(or, app(app(and, x), y)), app(app(and, x), z))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

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

(11) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04]. Here, we combined the reduction pair processor with the A-transformation [FROCOS05] which results in the following intermediate Q-DP Problem.
The a-transformed P is

not1(or(x, y)) → not1(y)
not1(or(x, y)) → not1(x)
not1(and(x, y)) → not1(x)
not1(and(x, y)) → not1(y)

The a-transformed usable rules are
none


The following pairs can be oriented strictly and are deleted.


APP(not, app(app(or, x), y)) → APP(not, y)
APP(not, app(app(or, x), y)) → APP(not, x)
APP(not, app(app(and, x), y)) → APP(not, x)
APP(not, app(app(and, x), y)) → APP(not, y)
The remaining pairs can at least be oriented weakly.
Used ordering: Recursive path order with status [RPO].
Quasi-Precedence:
[not11, or2, and2]

Status:
or2: multiset
and2: multiset
not11: multiset


The following usable rules [FROCOS05] were oriented: none

(12) Obligation:

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

app(not, app(not, x)) → x
app(not, app(app(or, x), y)) → app(app(and, app(not, x)), app(not, y))
app(not, app(app(and, x), y)) → app(app(or, app(not, x)), app(not, y))
app(app(and, x), app(app(or, y), z)) → app(app(or, app(app(and, x), y)), app(app(and, x), z))
app(app(and, app(app(or, y), z)), x) → app(app(or, app(app(and, x), y)), app(app(and, x), z))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

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

(13) PisEmptyProof (EQUIVALENT transformation)

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

(14) TRUE

(15) Obligation:

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

APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(app(filter2, app(f, x)), f), x), xs)
APP(app(app(app(filter2, true), f), x), xs) → APP(app(filter, f), xs)
APP(app(filter, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(app(app(filter2, false), f), x), xs) → APP(app(filter, f), xs)

The TRS R consists of the following rules:

app(not, app(not, x)) → x
app(not, app(app(or, x), y)) → app(app(and, app(not, x)), app(not, y))
app(not, app(app(and, x), y)) → app(app(or, app(not, x)), app(not, y))
app(app(and, x), app(app(or, y), z)) → app(app(or, app(app(and, x), y)), app(app(and, x), z))
app(app(and, app(app(or, y), z)), x) → app(app(or, app(app(and, x), y)), app(app(and, x), z))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

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

(16) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(app(filter, f), app(app(cons, x), xs)) → APP(app(app(app(filter2, app(f, x)), f), x), xs)
APP(app(filter, f), app(app(cons, x), xs)) → 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)  =  APP(x2)
app(x1, x2)  =  app(x1, x2)
map  =  map
cons  =  cons
filter  =  filter
filter2  =  filter2
true  =  true
false  =  false
nil  =  nil
not  =  not
and  =  and
or  =  or

Recursive path order with status [RPO].
Quasi-Precedence:
app2 > [cons, filter2] > map > [APP1, true] > or
app2 > [cons, filter2] > [filter, false] > [APP1, true] > or
app2 > nil > or
app2 > not > and > or

Status:
APP1: multiset
or: multiset
true: multiset
not: multiset
filter: multiset
cons: multiset
map: multiset
false: multiset
app2: multiset
and: multiset
filter2: multiset
nil: multiset


The following usable rules [FROCOS05] were oriented: none

(17) Obligation:

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

APP(app(app(app(filter2, true), f), x), xs) → APP(app(filter, f), xs)
APP(app(app(app(filter2, false), f), x), xs) → APP(app(filter, f), xs)

The TRS R consists of the following rules:

app(not, app(not, x)) → x
app(not, app(app(or, x), y)) → app(app(and, app(not, x)), app(not, y))
app(not, app(app(and, x), y)) → app(app(or, app(not, x)), app(not, y))
app(app(and, x), app(app(or, y), z)) → app(app(or, app(app(and, x), y)), app(app(and, x), z))
app(app(and, app(app(or, y), z)), x) → app(app(or, app(app(and, x), y)), app(app(and, x), z))
app(app(map, f), nil) → nil
app(app(map, f), app(app(cons, x), xs)) → app(app(cons, app(f, x)), app(app(map, f), xs))
app(app(filter, f), nil) → nil
app(app(filter, f), app(app(cons, x), xs)) → app(app(app(app(filter2, app(f, x)), f), x), xs)
app(app(app(app(filter2, true), f), x), xs) → app(app(cons, x), app(app(filter, f), xs))
app(app(app(app(filter2, false), f), x), xs) → app(app(filter, f), xs)

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

(18) DependencyGraphProof (EQUIVALENT transformation)

The approximation of the Dependency Graph [LPAR04,FROCOS05,EDGSTAR] contains 0 SCCs with 2 less nodes.

(19) TRUE