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 QDPOrderProof (⇔)
    ↳18 QDP
    ↳19 PisEmptyProof (⇔)
    ↳20 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(inc, xs) → app(app(map, app(plus, 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) 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(plus, 0), y) → y
app(app(plus, app(s, x)), y) → app(s, app(app(plus, x), y))
app(inc, xs) → app(app(map, app(plus, 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))

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(inc, x0)
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, 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(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(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(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(inc, xs) → app(app(map, app(plus, 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))

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(inc, x0)
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, 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 2 SCCs with 7 less nodes.

(6) Complex Obligation (AND)

(7) 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(inc, xs) → app(app(map, app(plus, 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))

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(inc, x0)
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, 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

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

The a-transformed usable rules are
none


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: Combined order from the following AFS and order.
plus1(x1, x2)  =  plus1(x1)
s(x1)  =  s(x1)

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

Status:
plus11: multiset
s1: [1]


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

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(inc, x0)
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, 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(inc, xs) → APP(app(map, app(plus, app(s, 0))), xs)
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(inc, xs) → app(app(map, app(plus, 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))

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(inc, x0)
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))

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

(13) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


APP(inc, xs) → APP(app(map, app(plus, app(s, 0))), xs)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
APP(x1, x2)  =  APP(x1)
inc  =  inc
app(x1, x2)  =  x2
map  =  map
plus  =  plus
s  =  s
0  =  0
cons  =  cons

Recursive path order with status [RPO].
Quasi-Precedence:
[inc, map, cons] > [APP1, 0] > plus > s

Status:
APP1: [1]
cons: multiset
plus: multiset
map: multiset
inc: multiset
s: multiset
0: multiset


The following usable rules [FROCOS05] were oriented: none

(14) Obligation:

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

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(inc, xs) → app(app(map, app(plus, 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))

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(inc, x0)
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))

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

(15) 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: Combined order from the following AFS and order.
APP(x1, x2)  =  APP(x1)
app(x1, x2)  =  app(x2)
map  =  map
cons  =  cons

Recursive path order with status [RPO].
Quasi-Precedence:
map > APP1 > [app1, cons]

Status:
APP1: multiset
cons: multiset
map: multiset
app1: multiset


The following usable rules [FROCOS05] were oriented: none

(16) 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(inc, xs) → app(app(map, app(plus, 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))

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(inc, x0)
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))

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

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

map1(f, cons(x, xs)) → map1(f, xs)

The a-transformed usable rules are
none


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: Combined order from the following AFS and order.
map1(x1, x2)  =  map1(x2)
cons(x1, x2)  =  cons(x2)

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

Status:
cons1: multiset
map11: multiset


The following usable rules [FROCOS05] were oriented: none

(18) 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(inc, xs) → app(app(map, app(plus, 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))

The set Q consists of the following terms:

app(app(plus, 0), x0)
app(app(plus, app(s, x0)), x1)
app(inc, x0)
app(app(map, x0), nil)
app(app(map, x0), app(app(cons, x1), x2))

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

(19) PisEmptyProof (EQUIVALENT transformation)

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

(20) TRUE