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

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

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

(4) Complex Obligation (AND)

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

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(lt, app(s, x)), app(s, y)) → APP(app(lt, 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(x1, x2)  =  APP(x2)

Tags:
APP has tags [1,1]

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

POL(app(x1, x2)) = 1 + x1 + x2   
POL(lt) = 0   
POL(s) = 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(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.
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(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)))

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(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: SCNP Order with the following components:
Level mapping:
Top level AFS:
APP(x1, x2)  =  APP(x2)

Tags:
APP has tags [0,1]

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

POL(app(x1, x2)) = 1 + x1 + x2   
POL(fork) = 1   
POL(member) = 1   

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(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.
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