The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^3, INF).

(0) Obligation:

Runtime Complexity TRS:
The TRS R consists of the following rules:

minus(x, 0) → x
minus(s(x), s(y)) → minus(x, y)
quot(0, s(y)) → 0
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
app(nil, y) → y
app(add(n, x), y) → add(n, app(x, y))
reverse(nil) → nil
reverse(add(n, x)) → app(reverse(x), add(n, nil))
shuffle(nil) → nil
shuffle(add(n, x)) → add(n, shuffle(reverse(x)))
concat(leaf, y) → y
concat(cons(u, v), y) → cons(u, concat(v, y))
less_leaves(x, leaf) → false
less_leaves(leaf, cons(w, z)) → true
less_leaves(cons(u, v), cons(w, z)) → less_leaves(concat(u, v), concat(w, z))

Rewrite Strategy: INNERMOST

(1) RenamingProof (EQUIVALENT transformation)

Renamed function symbols to avoid clashes with predefined symbol.

(2) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
app(nil, y) → y
app(add(n, x), y) → add(n, app(x, y))
reverse(nil) → nil
reverse(add(n, x)) → app(reverse(x), add(n, nil))
shuffle(nil) → nil
shuffle(add(n, x)) → add(n, shuffle(reverse(x)))
concat(leaf, y) → y
concat(cons(u, v), y) → cons(u, concat(v, y))
less_leaves(x, leaf) → false
less_leaves(leaf, cons(w, z)) → true
less_leaves(cons(u, v), cons(w, z)) → less_leaves(concat(u, v), concat(w, z))

S is empty.
Rewrite Strategy: INNERMOST

(3) SlicingProof (LOWER BOUND(ID) transformation)

Sliced the following arguments:
add/0

(4) Obligation:

Runtime Complexity Relative TRS:
The TRS R consists of the following rules:

minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
app(nil, y) → y
app(add(x), y) → add(app(x, y))
reverse(nil) → nil
reverse(add(x)) → app(reverse(x), add(nil))
shuffle(nil) → nil
shuffle(add(x)) → add(shuffle(reverse(x)))
concat(leaf, y) → y
concat(cons(u, v), y) → cons(u, concat(v, y))
less_leaves(x, leaf) → false
less_leaves(leaf, cons(w, z)) → true
less_leaves(cons(u, v), cons(w, z)) → less_leaves(concat(u, v), concat(w, z))

S is empty.
Rewrite Strategy: INNERMOST

(5) TypeInferenceProof (BOTH BOUNDS(ID, ID) transformation)

Infered types.

(6) Obligation:

Innermost TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
app(nil, y) → y
app(add(x), y) → add(app(x, y))
reverse(nil) → nil
reverse(add(x)) → app(reverse(x), add(nil))
shuffle(nil) → nil
shuffle(add(x)) → add(shuffle(reverse(x)))
concat(leaf, y) → y
concat(cons(u, v), y) → cons(u, concat(v, y))
less_leaves(x, leaf) → false
less_leaves(leaf, cons(w, z)) → true
less_leaves(cons(u, v), cons(w, z)) → less_leaves(concat(u, v), concat(w, z))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
app :: nil:add → nil:add → nil:add
nil :: nil:add
add :: nil:add → nil:add
reverse :: nil:add → nil:add
shuffle :: nil:add → nil:add
concat :: leaf:cons → leaf:cons → leaf:cons
leaf :: leaf:cons
cons :: leaf:cons → leaf:cons → leaf:cons
less_leaves :: leaf:cons → leaf:cons → false:true
false :: false:true
true :: false:true
hole_0':s1_0 :: 0':s
hole_nil:add2_0 :: nil:add
hole_leaf:cons3_0 :: leaf:cons
hole_false:true4_0 :: false:true
gen_0':s5_0 :: Nat → 0':s
gen_nil:add6_0 :: Nat → nil:add
gen_leaf:cons7_0 :: Nat → leaf:cons

(7) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
minus, quot, app, reverse, shuffle, concat, less_leaves

They will be analysed ascendingly in the following order:
minus < quot
app < reverse
reverse < shuffle
concat < less_leaves

(8) Obligation:

Innermost TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
app(nil, y) → y
app(add(x), y) → add(app(x, y))
reverse(nil) → nil
reverse(add(x)) → app(reverse(x), add(nil))
shuffle(nil) → nil
shuffle(add(x)) → add(shuffle(reverse(x)))
concat(leaf, y) → y
concat(cons(u, v), y) → cons(u, concat(v, y))
less_leaves(x, leaf) → false
less_leaves(leaf, cons(w, z)) → true
less_leaves(cons(u, v), cons(w, z)) → less_leaves(concat(u, v), concat(w, z))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
app :: nil:add → nil:add → nil:add
nil :: nil:add
add :: nil:add → nil:add
reverse :: nil:add → nil:add
shuffle :: nil:add → nil:add
concat :: leaf:cons → leaf:cons → leaf:cons
leaf :: leaf:cons
cons :: leaf:cons → leaf:cons → leaf:cons
less_leaves :: leaf:cons → leaf:cons → false:true
false :: false:true
true :: false:true
hole_0':s1_0 :: 0':s
hole_nil:add2_0 :: nil:add
hole_leaf:cons3_0 :: leaf:cons
hole_false:true4_0 :: false:true
gen_0':s5_0 :: Nat → 0':s
gen_nil:add6_0 :: Nat → nil:add
gen_leaf:cons7_0 :: Nat → leaf:cons

Generator Equations:
gen_0':s5_0(0) ⇔ 0'
gen_0':s5_0(+(x, 1)) ⇔ s(gen_0':s5_0(x))
gen_nil:add6_0(0) ⇔ nil
gen_nil:add6_0(+(x, 1)) ⇔ add(gen_nil:add6_0(x))
gen_leaf:cons7_0(0) ⇔ leaf
gen_leaf:cons7_0(+(x, 1)) ⇔ cons(leaf, gen_leaf:cons7_0(x))

The following defined symbols remain to be analysed:
minus, quot, app, reverse, shuffle, concat, less_leaves

They will be analysed ascendingly in the following order:
minus < quot
app < reverse
reverse < shuffle
concat < less_leaves

(9) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
minus(gen_0':s5_0(n9_0), gen_0':s5_0(n9_0)) → gen_0':s5_0(0), rt ∈ Ω(1 + n9₀)

Induction Base:
minus(gen_0':s5_0(0), gen_0':s5_0(0)) →_R^Ω(1)
gen_0':s5_0(0)

Induction Step:
minus(gen_0':s5_0(+(n9_0, 1)), gen_0':s5_0(+(n9_0, 1))) →_R^Ω(1)
minus(gen_0':s5_0(n9_0), gen_0':s5_0(n9_0)) →_IH
gen_0':s5_0(0)

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(10) Complex Obligation (BEST)

(11) Obligation:

Innermost TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
app(nil, y) → y
app(add(x), y) → add(app(x, y))
reverse(nil) → nil
reverse(add(x)) → app(reverse(x), add(nil))
shuffle(nil) → nil
shuffle(add(x)) → add(shuffle(reverse(x)))
concat(leaf, y) → y
concat(cons(u, v), y) → cons(u, concat(v, y))
less_leaves(x, leaf) → false
less_leaves(leaf, cons(w, z)) → true
less_leaves(cons(u, v), cons(w, z)) → less_leaves(concat(u, v), concat(w, z))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
app :: nil:add → nil:add → nil:add
nil :: nil:add
add :: nil:add → nil:add
reverse :: nil:add → nil:add
shuffle :: nil:add → nil:add
concat :: leaf:cons → leaf:cons → leaf:cons
leaf :: leaf:cons
cons :: leaf:cons → leaf:cons → leaf:cons
less_leaves :: leaf:cons → leaf:cons → false:true
false :: false:true
true :: false:true
hole_0':s1_0 :: 0':s
hole_nil:add2_0 :: nil:add
hole_leaf:cons3_0 :: leaf:cons
hole_false:true4_0 :: false:true
gen_0':s5_0 :: Nat → 0':s
gen_nil:add6_0 :: Nat → nil:add
gen_leaf:cons7_0 :: Nat → leaf:cons

Lemmas:
minus(gen_0':s5_0(n9_0), gen_0':s5_0(n9_0)) → gen_0':s5_0(0), rt ∈ Ω(1 + n9₀)

Generator Equations:
gen_0':s5_0(0) ⇔ 0'
gen_0':s5_0(+(x, 1)) ⇔ s(gen_0':s5_0(x))
gen_nil:add6_0(0) ⇔ nil
gen_nil:add6_0(+(x, 1)) ⇔ add(gen_nil:add6_0(x))
gen_leaf:cons7_0(0) ⇔ leaf
gen_leaf:cons7_0(+(x, 1)) ⇔ cons(leaf, gen_leaf:cons7_0(x))

The following defined symbols remain to be analysed:
quot, app, reverse, shuffle, concat, less_leaves

They will be analysed ascendingly in the following order:
app < reverse
reverse < shuffle
concat < less_leaves

(12) NoRewriteLemmaProof (LOWER BOUND(ID) transformation)

Could not prove a rewrite lemma for the defined symbol quot.

(13) Obligation:

Innermost TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
app(nil, y) → y
app(add(x), y) → add(app(x, y))
reverse(nil) → nil
reverse(add(x)) → app(reverse(x), add(nil))
shuffle(nil) → nil
shuffle(add(x)) → add(shuffle(reverse(x)))
concat(leaf, y) → y
concat(cons(u, v), y) → cons(u, concat(v, y))
less_leaves(x, leaf) → false
less_leaves(leaf, cons(w, z)) → true
less_leaves(cons(u, v), cons(w, z)) → less_leaves(concat(u, v), concat(w, z))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
app :: nil:add → nil:add → nil:add
nil :: nil:add
add :: nil:add → nil:add
reverse :: nil:add → nil:add
shuffle :: nil:add → nil:add
concat :: leaf:cons → leaf:cons → leaf:cons
leaf :: leaf:cons
cons :: leaf:cons → leaf:cons → leaf:cons
less_leaves :: leaf:cons → leaf:cons → false:true
false :: false:true
true :: false:true
hole_0':s1_0 :: 0':s
hole_nil:add2_0 :: nil:add
hole_leaf:cons3_0 :: leaf:cons
hole_false:true4_0 :: false:true
gen_0':s5_0 :: Nat → 0':s
gen_nil:add6_0 :: Nat → nil:add
gen_leaf:cons7_0 :: Nat → leaf:cons

Lemmas:
minus(gen_0':s5_0(n9_0), gen_0':s5_0(n9_0)) → gen_0':s5_0(0), rt ∈ Ω(1 + n9₀)

Generator Equations:
gen_0':s5_0(0) ⇔ 0'
gen_0':s5_0(+(x, 1)) ⇔ s(gen_0':s5_0(x))
gen_nil:add6_0(0) ⇔ nil
gen_nil:add6_0(+(x, 1)) ⇔ add(gen_nil:add6_0(x))
gen_leaf:cons7_0(0) ⇔ leaf
gen_leaf:cons7_0(+(x, 1)) ⇔ cons(leaf, gen_leaf:cons7_0(x))

The following defined symbols remain to be analysed:
app, reverse, shuffle, concat, less_leaves

They will be analysed ascendingly in the following order:
app < reverse
reverse < shuffle
concat < less_leaves

(14) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
app(gen_nil:add6_0(n635_0), gen_nil:add6_0(b)) → gen_nil:add6_0(+(n635_0, b)), rt ∈ Ω(1 + n635₀)

Induction Base:
app(gen_nil:add6_0(0), gen_nil:add6_0(b)) →_R^Ω(1)
gen_nil:add6_0(b)

Induction Step:
app(gen_nil:add6_0(+(n635_0, 1)), gen_nil:add6_0(b)) →_R^Ω(1)
add(app(gen_nil:add6_0(n635_0), gen_nil:add6_0(b))) →_IH
add(gen_nil:add6_0(+(b, c636_0)))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(15) Complex Obligation (BEST)

(16) Obligation:

Innermost TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
app(nil, y) → y
app(add(x), y) → add(app(x, y))
reverse(nil) → nil
reverse(add(x)) → app(reverse(x), add(nil))
shuffle(nil) → nil
shuffle(add(x)) → add(shuffle(reverse(x)))
concat(leaf, y) → y
concat(cons(u, v), y) → cons(u, concat(v, y))
less_leaves(x, leaf) → false
less_leaves(leaf, cons(w, z)) → true
less_leaves(cons(u, v), cons(w, z)) → less_leaves(concat(u, v), concat(w, z))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
app :: nil:add → nil:add → nil:add
nil :: nil:add
add :: nil:add → nil:add
reverse :: nil:add → nil:add
shuffle :: nil:add → nil:add
concat :: leaf:cons → leaf:cons → leaf:cons
leaf :: leaf:cons
cons :: leaf:cons → leaf:cons → leaf:cons
less_leaves :: leaf:cons → leaf:cons → false:true
false :: false:true
true :: false:true
hole_0':s1_0 :: 0':s
hole_nil:add2_0 :: nil:add
hole_leaf:cons3_0 :: leaf:cons
hole_false:true4_0 :: false:true
gen_0':s5_0 :: Nat → 0':s
gen_nil:add6_0 :: Nat → nil:add
gen_leaf:cons7_0 :: Nat → leaf:cons

Lemmas:
minus(gen_0':s5_0(n9_0), gen_0':s5_0(n9_0)) → gen_0':s5_0(0), rt ∈ Ω(1 + n9₀)
app(gen_nil:add6_0(n635_0), gen_nil:add6_0(b)) → gen_nil:add6_0(+(n635_0, b)), rt ∈ Ω(1 + n635₀)

Generator Equations:
gen_0':s5_0(0) ⇔ 0'
gen_0':s5_0(+(x, 1)) ⇔ s(gen_0':s5_0(x))
gen_nil:add6_0(0) ⇔ nil
gen_nil:add6_0(+(x, 1)) ⇔ add(gen_nil:add6_0(x))
gen_leaf:cons7_0(0) ⇔ leaf
gen_leaf:cons7_0(+(x, 1)) ⇔ cons(leaf, gen_leaf:cons7_0(x))

The following defined symbols remain to be analysed:
reverse, shuffle, concat, less_leaves

They will be analysed ascendingly in the following order:
reverse < shuffle
concat < less_leaves

(17) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
reverse(gen_nil:add6_0(n1614_0)) → gen_nil:add6_0(n1614_0), rt ∈ Ω(1 + n1614₀ + n1614₀²)

Induction Base:
reverse(gen_nil:add6_0(0)) →_R^Ω(1)
nil

Induction Step:
reverse(gen_nil:add6_0(+(n1614_0, 1))) →_R^Ω(1)
app(reverse(gen_nil:add6_0(n1614_0)), add(nil)) →_IH
app(gen_nil:add6_0(c1615_0), add(nil)) →_L^{Ω(1 + n1614₀)}
gen_nil:add6_0(+(n1614_0, +(0, 1)))

We have rt ∈ Ω(n²) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n²).

(18) Complex Obligation (BEST)

(19) Obligation:

Innermost TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
app(nil, y) → y
app(add(x), y) → add(app(x, y))
reverse(nil) → nil
reverse(add(x)) → app(reverse(x), add(nil))
shuffle(nil) → nil
shuffle(add(x)) → add(shuffle(reverse(x)))
concat(leaf, y) → y
concat(cons(u, v), y) → cons(u, concat(v, y))
less_leaves(x, leaf) → false
less_leaves(leaf, cons(w, z)) → true
less_leaves(cons(u, v), cons(w, z)) → less_leaves(concat(u, v), concat(w, z))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
app :: nil:add → nil:add → nil:add
nil :: nil:add
add :: nil:add → nil:add
reverse :: nil:add → nil:add
shuffle :: nil:add → nil:add
concat :: leaf:cons → leaf:cons → leaf:cons
leaf :: leaf:cons
cons :: leaf:cons → leaf:cons → leaf:cons
less_leaves :: leaf:cons → leaf:cons → false:true
false :: false:true
true :: false:true
hole_0':s1_0 :: 0':s
hole_nil:add2_0 :: nil:add
hole_leaf:cons3_0 :: leaf:cons
hole_false:true4_0 :: false:true
gen_0':s5_0 :: Nat → 0':s
gen_nil:add6_0 :: Nat → nil:add
gen_leaf:cons7_0 :: Nat → leaf:cons

Lemmas:
minus(gen_0':s5_0(n9_0), gen_0':s5_0(n9_0)) → gen_0':s5_0(0), rt ∈ Ω(1 + n9₀)
app(gen_nil:add6_0(n635_0), gen_nil:add6_0(b)) → gen_nil:add6_0(+(n635_0, b)), rt ∈ Ω(1 + n635₀)
reverse(gen_nil:add6_0(n1614_0)) → gen_nil:add6_0(n1614_0), rt ∈ Ω(1 + n1614₀ + n1614₀²)

Generator Equations:
gen_0':s5_0(0) ⇔ 0'
gen_0':s5_0(+(x, 1)) ⇔ s(gen_0':s5_0(x))
gen_nil:add6_0(0) ⇔ nil
gen_nil:add6_0(+(x, 1)) ⇔ add(gen_nil:add6_0(x))
gen_leaf:cons7_0(0) ⇔ leaf
gen_leaf:cons7_0(+(x, 1)) ⇔ cons(leaf, gen_leaf:cons7_0(x))

The following defined symbols remain to be analysed:
shuffle, concat, less_leaves

They will be analysed ascendingly in the following order:
concat < less_leaves

(20) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
shuffle(gen_nil:add6_0(n1926_0)) → gen_nil:add6_0(n1926_0), rt ∈ Ω(1 + n1926₀ + n1926₀² + n1926₀³)

Induction Base:
shuffle(gen_nil:add6_0(0)) →_R^Ω(1)
nil

Induction Step:
shuffle(gen_nil:add6_0(+(n1926_0, 1))) →_R^Ω(1)
add(shuffle(reverse(gen_nil:add6_0(n1926_0)))) →_L^{Ω(1 + n1926₀ + n1926₀2)}
add(shuffle(gen_nil:add6_0(n1926_0))) →_IH
add(gen_nil:add6_0(c1927_0))

We have rt ∈ Ω(n³) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n³).

(21) Complex Obligation (BEST)

(22) Obligation:

Innermost TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
app(nil, y) → y
app(add(x), y) → add(app(x, y))
reverse(nil) → nil
reverse(add(x)) → app(reverse(x), add(nil))
shuffle(nil) → nil
shuffle(add(x)) → add(shuffle(reverse(x)))
concat(leaf, y) → y
concat(cons(u, v), y) → cons(u, concat(v, y))
less_leaves(x, leaf) → false
less_leaves(leaf, cons(w, z)) → true
less_leaves(cons(u, v), cons(w, z)) → less_leaves(concat(u, v), concat(w, z))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
app :: nil:add → nil:add → nil:add
nil :: nil:add
add :: nil:add → nil:add
reverse :: nil:add → nil:add
shuffle :: nil:add → nil:add
concat :: leaf:cons → leaf:cons → leaf:cons
leaf :: leaf:cons
cons :: leaf:cons → leaf:cons → leaf:cons
less_leaves :: leaf:cons → leaf:cons → false:true
false :: false:true
true :: false:true
hole_0':s1_0 :: 0':s
hole_nil:add2_0 :: nil:add
hole_leaf:cons3_0 :: leaf:cons
hole_false:true4_0 :: false:true
gen_0':s5_0 :: Nat → 0':s
gen_nil:add6_0 :: Nat → nil:add
gen_leaf:cons7_0 :: Nat → leaf:cons

Lemmas:
minus(gen_0':s5_0(n9_0), gen_0':s5_0(n9_0)) → gen_0':s5_0(0), rt ∈ Ω(1 + n9₀)
app(gen_nil:add6_0(n635_0), gen_nil:add6_0(b)) → gen_nil:add6_0(+(n635_0, b)), rt ∈ Ω(1 + n635₀)
reverse(gen_nil:add6_0(n1614_0)) → gen_nil:add6_0(n1614_0), rt ∈ Ω(1 + n1614₀ + n1614₀²)
shuffle(gen_nil:add6_0(n1926_0)) → gen_nil:add6_0(n1926_0), rt ∈ Ω(1 + n1926₀ + n1926₀² + n1926₀³)

Generator Equations:
gen_0':s5_0(0) ⇔ 0'
gen_0':s5_0(+(x, 1)) ⇔ s(gen_0':s5_0(x))
gen_nil:add6_0(0) ⇔ nil
gen_nil:add6_0(+(x, 1)) ⇔ add(gen_nil:add6_0(x))
gen_leaf:cons7_0(0) ⇔ leaf
gen_leaf:cons7_0(+(x, 1)) ⇔ cons(leaf, gen_leaf:cons7_0(x))

The following defined symbols remain to be analysed:
concat, less_leaves

They will be analysed ascendingly in the following order:
concat < less_leaves

(23) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
concat(gen_leaf:cons7_0(n2157_0), gen_leaf:cons7_0(b)) → gen_leaf:cons7_0(+(n2157_0, b)), rt ∈ Ω(1 + n2157₀)

Induction Base:
concat(gen_leaf:cons7_0(0), gen_leaf:cons7_0(b)) →_R^Ω(1)
gen_leaf:cons7_0(b)

Induction Step:
concat(gen_leaf:cons7_0(+(n2157_0, 1)), gen_leaf:cons7_0(b)) →_R^Ω(1)
cons(leaf, concat(gen_leaf:cons7_0(n2157_0), gen_leaf:cons7_0(b))) →_IH
cons(leaf, gen_leaf:cons7_0(+(b, c2158_0)))

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(24) Complex Obligation (BEST)

(25) Obligation:

Innermost TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
app(nil, y) → y
app(add(x), y) → add(app(x, y))
reverse(nil) → nil
reverse(add(x)) → app(reverse(x), add(nil))
shuffle(nil) → nil
shuffle(add(x)) → add(shuffle(reverse(x)))
concat(leaf, y) → y
concat(cons(u, v), y) → cons(u, concat(v, y))
less_leaves(x, leaf) → false
less_leaves(leaf, cons(w, z)) → true
less_leaves(cons(u, v), cons(w, z)) → less_leaves(concat(u, v), concat(w, z))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
app :: nil:add → nil:add → nil:add
nil :: nil:add
add :: nil:add → nil:add
reverse :: nil:add → nil:add
shuffle :: nil:add → nil:add
concat :: leaf:cons → leaf:cons → leaf:cons
leaf :: leaf:cons
cons :: leaf:cons → leaf:cons → leaf:cons
less_leaves :: leaf:cons → leaf:cons → false:true
false :: false:true
true :: false:true
hole_0':s1_0 :: 0':s
hole_nil:add2_0 :: nil:add
hole_leaf:cons3_0 :: leaf:cons
hole_false:true4_0 :: false:true
gen_0':s5_0 :: Nat → 0':s
gen_nil:add6_0 :: Nat → nil:add
gen_leaf:cons7_0 :: Nat → leaf:cons

Lemmas:
minus(gen_0':s5_0(n9_0), gen_0':s5_0(n9_0)) → gen_0':s5_0(0), rt ∈ Ω(1 + n9₀)
app(gen_nil:add6_0(n635_0), gen_nil:add6_0(b)) → gen_nil:add6_0(+(n635_0, b)), rt ∈ Ω(1 + n635₀)
reverse(gen_nil:add6_0(n1614_0)) → gen_nil:add6_0(n1614_0), rt ∈ Ω(1 + n1614₀ + n1614₀²)
shuffle(gen_nil:add6_0(n1926_0)) → gen_nil:add6_0(n1926_0), rt ∈ Ω(1 + n1926₀ + n1926₀² + n1926₀³)
concat(gen_leaf:cons7_0(n2157_0), gen_leaf:cons7_0(b)) → gen_leaf:cons7_0(+(n2157_0, b)), rt ∈ Ω(1 + n2157₀)

Generator Equations:
gen_0':s5_0(0) ⇔ 0'
gen_0':s5_0(+(x, 1)) ⇔ s(gen_0':s5_0(x))
gen_nil:add6_0(0) ⇔ nil
gen_nil:add6_0(+(x, 1)) ⇔ add(gen_nil:add6_0(x))
gen_leaf:cons7_0(0) ⇔ leaf
gen_leaf:cons7_0(+(x, 1)) ⇔ cons(leaf, gen_leaf:cons7_0(x))

The following defined symbols remain to be analysed:
less_leaves

(26) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
less_leaves(gen_leaf:cons7_0(n3268_0), gen_leaf:cons7_0(n3268_0)) → false, rt ∈ Ω(1 + n3268₀)

Induction Base:
less_leaves(gen_leaf:cons7_0(0), gen_leaf:cons7_0(0)) →_R^Ω(1)
false

Induction Step:
less_leaves(gen_leaf:cons7_0(+(n3268_0, 1)), gen_leaf:cons7_0(+(n3268_0, 1))) →_R^Ω(1)
less_leaves(concat(leaf, gen_leaf:cons7_0(n3268_0)), concat(leaf, gen_leaf:cons7_0(n3268_0))) →_L^Ω(1)
less_leaves(gen_leaf:cons7_0(+(0, n3268_0)), concat(leaf, gen_leaf:cons7_0(n3268_0))) →_L^Ω(1)
less_leaves(gen_leaf:cons7_0(n3268_0), gen_leaf:cons7_0(+(0, n3268_0))) →_IH
false

We have rt ∈ Ω(n¹) and sz ∈ O(n). Thus, we have irc_R ∈ Ω(n).

(27) Complex Obligation (BEST)

(28) Obligation:

Innermost TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
app(nil, y) → y
app(add(x), y) → add(app(x, y))
reverse(nil) → nil
reverse(add(x)) → app(reverse(x), add(nil))
shuffle(nil) → nil
shuffle(add(x)) → add(shuffle(reverse(x)))
concat(leaf, y) → y
concat(cons(u, v), y) → cons(u, concat(v, y))
less_leaves(x, leaf) → false
less_leaves(leaf, cons(w, z)) → true
less_leaves(cons(u, v), cons(w, z)) → less_leaves(concat(u, v), concat(w, z))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
app :: nil:add → nil:add → nil:add
nil :: nil:add
add :: nil:add → nil:add
reverse :: nil:add → nil:add
shuffle :: nil:add → nil:add
concat :: leaf:cons → leaf:cons → leaf:cons
leaf :: leaf:cons
cons :: leaf:cons → leaf:cons → leaf:cons
less_leaves :: leaf:cons → leaf:cons → false:true
false :: false:true
true :: false:true
hole_0':s1_0 :: 0':s
hole_nil:add2_0 :: nil:add
hole_leaf:cons3_0 :: leaf:cons
hole_false:true4_0 :: false:true
gen_0':s5_0 :: Nat → 0':s
gen_nil:add6_0 :: Nat → nil:add
gen_leaf:cons7_0 :: Nat → leaf:cons

Lemmas:
minus(gen_0':s5_0(n9_0), gen_0':s5_0(n9_0)) → gen_0':s5_0(0), rt ∈ Ω(1 + n9₀)
app(gen_nil:add6_0(n635_0), gen_nil:add6_0(b)) → gen_nil:add6_0(+(n635_0, b)), rt ∈ Ω(1 + n635₀)
reverse(gen_nil:add6_0(n1614_0)) → gen_nil:add6_0(n1614_0), rt ∈ Ω(1 + n1614₀ + n1614₀²)
shuffle(gen_nil:add6_0(n1926_0)) → gen_nil:add6_0(n1926_0), rt ∈ Ω(1 + n1926₀ + n1926₀² + n1926₀³)
concat(gen_leaf:cons7_0(n2157_0), gen_leaf:cons7_0(b)) → gen_leaf:cons7_0(+(n2157_0, b)), rt ∈ Ω(1 + n2157₀)
less_leaves(gen_leaf:cons7_0(n3268_0), gen_leaf:cons7_0(n3268_0)) → false, rt ∈ Ω(1 + n3268₀)

Generator Equations:
gen_0':s5_0(0) ⇔ 0'
gen_0':s5_0(+(x, 1)) ⇔ s(gen_0':s5_0(x))
gen_nil:add6_0(0) ⇔ nil
gen_nil:add6_0(+(x, 1)) ⇔ add(gen_nil:add6_0(x))
gen_leaf:cons7_0(0) ⇔ leaf
gen_leaf:cons7_0(+(x, 1)) ⇔ cons(leaf, gen_leaf:cons7_0(x))

No more defined symbols left to analyse.

(29) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n³) was proven with the following lemma:
shuffle(gen_nil:add6_0(n1926_0)) → gen_nil:add6_0(n1926_0), rt ∈ Ω(1 + n1926₀ + n1926₀² + n1926₀³)

(30) BOUNDS(n^3, INF)

(31) Obligation:

Innermost TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
app(nil, y) → y
app(add(x), y) → add(app(x, y))
reverse(nil) → nil
reverse(add(x)) → app(reverse(x), add(nil))
shuffle(nil) → nil
shuffle(add(x)) → add(shuffle(reverse(x)))
concat(leaf, y) → y
concat(cons(u, v), y) → cons(u, concat(v, y))
less_leaves(x, leaf) → false
less_leaves(leaf, cons(w, z)) → true
less_leaves(cons(u, v), cons(w, z)) → less_leaves(concat(u, v), concat(w, z))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
app :: nil:add → nil:add → nil:add
nil :: nil:add
add :: nil:add → nil:add
reverse :: nil:add → nil:add
shuffle :: nil:add → nil:add
concat :: leaf:cons → leaf:cons → leaf:cons
leaf :: leaf:cons
cons :: leaf:cons → leaf:cons → leaf:cons
less_leaves :: leaf:cons → leaf:cons → false:true
false :: false:true
true :: false:true
hole_0':s1_0 :: 0':s
hole_nil:add2_0 :: nil:add
hole_leaf:cons3_0 :: leaf:cons
hole_false:true4_0 :: false:true
gen_0':s5_0 :: Nat → 0':s
gen_nil:add6_0 :: Nat → nil:add
gen_leaf:cons7_0 :: Nat → leaf:cons

Lemmas:
minus(gen_0':s5_0(n9_0), gen_0':s5_0(n9_0)) → gen_0':s5_0(0), rt ∈ Ω(1 + n9₀)
app(gen_nil:add6_0(n635_0), gen_nil:add6_0(b)) → gen_nil:add6_0(+(n635_0, b)), rt ∈ Ω(1 + n635₀)
reverse(gen_nil:add6_0(n1614_0)) → gen_nil:add6_0(n1614_0), rt ∈ Ω(1 + n1614₀ + n1614₀²)
shuffle(gen_nil:add6_0(n1926_0)) → gen_nil:add6_0(n1926_0), rt ∈ Ω(1 + n1926₀ + n1926₀² + n1926₀³)
concat(gen_leaf:cons7_0(n2157_0), gen_leaf:cons7_0(b)) → gen_leaf:cons7_0(+(n2157_0, b)), rt ∈ Ω(1 + n2157₀)
less_leaves(gen_leaf:cons7_0(n3268_0), gen_leaf:cons7_0(n3268_0)) → false, rt ∈ Ω(1 + n3268₀)

Generator Equations:
gen_0':s5_0(0) ⇔ 0'
gen_0':s5_0(+(x, 1)) ⇔ s(gen_0':s5_0(x))
gen_nil:add6_0(0) ⇔ nil
gen_nil:add6_0(+(x, 1)) ⇔ add(gen_nil:add6_0(x))
gen_leaf:cons7_0(0) ⇔ leaf
gen_leaf:cons7_0(+(x, 1)) ⇔ cons(leaf, gen_leaf:cons7_0(x))

No more defined symbols left to analyse.

(32) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n³) was proven with the following lemma:
shuffle(gen_nil:add6_0(n1926_0)) → gen_nil:add6_0(n1926_0), rt ∈ Ω(1 + n1926₀ + n1926₀² + n1926₀³)

(33) BOUNDS(n^3, INF)

(34) Obligation:

Innermost TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
app(nil, y) → y
app(add(x), y) → add(app(x, y))
reverse(nil) → nil
reverse(add(x)) → app(reverse(x), add(nil))
shuffle(nil) → nil
shuffle(add(x)) → add(shuffle(reverse(x)))
concat(leaf, y) → y
concat(cons(u, v), y) → cons(u, concat(v, y))
less_leaves(x, leaf) → false
less_leaves(leaf, cons(w, z)) → true
less_leaves(cons(u, v), cons(w, z)) → less_leaves(concat(u, v), concat(w, z))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
app :: nil:add → nil:add → nil:add
nil :: nil:add
add :: nil:add → nil:add
reverse :: nil:add → nil:add
shuffle :: nil:add → nil:add
concat :: leaf:cons → leaf:cons → leaf:cons
leaf :: leaf:cons
cons :: leaf:cons → leaf:cons → leaf:cons
less_leaves :: leaf:cons → leaf:cons → false:true
false :: false:true
true :: false:true
hole_0':s1_0 :: 0':s
hole_nil:add2_0 :: nil:add
hole_leaf:cons3_0 :: leaf:cons
hole_false:true4_0 :: false:true
gen_0':s5_0 :: Nat → 0':s
gen_nil:add6_0 :: Nat → nil:add
gen_leaf:cons7_0 :: Nat → leaf:cons

Lemmas:
minus(gen_0':s5_0(n9_0), gen_0':s5_0(n9_0)) → gen_0':s5_0(0), rt ∈ Ω(1 + n9₀)
app(gen_nil:add6_0(n635_0), gen_nil:add6_0(b)) → gen_nil:add6_0(+(n635_0, b)), rt ∈ Ω(1 + n635₀)
reverse(gen_nil:add6_0(n1614_0)) → gen_nil:add6_0(n1614_0), rt ∈ Ω(1 + n1614₀ + n1614₀²)
shuffle(gen_nil:add6_0(n1926_0)) → gen_nil:add6_0(n1926_0), rt ∈ Ω(1 + n1926₀ + n1926₀² + n1926₀³)
concat(gen_leaf:cons7_0(n2157_0), gen_leaf:cons7_0(b)) → gen_leaf:cons7_0(+(n2157_0, b)), rt ∈ Ω(1 + n2157₀)

Generator Equations:
gen_0':s5_0(0) ⇔ 0'
gen_0':s5_0(+(x, 1)) ⇔ s(gen_0':s5_0(x))
gen_nil:add6_0(0) ⇔ nil
gen_nil:add6_0(+(x, 1)) ⇔ add(gen_nil:add6_0(x))
gen_leaf:cons7_0(0) ⇔ leaf
gen_leaf:cons7_0(+(x, 1)) ⇔ cons(leaf, gen_leaf:cons7_0(x))

No more defined symbols left to analyse.

(35) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n³) was proven with the following lemma:
shuffle(gen_nil:add6_0(n1926_0)) → gen_nil:add6_0(n1926_0), rt ∈ Ω(1 + n1926₀ + n1926₀² + n1926₀³)

(36) BOUNDS(n^3, INF)

(37) Obligation:

Innermost TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
app(nil, y) → y
app(add(x), y) → add(app(x, y))
reverse(nil) → nil
reverse(add(x)) → app(reverse(x), add(nil))
shuffle(nil) → nil
shuffle(add(x)) → add(shuffle(reverse(x)))
concat(leaf, y) → y
concat(cons(u, v), y) → cons(u, concat(v, y))
less_leaves(x, leaf) → false
less_leaves(leaf, cons(w, z)) → true
less_leaves(cons(u, v), cons(w, z)) → less_leaves(concat(u, v), concat(w, z))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
app :: nil:add → nil:add → nil:add
nil :: nil:add
add :: nil:add → nil:add
reverse :: nil:add → nil:add
shuffle :: nil:add → nil:add
concat :: leaf:cons → leaf:cons → leaf:cons
leaf :: leaf:cons
cons :: leaf:cons → leaf:cons → leaf:cons
less_leaves :: leaf:cons → leaf:cons → false:true
false :: false:true
true :: false:true
hole_0':s1_0 :: 0':s
hole_nil:add2_0 :: nil:add
hole_leaf:cons3_0 :: leaf:cons
hole_false:true4_0 :: false:true
gen_0':s5_0 :: Nat → 0':s
gen_nil:add6_0 :: Nat → nil:add
gen_leaf:cons7_0 :: Nat → leaf:cons

Lemmas:
minus(gen_0':s5_0(n9_0), gen_0':s5_0(n9_0)) → gen_0':s5_0(0), rt ∈ Ω(1 + n9₀)
app(gen_nil:add6_0(n635_0), gen_nil:add6_0(b)) → gen_nil:add6_0(+(n635_0, b)), rt ∈ Ω(1 + n635₀)
reverse(gen_nil:add6_0(n1614_0)) → gen_nil:add6_0(n1614_0), rt ∈ Ω(1 + n1614₀ + n1614₀²)
shuffle(gen_nil:add6_0(n1926_0)) → gen_nil:add6_0(n1926_0), rt ∈ Ω(1 + n1926₀ + n1926₀² + n1926₀³)

Generator Equations:
gen_0':s5_0(0) ⇔ 0'
gen_0':s5_0(+(x, 1)) ⇔ s(gen_0':s5_0(x))
gen_nil:add6_0(0) ⇔ nil
gen_nil:add6_0(+(x, 1)) ⇔ add(gen_nil:add6_0(x))
gen_leaf:cons7_0(0) ⇔ leaf
gen_leaf:cons7_0(+(x, 1)) ⇔ cons(leaf, gen_leaf:cons7_0(x))

No more defined symbols left to analyse.

(38) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n³) was proven with the following lemma:
shuffle(gen_nil:add6_0(n1926_0)) → gen_nil:add6_0(n1926_0), rt ∈ Ω(1 + n1926₀ + n1926₀² + n1926₀³)

(39) BOUNDS(n^3, INF)

(40) Obligation:

Innermost TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
app(nil, y) → y
app(add(x), y) → add(app(x, y))
reverse(nil) → nil
reverse(add(x)) → app(reverse(x), add(nil))
shuffle(nil) → nil
shuffle(add(x)) → add(shuffle(reverse(x)))
concat(leaf, y) → y
concat(cons(u, v), y) → cons(u, concat(v, y))
less_leaves(x, leaf) → false
less_leaves(leaf, cons(w, z)) → true
less_leaves(cons(u, v), cons(w, z)) → less_leaves(concat(u, v), concat(w, z))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
app :: nil:add → nil:add → nil:add
nil :: nil:add
add :: nil:add → nil:add
reverse :: nil:add → nil:add
shuffle :: nil:add → nil:add
concat :: leaf:cons → leaf:cons → leaf:cons
leaf :: leaf:cons
cons :: leaf:cons → leaf:cons → leaf:cons
less_leaves :: leaf:cons → leaf:cons → false:true
false :: false:true
true :: false:true
hole_0':s1_0 :: 0':s
hole_nil:add2_0 :: nil:add
hole_leaf:cons3_0 :: leaf:cons
hole_false:true4_0 :: false:true
gen_0':s5_0 :: Nat → 0':s
gen_nil:add6_0 :: Nat → nil:add
gen_leaf:cons7_0 :: Nat → leaf:cons

Lemmas:
minus(gen_0':s5_0(n9_0), gen_0':s5_0(n9_0)) → gen_0':s5_0(0), rt ∈ Ω(1 + n9₀)
app(gen_nil:add6_0(n635_0), gen_nil:add6_0(b)) → gen_nil:add6_0(+(n635_0, b)), rt ∈ Ω(1 + n635₀)
reverse(gen_nil:add6_0(n1614_0)) → gen_nil:add6_0(n1614_0), rt ∈ Ω(1 + n1614₀ + n1614₀²)

Generator Equations:
gen_0':s5_0(0) ⇔ 0'
gen_0':s5_0(+(x, 1)) ⇔ s(gen_0':s5_0(x))
gen_nil:add6_0(0) ⇔ nil
gen_nil:add6_0(+(x, 1)) ⇔ add(gen_nil:add6_0(x))
gen_leaf:cons7_0(0) ⇔ leaf
gen_leaf:cons7_0(+(x, 1)) ⇔ cons(leaf, gen_leaf:cons7_0(x))

No more defined symbols left to analyse.

(41) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n²) was proven with the following lemma:
reverse(gen_nil:add6_0(n1614_0)) → gen_nil:add6_0(n1614_0), rt ∈ Ω(1 + n1614₀ + n1614₀²)

(42) BOUNDS(n^2, INF)

(43) Obligation:

Innermost TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
app(nil, y) → y
app(add(x), y) → add(app(x, y))
reverse(nil) → nil
reverse(add(x)) → app(reverse(x), add(nil))
shuffle(nil) → nil
shuffle(add(x)) → add(shuffle(reverse(x)))
concat(leaf, y) → y
concat(cons(u, v), y) → cons(u, concat(v, y))
less_leaves(x, leaf) → false
less_leaves(leaf, cons(w, z)) → true
less_leaves(cons(u, v), cons(w, z)) → less_leaves(concat(u, v), concat(w, z))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
app :: nil:add → nil:add → nil:add
nil :: nil:add
add :: nil:add → nil:add
reverse :: nil:add → nil:add
shuffle :: nil:add → nil:add
concat :: leaf:cons → leaf:cons → leaf:cons
leaf :: leaf:cons
cons :: leaf:cons → leaf:cons → leaf:cons
less_leaves :: leaf:cons → leaf:cons → false:true
false :: false:true
true :: false:true
hole_0':s1_0 :: 0':s
hole_nil:add2_0 :: nil:add
hole_leaf:cons3_0 :: leaf:cons
hole_false:true4_0 :: false:true
gen_0':s5_0 :: Nat → 0':s
gen_nil:add6_0 :: Nat → nil:add
gen_leaf:cons7_0 :: Nat → leaf:cons

Lemmas:
minus(gen_0':s5_0(n9_0), gen_0':s5_0(n9_0)) → gen_0':s5_0(0), rt ∈ Ω(1 + n9₀)
app(gen_nil:add6_0(n635_0), gen_nil:add6_0(b)) → gen_nil:add6_0(+(n635_0, b)), rt ∈ Ω(1 + n635₀)

Generator Equations:
gen_0':s5_0(0) ⇔ 0'
gen_0':s5_0(+(x, 1)) ⇔ s(gen_0':s5_0(x))
gen_nil:add6_0(0) ⇔ nil
gen_nil:add6_0(+(x, 1)) ⇔ add(gen_nil:add6_0(x))
gen_leaf:cons7_0(0) ⇔ leaf
gen_leaf:cons7_0(+(x, 1)) ⇔ cons(leaf, gen_leaf:cons7_0(x))

No more defined symbols left to analyse.

(44) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
minus(gen_0':s5_0(n9_0), gen_0':s5_0(n9_0)) → gen_0':s5_0(0), rt ∈ Ω(1 + n9₀)

(45) BOUNDS(n^1, INF)

(46) Obligation:

Innermost TRS:
Rules:
minus(x, 0') → x
minus(s(x), s(y)) → minus(x, y)
quot(0', s(y)) → 0'
quot(s(x), s(y)) → s(quot(minus(x, y), s(y)))
app(nil, y) → y
app(add(x), y) → add(app(x, y))
reverse(nil) → nil
reverse(add(x)) → app(reverse(x), add(nil))
shuffle(nil) → nil
shuffle(add(x)) → add(shuffle(reverse(x)))
concat(leaf, y) → y
concat(cons(u, v), y) → cons(u, concat(v, y))
less_leaves(x, leaf) → false
less_leaves(leaf, cons(w, z)) → true
less_leaves(cons(u, v), cons(w, z)) → less_leaves(concat(u, v), concat(w, z))

Types:
minus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
quot :: 0':s → 0':s → 0':s
app :: nil:add → nil:add → nil:add
nil :: nil:add
add :: nil:add → nil:add
reverse :: nil:add → nil:add
shuffle :: nil:add → nil:add
concat :: leaf:cons → leaf:cons → leaf:cons
leaf :: leaf:cons
cons :: leaf:cons → leaf:cons → leaf:cons
less_leaves :: leaf:cons → leaf:cons → false:true
false :: false:true
true :: false:true
hole_0':s1_0 :: 0':s
hole_nil:add2_0 :: nil:add
hole_leaf:cons3_0 :: leaf:cons
hole_false:true4_0 :: false:true
gen_0':s5_0 :: Nat → 0':s
gen_nil:add6_0 :: Nat → nil:add
gen_leaf:cons7_0 :: Nat → leaf:cons

Lemmas:
minus(gen_0':s5_0(n9_0), gen_0':s5_0(n9_0)) → gen_0':s5_0(0), rt ∈ Ω(1 + n9₀)

Generator Equations:
gen_0':s5_0(0) ⇔ 0'
gen_0':s5_0(+(x, 1)) ⇔ s(gen_0':s5_0(x))
gen_nil:add6_0(0) ⇔ nil
gen_nil:add6_0(+(x, 1)) ⇔ add(gen_nil:add6_0(x))
gen_leaf:cons7_0(0) ⇔ leaf
gen_leaf:cons7_0(+(x, 1)) ⇔ cons(leaf, gen_leaf:cons7_0(x))

No more defined symbols left to analyse.

(47) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
minus(gen_0':s5_0(n9_0), gen_0':s5_0(n9_0)) → gen_0':s5_0(0), rt ∈ Ω(1 + n9₀)

(48) BOUNDS(n^1, INF)