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
  ↳17 QDP
    ↳18 QDPOrderProof (⇔)
    ↳19 QDP
    ↳20 PisEmptyProof (⇔)
    ↳21 TRUE
  ↳22 QDP
    ↳23 QDPOrderProof (⇔)
    ↳24 QDP
    ↳25 PisEmptyProof (⇔)
    ↳26 TRUE

(0) Obligation:

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

lt(0, s(X)) → true
lt(s(X), 0) → false
lt(s(X), s(Y)) → lt(X, Y)
append(nil, Y) → Y
append(add(N, X), Y) → add(N, append(X, Y))
split(N, nil) → pair(nil, nil)
split(N, add(M, Y)) → f_1(split(N, Y), N, M, Y)
f_1(pair(X, Z), N, M, Y) → f_2(lt(N, M), N, M, Y, X, Z)
f_2(true, N, M, Y, X, Z) → pair(X, add(M, Z))
f_2(false, N, M, Y, X, Z) → pair(add(M, X), Z)
qsort(nil) → nil
qsort(add(N, X)) → f_3(split(N, X), N, X)
f_3(pair(Y, Z), N, X) → append(qsort(Y), add(X, qsort(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:

lt(0, s(X)) → true
lt(s(X), 0) → false
lt(s(X), s(Y)) → lt(X, Y)
append(nil, Y) → Y
append(add(N, X), Y) → add(N, append(X, Y))
split(N, nil) → pair(nil, nil)
split(N, add(M, Y)) → f_1(split(N, Y), N, M, Y)
f_1(pair(X, Z), N, M, Y) → f_2(lt(N, M), N, M, Y, X, Z)
f_2(true, N, M, Y, X, Z) → pair(X, add(M, Z))
f_2(false, N, M, Y, X, Z) → pair(add(M, X), Z)
qsort(nil) → nil
qsort(add(N, X)) → f_3(split(N, X), N, X)
f_3(pair(Y, Z), N, X) → append(qsort(Y), add(X, qsort(Z)))

The set Q consists of the following terms:

lt(0, s(x0))
lt(s(x0), 0)
lt(s(x0), s(x1))
append(nil, x0)
append(add(x0, x1), x2)
split(x0, nil)
split(x0, add(x1, x2))
f_1(pair(x0, x1), x2, x3, x4)
f_2(true, x0, x1, x2, x3, x4)
f_2(false, x0, x1, x2, x3, x4)
qsort(nil)
qsort(add(x0, x1))
f_3(pair(x0, 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:

LT(s(X), s(Y)) → LT(X, Y)
APPEND(add(N, X), Y) → APPEND(X, Y)
SPLIT(N, add(M, Y)) → F_1(split(N, Y), N, M, Y)
SPLIT(N, add(M, Y)) → SPLIT(N, Y)
F_1(pair(X, Z), N, M, Y) → F_2(lt(N, M), N, M, Y, X, Z)
F_1(pair(X, Z), N, M, Y) → LT(N, M)
QSORT(add(N, X)) → F_3(split(N, X), N, X)
QSORT(add(N, X)) → SPLIT(N, X)
F_3(pair(Y, Z), N, X) → APPEND(qsort(Y), add(X, qsort(Z)))
F_3(pair(Y, Z), N, X) → QSORT(Y)
F_3(pair(Y, Z), N, X) → QSORT(Z)

The TRS R consists of the following rules:

lt(0, s(X)) → true
lt(s(X), 0) → false
lt(s(X), s(Y)) → lt(X, Y)
append(nil, Y) → Y
append(add(N, X), Y) → add(N, append(X, Y))
split(N, nil) → pair(nil, nil)
split(N, add(M, Y)) → f_1(split(N, Y), N, M, Y)
f_1(pair(X, Z), N, M, Y) → f_2(lt(N, M), N, M, Y, X, Z)
f_2(true, N, M, Y, X, Z) → pair(X, add(M, Z))
f_2(false, N, M, Y, X, Z) → pair(add(M, X), Z)
qsort(nil) → nil
qsort(add(N, X)) → f_3(split(N, X), N, X)
f_3(pair(Y, Z), N, X) → append(qsort(Y), add(X, qsort(Z)))

The set Q consists of the following terms:

lt(0, s(x0))
lt(s(x0), 0)
lt(s(x0), s(x1))
append(nil, x0)
append(add(x0, x1), x2)
split(x0, nil)
split(x0, add(x1, x2))
f_1(pair(x0, x1), x2, x3, x4)
f_2(true, x0, x1, x2, x3, x4)
f_2(false, x0, x1, x2, x3, x4)
qsort(nil)
qsort(add(x0, x1))
f_3(pair(x0, 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 4 SCCs with 5 less nodes.

(6) Complex Obligation (AND)

(7) Obligation:

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

APPEND(add(N, X), Y) → APPEND(X, Y)

The TRS R consists of the following rules:

lt(0, s(X)) → true
lt(s(X), 0) → false
lt(s(X), s(Y)) → lt(X, Y)
append(nil, Y) → Y
append(add(N, X), Y) → add(N, append(X, Y))
split(N, nil) → pair(nil, nil)
split(N, add(M, Y)) → f_1(split(N, Y), N, M, Y)
f_1(pair(X, Z), N, M, Y) → f_2(lt(N, M), N, M, Y, X, Z)
f_2(true, N, M, Y, X, Z) → pair(X, add(M, Z))
f_2(false, N, M, Y, X, Z) → pair(add(M, X), Z)
qsort(nil) → nil
qsort(add(N, X)) → f_3(split(N, X), N, X)
f_3(pair(Y, Z), N, X) → append(qsort(Y), add(X, qsort(Z)))

The set Q consists of the following terms:

lt(0, s(x0))
lt(s(x0), 0)
lt(s(x0), s(x1))
append(nil, x0)
append(add(x0, x1), x2)
split(x0, nil)
split(x0, add(x1, x2))
f_1(pair(x0, x1), x2, x3, x4)
f_2(true, x0, x1, x2, x3, x4)
f_2(false, x0, x1, x2, x3, x4)
qsort(nil)
qsort(add(x0, x1))
f_3(pair(x0, x1), x2, x3)

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

(8) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


APPEND(add(N, X), Y) → APPEND(X, Y)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
APPEND(x1, x2)  =  APPEND(x1)
add(x1, x2)  =  add(x2)
lt(x1, x2)  =  lt
0  =  0
s(x1)  =  s
true  =  true
false  =  false
append(x1, x2)  =  append(x1, x2)
nil  =  nil
split(x1, x2)  =  split(x2)
pair(x1, x2)  =  pair(x1, x2)
f_1(x1, x2, x3, x4)  =  f_1(x1)
f_2(x1, x2, x3, x4, x5, x6)  =  f_2(x1, x5, x6)
qsort(x1)  =  qsort(x1)
f_3(x1, x2, x3)  =  f_3(x1)

Recursive path order with status [RPO].
Quasi-Precedence:
s > lt > [0, false] > nil
s > lt > true > nil
[qsort1, f31] > append2 > [APPEND1, add1, split1, f11, f23] > pair2 > lt > [0, false] > nil
[qsort1, f31] > append2 > [APPEND1, add1, split1, f11, f23] > pair2 > lt > true > nil

Status:
APPEND1: multiset
add1: multiset
lt: []
0: multiset
s: multiset
true: multiset
false: multiset
append2: [2,1]
nil: multiset
split1: multiset
pair2: [2,1]
f11: multiset
f23: multiset
qsort1: multiset
f31: multiset


The following usable rules [FROCOS05] were oriented:

lt(0, s(X)) → true
lt(s(X), 0) → false
lt(s(X), s(Y)) → lt(X, Y)
append(nil, Y) → Y
append(add(N, X), Y) → add(N, append(X, Y))
split(N, nil) → pair(nil, nil)
split(N, add(M, Y)) → f_1(split(N, Y), N, M, Y)
f_1(pair(X, Z), N, M, Y) → f_2(lt(N, M), N, M, Y, X, Z)
f_2(true, N, M, Y, X, Z) → pair(X, add(M, Z))
f_2(false, N, M, Y, X, Z) → pair(add(M, X), Z)
qsort(nil) → nil
qsort(add(N, X)) → f_3(split(N, X), N, X)
f_3(pair(Y, Z), N, X) → append(qsort(Y), add(X, qsort(Z)))

(9) Obligation:

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

lt(0, s(X)) → true
lt(s(X), 0) → false
lt(s(X), s(Y)) → lt(X, Y)
append(nil, Y) → Y
append(add(N, X), Y) → add(N, append(X, Y))
split(N, nil) → pair(nil, nil)
split(N, add(M, Y)) → f_1(split(N, Y), N, M, Y)
f_1(pair(X, Z), N, M, Y) → f_2(lt(N, M), N, M, Y, X, Z)
f_2(true, N, M, Y, X, Z) → pair(X, add(M, Z))
f_2(false, N, M, Y, X, Z) → pair(add(M, X), Z)
qsort(nil) → nil
qsort(add(N, X)) → f_3(split(N, X), N, X)
f_3(pair(Y, Z), N, X) → append(qsort(Y), add(X, qsort(Z)))

The set Q consists of the following terms:

lt(0, s(x0))
lt(s(x0), 0)
lt(s(x0), s(x1))
append(nil, x0)
append(add(x0, x1), x2)
split(x0, nil)
split(x0, add(x1, x2))
f_1(pair(x0, x1), x2, x3, x4)
f_2(true, x0, x1, x2, x3, x4)
f_2(false, x0, x1, x2, x3, x4)
qsort(nil)
qsort(add(x0, x1))
f_3(pair(x0, 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:

LT(s(X), s(Y)) → LT(X, Y)

The TRS R consists of the following rules:

lt(0, s(X)) → true
lt(s(X), 0) → false
lt(s(X), s(Y)) → lt(X, Y)
append(nil, Y) → Y
append(add(N, X), Y) → add(N, append(X, Y))
split(N, nil) → pair(nil, nil)
split(N, add(M, Y)) → f_1(split(N, Y), N, M, Y)
f_1(pair(X, Z), N, M, Y) → f_2(lt(N, M), N, M, Y, X, Z)
f_2(true, N, M, Y, X, Z) → pair(X, add(M, Z))
f_2(false, N, M, Y, X, Z) → pair(add(M, X), Z)
qsort(nil) → nil
qsort(add(N, X)) → f_3(split(N, X), N, X)
f_3(pair(Y, Z), N, X) → append(qsort(Y), add(X, qsort(Z)))

The set Q consists of the following terms:

lt(0, s(x0))
lt(s(x0), 0)
lt(s(x0), s(x1))
append(nil, x0)
append(add(x0, x1), x2)
split(x0, nil)
split(x0, add(x1, x2))
f_1(pair(x0, x1), x2, x3, x4)
f_2(true, x0, x1, x2, x3, x4)
f_2(false, x0, x1, x2, x3, x4)
qsort(nil)
qsort(add(x0, x1))
f_3(pair(x0, x1), x2, x3)

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.


LT(s(X), s(Y)) → LT(X, Y)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
LT(x1, x2)  =  LT(x1, x2)
s(x1)  =  s(x1)
lt(x1, x2)  =  lt
0  =  0
true  =  true
false  =  false
append(x1, x2)  =  append(x1, x2)
nil  =  nil
add(x1, x2)  =  add(x1, x2)
split(x1, x2)  =  split(x2)
pair(x1, x2)  =  pair(x1, x2)
f_1(x1, x2, x3, x4)  =  f_1(x1, x3, x4)
f_2(x1, x2, x3, x4, x5, x6)  =  f_2(x3, x4, x5, x6)
qsort(x1)  =  qsort(x1)
f_3(x1, x2, x3)  =  f_3(x1, x2, x3)

Recursive path order with status [RPO].
Quasi-Precedence:
[s1, lt] > true > [add2, split1, f13, f24] > pair2 > LT2
[s1, lt] > false > [add2, split1, f13, f24] > pair2 > LT2
0 > LT2
[qsort1, f33] > append2 > [add2, split1, f13, f24] > pair2 > LT2
[qsort1, f33] > nil > pair2 > LT2

Status:
LT2: [2,1]
s1: multiset
lt: []
0: multiset
true: multiset
false: multiset
append2: [2,1]
nil: multiset
add2: multiset
split1: multiset
pair2: multiset
f13: multiset
f24: multiset
qsort1: [1]
f33: [1,3,2]


The following usable rules [FROCOS05] were oriented:

lt(0, s(X)) → true
lt(s(X), 0) → false
lt(s(X), s(Y)) → lt(X, Y)
append(nil, Y) → Y
append(add(N, X), Y) → add(N, append(X, Y))
split(N, nil) → pair(nil, nil)
split(N, add(M, Y)) → f_1(split(N, Y), N, M, Y)
f_1(pair(X, Z), N, M, Y) → f_2(lt(N, M), N, M, Y, X, Z)
f_2(true, N, M, Y, X, Z) → pair(X, add(M, Z))
f_2(false, N, M, Y, X, Z) → pair(add(M, X), Z)
qsort(nil) → nil
qsort(add(N, X)) → f_3(split(N, X), N, X)
f_3(pair(Y, Z), N, X) → append(qsort(Y), add(X, qsort(Z)))

(14) Obligation:

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

lt(0, s(X)) → true
lt(s(X), 0) → false
lt(s(X), s(Y)) → lt(X, Y)
append(nil, Y) → Y
append(add(N, X), Y) → add(N, append(X, Y))
split(N, nil) → pair(nil, nil)
split(N, add(M, Y)) → f_1(split(N, Y), N, M, Y)
f_1(pair(X, Z), N, M, Y) → f_2(lt(N, M), N, M, Y, X, Z)
f_2(true, N, M, Y, X, Z) → pair(X, add(M, Z))
f_2(false, N, M, Y, X, Z) → pair(add(M, X), Z)
qsort(nil) → nil
qsort(add(N, X)) → f_3(split(N, X), N, X)
f_3(pair(Y, Z), N, X) → append(qsort(Y), add(X, qsort(Z)))

The set Q consists of the following terms:

lt(0, s(x0))
lt(s(x0), 0)
lt(s(x0), s(x1))
append(nil, x0)
append(add(x0, x1), x2)
split(x0, nil)
split(x0, add(x1, x2))
f_1(pair(x0, x1), x2, x3, x4)
f_2(true, x0, x1, x2, x3, x4)
f_2(false, x0, x1, x2, x3, x4)
qsort(nil)
qsort(add(x0, x1))
f_3(pair(x0, 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

(17) Obligation:

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

SPLIT(N, add(M, Y)) → SPLIT(N, Y)

The TRS R consists of the following rules:

lt(0, s(X)) → true
lt(s(X), 0) → false
lt(s(X), s(Y)) → lt(X, Y)
append(nil, Y) → Y
append(add(N, X), Y) → add(N, append(X, Y))
split(N, nil) → pair(nil, nil)
split(N, add(M, Y)) → f_1(split(N, Y), N, M, Y)
f_1(pair(X, Z), N, M, Y) → f_2(lt(N, M), N, M, Y, X, Z)
f_2(true, N, M, Y, X, Z) → pair(X, add(M, Z))
f_2(false, N, M, Y, X, Z) → pair(add(M, X), Z)
qsort(nil) → nil
qsort(add(N, X)) → f_3(split(N, X), N, X)
f_3(pair(Y, Z), N, X) → append(qsort(Y), add(X, qsort(Z)))

The set Q consists of the following terms:

lt(0, s(x0))
lt(s(x0), 0)
lt(s(x0), s(x1))
append(nil, x0)
append(add(x0, x1), x2)
split(x0, nil)
split(x0, add(x1, x2))
f_1(pair(x0, x1), x2, x3, x4)
f_2(true, x0, x1, x2, x3, x4)
f_2(false, x0, x1, x2, x3, x4)
qsort(nil)
qsort(add(x0, x1))
f_3(pair(x0, x1), x2, x3)

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

(18) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


SPLIT(N, add(M, Y)) → SPLIT(N, Y)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
SPLIT(x1, x2)  =  SPLIT(x2)
add(x1, x2)  =  add(x1, x2)
lt(x1, x2)  =  lt(x1, x2)
0  =  0
s(x1)  =  x1
true  =  true
false  =  false
append(x1, x2)  =  append(x1, x2)
nil  =  nil
split(x1, x2)  =  split(x2)
pair(x1, x2)  =  pair(x1, x2)
f_1(x1, x2, x3, x4)  =  f_1(x1, x3)
f_2(x1, x2, x3, x4, x5, x6)  =  f_2(x3, x5, x6)
qsort(x1)  =  qsort(x1)
f_3(x1, x2, x3)  =  f_3(x1, x2, x3)

Recursive path order with status [RPO].
Quasi-Precedence:
SPLIT1 > pair2
lt2 > [0, false] > [add2, true, split1, f12, f23] > pair2
nil > pair2
[qsort1, f33] > append2 > [add2, true, split1, f12, f23] > pair2

Status:
SPLIT1: [1]
add2: multiset
lt2: [1,2]
0: multiset
true: multiset
false: multiset
append2: [2,1]
nil: multiset
split1: multiset
pair2: multiset
f12: multiset
f23: multiset
qsort1: multiset
f33: multiset


The following usable rules [FROCOS05] were oriented:

lt(0, s(X)) → true
lt(s(X), 0) → false
lt(s(X), s(Y)) → lt(X, Y)
append(nil, Y) → Y
append(add(N, X), Y) → add(N, append(X, Y))
split(N, nil) → pair(nil, nil)
split(N, add(M, Y)) → f_1(split(N, Y), N, M, Y)
f_1(pair(X, Z), N, M, Y) → f_2(lt(N, M), N, M, Y, X, Z)
f_2(true, N, M, Y, X, Z) → pair(X, add(M, Z))
f_2(false, N, M, Y, X, Z) → pair(add(M, X), Z)
qsort(nil) → nil
qsort(add(N, X)) → f_3(split(N, X), N, X)
f_3(pair(Y, Z), N, X) → append(qsort(Y), add(X, qsort(Z)))

(19) Obligation:

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

lt(0, s(X)) → true
lt(s(X), 0) → false
lt(s(X), s(Y)) → lt(X, Y)
append(nil, Y) → Y
append(add(N, X), Y) → add(N, append(X, Y))
split(N, nil) → pair(nil, nil)
split(N, add(M, Y)) → f_1(split(N, Y), N, M, Y)
f_1(pair(X, Z), N, M, Y) → f_2(lt(N, M), N, M, Y, X, Z)
f_2(true, N, M, Y, X, Z) → pair(X, add(M, Z))
f_2(false, N, M, Y, X, Z) → pair(add(M, X), Z)
qsort(nil) → nil
qsort(add(N, X)) → f_3(split(N, X), N, X)
f_3(pair(Y, Z), N, X) → append(qsort(Y), add(X, qsort(Z)))

The set Q consists of the following terms:

lt(0, s(x0))
lt(s(x0), 0)
lt(s(x0), s(x1))
append(nil, x0)
append(add(x0, x1), x2)
split(x0, nil)
split(x0, add(x1, x2))
f_1(pair(x0, x1), x2, x3, x4)
f_2(true, x0, x1, x2, x3, x4)
f_2(false, x0, x1, x2, x3, x4)
qsort(nil)
qsort(add(x0, x1))
f_3(pair(x0, x1), x2, x3)

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

(20) PisEmptyProof (EQUIVALENT transformation)

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

(21) TRUE

(22) Obligation:

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

QSORT(add(N, X)) → F_3(split(N, X), N, X)
F_3(pair(Y, Z), N, X) → QSORT(Y)
F_3(pair(Y, Z), N, X) → QSORT(Z)

The TRS R consists of the following rules:

lt(0, s(X)) → true
lt(s(X), 0) → false
lt(s(X), s(Y)) → lt(X, Y)
append(nil, Y) → Y
append(add(N, X), Y) → add(N, append(X, Y))
split(N, nil) → pair(nil, nil)
split(N, add(M, Y)) → f_1(split(N, Y), N, M, Y)
f_1(pair(X, Z), N, M, Y) → f_2(lt(N, M), N, M, Y, X, Z)
f_2(true, N, M, Y, X, Z) → pair(X, add(M, Z))
f_2(false, N, M, Y, X, Z) → pair(add(M, X), Z)
qsort(nil) → nil
qsort(add(N, X)) → f_3(split(N, X), N, X)
f_3(pair(Y, Z), N, X) → append(qsort(Y), add(X, qsort(Z)))

The set Q consists of the following terms:

lt(0, s(x0))
lt(s(x0), 0)
lt(s(x0), s(x1))
append(nil, x0)
append(add(x0, x1), x2)
split(x0, nil)
split(x0, add(x1, x2))
f_1(pair(x0, x1), x2, x3, x4)
f_2(true, x0, x1, x2, x3, x4)
f_2(false, x0, x1, x2, x3, x4)
qsort(nil)
qsort(add(x0, x1))
f_3(pair(x0, x1), x2, x3)

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

(23) QDPOrderProof (EQUIVALENT transformation)

We use the reduction pair processor [LPAR04].


The following pairs can be oriented strictly and are deleted.


QSORT(add(N, X)) → F_3(split(N, X), N, X)
F_3(pair(Y, Z), N, X) → QSORT(Y)
F_3(pair(Y, Z), N, X) → QSORT(Z)
The remaining pairs can at least be oriented weakly.
Used ordering: Combined order from the following AFS and order.
QSORT(x1)  =  QSORT(x1)
add(x1, x2)  =  add(x1, x2)
F_3(x1, x2, x3)  =  F_3(x1, x2, x3)
split(x1, x2)  =  split(x2)
pair(x1, x2)  =  pair(x1, x2)
lt(x1, x2)  =  lt
0  =  0
s(x1)  =  x1
true  =  true
false  =  false
append(x1, x2)  =  append(x1, x2)
nil  =  nil
f_1(x1, x2, x3, x4)  =  f_1(x1, x3)
f_2(x1, x2, x3, x4, x5, x6)  =  f_2(x1, x3, x5, x6)
qsort(x1)  =  qsort(x1)
f_3(x1, x2, x3)  =  f_3(x1, x3)

Recursive path order with status [RPO].
Quasi-Precedence:
0 > [lt, false] > [true, nil]
[qsort1, f32] > append2 > [add2, split1, f12, f24] > pair2 > QSORT1 > F33 > [true, nil]
[qsort1, f32] > append2 > [add2, split1, f12, f24] > pair2 > [lt, false] > [true, nil]

Status:
QSORT1: multiset
add2: multiset
F33: multiset
split1: multiset
pair2: multiset
lt: []
0: multiset
true: multiset
false: multiset
append2: [1,2]
nil: multiset
f12: multiset
f24: multiset
qsort1: [1]
f32: [1,2]


The following usable rules [FROCOS05] were oriented:

lt(0, s(X)) → true
lt(s(X), 0) → false
lt(s(X), s(Y)) → lt(X, Y)
append(nil, Y) → Y
append(add(N, X), Y) → add(N, append(X, Y))
split(N, nil) → pair(nil, nil)
split(N, add(M, Y)) → f_1(split(N, Y), N, M, Y)
f_1(pair(X, Z), N, M, Y) → f_2(lt(N, M), N, M, Y, X, Z)
f_2(true, N, M, Y, X, Z) → pair(X, add(M, Z))
f_2(false, N, M, Y, X, Z) → pair(add(M, X), Z)
qsort(nil) → nil
qsort(add(N, X)) → f_3(split(N, X), N, X)
f_3(pair(Y, Z), N, X) → append(qsort(Y), add(X, qsort(Z)))

(24) Obligation:

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

lt(0, s(X)) → true
lt(s(X), 0) → false
lt(s(X), s(Y)) → lt(X, Y)
append(nil, Y) → Y
append(add(N, X), Y) → add(N, append(X, Y))
split(N, nil) → pair(nil, nil)
split(N, add(M, Y)) → f_1(split(N, Y), N, M, Y)
f_1(pair(X, Z), N, M, Y) → f_2(lt(N, M), N, M, Y, X, Z)
f_2(true, N, M, Y, X, Z) → pair(X, add(M, Z))
f_2(false, N, M, Y, X, Z) → pair(add(M, X), Z)
qsort(nil) → nil
qsort(add(N, X)) → f_3(split(N, X), N, X)
f_3(pair(Y, Z), N, X) → append(qsort(Y), add(X, qsort(Z)))

The set Q consists of the following terms:

lt(0, s(x0))
lt(s(x0), 0)
lt(s(x0), s(x1))
append(nil, x0)
append(add(x0, x1), x2)
split(x0, nil)
split(x0, add(x1, x2))
f_1(pair(x0, x1), x2, x3, x4)
f_2(true, x0, x1, x2, x3, x4)
f_2(false, x0, x1, x2, x3, x4)
qsort(nil)
qsort(add(x0, x1))
f_3(pair(x0, x1), x2, x3)

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

(25) PisEmptyProof (EQUIVALENT transformation)

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

(26) TRUE