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 PisEmptyProof (⇔)
    ↳16 TRUE

(0) Obligation:

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

app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(member, w), null) → false
app(app(member, w), app(app(app(fork, x), y), z)) → app(app(app(if, app(app(lt, w), y)), app(app(member, w), x)), app(app(app(if, app(app(eq, w), y)), true), app(app(member, w), z)))

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(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(member, w), null) → false
app(app(member, w), app(app(app(fork, x), y), z)) → app(app(app(if, app(app(lt, w), y)), app(app(member, w), x)), app(app(app(if, app(app(eq, w), y)), true), app(app(member, w), z)))

The set Q consists of the following terms:

app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(member, x0), null)
app(app(member, x0), app(app(app(fork, x1), x2), x3))

(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(lt, app(s, x)), app(s, y)) → APP(app(lt, x), y)
APP(app(lt, app(s, x)), app(s, y)) → APP(lt, x)
APP(app(member, w), app(app(app(fork, x), y), z)) → APP(app(app(if, app(app(lt, w), y)), app(app(member, w), x)), app(app(app(if, app(app(eq, w), y)), true), app(app(member, w), z)))
APP(app(member, w), app(app(app(fork, x), y), z)) → APP(app(if, app(app(lt, w), y)), app(app(member, w), x))
APP(app(member, w), app(app(app(fork, x), y), z)) → APP(if, app(app(lt, w), y))
APP(app(member, w), app(app(app(fork, x), y), z)) → APP(app(lt, w), y)
APP(app(member, w), app(app(app(fork, x), y), z)) → APP(lt, w)
APP(app(member, w), app(app(app(fork, x), y), z)) → APP(app(member, w), x)
APP(app(member, w), app(app(app(fork, x), y), z)) → APP(app(app(if, app(app(eq, w), y)), true), app(app(member, w), z))
APP(app(member, w), app(app(app(fork, x), y), z)) → APP(app(if, app(app(eq, w), y)), true)
APP(app(member, w), app(app(app(fork, x), y), z)) → APP(if, app(app(eq, w), y))
APP(app(member, w), app(app(app(fork, x), y), z)) → APP(app(eq, w), y)
APP(app(member, w), app(app(app(fork, x), y), z)) → APP(eq, w)
APP(app(member, w), app(app(app(fork, x), y), z)) → APP(app(member, w), z)

The TRS R consists of the following rules:

app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(member, w), null) → false
app(app(member, w), app(app(app(fork, x), y), z)) → app(app(app(if, app(app(lt, w), y)), app(app(member, w), x)), app(app(app(if, app(app(eq, w), y)), true), app(app(member, w), z)))

The set Q consists of the following terms:

app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(member, x0), null)
app(app(member, x0), app(app(app(fork, x1), x2), x3))

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

(6) Complex Obligation (AND)

(7) Obligation:

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

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

The TRS R consists of the following rules:

app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(member, w), null) → false
app(app(member, w), app(app(app(fork, x), y), z)) → app(app(app(if, app(app(lt, w), y)), app(app(member, w), x)), app(app(app(if, app(app(eq, w), y)), true), app(app(member, w), z)))

The set Q consists of the following terms:

app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(member, x0), null)
app(app(member, x0), app(app(app(fork, x1), x2), x3))

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

lt1(s(x), s(y)) → lt1(x, y)

The a-transformed usable rules are
none


The following pairs can be oriented strictly and are deleted.


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

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

Status:
lt11: [1]
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(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(member, w), null) → false
app(app(member, w), app(app(app(fork, x), y), z)) → app(app(app(if, app(app(lt, w), y)), app(app(member, w), x)), app(app(app(if, app(app(eq, w), y)), true), app(app(member, w), z)))

The set Q consists of the following terms:

app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(member, x0), null)
app(app(member, x0), app(app(app(fork, x1), x2), x3))

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(app(member, w), app(app(app(fork, x), y), z)) → APP(app(member, w), z)
APP(app(member, w), app(app(app(fork, x), y), z)) → APP(app(member, w), x)

The TRS R consists of the following rules:

app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(member, w), null) → false
app(app(member, w), app(app(app(fork, x), y), z)) → app(app(app(if, app(app(lt, w), y)), app(app(member, w), x)), app(app(app(if, app(app(eq, w), y)), true), app(app(member, w), z)))

The set Q consists of the following terms:

app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(member, x0), null)
app(app(member, x0), app(app(app(fork, x1), x2), x3))

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

member1(w, fork(x, y, z)) → member1(w, z)
member1(w, fork(x, y, z)) → member1(w, x)

The a-transformed usable rules are
none


The following pairs can be oriented strictly and are deleted.


APP(app(member, w), app(app(app(fork, x), y), z)) → APP(app(member, w), z)
APP(app(member, w), app(app(app(fork, x), y), z)) → APP(app(member, w), x)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
member1(x1, x2)  =  member1(x2)
fork(x1, x2, x3)  =  fork(x1, x2, x3)

Lexicographic path order with status [LPO].
Precedence:
fork3 > member11

Status:
member11: [1]
fork3: [1,2,3]

The following usable rules [FROCOS05] were oriented: none

(14) Obligation:

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

app(app(lt, app(s, x)), app(s, y)) → app(app(lt, x), y)
app(app(lt, 0), app(s, y)) → true
app(app(lt, y), 0) → false
app(app(eq, x), x) → true
app(app(eq, app(s, x)), 0) → false
app(app(eq, 0), app(s, x)) → false
app(app(member, w), null) → false
app(app(member, w), app(app(app(fork, x), y), z)) → app(app(app(if, app(app(lt, w), y)), app(app(member, w), x)), app(app(app(if, app(app(eq, w), y)), true), app(app(member, w), z)))

The set Q consists of the following terms:

app(app(lt, app(s, x0)), app(s, x1))
app(app(lt, 0), app(s, x0))
app(app(lt, x0), 0)
app(app(eq, x0), x0)
app(app(eq, app(s, x0)), 0)
app(app(eq, 0), app(s, x0))
app(app(member, x0), null)
app(app(member, x0), app(app(app(fork, x1), x2), x3))

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

(15) PisEmptyProof (EQUIVALENT transformation)

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

(16) TRUE