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 QDP
        ↳20 QDPOrderProof (⇔)
        ↳21 QDP
        ↳22 PisEmptyProof (⇔)
        ↳23 TRUE

(0) Obligation:

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

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(inc, xs) → app(app(map, app(plus, app(s, 0))), xs)
app(double, xs) → app(app(map, app(times, app(s, app(s, 0)))), xs)
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))

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

The TRS R consists of the following rules:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(inc, xs) → app(app(map, app(plus, app(s, 0))), xs)
app(double, xs) → app(app(map, app(times, app(s, app(s, 0)))), xs)
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))

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

(4) Complex Obligation (AND)

(5) Obligation:

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

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

The TRS R consists of the following rules:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(inc, xs) → app(app(map, app(plus, app(s, 0))), xs)
app(double, xs) → app(app(map, app(times, app(s, app(s, 0)))), xs)
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))

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

(6) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Tags:
APP has argument tags [3,1,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(APP(x1, x2)) = 0   
POL(app(x1, x2)) = 1 + x2   
POL(plus) = 0   
POL(s) = 0   

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(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(inc, xs) → app(app(map, app(plus, app(s, 0))), xs)
app(double, xs) → app(app(map, app(times, app(s, app(s, 0)))), xs)
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))

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

The TRS R consists of the following rules:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(inc, xs) → app(app(map, app(plus, app(s, 0))), xs)
app(double, xs) → app(app(map, app(times, app(s, app(s, 0)))), xs)
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))

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

(11) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


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

Tags:
APP has argument tags [3,1,2] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(APP(x1, x2)) = 0   
POL(app(x1, x2)) = 1 + x2   
POL(s) = 0   
POL(times) = 0   

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(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(inc, xs) → app(app(map, app(plus, app(s, 0))), xs)
app(double, xs) → app(app(map, app(times, app(s, app(s, 0)))), xs)
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))

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(inc, xs) → APP(app(map, app(plus, app(s, 0))), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(f, x)
APP(double, xs) → APP(app(map, app(times, app(s, app(s, 0)))), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)

The TRS R consists of the following rules:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(inc, xs) → app(app(map, app(plus, app(s, 0))), xs)
app(double, xs) → app(app(map, app(times, app(s, app(s, 0)))), xs)
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))

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(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(x0, x1, x2)  =  APP(x1, x2)

Tags:
APP has argument tags [0,0,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(0) = 0   
POL(APP(x1, x2)) = 0   
POL(app(x1, x2)) = x1 + x2   
POL(cons) = 1   
POL(double) = 1   
POL(inc) = 1   
POL(map) = 1   
POL(plus) = 0   
POL(s) = 0   
POL(times) = 0   

The following usable rules [FROCOS05] were oriented: none

(17) Obligation:

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

APP(inc, xs) → APP(app(map, app(plus, app(s, 0))), xs)
APP(double, xs) → APP(app(map, app(times, app(s, app(s, 0)))), xs)
APP(app(map, f), app(app(cons, x), xs)) → APP(app(map, f), xs)

The TRS R consists of the following rules:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(inc, xs) → app(app(map, app(plus, app(s, 0))), xs)
app(double, xs) → app(app(map, app(times, app(s, app(s, 0)))), xs)
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))

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 1 SCC with 2 less nodes.

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

The TRS R consists of the following rules:

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(inc, xs) → app(app(map, app(plus, app(s, 0))), xs)
app(double, xs) → app(app(map, app(times, app(s, app(s, 0)))), xs)
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))

Q is empty.
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, f), app(app(cons, x), xs)) → APP(app(map, 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(x0, x1, x2)  =  APP(x0, x2)

Tags:
APP has argument tags [0,0,1] and root tag 0

Comparison: MAX
Underlying order for the size change arcs and the rules of R:
Polynomial interpretation [POLO]:

POL(APP(x1, x2)) = 1   
POL(app(x1, x2)) = 1 + x2   
POL(cons) = 0   
POL(map) = 0   

The following usable rules [FROCOS05] were oriented: none

(21) Obligation:

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

app(app(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(app(times, 0), y) → 0
app(app(times, app(s, x)), y) → app(app(plus, app(app(times, x), y)), y)
app(inc, xs) → app(app(map, app(plus, app(s, 0))), xs)
app(double, xs) → app(app(map, app(times, app(s, app(s, 0)))), xs)
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))

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

(22) PisEmptyProof (EQUIVALENT transformation)

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

(23) TRUE