Left Termination proof of /tmp/tmpe

Left Termination of the query pattern mergesort(b,f) w.r.t. the given Prolog program could successfully be proven:

↳ PROLOG

  ↳ PrologToPiTRSProof

mergesort₂({}₀, {}₀).
mergesort₂(.₂(E, {}₀), .₂(E, {}₀)).
mergesort₂(.₂(E, .₂(F, U)), V) :- split₃(U, L2, L1), mergesort₂(.₂(E, L2), X), mergesort₂(.₂(F, L1), Z), merge₃(X, Z, V).
merge₃(X, {}₀, X).
merge₃({}₀, X, X).
merge₃(.₂(A, X), .₂(B, Y), .₂(A, Z)) :- le₂(A, B), merge₃(X, .₂(B, Y), Z).
merge₃(.₂(A, X), .₂(B, Y), .₂(B, Z)) :- gt₂(A, B), merge₃(.₂(A, X), Y, Z).
split₃({}₀, {}₀, {}₀).
split₃(.₂(E, U), .₂(E, V), W) :- split₃(U, W, V).
gt₂(s₁(X), s₁(Y)) :- gt₂(X, Y).
gt₂(s₁(X), 0₀).
le₂(s₁(X), s₁(Y)) :- le₂(X, Y).
le₂(0₀, s₁(Y)).
le₂(0₀, 0₀).

With regard to the inferred argument filtering the predicates were used in the following modes:
mergesort₂: (b,f)
split₃: (b,f,f)
merge₃: (b,b,f)
le₂: (b,b)
gt₂: (b,b)
Transforming PROLOG into the following Term Rewriting System:
Pi-finite rewrite system:
The TRS R consists of the following rules:

mergesort_2_in_ga₂([]_0, []_0) -> mergesort_2_out_ga₂([]_0, []_0)
mergesort_2_in_ga₂(._2₂(E, []_0), ._2₂(E, []_0)) -> mergesort_2_out_ga₂(._2₂(E, []_0), ._2₂(E, []_0))
mergesort_2_in_ga₂(._2₂(E, ._2₂(F, U)), V) -> if_mergesort_2_in_1_ga₅(E, F, U, V, split_3_in_gaa₃(U, L2, L1))
split_3_in_gaa₃([]_0, []_0, []_0) -> split_3_out_gaa₃([]_0, []_0, []_0)
split_3_in_gaa₃(._2₂(E, U), ._2₂(E, V), W) -> if_split_3_in_1_gaa₅(E, U, V, W, split_3_in_gaa₃(U, W, V))
if_split_3_in_1_gaa₅(E, U, V, W, split_3_out_gaa₃(U, W, V)) -> split_3_out_gaa₃(._2₂(E, U), ._2₂(E, V), W)
if_mergesort_2_in_1_ga₅(E, F, U, V, split_3_out_gaa₃(U, L2, L1)) -> if_mergesort_2_in_2_ga₇(E, F, U, V, L2, L1, mergesort_2_in_ga₂(._2₂(E, L2), X))
if_mergesort_2_in_2_ga₇(E, F, U, V, L2, L1, mergesort_2_out_ga₂(._2₂(E, L2), X)) -> if_mergesort_2_in_3_ga₇(E, F, U, V, L1, X, mergesort_2_in_ga₂(._2₂(F, L1), Z))
if_mergesort_2_in_3_ga₇(E, F, U, V, L1, X, mergesort_2_out_ga₂(._2₂(F, L1), Z)) -> if_mergesort_2_in_4_ga₇(E, F, U, V, X, Z, merge_3_in_gga₃(X, Z, V))
merge_3_in_gga₃(X, []_0, X) -> merge_3_out_gga₃(X, []_0, X)
merge_3_in_gga₃([]_0, X, X) -> merge_3_out_gga₃([]_0, X, X)
merge_3_in_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z)) -> if_merge_3_in_1_gga₆(A, X, B, Y, Z, le_2_in_gg₂(A, B))
le_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_le_2_in_1_gg₃(X, Y, le_2_in_gg₂(X, Y))
le_2_in_gg₂(0_0, s_1₁(Y)) -> le_2_out_gg₂(0_0, s_1₁(Y))
le_2_in_gg₂(0_0, 0_0) -> le_2_out_gg₂(0_0, 0_0)
if_le_2_in_1_gg₃(X, Y, le_2_out_gg₂(X, Y)) -> le_2_out_gg₂(s_1₁(X), s_1₁(Y))
if_merge_3_in_1_gga₆(A, X, B, Y, Z, le_2_out_gg₂(A, B)) -> if_merge_3_in_2_gga₆(A, X, B, Y, Z, merge_3_in_gga₃(X, ._2₂(B, Y), Z))
merge_3_in_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z)) -> if_merge_3_in_3_gga₆(A, X, B, Y, Z, gt_2_in_gg₂(A, B))
gt_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_gt_2_in_1_gg₃(X, Y, gt_2_in_gg₂(X, Y))
gt_2_in_gg₂(s_1₁(X), 0_0) -> gt_2_out_gg₂(s_1₁(X), 0_0)
if_gt_2_in_1_gg₃(X, Y, gt_2_out_gg₂(X, Y)) -> gt_2_out_gg₂(s_1₁(X), s_1₁(Y))
if_merge_3_in_3_gga₆(A, X, B, Y, Z, gt_2_out_gg₂(A, B)) -> if_merge_3_in_4_gga₆(A, X, B, Y, Z, merge_3_in_gga₃(._2₂(A, X), Y, Z))
if_merge_3_in_4_gga₆(A, X, B, Y, Z, merge_3_out_gga₃(._2₂(A, X), Y, Z)) -> merge_3_out_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z))
if_merge_3_in_2_gga₆(A, X, B, Y, Z, merge_3_out_gga₃(X, ._2₂(B, Y), Z)) -> merge_3_out_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z))
if_mergesort_2_in_4_ga₇(E, F, U, V, X, Z, merge_3_out_gga₃(X, Z, V)) -> mergesort_2_out_ga₂(._2₂(E, ._2₂(F, U)), V)

Infinitary Constructor Rewriting Termination of PiTRS implies Termination of PROLOG

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

Pi-finite rewrite system:
The TRS R consists of the following rules:

mergesort_2_in_ga₂([]_0, []_0) -> mergesort_2_out_ga₂([]_0, []_0)
mergesort_2_in_ga₂(._2₂(E, []_0), ._2₂(E, []_0)) -> mergesort_2_out_ga₂(._2₂(E, []_0), ._2₂(E, []_0))
mergesort_2_in_ga₂(._2₂(E, ._2₂(F, U)), V) -> if_mergesort_2_in_1_ga₅(E, F, U, V, split_3_in_gaa₃(U, L2, L1))
split_3_in_gaa₃([]_0, []_0, []_0) -> split_3_out_gaa₃([]_0, []_0, []_0)
split_3_in_gaa₃(._2₂(E, U), ._2₂(E, V), W) -> if_split_3_in_1_gaa₅(E, U, V, W, split_3_in_gaa₃(U, W, V))
if_split_3_in_1_gaa₅(E, U, V, W, split_3_out_gaa₃(U, W, V)) -> split_3_out_gaa₃(._2₂(E, U), ._2₂(E, V), W)
if_mergesort_2_in_1_ga₅(E, F, U, V, split_3_out_gaa₃(U, L2, L1)) -> if_mergesort_2_in_2_ga₇(E, F, U, V, L2, L1, mergesort_2_in_ga₂(._2₂(E, L2), X))
if_mergesort_2_in_2_ga₇(E, F, U, V, L2, L1, mergesort_2_out_ga₂(._2₂(E, L2), X)) -> if_mergesort_2_in_3_ga₇(E, F, U, V, L1, X, mergesort_2_in_ga₂(._2₂(F, L1), Z))
if_mergesort_2_in_3_ga₇(E, F, U, V, L1, X, mergesort_2_out_ga₂(._2₂(F, L1), Z)) -> if_mergesort_2_in_4_ga₇(E, F, U, V, X, Z, merge_3_in_gga₃(X, Z, V))
merge_3_in_gga₃(X, []_0, X) -> merge_3_out_gga₃(X, []_0, X)
merge_3_in_gga₃([]_0, X, X) -> merge_3_out_gga₃([]_0, X, X)
merge_3_in_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z)) -> if_merge_3_in_1_gga₆(A, X, B, Y, Z, le_2_in_gg₂(A, B))
le_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_le_2_in_1_gg₃(X, Y, le_2_in_gg₂(X, Y))
le_2_in_gg₂(0_0, s_1₁(Y)) -> le_2_out_gg₂(0_0, s_1₁(Y))
le_2_in_gg₂(0_0, 0_0) -> le_2_out_gg₂(0_0, 0_0)
if_le_2_in_1_gg₃(X, Y, le_2_out_gg₂(X, Y)) -> le_2_out_gg₂(s_1₁(X), s_1₁(Y))
if_merge_3_in_1_gga₆(A, X, B, Y, Z, le_2_out_gg₂(A, B)) -> if_merge_3_in_2_gga₆(A, X, B, Y, Z, merge_3_in_gga₃(X, ._2₂(B, Y), Z))
merge_3_in_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z)) -> if_merge_3_in_3_gga₆(A, X, B, Y, Z, gt_2_in_gg₂(A, B))
gt_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_gt_2_in_1_gg₃(X, Y, gt_2_in_gg₂(X, Y))
gt_2_in_gg₂(s_1₁(X), 0_0) -> gt_2_out_gg₂(s_1₁(X), 0_0)
if_gt_2_in_1_gg₃(X, Y, gt_2_out_gg₂(X, Y)) -> gt_2_out_gg₂(s_1₁(X), s_1₁(Y))
if_merge_3_in_3_gga₆(A, X, B, Y, Z, gt_2_out_gg₂(A, B)) -> if_merge_3_in_4_gga₆(A, X, B, Y, Z, merge_3_in_gga₃(._2₂(A, X), Y, Z))
if_merge_3_in_4_gga₆(A, X, B, Y, Z, merge_3_out_gga₃(._2₂(A, X), Y, Z)) -> merge_3_out_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z))
if_merge_3_in_2_gga₆(A, X, B, Y, Z, merge_3_out_gga₃(X, ._2₂(B, Y), Z)) -> merge_3_out_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z))
if_mergesort_2_in_4_ga₇(E, F, U, V, X, Z, merge_3_out_gga₃(X, Z, V)) -> mergesort_2_out_ga₂(._2₂(E, ._2₂(F, U)), V)

MERGESORT_2_IN_GA₂(._2₂(E, ._2₂(F, U)), V) -> IF_MERGESORT_2_IN_1_GA₅(E, F, U, V, split_3_in_gaa₃(U, L2, L1))
MERGESORT_2_IN_GA₂(._2₂(E, ._2₂(F, U)), V) -> SPLIT_3_IN_GAA₃(U, L2, L1)
SPLIT_3_IN_GAA₃(._2₂(E, U), ._2₂(E, V), W) -> IF_SPLIT_3_IN_1_GAA₅(E, U, V, W, split_3_in_gaa₃(U, W, V))
SPLIT_3_IN_GAA₃(._2₂(E, U), ._2₂(E, V), W) -> SPLIT_3_IN_GAA₃(U, W, V)
IF_MERGESORT_2_IN_1_GA₅(E, F, U, V, split_3_out_gaa₃(U, L2, L1)) -> IF_MERGESORT_2_IN_2_GA₇(E, F, U, V, L2, L1, mergesort_2_in_ga₂(._2₂(E, L2), X))
IF_MERGESORT_2_IN_1_GA₅(E, F, U, V, split_3_out_gaa₃(U, L2, L1)) -> MERGESORT_2_IN_GA₂(._2₂(E, L2), X)
IF_MERGESORT_2_IN_2_GA₇(E, F, U, V, L2, L1, mergesort_2_out_ga₂(._2₂(E, L2), X)) -> IF_MERGESORT_2_IN_3_GA₇(E, F, U, V, L1, X, mergesort_2_in_ga₂(._2₂(F, L1), Z))
IF_MERGESORT_2_IN_2_GA₇(E, F, U, V, L2, L1, mergesort_2_out_ga₂(._2₂(E, L2), X)) -> MERGESORT_2_IN_GA₂(._2₂(F, L1), Z)
IF_MERGESORT_2_IN_3_GA₇(E, F, U, V, L1, X, mergesort_2_out_ga₂(._2₂(F, L1), Z)) -> IF_MERGESORT_2_IN_4_GA₇(E, F, U, V, X, Z, merge_3_in_gga₃(X, Z, V))
IF_MERGESORT_2_IN_3_GA₇(E, F, U, V, L1, X, mergesort_2_out_ga₂(._2₂(F, L1), Z)) -> MERGE_3_IN_GGA₃(X, Z, V)
MERGE_3_IN_GGA₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z)) -> IF_MERGE_3_IN_1_GGA₆(A, X, B, Y, Z, le_2_in_gg₂(A, B))
MERGE_3_IN_GGA₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z)) -> LE_2_IN_GG₂(A, B)
LE_2_IN_GG₂(s_1₁(X), s_1₁(Y)) -> IF_LE_2_IN_1_GG₃(X, Y, le_2_in_gg₂(X, Y))
LE_2_IN_GG₂(s_1₁(X), s_1₁(Y)) -> LE_2_IN_GG₂(X, Y)
IF_MERGE_3_IN_1_GGA₆(A, X, B, Y, Z, le_2_out_gg₂(A, B)) -> IF_MERGE_3_IN_2_GGA₆(A, X, B, Y, Z, merge_3_in_gga₃(X, ._2₂(B, Y), Z))
IF_MERGE_3_IN_1_GGA₆(A, X, B, Y, Z, le_2_out_gg₂(A, B)) -> MERGE_3_IN_GGA₃(X, ._2₂(B, Y), Z)
MERGE_3_IN_GGA₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z)) -> IF_MERGE_3_IN_3_GGA₆(A, X, B, Y, Z, gt_2_in_gg₂(A, B))
MERGE_3_IN_GGA₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z)) -> GT_2_IN_GG₂(A, B)
GT_2_IN_GG₂(s_1₁(X), s_1₁(Y)) -> IF_GT_2_IN_1_GG₃(X, Y, gt_2_in_gg₂(X, Y))
GT_2_IN_GG₂(s_1₁(X), s_1₁(Y)) -> GT_2_IN_GG₂(X, Y)
IF_MERGE_3_IN_3_GGA₆(A, X, B, Y, Z, gt_2_out_gg₂(A, B)) -> IF_MERGE_3_IN_4_GGA₆(A, X, B, Y, Z, merge_3_in_gga₃(._2₂(A, X), Y, Z))
IF_MERGE_3_IN_3_GGA₆(A, X, B, Y, Z, gt_2_out_gg₂(A, B)) -> MERGE_3_IN_GGA₃(._2₂(A, X), Y, Z)

The TRS R consists of the following rules:

mergesort_2_in_ga₂([]_0, []_0) -> mergesort_2_out_ga₂([]_0, []_0)
mergesort_2_in_ga₂(._2₂(E, []_0), ._2₂(E, []_0)) -> mergesort_2_out_ga₂(._2₂(E, []_0), ._2₂(E, []_0))
mergesort_2_in_ga₂(._2₂(E, ._2₂(F, U)), V) -> if_mergesort_2_in_1_ga₅(E, F, U, V, split_3_in_gaa₃(U, L2, L1))
split_3_in_gaa₃([]_0, []_0, []_0) -> split_3_out_gaa₃([]_0, []_0, []_0)
split_3_in_gaa₃(._2₂(E, U), ._2₂(E, V), W) -> if_split_3_in_1_gaa₅(E, U, V, W, split_3_in_gaa₃(U, W, V))
if_split_3_in_1_gaa₅(E, U, V, W, split_3_out_gaa₃(U, W, V)) -> split_3_out_gaa₃(._2₂(E, U), ._2₂(E, V), W)
if_mergesort_2_in_1_ga₅(E, F, U, V, split_3_out_gaa₃(U, L2, L1)) -> if_mergesort_2_in_2_ga₇(E, F, U, V, L2, L1, mergesort_2_in_ga₂(._2₂(E, L2), X))
if_mergesort_2_in_2_ga₇(E, F, U, V, L2, L1, mergesort_2_out_ga₂(._2₂(E, L2), X)) -> if_mergesort_2_in_3_ga₇(E, F, U, V, L1, X, mergesort_2_in_ga₂(._2₂(F, L1), Z))
if_mergesort_2_in_3_ga₇(E, F, U, V, L1, X, mergesort_2_out_ga₂(._2₂(F, L1), Z)) -> if_mergesort_2_in_4_ga₇(E, F, U, V, X, Z, merge_3_in_gga₃(X, Z, V))
merge_3_in_gga₃(X, []_0, X) -> merge_3_out_gga₃(X, []_0, X)
merge_3_in_gga₃([]_0, X, X) -> merge_3_out_gga₃([]_0, X, X)
merge_3_in_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z)) -> if_merge_3_in_1_gga₆(A, X, B, Y, Z, le_2_in_gg₂(A, B))
le_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_le_2_in_1_gg₃(X, Y, le_2_in_gg₂(X, Y))
le_2_in_gg₂(0_0, s_1₁(Y)) -> le_2_out_gg₂(0_0, s_1₁(Y))
le_2_in_gg₂(0_0, 0_0) -> le_2_out_gg₂(0_0, 0_0)
if_le_2_in_1_gg₃(X, Y, le_2_out_gg₂(X, Y)) -> le_2_out_gg₂(s_1₁(X), s_1₁(Y))
if_merge_3_in_1_gga₆(A, X, B, Y, Z, le_2_out_gg₂(A, B)) -> if_merge_3_in_2_gga₆(A, X, B, Y, Z, merge_3_in_gga₃(X, ._2₂(B, Y), Z))
merge_3_in_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z)) -> if_merge_3_in_3_gga₆(A, X, B, Y, Z, gt_2_in_gg₂(A, B))
gt_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_gt_2_in_1_gg₃(X, Y, gt_2_in_gg₂(X, Y))
gt_2_in_gg₂(s_1₁(X), 0_0) -> gt_2_out_gg₂(s_1₁(X), 0_0)
if_gt_2_in_1_gg₃(X, Y, gt_2_out_gg₂(X, Y)) -> gt_2_out_gg₂(s_1₁(X), s_1₁(Y))
if_merge_3_in_3_gga₆(A, X, B, Y, Z, gt_2_out_gg₂(A, B)) -> if_merge_3_in_4_gga₆(A, X, B, Y, Z, merge_3_in_gga₃(._2₂(A, X), Y, Z))
if_merge_3_in_4_gga₆(A, X, B, Y, Z, merge_3_out_gga₃(._2₂(A, X), Y, Z)) -> merge_3_out_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z))
if_merge_3_in_2_gga₆(A, X, B, Y, Z, merge_3_out_gga₃(X, ._2₂(B, Y), Z)) -> merge_3_out_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z))
if_mergesort_2_in_4_ga₇(E, F, U, V, X, Z, merge_3_out_gga₃(X, Z, V)) -> mergesort_2_out_ga₂(._2₂(E, ._2₂(F, U)), V)

The argument filtering Pi contains the following mapping:
mergesort_2_in_ga₂(x1, x2) = mergesort_2_in_ga₁(x1)
[]_0 = []_0
._2₂(x1, x2) = ._2₂(x1, x2)
s_1₁(x1) = s_1₁(x1)
0_0 = 0_0
mergesort_2_out_ga₂(x1, x2) = mergesort_2_out_ga₁(x2)
if_mergesort_2_in_1_ga₅(x1, x2, x3, x4, x5) = if_mergesort_2_in_1_ga₃(x1, x2, x5)
split_3_in_gaa₃(x1, x2, x3) = split_3_in_gaa₁(x1)
split_3_out_gaa₃(x1, x2, x3) = split_3_out_gaa₂(x2, x3)
if_split_3_in_1_gaa₅(x1, x2, x3, x4, x5) = if_split_3_in_1_gaa₂(x1, x5)
if_mergesort_2_in_2_ga₇(x1, x2, x3, x4, x5, x6, x7) = if_mergesort_2_in_2_ga₃(x2, x6, x7)
if_mergesort_2_in_3_ga₇(x1, x2, x3, x4, x5, x6, x7) = if_mergesort_2_in_3_ga₂(x6, x7)
if_mergesort_2_in_4_ga₇(x1, x2, x3, x4, x5, x6, x7) = if_mergesort_2_in_4_ga₁(x7)
merge_3_in_gga₃(x1, x2, x3) = merge_3_in_gga₂(x1, x2)
merge_3_out_gga₃(x1, x2, x3) = merge_3_out_gga₁(x3)
if_merge_3_in_1_gga₆(x1, x2, x3, x4, x5, x6) = if_merge_3_in_1_gga₅(x1, x2, x3, x4, x6)
le_2_in_gg₂(x1, x2) = le_2_in_gg₂(x1, x2)
if_le_2_in_1_gg₃(x1, x2, x3) = if_le_2_in_1_gg₁(x3)
le_2_out_gg₂(x1, x2) = le_2_out_gg
if_merge_3_in_2_gga₆(x1, x2, x3, x4, x5, x6) = if_merge_3_in_2_gga₂(x1, x6)
if_merge_3_in_3_gga₆(x1, x2, x3, x4, x5, x6) = if_merge_3_in_3_gga₅(x1, x2, x3, x4, x6)
gt_2_in_gg₂(x1, x2) = gt_2_in_gg₂(x1, x2)
if_gt_2_in_1_gg₃(x1, x2, x3) = if_gt_2_in_1_gg₁(x3)
gt_2_out_gg₂(x1, x2) = gt_2_out_gg
if_merge_3_in_4_gga₆(x1, x2, x3, x4, x5, x6) = if_merge_3_in_4_gga₂(x3, x6)
GT_2_IN_GG₂(x1, x2) = GT_2_IN_GG₂(x1, x2)
IF_SPLIT_3_IN_1_GAA₅(x1, x2, x3, x4, x5) = IF_SPLIT_3_IN_1_GAA₂(x1, x5)
IF_MERGE_3_IN_2_GGA₆(x1, x2, x3, x4, x5, x6) = IF_MERGE_3_IN_2_GGA₂(x1, x6)
IF_MERGE_3_IN_1_GGA₆(x1, x2, x3, x4, x5, x6) = IF_MERGE_3_IN_1_GGA₅(x1, x2, x3, x4, x6)
IF_GT_2_IN_1_GG₃(x1, x2, x3) = IF_GT_2_IN_1_GG₁(x3)
IF_MERGESORT_2_IN_4_GA₇(x1, x2, x3, x4, x5, x6, x7) = IF_MERGESORT_2_IN_4_GA₁(x7)
IF_MERGESORT_2_IN_2_GA₇(x1, x2, x3, x4, x5, x6, x7) = IF_MERGESORT_2_IN_2_GA₃(x2, x6, x7)
IF_MERGE_3_IN_4_GGA₆(x1, x2, x3, x4, x5, x6) = IF_MERGE_3_IN_4_GGA₂(x3, x6)
IF_LE_2_IN_1_GG₃(x1, x2, x3) = IF_LE_2_IN_1_GG₁(x3)
MERGE_3_IN_GGA₃(x1, x2, x3) = MERGE_3_IN_GGA₂(x1, x2)
SPLIT_3_IN_GAA₃(x1, x2, x3) = SPLIT_3_IN_GAA₁(x1)
IF_MERGE_3_IN_3_GGA₆(x1, x2, x3, x4, x5, x6) = IF_MERGE_3_IN_3_GGA₅(x1, x2, x3, x4, x6)
MERGESORT_2_IN_GA₂(x1, x2) = MERGESORT_2_IN_GA₁(x1)
IF_MERGESORT_2_IN_3_GA₇(x1, x2, x3, x4, x5, x6, x7) = IF_MERGESORT_2_IN_3_GA₂(x6, x7)
LE_2_IN_GG₂(x1, x2) = LE_2_IN_GG₂(x1, x2)
IF_MERGESORT_2_IN_1_GA₅(x1, x2, x3, x4, x5) = IF_MERGESORT_2_IN_1_GA₃(x1, x2, x5)

We have to consider all (P,R,Pi)-chains

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

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

MERGESORT_2_IN_GA₂(._2₂(E, ._2₂(F, U)), V) -> IF_MERGESORT_2_IN_1_GA₅(E, F, U, V, split_3_in_gaa₃(U, L2, L1))
MERGESORT_2_IN_GA₂(._2₂(E, ._2₂(F, U)), V) -> SPLIT_3_IN_GAA₃(U, L2, L1)
SPLIT_3_IN_GAA₃(._2₂(E, U), ._2₂(E, V), W) -> IF_SPLIT_3_IN_1_GAA₅(E, U, V, W, split_3_in_gaa₃(U, W, V))
SPLIT_3_IN_GAA₃(._2₂(E, U), ._2₂(E, V), W) -> SPLIT_3_IN_GAA₃(U, W, V)
IF_MERGESORT_2_IN_1_GA₅(E, F, U, V, split_3_out_gaa₃(U, L2, L1)) -> IF_MERGESORT_2_IN_2_GA₇(E, F, U, V, L2, L1, mergesort_2_in_ga₂(._2₂(E, L2), X))
IF_MERGESORT_2_IN_1_GA₅(E, F, U, V, split_3_out_gaa₃(U, L2, L1)) -> MERGESORT_2_IN_GA₂(._2₂(E, L2), X)
IF_MERGESORT_2_IN_2_GA₇(E, F, U, V, L2, L1, mergesort_2_out_ga₂(._2₂(E, L2), X)) -> IF_MERGESORT_2_IN_3_GA₇(E, F, U, V, L1, X, mergesort_2_in_ga₂(._2₂(F, L1), Z))
IF_MERGESORT_2_IN_2_GA₇(E, F, U, V, L2, L1, mergesort_2_out_ga₂(._2₂(E, L2), X)) -> MERGESORT_2_IN_GA₂(._2₂(F, L1), Z)
IF_MERGESORT_2_IN_3_GA₇(E, F, U, V, L1, X, mergesort_2_out_ga₂(._2₂(F, L1), Z)) -> IF_MERGESORT_2_IN_4_GA₇(E, F, U, V, X, Z, merge_3_in_gga₃(X, Z, V))
IF_MERGESORT_2_IN_3_GA₇(E, F, U, V, L1, X, mergesort_2_out_ga₂(._2₂(F, L1), Z)) -> MERGE_3_IN_GGA₃(X, Z, V)
MERGE_3_IN_GGA₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z)) -> IF_MERGE_3_IN_1_GGA₆(A, X, B, Y, Z, le_2_in_gg₂(A, B))
MERGE_3_IN_GGA₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z)) -> LE_2_IN_GG₂(A, B)
LE_2_IN_GG₂(s_1₁(X), s_1₁(Y)) -> IF_LE_2_IN_1_GG₃(X, Y, le_2_in_gg₂(X, Y))
LE_2_IN_GG₂(s_1₁(X), s_1₁(Y)) -> LE_2_IN_GG₂(X, Y)
IF_MERGE_3_IN_1_GGA₆(A, X, B, Y, Z, le_2_out_gg₂(A, B)) -> IF_MERGE_3_IN_2_GGA₆(A, X, B, Y, Z, merge_3_in_gga₃(X, ._2₂(B, Y), Z))
IF_MERGE_3_IN_1_GGA₆(A, X, B, Y, Z, le_2_out_gg₂(A, B)) -> MERGE_3_IN_GGA₃(X, ._2₂(B, Y), Z)
MERGE_3_IN_GGA₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z)) -> IF_MERGE_3_IN_3_GGA₆(A, X, B, Y, Z, gt_2_in_gg₂(A, B))
MERGE_3_IN_GGA₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z)) -> GT_2_IN_GG₂(A, B)
GT_2_IN_GG₂(s_1₁(X), s_1₁(Y)) -> IF_GT_2_IN_1_GG₃(X, Y, gt_2_in_gg₂(X, Y))
GT_2_IN_GG₂(s_1₁(X), s_1₁(Y)) -> GT_2_IN_GG₂(X, Y)
IF_MERGE_3_IN_3_GGA₆(A, X, B, Y, Z, gt_2_out_gg₂(A, B)) -> IF_MERGE_3_IN_4_GGA₆(A, X, B, Y, Z, merge_3_in_gga₃(._2₂(A, X), Y, Z))
IF_MERGE_3_IN_3_GGA₆(A, X, B, Y, Z, gt_2_out_gg₂(A, B)) -> MERGE_3_IN_GGA₃(._2₂(A, X), Y, Z)

The TRS R consists of the following rules:

mergesort_2_in_ga₂([]_0, []_0) -> mergesort_2_out_ga₂([]_0, []_0)
mergesort_2_in_ga₂(._2₂(E, []_0), ._2₂(E, []_0)) -> mergesort_2_out_ga₂(._2₂(E, []_0), ._2₂(E, []_0))
mergesort_2_in_ga₂(._2₂(E, ._2₂(F, U)), V) -> if_mergesort_2_in_1_ga₅(E, F, U, V, split_3_in_gaa₃(U, L2, L1))
split_3_in_gaa₃([]_0, []_0, []_0) -> split_3_out_gaa₃([]_0, []_0, []_0)
split_3_in_gaa₃(._2₂(E, U), ._2₂(E, V), W) -> if_split_3_in_1_gaa₅(E, U, V, W, split_3_in_gaa₃(U, W, V))
if_split_3_in_1_gaa₅(E, U, V, W, split_3_out_gaa₃(U, W, V)) -> split_3_out_gaa₃(._2₂(E, U), ._2₂(E, V), W)
if_mergesort_2_in_1_ga₅(E, F, U, V, split_3_out_gaa₃(U, L2, L1)) -> if_mergesort_2_in_2_ga₇(E, F, U, V, L2, L1, mergesort_2_in_ga₂(._2₂(E, L2), X))
if_mergesort_2_in_2_ga₇(E, F, U, V, L2, L1, mergesort_2_out_ga₂(._2₂(E, L2), X)) -> if_mergesort_2_in_3_ga₇(E, F, U, V, L1, X, mergesort_2_in_ga₂(._2₂(F, L1), Z))
if_mergesort_2_in_3_ga₇(E, F, U, V, L1, X, mergesort_2_out_ga₂(._2₂(F, L1), Z)) -> if_mergesort_2_in_4_ga₇(E, F, U, V, X, Z, merge_3_in_gga₃(X, Z, V))
merge_3_in_gga₃(X, []_0, X) -> merge_3_out_gga₃(X, []_0, X)
merge_3_in_gga₃([]_0, X, X) -> merge_3_out_gga₃([]_0, X, X)
merge_3_in_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z)) -> if_merge_3_in_1_gga₆(A, X, B, Y, Z, le_2_in_gg₂(A, B))
le_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_le_2_in_1_gg₃(X, Y, le_2_in_gg₂(X, Y))
le_2_in_gg₂(0_0, s_1₁(Y)) -> le_2_out_gg₂(0_0, s_1₁(Y))
le_2_in_gg₂(0_0, 0_0) -> le_2_out_gg₂(0_0, 0_0)
if_le_2_in_1_gg₃(X, Y, le_2_out_gg₂(X, Y)) -> le_2_out_gg₂(s_1₁(X), s_1₁(Y))
if_merge_3_in_1_gga₆(A, X, B, Y, Z, le_2_out_gg₂(A, B)) -> if_merge_3_in_2_gga₆(A, X, B, Y, Z, merge_3_in_gga₃(X, ._2₂(B, Y), Z))
merge_3_in_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z)) -> if_merge_3_in_3_gga₆(A, X, B, Y, Z, gt_2_in_gg₂(A, B))
gt_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_gt_2_in_1_gg₃(X, Y, gt_2_in_gg₂(X, Y))
gt_2_in_gg₂(s_1₁(X), 0_0) -> gt_2_out_gg₂(s_1₁(X), 0_0)
if_gt_2_in_1_gg₃(X, Y, gt_2_out_gg₂(X, Y)) -> gt_2_out_gg₂(s_1₁(X), s_1₁(Y))
if_merge_3_in_3_gga₆(A, X, B, Y, Z, gt_2_out_gg₂(A, B)) -> if_merge_3_in_4_gga₆(A, X, B, Y, Z, merge_3_in_gga₃(._2₂(A, X), Y, Z))
if_merge_3_in_4_gga₆(A, X, B, Y, Z, merge_3_out_gga₃(._2₂(A, X), Y, Z)) -> merge_3_out_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z))
if_merge_3_in_2_gga₆(A, X, B, Y, Z, merge_3_out_gga₃(X, ._2₂(B, Y), Z)) -> merge_3_out_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z))
if_mergesort_2_in_4_ga₇(E, F, U, V, X, Z, merge_3_out_gga₃(X, Z, V)) -> mergesort_2_out_ga₂(._2₂(E, ._2₂(F, U)), V)

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

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

GT_2_IN_GG₂(s_1₁(X), s_1₁(Y)) -> GT_2_IN_GG₂(X, Y)

The TRS R consists of the following rules:

mergesort_2_in_ga₂([]_0, []_0) -> mergesort_2_out_ga₂([]_0, []_0)
mergesort_2_in_ga₂(._2₂(E, []_0), ._2₂(E, []_0)) -> mergesort_2_out_ga₂(._2₂(E, []_0), ._2₂(E, []_0))
mergesort_2_in_ga₂(._2₂(E, ._2₂(F, U)), V) -> if_mergesort_2_in_1_ga₅(E, F, U, V, split_3_in_gaa₃(U, L2, L1))
split_3_in_gaa₃([]_0, []_0, []_0) -> split_3_out_gaa₃([]_0, []_0, []_0)
split_3_in_gaa₃(._2₂(E, U), ._2₂(E, V), W) -> if_split_3_in_1_gaa₅(E, U, V, W, split_3_in_gaa₃(U, W, V))
if_split_3_in_1_gaa₅(E, U, V, W, split_3_out_gaa₃(U, W, V)) -> split_3_out_gaa₃(._2₂(E, U), ._2₂(E, V), W)
if_mergesort_2_in_1_ga₅(E, F, U, V, split_3_out_gaa₃(U, L2, L1)) -> if_mergesort_2_in_2_ga₇(E, F, U, V, L2, L1, mergesort_2_in_ga₂(._2₂(E, L2), X))
if_mergesort_2_in_2_ga₇(E, F, U, V, L2, L1, mergesort_2_out_ga₂(._2₂(E, L2), X)) -> if_mergesort_2_in_3_ga₇(E, F, U, V, L1, X, mergesort_2_in_ga₂(._2₂(F, L1), Z))
if_mergesort_2_in_3_ga₇(E, F, U, V, L1, X, mergesort_2_out_ga₂(._2₂(F, L1), Z)) -> if_mergesort_2_in_4_ga₇(E, F, U, V, X, Z, merge_3_in_gga₃(X, Z, V))
merge_3_in_gga₃(X, []_0, X) -> merge_3_out_gga₃(X, []_0, X)
merge_3_in_gga₃([]_0, X, X) -> merge_3_out_gga₃([]_0, X, X)
merge_3_in_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z)) -> if_merge_3_in_1_gga₆(A, X, B, Y, Z, le_2_in_gg₂(A, B))
le_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_le_2_in_1_gg₃(X, Y, le_2_in_gg₂(X, Y))
le_2_in_gg₂(0_0, s_1₁(Y)) -> le_2_out_gg₂(0_0, s_1₁(Y))
le_2_in_gg₂(0_0, 0_0) -> le_2_out_gg₂(0_0, 0_0)
if_le_2_in_1_gg₃(X, Y, le_2_out_gg₂(X, Y)) -> le_2_out_gg₂(s_1₁(X), s_1₁(Y))
if_merge_3_in_1_gga₆(A, X, B, Y, Z, le_2_out_gg₂(A, B)) -> if_merge_3_in_2_gga₆(A, X, B, Y, Z, merge_3_in_gga₃(X, ._2₂(B, Y), Z))
merge_3_in_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z)) -> if_merge_3_in_3_gga₆(A, X, B, Y, Z, gt_2_in_gg₂(A, B))
gt_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_gt_2_in_1_gg₃(X, Y, gt_2_in_gg₂(X, Y))
gt_2_in_gg₂(s_1₁(X), 0_0) -> gt_2_out_gg₂(s_1₁(X), 0_0)
if_gt_2_in_1_gg₃(X, Y, gt_2_out_gg₂(X, Y)) -> gt_2_out_gg₂(s_1₁(X), s_1₁(Y))
if_merge_3_in_3_gga₆(A, X, B, Y, Z, gt_2_out_gg₂(A, B)) -> if_merge_3_in_4_gga₆(A, X, B, Y, Z, merge_3_in_gga₃(._2₂(A, X), Y, Z))
if_merge_3_in_4_gga₆(A, X, B, Y, Z, merge_3_out_gga₃(._2₂(A, X), Y, Z)) -> merge_3_out_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z))
if_merge_3_in_2_gga₆(A, X, B, Y, Z, merge_3_out_gga₃(X, ._2₂(B, Y), Z)) -> merge_3_out_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z))
if_mergesort_2_in_4_ga₇(E, F, U, V, X, Z, merge_3_out_gga₃(X, Z, V)) -> mergesort_2_out_ga₂(._2₂(E, ._2₂(F, U)), V)

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

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

GT_2_IN_GG₂(s_1₁(X), s_1₁(Y)) -> GT_2_IN_GG₂(X, Y)

R is empty.
Pi is empty.
We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem into ordinary QDP problem by application of Pi.

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

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

GT_2_IN_GG₂(s_1₁(X), s_1₁(Y)) -> GT_2_IN_GG₂(X, Y)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
The head symbols of this DP problem are {GT_2_IN_GG₂}.
By using the subterm criterion together with the size-change analysis we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

GT_2_IN_GG₂(s_1₁(X), s_1₁(Y)) -> GT_2_IN_GG₂(X, Y)
The graph contains the following edges 1 > 1, 2 > 2

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

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

LE_2_IN_GG₂(s_1₁(X), s_1₁(Y)) -> LE_2_IN_GG₂(X, Y)

The TRS R consists of the following rules:

mergesort_2_in_ga₂([]_0, []_0) -> mergesort_2_out_ga₂([]_0, []_0)
mergesort_2_in_ga₂(._2₂(E, []_0), ._2₂(E, []_0)) -> mergesort_2_out_ga₂(._2₂(E, []_0), ._2₂(E, []_0))
mergesort_2_in_ga₂(._2₂(E, ._2₂(F, U)), V) -> if_mergesort_2_in_1_ga₅(E, F, U, V, split_3_in_gaa₃(U, L2, L1))
split_3_in_gaa₃([]_0, []_0, []_0) -> split_3_out_gaa₃([]_0, []_0, []_0)
split_3_in_gaa₃(._2₂(E, U), ._2₂(E, V), W) -> if_split_3_in_1_gaa₅(E, U, V, W, split_3_in_gaa₃(U, W, V))
if_split_3_in_1_gaa₅(E, U, V, W, split_3_out_gaa₃(U, W, V)) -> split_3_out_gaa₃(._2₂(E, U), ._2₂(E, V), W)
if_mergesort_2_in_1_ga₅(E, F, U, V, split_3_out_gaa₃(U, L2, L1)) -> if_mergesort_2_in_2_ga₇(E, F, U, V, L2, L1, mergesort_2_in_ga₂(._2₂(E, L2), X))
if_mergesort_2_in_2_ga₇(E, F, U, V, L2, L1, mergesort_2_out_ga₂(._2₂(E, L2), X)) -> if_mergesort_2_in_3_ga₇(E, F, U, V, L1, X, mergesort_2_in_ga₂(._2₂(F, L1), Z))
if_mergesort_2_in_3_ga₇(E, F, U, V, L1, X, mergesort_2_out_ga₂(._2₂(F, L1), Z)) -> if_mergesort_2_in_4_ga₇(E, F, U, V, X, Z, merge_3_in_gga₃(X, Z, V))
merge_3_in_gga₃(X, []_0, X) -> merge_3_out_gga₃(X, []_0, X)
merge_3_in_gga₃([]_0, X, X) -> merge_3_out_gga₃([]_0, X, X)
merge_3_in_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z)) -> if_merge_3_in_1_gga₆(A, X, B, Y, Z, le_2_in_gg₂(A, B))
le_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_le_2_in_1_gg₃(X, Y, le_2_in_gg₂(X, Y))
le_2_in_gg₂(0_0, s_1₁(Y)) -> le_2_out_gg₂(0_0, s_1₁(Y))
le_2_in_gg₂(0_0, 0_0) -> le_2_out_gg₂(0_0, 0_0)
if_le_2_in_1_gg₃(X, Y, le_2_out_gg₂(X, Y)) -> le_2_out_gg₂(s_1₁(X), s_1₁(Y))
if_merge_3_in_1_gga₆(A, X, B, Y, Z, le_2_out_gg₂(A, B)) -> if_merge_3_in_2_gga₆(A, X, B, Y, Z, merge_3_in_gga₃(X, ._2₂(B, Y), Z))
merge_3_in_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z)) -> if_merge_3_in_3_gga₆(A, X, B, Y, Z, gt_2_in_gg₂(A, B))
gt_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_gt_2_in_1_gg₃(X, Y, gt_2_in_gg₂(X, Y))
gt_2_in_gg₂(s_1₁(X), 0_0) -> gt_2_out_gg₂(s_1₁(X), 0_0)
if_gt_2_in_1_gg₃(X, Y, gt_2_out_gg₂(X, Y)) -> gt_2_out_gg₂(s_1₁(X), s_1₁(Y))
if_merge_3_in_3_gga₆(A, X, B, Y, Z, gt_2_out_gg₂(A, B)) -> if_merge_3_in_4_gga₆(A, X, B, Y, Z, merge_3_in_gga₃(._2₂(A, X), Y, Z))
if_merge_3_in_4_gga₆(A, X, B, Y, Z, merge_3_out_gga₃(._2₂(A, X), Y, Z)) -> merge_3_out_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z))
if_merge_3_in_2_gga₆(A, X, B, Y, Z, merge_3_out_gga₃(X, ._2₂(B, Y), Z)) -> merge_3_out_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z))
if_mergesort_2_in_4_ga₇(E, F, U, V, X, Z, merge_3_out_gga₃(X, Z, V)) -> mergesort_2_out_ga₂(._2₂(E, ._2₂(F, U)), V)

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

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

LE_2_IN_GG₂(s_1₁(X), s_1₁(Y)) -> LE_2_IN_GG₂(X, Y)

R is empty.
Pi is empty.
We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem into ordinary QDP problem by application of Pi.

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

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

LE_2_IN_GG₂(s_1₁(X), s_1₁(Y)) -> LE_2_IN_GG₂(X, Y)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
The head symbols of this DP problem are {LE_2_IN_GG₂}.
By using the subterm criterion together with the size-change analysis we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

LE_2_IN_GG₂(s_1₁(X), s_1₁(Y)) -> LE_2_IN_GG₂(X, Y)
The graph contains the following edges 1 > 1, 2 > 2

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

              ↳ PiDP

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

MERGE_3_IN_GGA₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z)) -> IF_MERGE_3_IN_3_GGA₆(A, X, B, Y, Z, gt_2_in_gg₂(A, B))
MERGE_3_IN_GGA₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z)) -> IF_MERGE_3_IN_1_GGA₆(A, X, B, Y, Z, le_2_in_gg₂(A, B))
IF_MERGE_3_IN_1_GGA₆(A, X, B, Y, Z, le_2_out_gg₂(A, B)) -> MERGE_3_IN_GGA₃(X, ._2₂(B, Y), Z)
IF_MERGE_3_IN_3_GGA₆(A, X, B, Y, Z, gt_2_out_gg₂(A, B)) -> MERGE_3_IN_GGA₃(._2₂(A, X), Y, Z)

The TRS R consists of the following rules:

mergesort_2_in_ga₂([]_0, []_0) -> mergesort_2_out_ga₂([]_0, []_0)
mergesort_2_in_ga₂(._2₂(E, []_0), ._2₂(E, []_0)) -> mergesort_2_out_ga₂(._2₂(E, []_0), ._2₂(E, []_0))
mergesort_2_in_ga₂(._2₂(E, ._2₂(F, U)), V) -> if_mergesort_2_in_1_ga₅(E, F, U, V, split_3_in_gaa₃(U, L2, L1))
split_3_in_gaa₃([]_0, []_0, []_0) -> split_3_out_gaa₃([]_0, []_0, []_0)
split_3_in_gaa₃(._2₂(E, U), ._2₂(E, V), W) -> if_split_3_in_1_gaa₅(E, U, V, W, split_3_in_gaa₃(U, W, V))
if_split_3_in_1_gaa₅(E, U, V, W, split_3_out_gaa₃(U, W, V)) -> split_3_out_gaa₃(._2₂(E, U), ._2₂(E, V), W)
if_mergesort_2_in_1_ga₅(E, F, U, V, split_3_out_gaa₃(U, L2, L1)) -> if_mergesort_2_in_2_ga₇(E, F, U, V, L2, L1, mergesort_2_in_ga₂(._2₂(E, L2), X))
if_mergesort_2_in_2_ga₇(E, F, U, V, L2, L1, mergesort_2_out_ga₂(._2₂(E, L2), X)) -> if_mergesort_2_in_3_ga₇(E, F, U, V, L1, X, mergesort_2_in_ga₂(._2₂(F, L1), Z))
if_mergesort_2_in_3_ga₇(E, F, U, V, L1, X, mergesort_2_out_ga₂(._2₂(F, L1), Z)) -> if_mergesort_2_in_4_ga₇(E, F, U, V, X, Z, merge_3_in_gga₃(X, Z, V))
merge_3_in_gga₃(X, []_0, X) -> merge_3_out_gga₃(X, []_0, X)
merge_3_in_gga₃([]_0, X, X) -> merge_3_out_gga₃([]_0, X, X)
merge_3_in_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z)) -> if_merge_3_in_1_gga₆(A, X, B, Y, Z, le_2_in_gg₂(A, B))
le_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_le_2_in_1_gg₃(X, Y, le_2_in_gg₂(X, Y))
le_2_in_gg₂(0_0, s_1₁(Y)) -> le_2_out_gg₂(0_0, s_1₁(Y))
le_2_in_gg₂(0_0, 0_0) -> le_2_out_gg₂(0_0, 0_0)
if_le_2_in_1_gg₃(X, Y, le_2_out_gg₂(X, Y)) -> le_2_out_gg₂(s_1₁(X), s_1₁(Y))
if_merge_3_in_1_gga₆(A, X, B, Y, Z, le_2_out_gg₂(A, B)) -> if_merge_3_in_2_gga₆(A, X, B, Y, Z, merge_3_in_gga₃(X, ._2₂(B, Y), Z))
merge_3_in_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z)) -> if_merge_3_in_3_gga₆(A, X, B, Y, Z, gt_2_in_gg₂(A, B))
gt_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_gt_2_in_1_gg₃(X, Y, gt_2_in_gg₂(X, Y))
gt_2_in_gg₂(s_1₁(X), 0_0) -> gt_2_out_gg₂(s_1₁(X), 0_0)
if_gt_2_in_1_gg₃(X, Y, gt_2_out_gg₂(X, Y)) -> gt_2_out_gg₂(s_1₁(X), s_1₁(Y))
if_merge_3_in_3_gga₆(A, X, B, Y, Z, gt_2_out_gg₂(A, B)) -> if_merge_3_in_4_gga₆(A, X, B, Y, Z, merge_3_in_gga₃(._2₂(A, X), Y, Z))
if_merge_3_in_4_gga₆(A, X, B, Y, Z, merge_3_out_gga₃(._2₂(A, X), Y, Z)) -> merge_3_out_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z))
if_merge_3_in_2_gga₆(A, X, B, Y, Z, merge_3_out_gga₃(X, ._2₂(B, Y), Z)) -> merge_3_out_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z))
if_mergesort_2_in_4_ga₇(E, F, U, V, X, Z, merge_3_out_gga₃(X, Z, V)) -> mergesort_2_out_ga₂(._2₂(E, ._2₂(F, U)), V)

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

              ↳ PiDP

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

MERGE_3_IN_GGA₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z)) -> IF_MERGE_3_IN_3_GGA₆(A, X, B, Y, Z, gt_2_in_gg₂(A, B))
MERGE_3_IN_GGA₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z)) -> IF_MERGE_3_IN_1_GGA₆(A, X, B, Y, Z, le_2_in_gg₂(A, B))
IF_MERGE_3_IN_1_GGA₆(A, X, B, Y, Z, le_2_out_gg₂(A, B)) -> MERGE_3_IN_GGA₃(X, ._2₂(B, Y), Z)
IF_MERGE_3_IN_3_GGA₆(A, X, B, Y, Z, gt_2_out_gg₂(A, B)) -> MERGE_3_IN_GGA₃(._2₂(A, X), Y, Z)

The TRS R consists of the following rules:

gt_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_gt_2_in_1_gg₃(X, Y, gt_2_in_gg₂(X, Y))
gt_2_in_gg₂(s_1₁(X), 0_0) -> gt_2_out_gg₂(s_1₁(X), 0_0)
le_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_le_2_in_1_gg₃(X, Y, le_2_in_gg₂(X, Y))
le_2_in_gg₂(0_0, s_1₁(Y)) -> le_2_out_gg₂(0_0, s_1₁(Y))
le_2_in_gg₂(0_0, 0_0) -> le_2_out_gg₂(0_0, 0_0)
if_gt_2_in_1_gg₃(X, Y, gt_2_out_gg₂(X, Y)) -> gt_2_out_gg₂(s_1₁(X), s_1₁(Y))
if_le_2_in_1_gg₃(X, Y, le_2_out_gg₂(X, Y)) -> le_2_out_gg₂(s_1₁(X), s_1₁(Y))

The argument filtering Pi contains the following mapping:
._2₂(x1, x2) = ._2₂(x1, x2)
s_1₁(x1) = s_1₁(x1)
0_0 = 0_0
le_2_in_gg₂(x1, x2) = le_2_in_gg₂(x1, x2)
if_le_2_in_1_gg₃(x1, x2, x3) = if_le_2_in_1_gg₁(x3)
le_2_out_gg₂(x1, x2) = le_2_out_gg
gt_2_in_gg₂(x1, x2) = gt_2_in_gg₂(x1, x2)
if_gt_2_in_1_gg₃(x1, x2, x3) = if_gt_2_in_1_gg₁(x3)
gt_2_out_gg₂(x1, x2) = gt_2_out_gg
IF_MERGE_3_IN_1_GGA₆(x1, x2, x3, x4, x5, x6) = IF_MERGE_3_IN_1_GGA₅(x1, x2, x3, x4, x6)
MERGE_3_IN_GGA₃(x1, x2, x3) = MERGE_3_IN_GGA₂(x1, x2)
IF_MERGE_3_IN_3_GGA₆(x1, x2, x3, x4, x5, x6) = IF_MERGE_3_IN_3_GGA₅(x1, x2, x3, x4, x6)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem into ordinary QDP problem by application of Pi.

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPPoloProof

              ↳ PiDP

              ↳ PiDP

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

MERGE_3_IN_GGA₂(._2₂(A, X), ._2₂(B, Y)) -> IF_MERGE_3_IN_3_GGA₅(A, X, B, Y, gt_2_in_gg₂(A, B))
MERGE_3_IN_GGA₂(._2₂(A, X), ._2₂(B, Y)) -> IF_MERGE_3_IN_1_GGA₅(A, X, B, Y, le_2_in_gg₂(A, B))
IF_MERGE_3_IN_1_GGA₅(A, X, B, Y, le_2_out_gg) -> MERGE_3_IN_GGA₂(X, ._2₂(B, Y))
IF_MERGE_3_IN_3_GGA₅(A, X, B, Y, gt_2_out_gg) -> MERGE_3_IN_GGA₂(._2₂(A, X), Y)

The TRS R consists of the following rules:

gt_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_gt_2_in_1_gg₁(gt_2_in_gg₂(X, Y))
gt_2_in_gg₂(s_1₁(X), 0_0) -> gt_2_out_gg
le_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_le_2_in_1_gg₁(le_2_in_gg₂(X, Y))
le_2_in_gg₂(0_0, s_1₁(Y)) -> le_2_out_gg
le_2_in_gg₂(0_0, 0_0) -> le_2_out_gg
if_gt_2_in_1_gg₁(gt_2_out_gg) -> gt_2_out_gg
if_le_2_in_1_gg₁(le_2_out_gg) -> le_2_out_gg

The set Q consists of the following terms:

gt_2_in_gg₂(x0, x1)
le_2_in_gg₂(x0, x1)
if_gt_2_in_1_gg₁(x0)
if_le_2_in_1_gg₁(x0)

We have to consider all (P,Q,R)-chains.
The head symbols of this DP problem are {IF_MERGE_3_IN_3_GGA₅, MERGE_3_IN_GGA₂, IF_MERGE_3_IN_1_GGA₅}.
By using a polynomial ordering, the following set of Dependency Pairs of this DP problem can be strictly oriented.

MERGE_3_IN_GGA₂(._2₂(A, X), ._2₂(B, Y)) -> IF_MERGE_3_IN_1_GGA₅(A, X, B, Y, le_2_in_gg₂(A, B))

The remaining Dependency Pairs were at least non-strictly be oriented.

MERGE_3_IN_GGA₂(._2₂(A, X), ._2₂(B, Y)) -> IF_MERGE_3_IN_3_GGA₅(A, X, B, Y, gt_2_in_gg₂(A, B))
IF_MERGE_3_IN_1_GGA₅(A, X, B, Y, le_2_out_gg) -> MERGE_3_IN_GGA₂(X, ._2₂(B, Y))
IF_MERGE_3_IN_3_GGA₅(A, X, B, Y, gt_2_out_gg) -> MERGE_3_IN_GGA₂(._2₂(A, X), Y)

With the implicit AFS there is no usable rule.

Used ordering: POLO with Polynomial interpretation:

POL(0_0) = 0
POL(gt_2_in_gg₂(x₁, x₂)) = 0
POL(if_gt_2_in_1_gg₁(x₁)) = 0
POL(MERGE_3_IN_GGA₂(x₁, x₂)) = x₁
POL(._2₂(x₁, x₂)) = 1 + x₂
POL(IF_MERGE_3_IN_1_GGA₅(x₁, x₂, x₃, x₄, x₅)) = x₂
POL(le_2_out_gg) = 0
POL(le_2_in_gg₂(x₁, x₂)) = 0
POL(s_1₁(x₁)) = 0
POL(gt_2_out_gg) = 0
POL(IF_MERGE_3_IN_3_GGA₅(x₁, x₂, x₃, x₄, x₅)) = 1 + x₂
POL(if_le_2_in_1_gg₁(x₁)) = 0

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPPoloProof

                          ↳ QDP

                            ↳ DependencyGraphProof

              ↳ PiDP

              ↳ PiDP

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

MERGE_3_IN_GGA₂(._2₂(A, X), ._2₂(B, Y)) -> IF_MERGE_3_IN_3_GGA₅(A, X, B, Y, gt_2_in_gg₂(A, B))
IF_MERGE_3_IN_1_GGA₅(A, X, B, Y, le_2_out_gg) -> MERGE_3_IN_GGA₂(X, ._2₂(B, Y))
IF_MERGE_3_IN_3_GGA₅(A, X, B, Y, gt_2_out_gg) -> MERGE_3_IN_GGA₂(._2₂(A, X), Y)

The TRS R consists of the following rules:

gt_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_gt_2_in_1_gg₁(gt_2_in_gg₂(X, Y))
gt_2_in_gg₂(s_1₁(X), 0_0) -> gt_2_out_gg
le_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_le_2_in_1_gg₁(le_2_in_gg₂(X, Y))
le_2_in_gg₂(0_0, s_1₁(Y)) -> le_2_out_gg
le_2_in_gg₂(0_0, 0_0) -> le_2_out_gg
if_gt_2_in_1_gg₁(gt_2_out_gg) -> gt_2_out_gg
if_le_2_in_1_gg₁(le_2_out_gg) -> le_2_out_gg

The set Q consists of the following terms:

gt_2_in_gg₂(x0, x1)
le_2_in_gg₂(x0, x1)
if_gt_2_in_1_gg₁(x0)
if_le_2_in_1_gg₁(x0)

We have to consider all (P,Q,R)-chains.
The head symbols of this DP problem are {IF_MERGE_3_IN_3_GGA₅, MERGE_3_IN_GGA₂, IF_MERGE_3_IN_1_GGA₅}.
The approximation of the Dependency Graph contains 1 SCC with 1 less node.

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPPoloProof

                          ↳ QDP

                            ↳ DependencyGraphProof

                              ↳ QDP

                                ↳ QDPSizeChangeProof

              ↳ PiDP

              ↳ PiDP

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

MERGE_3_IN_GGA₂(._2₂(A, X), ._2₂(B, Y)) -> IF_MERGE_3_IN_3_GGA₅(A, X, B, Y, gt_2_in_gg₂(A, B))
IF_MERGE_3_IN_3_GGA₅(A, X, B, Y, gt_2_out_gg) -> MERGE_3_IN_GGA₂(._2₂(A, X), Y)

The TRS R consists of the following rules:

gt_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_gt_2_in_1_gg₁(gt_2_in_gg₂(X, Y))
gt_2_in_gg₂(s_1₁(X), 0_0) -> gt_2_out_gg
le_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_le_2_in_1_gg₁(le_2_in_gg₂(X, Y))
le_2_in_gg₂(0_0, s_1₁(Y)) -> le_2_out_gg
le_2_in_gg₂(0_0, 0_0) -> le_2_out_gg
if_gt_2_in_1_gg₁(gt_2_out_gg) -> gt_2_out_gg
if_le_2_in_1_gg₁(le_2_out_gg) -> le_2_out_gg

The set Q consists of the following terms:

gt_2_in_gg₂(x0, x1)
le_2_in_gg₂(x0, x1)
if_gt_2_in_1_gg₁(x0)
if_le_2_in_1_gg₁(x0)

We have to consider all (P,Q,R)-chains.
The head symbols of this DP problem are {IF_MERGE_3_IN_3_GGA₅, MERGE_3_IN_GGA₂}.
By using the subterm criterion together with the size-change analysis we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

MERGE_3_IN_GGA₂(._2₂(A, X), ._2₂(B, Y)) -> IF_MERGE_3_IN_3_GGA₅(A, X, B, Y, gt_2_in_gg₂(A, B))
The graph contains the following edges 1 > 1, 1 > 2, 2 > 3, 2 > 4
IF_MERGE_3_IN_3_GGA₅(A, X, B, Y, gt_2_out_gg) -> MERGE_3_IN_GGA₂(._2₂(A, X), Y)
The graph contains the following edges 4 >= 2

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

              ↳ PiDP

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

SPLIT_3_IN_GAA₃(._2₂(E, U), ._2₂(E, V), W) -> SPLIT_3_IN_GAA₃(U, W, V)

The TRS R consists of the following rules:

mergesort_2_in_ga₂([]_0, []_0) -> mergesort_2_out_ga₂([]_0, []_0)
mergesort_2_in_ga₂(._2₂(E, []_0), ._2₂(E, []_0)) -> mergesort_2_out_ga₂(._2₂(E, []_0), ._2₂(E, []_0))
mergesort_2_in_ga₂(._2₂(E, ._2₂(F, U)), V) -> if_mergesort_2_in_1_ga₅(E, F, U, V, split_3_in_gaa₃(U, L2, L1))
split_3_in_gaa₃([]_0, []_0, []_0) -> split_3_out_gaa₃([]_0, []_0, []_0)
split_3_in_gaa₃(._2₂(E, U), ._2₂(E, V), W) -> if_split_3_in_1_gaa₅(E, U, V, W, split_3_in_gaa₃(U, W, V))
if_split_3_in_1_gaa₅(E, U, V, W, split_3_out_gaa₃(U, W, V)) -> split_3_out_gaa₃(._2₂(E, U), ._2₂(E, V), W)
if_mergesort_2_in_1_ga₅(E, F, U, V, split_3_out_gaa₃(U, L2, L1)) -> if_mergesort_2_in_2_ga₇(E, F, U, V, L2, L1, mergesort_2_in_ga₂(._2₂(E, L2), X))
if_mergesort_2_in_2_ga₇(E, F, U, V, L2, L1, mergesort_2_out_ga₂(._2₂(E, L2), X)) -> if_mergesort_2_in_3_ga₇(E, F, U, V, L1, X, mergesort_2_in_ga₂(._2₂(F, L1), Z))
if_mergesort_2_in_3_ga₇(E, F, U, V, L1, X, mergesort_2_out_ga₂(._2₂(F, L1), Z)) -> if_mergesort_2_in_4_ga₇(E, F, U, V, X, Z, merge_3_in_gga₃(X, Z, V))
merge_3_in_gga₃(X, []_0, X) -> merge_3_out_gga₃(X, []_0, X)
merge_3_in_gga₃([]_0, X, X) -> merge_3_out_gga₃([]_0, X, X)
merge_3_in_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z)) -> if_merge_3_in_1_gga₆(A, X, B, Y, Z, le_2_in_gg₂(A, B))
le_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_le_2_in_1_gg₃(X, Y, le_2_in_gg₂(X, Y))
le_2_in_gg₂(0_0, s_1₁(Y)) -> le_2_out_gg₂(0_0, s_1₁(Y))
le_2_in_gg₂(0_0, 0_0) -> le_2_out_gg₂(0_0, 0_0)
if_le_2_in_1_gg₃(X, Y, le_2_out_gg₂(X, Y)) -> le_2_out_gg₂(s_1₁(X), s_1₁(Y))
if_merge_3_in_1_gga₆(A, X, B, Y, Z, le_2_out_gg₂(A, B)) -> if_merge_3_in_2_gga₆(A, X, B, Y, Z, merge_3_in_gga₃(X, ._2₂(B, Y), Z))
merge_3_in_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z)) -> if_merge_3_in_3_gga₆(A, X, B, Y, Z, gt_2_in_gg₂(A, B))
gt_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_gt_2_in_1_gg₃(X, Y, gt_2_in_gg₂(X, Y))
gt_2_in_gg₂(s_1₁(X), 0_0) -> gt_2_out_gg₂(s_1₁(X), 0_0)
if_gt_2_in_1_gg₃(X, Y, gt_2_out_gg₂(X, Y)) -> gt_2_out_gg₂(s_1₁(X), s_1₁(Y))
if_merge_3_in_3_gga₆(A, X, B, Y, Z, gt_2_out_gg₂(A, B)) -> if_merge_3_in_4_gga₆(A, X, B, Y, Z, merge_3_in_gga₃(._2₂(A, X), Y, Z))
if_merge_3_in_4_gga₆(A, X, B, Y, Z, merge_3_out_gga₃(._2₂(A, X), Y, Z)) -> merge_3_out_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z))
if_merge_3_in_2_gga₆(A, X, B, Y, Z, merge_3_out_gga₃(X, ._2₂(B, Y), Z)) -> merge_3_out_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z))
if_mergesort_2_in_4_ga₇(E, F, U, V, X, Z, merge_3_out_gga₃(X, Z, V)) -> mergesort_2_out_ga₂(._2₂(E, ._2₂(F, U)), V)

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

              ↳ PiDP

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

SPLIT_3_IN_GAA₃(._2₂(E, U), ._2₂(E, V), W) -> SPLIT_3_IN_GAA₃(U, W, V)

R is empty.
The argument filtering Pi contains the following mapping:
._2₂(x1, x2) = ._2₂(x1, x2)
SPLIT_3_IN_GAA₃(x1, x2, x3) = SPLIT_3_IN_GAA₁(x1)

We have to consider all (P,R,Pi)-chains
Transforming (infinitary) constructor rewriting Pi-DP problem into ordinary QDP problem by application of Pi.

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPSizeChangeProof

              ↳ PiDP

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

SPLIT_3_IN_GAA₁(._2₂(E, U)) -> SPLIT_3_IN_GAA₁(U)

R is empty.
Q is empty.
We have to consider all (P,Q,R)-chains.
The head symbols of this DP problem are {SPLIT_3_IN_GAA₁}.
By using the subterm criterion together with the size-change analysis we have proven that there are no infinite chains for this DP problem.

From the DPs we obtained the following set of size-change graphs:

SPLIT_3_IN_GAA₁(._2₂(E, U)) -> SPLIT_3_IN_GAA₁(U)
The graph contains the following edges 1 > 1

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

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

IF_MERGESORT_2_IN_1_GA₅(E, F, U, V, split_3_out_gaa₃(U, L2, L1)) -> MERGESORT_2_IN_GA₂(._2₂(E, L2), X)
MERGESORT_2_IN_GA₂(._2₂(E, ._2₂(F, U)), V) -> IF_MERGESORT_2_IN_1_GA₅(E, F, U, V, split_3_in_gaa₃(U, L2, L1))
IF_MERGESORT_2_IN_2_GA₇(E, F, U, V, L2, L1, mergesort_2_out_ga₂(._2₂(E, L2), X)) -> MERGESORT_2_IN_GA₂(._2₂(F, L1), Z)
IF_MERGESORT_2_IN_1_GA₅(E, F, U, V, split_3_out_gaa₃(U, L2, L1)) -> IF_MERGESORT_2_IN_2_GA₇(E, F, U, V, L2, L1, mergesort_2_in_ga₂(._2₂(E, L2), X))

The TRS R consists of the following rules:

mergesort_2_in_ga₂([]_0, []_0) -> mergesort_2_out_ga₂([]_0, []_0)
mergesort_2_in_ga₂(._2₂(E, []_0), ._2₂(E, []_0)) -> mergesort_2_out_ga₂(._2₂(E, []_0), ._2₂(E, []_0))
mergesort_2_in_ga₂(._2₂(E, ._2₂(F, U)), V) -> if_mergesort_2_in_1_ga₅(E, F, U, V, split_3_in_gaa₃(U, L2, L1))
split_3_in_gaa₃([]_0, []_0, []_0) -> split_3_out_gaa₃([]_0, []_0, []_0)
split_3_in_gaa₃(._2₂(E, U), ._2₂(E, V), W) -> if_split_3_in_1_gaa₅(E, U, V, W, split_3_in_gaa₃(U, W, V))
if_split_3_in_1_gaa₅(E, U, V, W, split_3_out_gaa₃(U, W, V)) -> split_3_out_gaa₃(._2₂(E, U), ._2₂(E, V), W)
if_mergesort_2_in_1_ga₅(E, F, U, V, split_3_out_gaa₃(U, L2, L1)) -> if_mergesort_2_in_2_ga₇(E, F, U, V, L2, L1, mergesort_2_in_ga₂(._2₂(E, L2), X))
if_mergesort_2_in_2_ga₇(E, F, U, V, L2, L1, mergesort_2_out_ga₂(._2₂(E, L2), X)) -> if_mergesort_2_in_3_ga₇(E, F, U, V, L1, X, mergesort_2_in_ga₂(._2₂(F, L1), Z))
if_mergesort_2_in_3_ga₇(E, F, U, V, L1, X, mergesort_2_out_ga₂(._2₂(F, L1), Z)) -> if_mergesort_2_in_4_ga₇(E, F, U, V, X, Z, merge_3_in_gga₃(X, Z, V))
merge_3_in_gga₃(X, []_0, X) -> merge_3_out_gga₃(X, []_0, X)
merge_3_in_gga₃([]_0, X, X) -> merge_3_out_gga₃([]_0, X, X)
merge_3_in_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z)) -> if_merge_3_in_1_gga₆(A, X, B, Y, Z, le_2_in_gg₂(A, B))
le_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_le_2_in_1_gg₃(X, Y, le_2_in_gg₂(X, Y))
le_2_in_gg₂(0_0, s_1₁(Y)) -> le_2_out_gg₂(0_0, s_1₁(Y))
le_2_in_gg₂(0_0, 0_0) -> le_2_out_gg₂(0_0, 0_0)
if_le_2_in_1_gg₃(X, Y, le_2_out_gg₂(X, Y)) -> le_2_out_gg₂(s_1₁(X), s_1₁(Y))
if_merge_3_in_1_gga₆(A, X, B, Y, Z, le_2_out_gg₂(A, B)) -> if_merge_3_in_2_gga₆(A, X, B, Y, Z, merge_3_in_gga₃(X, ._2₂(B, Y), Z))
merge_3_in_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z)) -> if_merge_3_in_3_gga₆(A, X, B, Y, Z, gt_2_in_gg₂(A, B))
gt_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_gt_2_in_1_gg₃(X, Y, gt_2_in_gg₂(X, Y))
gt_2_in_gg₂(s_1₁(X), 0_0) -> gt_2_out_gg₂(s_1₁(X), 0_0)
if_gt_2_in_1_gg₃(X, Y, gt_2_out_gg₂(X, Y)) -> gt_2_out_gg₂(s_1₁(X), s_1₁(Y))
if_merge_3_in_3_gga₆(A, X, B, Y, Z, gt_2_out_gg₂(A, B)) -> if_merge_3_in_4_gga₆(A, X, B, Y, Z, merge_3_in_gga₃(._2₂(A, X), Y, Z))
if_merge_3_in_4_gga₆(A, X, B, Y, Z, merge_3_out_gga₃(._2₂(A, X), Y, Z)) -> merge_3_out_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z))
if_merge_3_in_2_gga₆(A, X, B, Y, Z, merge_3_out_gga₃(X, ._2₂(B, Y), Z)) -> merge_3_out_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z))
if_mergesort_2_in_4_ga₇(E, F, U, V, X, Z, merge_3_out_gga₃(X, Z, V)) -> mergesort_2_out_ga₂(._2₂(E, ._2₂(F, U)), V)

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

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

IF_MERGESORT_2_IN_1_GA₅(E, F, U, V, split_3_out_gaa₃(U, L2, L1)) -> MERGESORT_2_IN_GA₂(._2₂(E, L2), X)
MERGESORT_2_IN_GA₂(._2₂(E, ._2₂(F, U)), V) -> IF_MERGESORT_2_IN_1_GA₅(E, F, U, V, split_3_in_gaa₃(U, L2, L1))
IF_MERGESORT_2_IN_2_GA₇(E, F, U, V, L2, L1, mergesort_2_out_ga₂(._2₂(E, L2), X)) -> MERGESORT_2_IN_GA₂(._2₂(F, L1), Z)
IF_MERGESORT_2_IN_1_GA₅(E, F, U, V, split_3_out_gaa₃(U, L2, L1)) -> IF_MERGESORT_2_IN_2_GA₇(E, F, U, V, L2, L1, mergesort_2_in_ga₂(._2₂(E, L2), X))

The TRS R consists of the following rules:

split_3_in_gaa₃([]_0, []_0, []_0) -> split_3_out_gaa₃([]_0, []_0, []_0)
split_3_in_gaa₃(._2₂(E, U), ._2₂(E, V), W) -> if_split_3_in_1_gaa₅(E, U, V, W, split_3_in_gaa₃(U, W, V))
mergesort_2_in_ga₂(._2₂(E, []_0), ._2₂(E, []_0)) -> mergesort_2_out_ga₂(._2₂(E, []_0), ._2₂(E, []_0))
mergesort_2_in_ga₂(._2₂(E, ._2₂(F, U)), V) -> if_mergesort_2_in_1_ga₅(E, F, U, V, split_3_in_gaa₃(U, L2, L1))
if_split_3_in_1_gaa₅(E, U, V, W, split_3_out_gaa₃(U, W, V)) -> split_3_out_gaa₃(._2₂(E, U), ._2₂(E, V), W)
if_mergesort_2_in_1_ga₅(E, F, U, V, split_3_out_gaa₃(U, L2, L1)) -> if_mergesort_2_in_2_ga₇(E, F, U, V, L2, L1, mergesort_2_in_ga₂(._2₂(E, L2), X))
if_mergesort_2_in_2_ga₇(E, F, U, V, L2, L1, mergesort_2_out_ga₂(._2₂(E, L2), X)) -> if_mergesort_2_in_3_ga₇(E, F, U, V, L1, X, mergesort_2_in_ga₂(._2₂(F, L1), Z))
if_mergesort_2_in_3_ga₇(E, F, U, V, L1, X, mergesort_2_out_ga₂(._2₂(F, L1), Z)) -> if_mergesort_2_in_4_ga₇(E, F, U, V, X, Z, merge_3_in_gga₃(X, Z, V))
if_mergesort_2_in_4_ga₇(E, F, U, V, X, Z, merge_3_out_gga₃(X, Z, V)) -> mergesort_2_out_ga₂(._2₂(E, ._2₂(F, U)), V)
merge_3_in_gga₃(X, []_0, X) -> merge_3_out_gga₃(X, []_0, X)
merge_3_in_gga₃([]_0, X, X) -> merge_3_out_gga₃([]_0, X, X)
merge_3_in_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z)) -> if_merge_3_in_1_gga₆(A, X, B, Y, Z, le_2_in_gg₂(A, B))
merge_3_in_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z)) -> if_merge_3_in_3_gga₆(A, X, B, Y, Z, gt_2_in_gg₂(A, B))
if_merge_3_in_1_gga₆(A, X, B, Y, Z, le_2_out_gg₂(A, B)) -> if_merge_3_in_2_gga₆(A, X, B, Y, Z, merge_3_in_gga₃(X, ._2₂(B, Y), Z))
if_merge_3_in_3_gga₆(A, X, B, Y, Z, gt_2_out_gg₂(A, B)) -> if_merge_3_in_4_gga₆(A, X, B, Y, Z, merge_3_in_gga₃(._2₂(A, X), Y, Z))
le_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_le_2_in_1_gg₃(X, Y, le_2_in_gg₂(X, Y))
le_2_in_gg₂(0_0, s_1₁(Y)) -> le_2_out_gg₂(0_0, s_1₁(Y))
le_2_in_gg₂(0_0, 0_0) -> le_2_out_gg₂(0_0, 0_0)
if_merge_3_in_2_gga₆(A, X, B, Y, Z, merge_3_out_gga₃(X, ._2₂(B, Y), Z)) -> merge_3_out_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(A, Z))
gt_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_gt_2_in_1_gg₃(X, Y, gt_2_in_gg₂(X, Y))
gt_2_in_gg₂(s_1₁(X), 0_0) -> gt_2_out_gg₂(s_1₁(X), 0_0)
if_merge_3_in_4_gga₆(A, X, B, Y, Z, merge_3_out_gga₃(._2₂(A, X), Y, Z)) -> merge_3_out_gga₃(._2₂(A, X), ._2₂(B, Y), ._2₂(B, Z))
if_le_2_in_1_gg₃(X, Y, le_2_out_gg₂(X, Y)) -> le_2_out_gg₂(s_1₁(X), s_1₁(Y))
if_gt_2_in_1_gg₃(X, Y, gt_2_out_gg₂(X, Y)) -> gt_2_out_gg₂(s_1₁(X), s_1₁(Y))

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPPoloProof

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

IF_MERGESORT_2_IN_1_GA₃(E, F, split_3_out_gaa₂(L2, L1)) -> MERGESORT_2_IN_GA₁(._2₂(E, L2))
MERGESORT_2_IN_GA₁(._2₂(E, ._2₂(F, U))) -> IF_MERGESORT_2_IN_1_GA₃(E, F, split_3_in_gaa₁(U))
IF_MERGESORT_2_IN_2_GA₃(F, L1, mergesort_2_out_ga₁(X)) -> MERGESORT_2_IN_GA₁(._2₂(F, L1))
IF_MERGESORT_2_IN_1_GA₃(E, F, split_3_out_gaa₂(L2, L1)) -> IF_MERGESORT_2_IN_2_GA₃(F, L1, mergesort_2_in_ga₁(._2₂(E, L2)))

The TRS R consists of the following rules:

split_3_in_gaa₁([]_0) -> split_3_out_gaa₂([]_0, []_0)
split_3_in_gaa₁(._2₂(E, U)) -> if_split_3_in_1_gaa₂(E, split_3_in_gaa₁(U))
mergesort_2_in_ga₁(._2₂(E, []_0)) -> mergesort_2_out_ga₁(._2₂(E, []_0))
mergesort_2_in_ga₁(._2₂(E, ._2₂(F, U))) -> if_mergesort_2_in_1_ga₃(E, F, split_3_in_gaa₁(U))
if_split_3_in_1_gaa₂(E, split_3_out_gaa₂(W, V)) -> split_3_out_gaa₂(._2₂(E, V), W)
if_mergesort_2_in_1_ga₃(E, F, split_3_out_gaa₂(L2, L1)) -> if_mergesort_2_in_2_ga₃(F, L1, mergesort_2_in_ga₁(._2₂(E, L2)))
if_mergesort_2_in_2_ga₃(F, L1, mergesort_2_out_ga₁(X)) -> if_mergesort_2_in_3_ga₂(X, mergesort_2_in_ga₁(._2₂(F, L1)))
if_mergesort_2_in_3_ga₂(X, mergesort_2_out_ga₁(Z)) -> if_mergesort_2_in_4_ga₁(merge_3_in_gga₂(X, Z))
if_mergesort_2_in_4_ga₁(merge_3_out_gga₁(V)) -> mergesort_2_out_ga₁(V)
merge_3_in_gga₂(X, []_0) -> merge_3_out_gga₁(X)
merge_3_in_gga₂([]_0, X) -> merge_3_out_gga₁(X)
merge_3_in_gga₂(._2₂(A, X), ._2₂(B, Y)) -> if_merge_3_in_1_gga₅(A, X, B, Y, le_2_in_gg₂(A, B))
merge_3_in_gga₂(._2₂(A, X), ._2₂(B, Y)) -> if_merge_3_in_3_gga₅(A, X, B, Y, gt_2_in_gg₂(A, B))
if_merge_3_in_1_gga₅(A, X, B, Y, le_2_out_gg) -> if_merge_3_in_2_gga₂(A, merge_3_in_gga₂(X, ._2₂(B, Y)))
if_merge_3_in_3_gga₅(A, X, B, Y, gt_2_out_gg) -> if_merge_3_in_4_gga₂(B, merge_3_in_gga₂(._2₂(A, X), Y))
le_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_le_2_in_1_gg₁(le_2_in_gg₂(X, Y))
le_2_in_gg₂(0_0, s_1₁(Y)) -> le_2_out_gg
le_2_in_gg₂(0_0, 0_0) -> le_2_out_gg
if_merge_3_in_2_gga₂(A, merge_3_out_gga₁(Z)) -> merge_3_out_gga₁(._2₂(A, Z))
gt_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_gt_2_in_1_gg₁(gt_2_in_gg₂(X, Y))
gt_2_in_gg₂(s_1₁(X), 0_0) -> gt_2_out_gg
if_merge_3_in_4_gga₂(B, merge_3_out_gga₁(Z)) -> merge_3_out_gga₁(._2₂(B, Z))
if_le_2_in_1_gg₁(le_2_out_gg) -> le_2_out_gg
if_gt_2_in_1_gg₁(gt_2_out_gg) -> gt_2_out_gg

The set Q consists of the following terms:

split_3_in_gaa₁(x0)
mergesort_2_in_ga₁(x0)
if_split_3_in_1_gaa₂(x0, x1)
if_mergesort_2_in_1_ga₃(x0, x1, x2)
if_mergesort_2_in_2_ga₃(x0, x1, x2)
if_mergesort_2_in_3_ga₂(x0, x1)
if_mergesort_2_in_4_ga₁(x0)
merge_3_in_gga₂(x0, x1)
if_merge_3_in_1_gga₅(x0, x1, x2, x3, x4)
if_merge_3_in_3_gga₅(x0, x1, x2, x3, x4)
le_2_in_gg₂(x0, x1)
if_merge_3_in_2_gga₂(x0, x1)
gt_2_in_gg₂(x0, x1)
if_merge_3_in_4_gga₂(x0, x1)
if_le_2_in_1_gg₁(x0)
if_gt_2_in_1_gg₁(x0)

We have to consider all (P,Q,R)-chains.
The head symbols of this DP problem are {MERGESORT_2_IN_GA₁, IF_MERGESORT_2_IN_1_GA₃, IF_MERGESORT_2_IN_2_GA₃}.
By using a polynomial ordering, the following set of Dependency Pairs of this DP problem can be strictly oriented.

MERGESORT_2_IN_GA₁(._2₂(E, ._2₂(F, U))) -> IF_MERGESORT_2_IN_1_GA₃(E, F, split_3_in_gaa₁(U))

The remaining Dependency Pairs were at least non-strictly be oriented.

IF_MERGESORT_2_IN_1_GA₃(E, F, split_3_out_gaa₂(L2, L1)) -> MERGESORT_2_IN_GA₁(._2₂(E, L2))
IF_MERGESORT_2_IN_2_GA₃(F, L1, mergesort_2_out_ga₁(X)) -> MERGESORT_2_IN_GA₁(._2₂(F, L1))
IF_MERGESORT_2_IN_1_GA₃(E, F, split_3_out_gaa₂(L2, L1)) -> IF_MERGESORT_2_IN_2_GA₃(F, L1, mergesort_2_in_ga₁(._2₂(E, L2)))

With the implicit AFS we had to orient the following set of usable rules non-strictly.

if_split_3_in_1_gaa₂(E, split_3_out_gaa₂(W, V)) -> split_3_out_gaa₂(._2₂(E, V), W)
split_3_in_gaa₁([]_0) -> split_3_out_gaa₂([]_0, []_0)
split_3_in_gaa₁(._2₂(E, U)) -> if_split_3_in_1_gaa₂(E, split_3_in_gaa₁(U))

Used ordering: POLO with Polynomial interpretation:

POL(0_0) = 0
POL(merge_3_in_gga₂(x₁, x₂)) = 0
POL(gt_2_in_gg₂(x₁, x₂)) = 0
POL(split_3_out_gaa₂(x₁, x₂)) = x₁ + x₂
POL(mergesort_2_out_ga₁(x₁)) = 0
POL(mergesort_2_in_ga₁(x₁)) = 0
POL(if_mergesort_2_in_3_ga₂(x₁, x₂)) = 0
POL(MERGESORT_2_IN_GA₁(x₁)) = x₁
POL(merge_3_out_gga₁(x₁)) = 0
POL(split_3_in_gaa₁(x₁)) = x₁
POL(IF_MERGESORT_2_IN_2_GA₃(x₁, x₂, x₃)) = 1 + x₂
POL(if_mergesort_2_in_1_ga₃(x₁, x₂, x₃)) = 0
POL(if_merge_3_in_2_gga₂(x₁, x₂)) = 0
POL(if_gt_2_in_1_gg₁(x₁)) = 0
POL(IF_MERGESORT_2_IN_1_GA₃(x₁, x₂, x₃)) = 1 + x₃
POL(if_merge_3_in_3_gga₅(x₁, x₂, x₃, x₄, x₅)) = 0
POL(if_merge_3_in_4_gga₂(x₁, x₂)) = 0
POL(le_2_out_gg) = 0
POL(if_mergesort_2_in_2_ga₃(x₁, x₂, x₃)) = 0
POL(if_mergesort_2_in_4_ga₁(x₁)) = 0
POL([]_0) = 0
POL(if_le_2_in_1_gg₁(x₁)) = 0
POL(._2₂(x₁, x₂)) = 1 + x₂
POL(if_merge_3_in_1_gga₅(x₁, x₂, x₃, x₄, x₅)) = 0
POL(le_2_in_gg₂(x₁, x₂)) = 0
POL(gt_2_out_gg) = 0
POL(s_1₁(x₁)) = 0
POL(if_split_3_in_1_gaa₂(x₁, x₂)) = 1 + x₂

↳ PROLOG

  ↳ PrologToPiTRSProof

    ↳ PiTRS

      ↳ DependencyPairsProof

        ↳ PiDP

          ↳ DependencyGraphProof

            ↳ AND

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

              ↳ PiDP

                ↳ UsableRulesProof

                  ↳ PiDP

                    ↳ PiDPToQDPProof

                      ↳ QDP

                        ↳ QDPPoloProof

                          ↳ QDP

                            ↳ DependencyGraphProof

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

IF_MERGESORT_2_IN_1_GA₃(E, F, split_3_out_gaa₂(L2, L1)) -> MERGESORT_2_IN_GA₁(._2₂(E, L2))
IF_MERGESORT_2_IN_2_GA₃(F, L1, mergesort_2_out_ga₁(X)) -> MERGESORT_2_IN_GA₁(._2₂(F, L1))
IF_MERGESORT_2_IN_1_GA₃(E, F, split_3_out_gaa₂(L2, L1)) -> IF_MERGESORT_2_IN_2_GA₃(F, L1, mergesort_2_in_ga₁(._2₂(E, L2)))

The TRS R consists of the following rules:

split_3_in_gaa₁([]_0) -> split_3_out_gaa₂([]_0, []_0)
split_3_in_gaa₁(._2₂(E, U)) -> if_split_3_in_1_gaa₂(E, split_3_in_gaa₁(U))
mergesort_2_in_ga₁(._2₂(E, []_0)) -> mergesort_2_out_ga₁(._2₂(E, []_0))
mergesort_2_in_ga₁(._2₂(E, ._2₂(F, U))) -> if_mergesort_2_in_1_ga₃(E, F, split_3_in_gaa₁(U))
if_split_3_in_1_gaa₂(E, split_3_out_gaa₂(W, V)) -> split_3_out_gaa₂(._2₂(E, V), W)
if_mergesort_2_in_1_ga₃(E, F, split_3_out_gaa₂(L2, L1)) -> if_mergesort_2_in_2_ga₃(F, L1, mergesort_2_in_ga₁(._2₂(E, L2)))
if_mergesort_2_in_2_ga₃(F, L1, mergesort_2_out_ga₁(X)) -> if_mergesort_2_in_3_ga₂(X, mergesort_2_in_ga₁(._2₂(F, L1)))
if_mergesort_2_in_3_ga₂(X, mergesort_2_out_ga₁(Z)) -> if_mergesort_2_in_4_ga₁(merge_3_in_gga₂(X, Z))
if_mergesort_2_in_4_ga₁(merge_3_out_gga₁(V)) -> mergesort_2_out_ga₁(V)
merge_3_in_gga₂(X, []_0) -> merge_3_out_gga₁(X)
merge_3_in_gga₂([]_0, X) -> merge_3_out_gga₁(X)
merge_3_in_gga₂(._2₂(A, X), ._2₂(B, Y)) -> if_merge_3_in_1_gga₅(A, X, B, Y, le_2_in_gg₂(A, B))
merge_3_in_gga₂(._2₂(A, X), ._2₂(B, Y)) -> if_merge_3_in_3_gga₅(A, X, B, Y, gt_2_in_gg₂(A, B))
if_merge_3_in_1_gga₅(A, X, B, Y, le_2_out_gg) -> if_merge_3_in_2_gga₂(A, merge_3_in_gga₂(X, ._2₂(B, Y)))
if_merge_3_in_3_gga₅(A, X, B, Y, gt_2_out_gg) -> if_merge_3_in_4_gga₂(B, merge_3_in_gga₂(._2₂(A, X), Y))
le_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_le_2_in_1_gg₁(le_2_in_gg₂(X, Y))
le_2_in_gg₂(0_0, s_1₁(Y)) -> le_2_out_gg
le_2_in_gg₂(0_0, 0_0) -> le_2_out_gg
if_merge_3_in_2_gga₂(A, merge_3_out_gga₁(Z)) -> merge_3_out_gga₁(._2₂(A, Z))
gt_2_in_gg₂(s_1₁(X), s_1₁(Y)) -> if_gt_2_in_1_gg₁(gt_2_in_gg₂(X, Y))
gt_2_in_gg₂(s_1₁(X), 0_0) -> gt_2_out_gg
if_merge_3_in_4_gga₂(B, merge_3_out_gga₁(Z)) -> merge_3_out_gga₁(._2₂(B, Z))
if_le_2_in_1_gg₁(le_2_out_gg) -> le_2_out_gg
if_gt_2_in_1_gg₁(gt_2_out_gg) -> gt_2_out_gg

The set Q consists of the following terms:

split_3_in_gaa₁(x0)
mergesort_2_in_ga₁(x0)
if_split_3_in_1_gaa₂(x0, x1)
if_mergesort_2_in_1_ga₃(x0, x1, x2)
if_mergesort_2_in_2_ga₃(x0, x1, x2)
if_mergesort_2_in_3_ga₂(x0, x1)
if_mergesort_2_in_4_ga₁(x0)
merge_3_in_gga₂(x0, x1)
if_merge_3_in_1_gga₅(x0, x1, x2, x3, x4)
if_merge_3_in_3_gga₅(x0, x1, x2, x3, x4)
le_2_in_gg₂(x0, x1)
if_merge_3_in_2_gga₂(x0, x1)
gt_2_in_gg₂(x0, x1)
if_merge_3_in_4_gga₂(x0, x1)
if_le_2_in_1_gg₁(x0)
if_gt_2_in_1_gg₁(x0)

We have to consider all (P,Q,R)-chains.
The head symbols of this DP problem are {MERGESORT_2_IN_GA₁, IF_MERGESORT_2_IN_1_GA₃, IF_MERGESORT_2_IN_2_GA₃}.
The approximation of the Dependency Graph contains 0 SCCs with 3 less nodes.