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

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

(0) Obligation:

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

app(app(minus, x), 0) → x
app(app(minus, app(s, x)), app(s, y)) → app(app(minus, x), y)
app(f, 0) → app(s, 0)
app(f, app(s, x)) → app(app(minus, app(s, x)), app(g, app(f, x)))
app(g, 0) → 0
app(g, app(s, x)) → app(app(minus, app(s, x)), app(f, app(g, x)))
app(app(map, fun), nil) → nil
app(app(map, fun), app(app(cons, x), xs)) → app(app(cons, app(fun, x)), app(app(map, fun), xs))
app(app(filter, fun), nil) → nil
app(app(filter, fun), app(app(cons, x), xs)) → app(app(app(app(filter2, app(fun, x)), fun), x), xs)
app(app(app(app(filter2, true), fun), x), xs) → app(app(cons, x), app(app(filter, fun), xs))
app(app(app(app(filter2, false), fun), x), xs) → app(app(filter, fun), xs)

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(minus, x), 0) → x
app(app(minus, app(s, x)), app(s, y)) → app(app(minus, x), y)
app(f, 0) → app(s, 0)
app(f, app(s, x)) → app(app(minus, app(s, x)), app(g, app(f, x)))
app(g, 0) → 0
app(g, app(s, x)) → app(app(minus, app(s, x)), app(f, app(g, x)))
app(app(map, fun), nil) → nil
app(app(map, fun), app(app(cons, x), xs)) → app(app(cons, app(fun, x)), app(app(map, fun), xs))
app(app(filter, fun), nil) → nil
app(app(filter, fun), app(app(cons, x), xs)) → app(app(app(app(filter2, app(fun, x)), fun), x), xs)
app(app(app(app(filter2, true), fun), x), xs) → app(app(cons, x), app(app(filter, fun), xs))
app(app(app(app(filter2, false), fun), x), xs) → app(app(filter, fun), xs)

The set Q consists of the following terms:

app(app(minus, x0), 0)
app(app(minus, app(s, x0)), app(s, x1))
app(f, 0)
app(f, app(s, x0))
app(g, 0)
app(g, app(s, x0))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), 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(minus, app(s, x)), app(s, y)) → APP(app(minus, x), y)
APP(app(minus, app(s, x)), app(s, y)) → APP(minus, x)
APP(f, 0) → APP(s, 0)
APP(f, app(s, x)) → APP(app(minus, app(s, x)), app(g, app(f, x)))
APP(f, app(s, x)) → APP(minus, app(s, x))
APP(f, app(s, x)) → APP(g, app(f, x))
APP(f, app(s, x)) → APP(f, x)
APP(g, app(s, x)) → APP(app(minus, app(s, x)), app(f, app(g, x)))
APP(g, app(s, x)) → APP(minus, app(s, x))
APP(g, app(s, x)) → APP(f, app(g, x))
APP(g, app(s, x)) → APP(g, x)
APP(app(map, fun), app(app(cons, x), xs)) → APP(app(cons, app(fun, x)), app(app(map, fun), xs))
APP(app(map, fun), app(app(cons, x), xs)) → APP(cons, app(fun, x))
APP(app(map, fun), app(app(cons, x), xs)) → APP(fun, x)
APP(app(map, fun), app(app(cons, x), xs)) → APP(app(map, fun), xs)
APP(app(filter, fun), app(app(cons, x), xs)) → APP(app(app(app(filter2, app(fun, x)), fun), x), xs)
APP(app(filter, fun), app(app(cons, x), xs)) → APP(app(app(filter2, app(fun, x)), fun), x)
APP(app(filter, fun), app(app(cons, x), xs)) → APP(app(filter2, app(fun, x)), fun)
APP(app(filter, fun), app(app(cons, x), xs)) → APP(filter2, app(fun, x))
APP(app(filter, fun), app(app(cons, x), xs)) → APP(fun, x)
APP(app(app(app(filter2, true), fun), x), xs) → APP(app(cons, x), app(app(filter, fun), xs))
APP(app(app(app(filter2, true), fun), x), xs) → APP(cons, x)
APP(app(app(app(filter2, true), fun), x), xs) → APP(app(filter, fun), xs)
APP(app(app(app(filter2, true), fun), x), xs) → APP(filter, fun)
APP(app(app(app(filter2, false), fun), x), xs) → APP(app(filter, fun), xs)
APP(app(app(app(filter2, false), fun), x), xs) → APP(filter, fun)

The TRS R consists of the following rules:

app(app(minus, x), 0) → x
app(app(minus, app(s, x)), app(s, y)) → app(app(minus, x), y)
app(f, 0) → app(s, 0)
app(f, app(s, x)) → app(app(minus, app(s, x)), app(g, app(f, x)))
app(g, 0) → 0
app(g, app(s, x)) → app(app(minus, app(s, x)), app(f, app(g, x)))
app(app(map, fun), nil) → nil
app(app(map, fun), app(app(cons, x), xs)) → app(app(cons, app(fun, x)), app(app(map, fun), xs))
app(app(filter, fun), nil) → nil
app(app(filter, fun), app(app(cons, x), xs)) → app(app(app(app(filter2, app(fun, x)), fun), x), xs)
app(app(app(app(filter2, true), fun), x), xs) → app(app(cons, x), app(app(filter, fun), xs))
app(app(app(app(filter2, false), fun), x), xs) → app(app(filter, fun), xs)

The set Q consists of the following terms:

app(app(minus, x0), 0)
app(app(minus, app(s, x0)), app(s, x1))
app(f, 0)
app(f, app(s, x0))
app(g, 0)
app(g, app(s, x0))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), 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 3 SCCs with 15 less nodes.

(6) Complex Obligation (AND)

(7) Obligation:

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

APP(app(minus, app(s, x)), app(s, y)) → APP(app(minus, x), y)

The TRS R consists of the following rules:

app(app(minus, x), 0) → x
app(app(minus, app(s, x)), app(s, y)) → app(app(minus, x), y)
app(f, 0) → app(s, 0)
app(f, app(s, x)) → app(app(minus, app(s, x)), app(g, app(f, x)))
app(g, 0) → 0
app(g, app(s, x)) → app(app(minus, app(s, x)), app(f, app(g, x)))
app(app(map, fun), nil) → nil
app(app(map, fun), app(app(cons, x), xs)) → app(app(cons, app(fun, x)), app(app(map, fun), xs))
app(app(filter, fun), nil) → nil
app(app(filter, fun), app(app(cons, x), xs)) → app(app(app(app(filter2, app(fun, x)), fun), x), xs)
app(app(app(app(filter2, true), fun), x), xs) → app(app(cons, x), app(app(filter, fun), xs))
app(app(app(app(filter2, false), fun), x), xs) → app(app(filter, fun), xs)

The set Q consists of the following terms:

app(app(minus, x0), 0)
app(app(minus, app(s, x0)), app(s, x1))
app(f, 0)
app(f, app(s, x0))
app(g, 0)
app(g, app(s, x0))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

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

(8) 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

minus1(s(x), s(y)) → minus1(x, y)

The a-transformed usable rules are
none


The following pairs can be oriented strictly and are deleted.


APP(app(minus, app(s, x)), app(s, y)) → APP(app(minus, x), y)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
minus1(x1, x2)  =  minus1(x1)
s(x1)  =  s(x1)

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

Status:
minus11: [1]
s1: multiset


The following usable rules [FROCOS05] were oriented: none

(9) Obligation:

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

app(app(minus, x), 0) → x
app(app(minus, app(s, x)), app(s, y)) → app(app(minus, x), y)
app(f, 0) → app(s, 0)
app(f, app(s, x)) → app(app(minus, app(s, x)), app(g, app(f, x)))
app(g, 0) → 0
app(g, app(s, x)) → app(app(minus, app(s, x)), app(f, app(g, x)))
app(app(map, fun), nil) → nil
app(app(map, fun), app(app(cons, x), xs)) → app(app(cons, app(fun, x)), app(app(map, fun), xs))
app(app(filter, fun), nil) → nil
app(app(filter, fun), app(app(cons, x), xs)) → app(app(app(app(filter2, app(fun, x)), fun), x), xs)
app(app(app(app(filter2, true), fun), x), xs) → app(app(cons, x), app(app(filter, fun), xs))
app(app(app(app(filter2, false), fun), x), xs) → app(app(filter, fun), xs)

The set Q consists of the following terms:

app(app(minus, x0), 0)
app(app(minus, app(s, x0)), app(s, x1))
app(f, 0)
app(f, app(s, x0))
app(g, 0)
app(g, app(s, x0))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

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

(10) PisEmptyProof (EQUIVALENT transformation)

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

(11) TRUE

(12) Obligation:

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

APP(f, app(s, x)) → APP(g, app(f, x))
APP(g, app(s, x)) → APP(f, app(g, x))
APP(f, app(s, x)) → APP(f, x)
APP(g, app(s, x)) → APP(g, x)

The TRS R consists of the following rules:

app(app(minus, x), 0) → x
app(app(minus, app(s, x)), app(s, y)) → app(app(minus, x), y)
app(f, 0) → app(s, 0)
app(f, app(s, x)) → app(app(minus, app(s, x)), app(g, app(f, x)))
app(g, 0) → 0
app(g, app(s, x)) → app(app(minus, app(s, x)), app(f, app(g, x)))
app(app(map, fun), nil) → nil
app(app(map, fun), app(app(cons, x), xs)) → app(app(cons, app(fun, x)), app(app(map, fun), xs))
app(app(filter, fun), nil) → nil
app(app(filter, fun), app(app(cons, x), xs)) → app(app(app(app(filter2, app(fun, x)), fun), x), xs)
app(app(app(app(filter2, true), fun), x), xs) → app(app(cons, x), app(app(filter, fun), xs))
app(app(app(app(filter2, false), fun), x), xs) → app(app(filter, fun), xs)

The set Q consists of the following terms:

app(app(minus, x0), 0)
app(app(minus, app(s, x0)), app(s, x1))
app(f, 0)
app(f, app(s, x0))
app(g, 0)
app(g, app(s, x0))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

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

(13) 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

f1(s(x)) → g1(f(x))
g1(s(x)) → f1(g(x))
f1(s(x)) → f1(x)
g1(s(x)) → g1(x)

The a-transformed usable rules are

g(0) → 0
g(s(x)) → minus(s(x), f(g(x)))
f(0) → s(0)
f(s(x)) → minus(s(x), g(f(x)))
minus(x, 0) → x
minus(s(x), s(y)) → minus(x, y)


The following pairs can be oriented strictly and are deleted.


APP(f, app(s, x)) → APP(f, x)
APP(g, app(s, x)) → APP(g, x)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
f1(x1)  =  f1(x1)
s(x1)  =  s(x1)
g1(x1)  =  g1(x1)
f(x1)  =  f(x1)
g(x1)  =  g(x1)
0  =  0
minus(x1, x2)  =  x1

Recursive path order with status [RPO].
Quasi-Precedence:
0 > [f11, s1, g11, f1, g1]

Status:
f11: multiset
s1: multiset
g11: multiset
f1: multiset
g1: multiset
0: multiset


The following usable rules [FROCOS05] were oriented:

app(g, 0) → 0
app(g, app(s, x)) → app(app(minus, app(s, x)), app(f, app(g, x)))
app(f, 0) → app(s, 0)
app(f, app(s, x)) → app(app(minus, app(s, x)), app(g, app(f, x)))
app(app(minus, x), 0) → x
app(app(minus, app(s, x)), app(s, y)) → app(app(minus, x), y)

(14) Obligation:

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

APP(f, app(s, x)) → APP(g, app(f, x))
APP(g, app(s, x)) → APP(f, app(g, x))

The TRS R consists of the following rules:

app(app(minus, x), 0) → x
app(app(minus, app(s, x)), app(s, y)) → app(app(minus, x), y)
app(f, 0) → app(s, 0)
app(f, app(s, x)) → app(app(minus, app(s, x)), app(g, app(f, x)))
app(g, 0) → 0
app(g, app(s, x)) → app(app(minus, app(s, x)), app(f, app(g, x)))
app(app(map, fun), nil) → nil
app(app(map, fun), app(app(cons, x), xs)) → app(app(cons, app(fun, x)), app(app(map, fun), xs))
app(app(filter, fun), nil) → nil
app(app(filter, fun), app(app(cons, x), xs)) → app(app(app(app(filter2, app(fun, x)), fun), x), xs)
app(app(app(app(filter2, true), fun), x), xs) → app(app(cons, x), app(app(filter, fun), xs))
app(app(app(app(filter2, false), fun), x), xs) → app(app(filter, fun), xs)

The set Q consists of the following terms:

app(app(minus, x0), 0)
app(app(minus, app(s, x0)), app(s, x1))
app(f, 0)
app(f, app(s, x0))
app(g, 0)
app(g, app(s, x0))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

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

(15) 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

f1(s(x)) → g1(f(x))
g1(s(x)) → f1(g(x))

The a-transformed usable rules are

g(0) → 0
g(s(x)) → minus(s(x), f(g(x)))
f(0) → s(0)
f(s(x)) → minus(s(x), g(f(x)))
minus(x, 0) → x
minus(s(x), s(y)) → minus(x, y)


The following pairs can be oriented strictly and are deleted.


APP(g, app(s, x)) → APP(f, app(g, x))
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
f1(x1)  =  f1(x1)
s(x1)  =  s(x1)
g1(x1)  =  g1(x1)
f(x1)  =  f(x1)
g(x1)  =  g(x1)
0  =  0
minus(x1, x2)  =  x1

Recursive path order with status [RPO].
Quasi-Precedence:
[s1, f1] > [g1, 0] > [f11, g11]

Status:
f11: multiset
s1: multiset
g11: multiset
f1: multiset
g1: multiset
0: multiset


The following usable rules [FROCOS05] were oriented:

app(g, 0) → 0
app(g, app(s, x)) → app(app(minus, app(s, x)), app(f, app(g, x)))
app(f, 0) → app(s, 0)
app(f, app(s, x)) → app(app(minus, app(s, x)), app(g, app(f, x)))
app(app(minus, x), 0) → x
app(app(minus, app(s, x)), app(s, y)) → app(app(minus, x), y)

(16) Obligation:

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

APP(f, app(s, x)) → APP(g, app(f, x))

The TRS R consists of the following rules:

app(app(minus, x), 0) → x
app(app(minus, app(s, x)), app(s, y)) → app(app(minus, x), y)
app(f, 0) → app(s, 0)
app(f, app(s, x)) → app(app(minus, app(s, x)), app(g, app(f, x)))
app(g, 0) → 0
app(g, app(s, x)) → app(app(minus, app(s, x)), app(f, app(g, x)))
app(app(map, fun), nil) → nil
app(app(map, fun), app(app(cons, x), xs)) → app(app(cons, app(fun, x)), app(app(map, fun), xs))
app(app(filter, fun), nil) → nil
app(app(filter, fun), app(app(cons, x), xs)) → app(app(app(app(filter2, app(fun, x)), fun), x), xs)
app(app(app(app(filter2, true), fun), x), xs) → app(app(cons, x), app(app(filter, fun), xs))
app(app(app(app(filter2, false), fun), x), xs) → app(app(filter, fun), xs)

The set Q consists of the following terms:

app(app(minus, x0), 0)
app(app(minus, app(s, x0)), app(s, x1))
app(f, 0)
app(f, app(s, x0))
app(g, 0)
app(g, app(s, x0))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

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

(17) DependencyGraphProof (EQUIVALENT transformation)

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

(18) TRUE

(19) Obligation:

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

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

The TRS R consists of the following rules:

app(app(minus, x), 0) → x
app(app(minus, app(s, x)), app(s, y)) → app(app(minus, x), y)
app(f, 0) → app(s, 0)
app(f, app(s, x)) → app(app(minus, app(s, x)), app(g, app(f, x)))
app(g, 0) → 0
app(g, app(s, x)) → app(app(minus, app(s, x)), app(f, app(g, x)))
app(app(map, fun), nil) → nil
app(app(map, fun), app(app(cons, x), xs)) → app(app(cons, app(fun, x)), app(app(map, fun), xs))
app(app(filter, fun), nil) → nil
app(app(filter, fun), app(app(cons, x), xs)) → app(app(app(app(filter2, app(fun, x)), fun), x), xs)
app(app(app(app(filter2, true), fun), x), xs) → app(app(cons, x), app(app(filter, fun), xs))
app(app(app(app(filter2, false), fun), x), xs) → app(app(filter, fun), xs)

The set Q consists of the following terms:

app(app(minus, x0), 0)
app(app(minus, app(s, x0)), app(s, x1))
app(f, 0)
app(f, app(s, x0))
app(g, 0)
app(g, app(s, x0))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

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

(20) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


APP(app(map, fun), app(app(cons, x), xs)) → APP(app(map, fun), xs)
APP(app(map, fun), app(app(cons, x), xs)) → APP(fun, x)
APP(app(filter, fun), app(app(cons, x), xs)) → APP(app(app(app(filter2, app(fun, x)), fun), x), xs)
APP(app(filter, fun), app(app(cons, x), xs)) → APP(fun, 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
minus  =  minus
0  =  0
s  =  s
f  =  f
g  =  g
nil  =  nil

Recursive path order with status [RPO].
Quasi-Precedence:
true > [APP1, app2, map, cons, filter, filter2, minus, s, nil]
false > [APP1, app2, map, cons, filter, filter2, minus, s, nil]
0 > [APP1, app2, map, cons, filter, filter2, minus, s, nil]
[f, g] > [APP1, app2, map, cons, filter, filter2, minus, s, nil]

Status:
APP1: [1]
app2: [1,2]
map: multiset
cons: multiset
filter: multiset
filter2: multiset
true: multiset
false: multiset
minus: multiset
0: multiset
s: multiset
f: multiset
g: multiset
nil: multiset


The following usable rules [FROCOS05] were oriented: none

(21) Obligation:

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

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

The TRS R consists of the following rules:

app(app(minus, x), 0) → x
app(app(minus, app(s, x)), app(s, y)) → app(app(minus, x), y)
app(f, 0) → app(s, 0)
app(f, app(s, x)) → app(app(minus, app(s, x)), app(g, app(f, x)))
app(g, 0) → 0
app(g, app(s, x)) → app(app(minus, app(s, x)), app(f, app(g, x)))
app(app(map, fun), nil) → nil
app(app(map, fun), app(app(cons, x), xs)) → app(app(cons, app(fun, x)), app(app(map, fun), xs))
app(app(filter, fun), nil) → nil
app(app(filter, fun), app(app(cons, x), xs)) → app(app(app(app(filter2, app(fun, x)), fun), x), xs)
app(app(app(app(filter2, true), fun), x), xs) → app(app(cons, x), app(app(filter, fun), xs))
app(app(app(app(filter2, false), fun), x), xs) → app(app(filter, fun), xs)

The set Q consists of the following terms:

app(app(minus, x0), 0)
app(app(minus, app(s, x0)), app(s, x1))
app(f, 0)
app(f, app(s, x0))
app(g, 0)
app(g, app(s, x0))
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))
app(app(filter, x0), nil)
app(app(filter, x0), app(app(cons, x1), x2))
app(app(app(app(filter2, true), x0), x1), x2)
app(app(app(app(filter2, false), x0), x1), x2)

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

(22) DependencyGraphProof (EQUIVALENT transformation)

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

(23) TRUE