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(app(times, x), app(app(plus, y), app(s, z))) → app(app(plus, app(app(times, x), app(app(plus, y), app(app(times, app(s, z)), 0)))), app(app(times, x), app(s, z)))
app(app(times, x), 0) → 0
app(app(times, x), app(s, y)) → app(app(plus, app(app(times, x), y)), x)
app(app(plus, x), 0) → x
app(app(plus, x), app(s, y)) → app(s, app(app(plus, x), y))
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(app(times, x), app(app(plus, y), app(s, z))) → APP(app(plus, app(app(times, x), app(app(plus, y), app(app(times, app(s, z)), 0)))), app(app(times, x), app(s, z)))
APP(app(times, x), app(app(plus, y), app(s, z))) → APP(plus, app(app(times, x), app(app(plus, y), app(app(times, app(s, z)), 0))))
APP(app(times, x), app(app(plus, y), app(s, z))) → APP(app(times, x), app(app(plus, y), app(app(times, app(s, z)), 0)))
APP(app(times, x), app(app(plus, y), app(s, z))) → APP(app(plus, y), app(app(times, app(s, z)), 0))
APP(app(times, x), app(app(plus, y), app(s, z))) → APP(app(times, app(s, z)), 0)
APP(app(times, x), app(app(plus, y), app(s, z))) → APP(times, app(s, z))
APP(app(times, x), app(app(plus, y), app(s, z))) → APP(app(times, x), app(s, z))
APP(app(times, x), app(s, y)) → APP(app(plus, app(app(times, x), y)), x)
APP(app(times, x), app(s, y)) → APP(plus, app(app(times, x), y))
APP(app(times, x), app(s, y)) → APP(app(times, x), y)
APP(app(plus, x), app(s, y)) → APP(s, app(app(plus, x), y))
APP(app(plus, x), app(s, y)) → APP(app(plus, x), y)
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(app(times, x), app(app(plus, y), app(s, z))) → app(app(plus, app(app(times, x), app(app(plus, y), app(app(times, app(s, z)), 0)))), app(app(times, x), app(s, z)))
app(app(times, x), 0) → 0
app(app(times, x), app(s, y)) → app(app(plus, app(app(times, x), y)), x)
app(app(plus, x), 0) → x
app(app(plus, x), app(s, y)) → app(s, app(app(plus, x), y))
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 17 less nodes.

(4) Complex Obligation (AND)

(5) Obligation:

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

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

The TRS R consists of the following rules:

app(app(times, x), app(app(plus, y), app(s, z))) → app(app(plus, app(app(times, x), app(app(plus, y), app(app(times, app(s, z)), 0)))), app(app(times, x), app(s, z)))
app(app(times, x), 0) → 0
app(app(times, x), app(s, y)) → app(app(plus, app(app(times, x), y)), x)
app(app(plus, x), 0) → x
app(app(plus, x), app(s, y)) → app(s, app(app(plus, x), y))
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

plus1(x, s(y)) → plus1(x, y)

The a-transformed usable rules are
none


The following pairs can be oriented strictly and are deleted.


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

Lexicographic path order with status [LPO].
Precedence:
s1 > plus11

Status:
plus11: [1]
s1: [1]

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(app(times, x), app(app(plus, y), app(s, z))) → app(app(plus, app(app(times, x), app(app(plus, y), app(app(times, app(s, z)), 0)))), app(app(times, x), app(s, z)))
app(app(times, x), 0) → 0
app(app(times, x), app(s, y)) → app(app(plus, app(app(times, x), y)), x)
app(app(plus, x), 0) → x
app(app(plus, x), app(s, y)) → app(s, app(app(plus, x), y))
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(app(times, x), app(app(plus, y), app(s, z))) → APP(app(times, x), app(s, z))
APP(app(times, x), app(s, y)) → APP(app(times, x), y)
APP(app(times, x), app(app(plus, y), app(s, z))) → APP(app(times, x), app(app(plus, y), app(app(times, app(s, z)), 0)))

The TRS R consists of the following rules:

app(app(times, x), app(app(plus, y), app(s, z))) → app(app(plus, app(app(times, x), app(app(plus, y), app(app(times, app(s, z)), 0)))), app(app(times, x), app(s, z)))
app(app(times, x), 0) → 0
app(app(times, x), app(s, y)) → app(app(plus, app(app(times, x), y)), x)
app(app(plus, x), 0) → x
app(app(plus, x), app(s, y)) → app(s, app(app(plus, x), y))
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

times1(x, plus(y, s(z))) → times1(x, s(z))
times1(x, s(y)) → times1(x, y)
times1(x, plus(y, s(z))) → times1(x, plus(y, times(s(z), 0)))

The a-transformed usable rules are

times(x, 0) → 0
plus(x, 0) → x
plus(x, s(y)) → s(plus(x, y))


The following pairs can be oriented strictly and are deleted.


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

Lexicographic path order with status [LPO].
Precedence:
times11 > s1 > 0
plus2 > s1 > 0

Status:
times11: [1]
plus2: [1,2]
s1: [1]
0: []

The following usable rules [FROCOS05] were oriented:

app(app(times, x), 0) → 0
app(app(plus, x), 0) → x
app(app(plus, x), app(s, y)) → app(s, app(app(plus, x), y))

(12) Obligation:

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

app(app(times, x), app(app(plus, y), app(s, z))) → app(app(plus, app(app(times, x), app(app(plus, y), app(app(times, app(s, z)), 0)))), app(app(times, x), app(s, z)))
app(app(times, x), 0) → 0
app(app(times, x), app(s, y)) → app(app(plus, app(app(times, x), y)), x)
app(app(plus, x), 0) → x
app(app(plus, x), app(s, y)) → app(s, app(app(plus, x), y))
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(app(times, x), app(app(plus, y), app(s, z))) → app(app(plus, app(app(times, x), app(app(plus, y), app(app(times, app(s, z)), 0)))), app(app(times, x), app(s, z)))
app(app(times, x), 0) → 0
app(app(times, x), app(s, y)) → app(app(plus, app(app(times, x), y)), x)
app(app(plus, x), 0) → x
app(app(plus, x), app(s, y)) → app(s, app(app(plus, x), y))
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
times  =  times
plus  =  plus
s  =  s
0  =  0
nil  =  nil

Lexicographic path order with status [LPO].
Precedence:
true > APP1
true > app2
true > cons
true > filter
false > APP1
false > app2
false > filter

Status:
APP1: [1]
app2: [2,1]
map: []
cons: []
filter: []
filter2: []
true: []
false: []
times: []
plus: []
s: []
0: []
nil: []

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(app(times, x), app(app(plus, y), app(s, z))) → app(app(plus, app(app(times, x), app(app(plus, y), app(app(times, app(s, z)), 0)))), app(app(times, x), app(s, z)))
app(app(times, x), 0) → 0
app(app(times, x), app(s, y)) → app(app(plus, app(app(times, x), y)), x)
app(app(plus, x), 0) → x
app(app(plus, x), app(s, y)) → app(s, app(app(plus, x), y))
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