min(0, y) → 0
min(x, 0) → 0
min(s(x), s(y)) → s(min(x, y))
max(0, y) → y
max(x, 0) → x
max(s(x), s(y)) → s(max(x, y))
+(0, y) → y
+(s(x), y) → s(+(x, y))
-(x, 0) → x
-(s(x), s(y)) → -(x, y)
*(x, 0) → 0
*(x, s(y)) → +(x, *(x, y))
f(s(x)) → f(-(max(*(s(x), s(x)), +(s(x), s(s(s(0))))), max(s(*(s(x), s(x))), +(s(x), s(s(s(s(0))))))))
Renamed function symbols to avoid clashes with predefined symbol.
Runtime Complexity TRS:
The TRS R consists of the following rules:
min'(0', y) → 0'
min'(x, 0') → 0'
min'(s'(x), s'(y)) → s'(min'(x, y))
max'(0', y) → y
max'(x, 0') → x
max'(s'(x), s'(y)) → s'(max'(x, y))
+'(0', y) → y
+'(s'(x), y) → s'(+'(x, y))
-'(x, 0') → x
-'(s'(x), s'(y)) → -'(x, y)
*'(x, 0') → 0'
*'(x, s'(y)) → +'(x, *'(x, y))
f'(s'(x)) → f'(-'(max'(*'(s'(x), s'(x)), +'(s'(x), s'(s'(s'(0'))))), max'(s'(*'(s'(x), s'(x))), +'(s'(x), s'(s'(s'(s'(0'))))))))
Infered types.
Rules:
min'(0', y) → 0'
min'(x, 0') → 0'
min'(s'(x), s'(y)) → s'(min'(x, y))
max'(0', y) → y
max'(x, 0') → x
max'(s'(x), s'(y)) → s'(max'(x, y))
+'(0', y) → y
+'(s'(x), y) → s'(+'(x, y))
-'(x, 0') → x
-'(s'(x), s'(y)) → -'(x, y)
*'(x, 0') → 0'
*'(x, s'(y)) → +'(x, *'(x, y))
f'(s'(x)) → f'(-'(max'(*'(s'(x), s'(x)), +'(s'(x), s'(s'(s'(0'))))), max'(s'(*'(s'(x), s'(x))), +'(s'(x), s'(s'(s'(s'(0'))))))))
Types:
min' :: 0':s' → 0':s' → 0':s'
0' :: 0':s'
s' :: 0':s' → 0':s'
max' :: 0':s' → 0':s' → 0':s'
+' :: 0':s' → 0':s' → 0':s'
-' :: 0':s' → 0':s' → 0':s'
*' :: 0':s' → 0':s' → 0':s'
f' :: 0':s' → f'
_hole_0':s'1 :: 0':s'
_hole_f'2 :: f'
_gen_0':s'3 :: Nat → 0':s'
Heuristically decided to analyse the following defined symbols:
min', max', +', -', *', f'
They will be analysed ascendingly in the following order:
max' < f'
+' < *'
+' < f'
-' < f'
*' < f'
Rules:
min'(0', y) → 0'
min'(x, 0') → 0'
min'(s'(x), s'(y)) → s'(min'(x, y))
max'(0', y) → y
max'(x, 0') → x
max'(s'(x), s'(y)) → s'(max'(x, y))
+'(0', y) → y
+'(s'(x), y) → s'(+'(x, y))
-'(x, 0') → x
-'(s'(x), s'(y)) → -'(x, y)
*'(x, 0') → 0'
*'(x, s'(y)) → +'(x, *'(x, y))
f'(s'(x)) → f'(-'(max'(*'(s'(x), s'(x)), +'(s'(x), s'(s'(s'(0'))))), max'(s'(*'(s'(x), s'(x))), +'(s'(x), s'(s'(s'(s'(0'))))))))
Types:
min' :: 0':s' → 0':s' → 0':s'
0' :: 0':s'
s' :: 0':s' → 0':s'
max' :: 0':s' → 0':s' → 0':s'
+' :: 0':s' → 0':s' → 0':s'
-' :: 0':s' → 0':s' → 0':s'
*' :: 0':s' → 0':s' → 0':s'
f' :: 0':s' → f'
_hole_0':s'1 :: 0':s'
_hole_f'2 :: f'
_gen_0':s'3 :: Nat → 0':s'
Generator Equations:
_gen_0':s'3(0) ⇔ 0'
_gen_0':s'3(+(x, 1)) ⇔ s'(_gen_0':s'3(x))
The following defined symbols remain to be analysed:
min', max', +', -', *', f'
They will be analysed ascendingly in the following order:
max' < f'
+' < *'
+' < f'
-' < f'
*' < f'
Proved the following rewrite lemma:
min'(_gen_0':s'3(_n5), _gen_0':s'3(_n5)) → _gen_0':s'3(_n5), rt ∈ Ω(1 + n5)
Induction Base:
min'(_gen_0':s'3(0), _gen_0':s'3(0)) →RΩ(1)
0'
Induction Step:
min'(_gen_0':s'3(+(_$n6, 1)), _gen_0':s'3(+(_$n6, 1))) →RΩ(1)
s'(min'(_gen_0':s'3(_$n6), _gen_0':s'3(_$n6))) →IH
s'(_gen_0':s'3(_$n6))
We have rt ∈ Ω(n) and sz ∈ O(n). Thus, we have ircR ∈ Ω(n).
Rules:
min'(0', y) → 0'
min'(x, 0') → 0'
min'(s'(x), s'(y)) → s'(min'(x, y))
max'(0', y) → y
max'(x, 0') → x
max'(s'(x), s'(y)) → s'(max'(x, y))
+'(0', y) → y
+'(s'(x), y) → s'(+'(x, y))
-'(x, 0') → x
-'(s'(x), s'(y)) → -'(x, y)
*'(x, 0') → 0'
*'(x, s'(y)) → +'(x, *'(x, y))
f'(s'(x)) → f'(-'(max'(*'(s'(x), s'(x)), +'(s'(x), s'(s'(s'(0'))))), max'(s'(*'(s'(x), s'(x))), +'(s'(x), s'(s'(s'(s'(0'))))))))
Types:
min' :: 0':s' → 0':s' → 0':s'
0' :: 0':s'
s' :: 0':s' → 0':s'
max' :: 0':s' → 0':s' → 0':s'
+' :: 0':s' → 0':s' → 0':s'
-' :: 0':s' → 0':s' → 0':s'
*' :: 0':s' → 0':s' → 0':s'
f' :: 0':s' → f'
_hole_0':s'1 :: 0':s'
_hole_f'2 :: f'
_gen_0':s'3 :: Nat → 0':s'
Lemmas:
min'(_gen_0':s'3(_n5), _gen_0':s'3(_n5)) → _gen_0':s'3(_n5), rt ∈ Ω(1 + n5)
Generator Equations:
_gen_0':s'3(0) ⇔ 0'
_gen_0':s'3(+(x, 1)) ⇔ s'(_gen_0':s'3(x))
The following defined symbols remain to be analysed:
max', +', -', *', f'
They will be analysed ascendingly in the following order:
max' < f'
+' < *'
+' < f'
-' < f'
*' < f'
Proved the following rewrite lemma:
max'(_gen_0':s'3(_n736), _gen_0':s'3(_n736)) → _gen_0':s'3(_n736), rt ∈ Ω(1 + n736)
Induction Base:
max'(_gen_0':s'3(0), _gen_0':s'3(0)) →RΩ(1)
_gen_0':s'3(0)
Induction Step:
max'(_gen_0':s'3(+(_$n737, 1)), _gen_0':s'3(+(_$n737, 1))) →RΩ(1)
s'(max'(_gen_0':s'3(_$n737), _gen_0':s'3(_$n737))) →IH
s'(_gen_0':s'3(_$n737))
We have rt ∈ Ω(n) and sz ∈ O(n). Thus, we have ircR ∈ Ω(n).
Rules:
min'(0', y) → 0'
min'(x, 0') → 0'
min'(s'(x), s'(y)) → s'(min'(x, y))
max'(0', y) → y
max'(x, 0') → x
max'(s'(x), s'(y)) → s'(max'(x, y))
+'(0', y) → y
+'(s'(x), y) → s'(+'(x, y))
-'(x, 0') → x
-'(s'(x), s'(y)) → -'(x, y)
*'(x, 0') → 0'
*'(x, s'(y)) → +'(x, *'(x, y))
f'(s'(x)) → f'(-'(max'(*'(s'(x), s'(x)), +'(s'(x), s'(s'(s'(0'))))), max'(s'(*'(s'(x), s'(x))), +'(s'(x), s'(s'(s'(s'(0'))))))))
Types:
min' :: 0':s' → 0':s' → 0':s'
0' :: 0':s'
s' :: 0':s' → 0':s'
max' :: 0':s' → 0':s' → 0':s'
+' :: 0':s' → 0':s' → 0':s'
-' :: 0':s' → 0':s' → 0':s'
*' :: 0':s' → 0':s' → 0':s'
f' :: 0':s' → f'
_hole_0':s'1 :: 0':s'
_hole_f'2 :: f'
_gen_0':s'3 :: Nat → 0':s'
Lemmas:
min'(_gen_0':s'3(_n5), _gen_0':s'3(_n5)) → _gen_0':s'3(_n5), rt ∈ Ω(1 + n5)
max'(_gen_0':s'3(_n736), _gen_0':s'3(_n736)) → _gen_0':s'3(_n736), rt ∈ Ω(1 + n736)
Generator Equations:
_gen_0':s'3(0) ⇔ 0'
_gen_0':s'3(+(x, 1)) ⇔ s'(_gen_0':s'3(x))
The following defined symbols remain to be analysed:
+', -', *', f'
They will be analysed ascendingly in the following order:
+' < *'
+' < f'
-' < f'
*' < f'
Proved the following rewrite lemma:
+'(_gen_0':s'3(_n1627), _gen_0':s'3(b)) → _gen_0':s'3(+(_n1627, b)), rt ∈ Ω(1 + n1627)
Induction Base:
+'(_gen_0':s'3(0), _gen_0':s'3(b)) →RΩ(1)
_gen_0':s'3(b)
Induction Step:
+'(_gen_0':s'3(+(_$n1628, 1)), _gen_0':s'3(_b1760)) →RΩ(1)
s'(+'(_gen_0':s'3(_$n1628), _gen_0':s'3(_b1760))) →IH
s'(_gen_0':s'3(+(_$n1628, _b1760)))
We have rt ∈ Ω(n) and sz ∈ O(n). Thus, we have ircR ∈ Ω(n).
Rules:
min'(0', y) → 0'
min'(x, 0') → 0'
min'(s'(x), s'(y)) → s'(min'(x, y))
max'(0', y) → y
max'(x, 0') → x
max'(s'(x), s'(y)) → s'(max'(x, y))
+'(0', y) → y
+'(s'(x), y) → s'(+'(x, y))
-'(x, 0') → x
-'(s'(x), s'(y)) → -'(x, y)
*'(x, 0') → 0'
*'(x, s'(y)) → +'(x, *'(x, y))
f'(s'(x)) → f'(-'(max'(*'(s'(x), s'(x)), +'(s'(x), s'(s'(s'(0'))))), max'(s'(*'(s'(x), s'(x))), +'(s'(x), s'(s'(s'(s'(0'))))))))
Types:
min' :: 0':s' → 0':s' → 0':s'
0' :: 0':s'
s' :: 0':s' → 0':s'
max' :: 0':s' → 0':s' → 0':s'
+' :: 0':s' → 0':s' → 0':s'
-' :: 0':s' → 0':s' → 0':s'
*' :: 0':s' → 0':s' → 0':s'
f' :: 0':s' → f'
_hole_0':s'1 :: 0':s'
_hole_f'2 :: f'
_gen_0':s'3 :: Nat → 0':s'
Lemmas:
min'(_gen_0':s'3(_n5), _gen_0':s'3(_n5)) → _gen_0':s'3(_n5), rt ∈ Ω(1 + n5)
max'(_gen_0':s'3(_n736), _gen_0':s'3(_n736)) → _gen_0':s'3(_n736), rt ∈ Ω(1 + n736)
+'(_gen_0':s'3(_n1627), _gen_0':s'3(b)) → _gen_0':s'3(+(_n1627, b)), rt ∈ Ω(1 + n1627)
Generator Equations:
_gen_0':s'3(0) ⇔ 0'
_gen_0':s'3(+(x, 1)) ⇔ s'(_gen_0':s'3(x))
The following defined symbols remain to be analysed:
-', *', f'
They will be analysed ascendingly in the following order:
-' < f'
*' < f'
Proved the following rewrite lemma:
-'(_gen_0':s'3(_n2495), _gen_0':s'3(_n2495)) → _gen_0':s'3(0), rt ∈ Ω(1 + n2495)
Induction Base:
-'(_gen_0':s'3(0), _gen_0':s'3(0)) →RΩ(1)
_gen_0':s'3(0)
Induction Step:
-'(_gen_0':s'3(+(_$n2496, 1)), _gen_0':s'3(+(_$n2496, 1))) →RΩ(1)
-'(_gen_0':s'3(_$n2496), _gen_0':s'3(_$n2496)) →IH
_gen_0':s'3(0)
We have rt ∈ Ω(n) and sz ∈ O(n). Thus, we have ircR ∈ Ω(n).
Rules:
min'(0', y) → 0'
min'(x, 0') → 0'
min'(s'(x), s'(y)) → s'(min'(x, y))
max'(0', y) → y
max'(x, 0') → x
max'(s'(x), s'(y)) → s'(max'(x, y))
+'(0', y) → y
+'(s'(x), y) → s'(+'(x, y))
-'(x, 0') → x
-'(s'(x), s'(y)) → -'(x, y)
*'(x, 0') → 0'
*'(x, s'(y)) → +'(x, *'(x, y))
f'(s'(x)) → f'(-'(max'(*'(s'(x), s'(x)), +'(s'(x), s'(s'(s'(0'))))), max'(s'(*'(s'(x), s'(x))), +'(s'(x), s'(s'(s'(s'(0'))))))))
Types:
min' :: 0':s' → 0':s' → 0':s'
0' :: 0':s'
s' :: 0':s' → 0':s'
max' :: 0':s' → 0':s' → 0':s'
+' :: 0':s' → 0':s' → 0':s'
-' :: 0':s' → 0':s' → 0':s'
*' :: 0':s' → 0':s' → 0':s'
f' :: 0':s' → f'
_hole_0':s'1 :: 0':s'
_hole_f'2 :: f'
_gen_0':s'3 :: Nat → 0':s'
Lemmas:
min'(_gen_0':s'3(_n5), _gen_0':s'3(_n5)) → _gen_0':s'3(_n5), rt ∈ Ω(1 + n5)
max'(_gen_0':s'3(_n736), _gen_0':s'3(_n736)) → _gen_0':s'3(_n736), rt ∈ Ω(1 + n736)
+'(_gen_0':s'3(_n1627), _gen_0':s'3(b)) → _gen_0':s'3(+(_n1627, b)), rt ∈ Ω(1 + n1627)
-'(_gen_0':s'3(_n2495), _gen_0':s'3(_n2495)) → _gen_0':s'3(0), rt ∈ Ω(1 + n2495)
Generator Equations:
_gen_0':s'3(0) ⇔ 0'
_gen_0':s'3(+(x, 1)) ⇔ s'(_gen_0':s'3(x))
The following defined symbols remain to be analysed:
*', f'
They will be analysed ascendingly in the following order:
*' < f'
Proved the following rewrite lemma:
*'(_gen_0':s'3(a), _gen_0':s'3(_n3336)) → _gen_0':s'3(*(_n3336, a)), rt ∈ Ω(1 + a3596·n3336 + n3336)
Induction Base:
*'(_gen_0':s'3(a), _gen_0':s'3(0)) →RΩ(1)
0'
Induction Step:
*'(_gen_0':s'3(_a3596), _gen_0':s'3(+(_$n3337, 1))) →RΩ(1)
+'(_gen_0':s'3(_a3596), *'(_gen_0':s'3(_a3596), _gen_0':s'3(_$n3337))) →IH
+'(_gen_0':s'3(_a3596), _gen_0':s'3(*(_$n3337, _a3596))) →LΩ(1 + a3596)
_gen_0':s'3(+(_a3596, *(_$n3337, _a3596)))
We have rt ∈ Ω(n2) and sz ∈ O(n). Thus, we have ircR ∈ Ω(n2).
Rules:
min'(0', y) → 0'
min'(x, 0') → 0'
min'(s'(x), s'(y)) → s'(min'(x, y))
max'(0', y) → y
max'(x, 0') → x
max'(s'(x), s'(y)) → s'(max'(x, y))
+'(0', y) → y
+'(s'(x), y) → s'(+'(x, y))
-'(x, 0') → x
-'(s'(x), s'(y)) → -'(x, y)
*'(x, 0') → 0'
*'(x, s'(y)) → +'(x, *'(x, y))
f'(s'(x)) → f'(-'(max'(*'(s'(x), s'(x)), +'(s'(x), s'(s'(s'(0'))))), max'(s'(*'(s'(x), s'(x))), +'(s'(x), s'(s'(s'(s'(0'))))))))
Types:
min' :: 0':s' → 0':s' → 0':s'
0' :: 0':s'
s' :: 0':s' → 0':s'
max' :: 0':s' → 0':s' → 0':s'
+' :: 0':s' → 0':s' → 0':s'
-' :: 0':s' → 0':s' → 0':s'
*' :: 0':s' → 0':s' → 0':s'
f' :: 0':s' → f'
_hole_0':s'1 :: 0':s'
_hole_f'2 :: f'
_gen_0':s'3 :: Nat → 0':s'
Lemmas:
min'(_gen_0':s'3(_n5), _gen_0':s'3(_n5)) → _gen_0':s'3(_n5), rt ∈ Ω(1 + n5)
max'(_gen_0':s'3(_n736), _gen_0':s'3(_n736)) → _gen_0':s'3(_n736), rt ∈ Ω(1 + n736)
+'(_gen_0':s'3(_n1627), _gen_0':s'3(b)) → _gen_0':s'3(+(_n1627, b)), rt ∈ Ω(1 + n1627)
-'(_gen_0':s'3(_n2495), _gen_0':s'3(_n2495)) → _gen_0':s'3(0), rt ∈ Ω(1 + n2495)
*'(_gen_0':s'3(a), _gen_0':s'3(_n3336)) → _gen_0':s'3(*(_n3336, a)), rt ∈ Ω(1 + a3596·n3336 + n3336)
Generator Equations:
_gen_0':s'3(0) ⇔ 0'
_gen_0':s'3(+(x, 1)) ⇔ s'(_gen_0':s'3(x))
The following defined symbols remain to be analysed:
f'
Could not prove a rewrite lemma for the defined symbol f'.
Rules:
min'(0', y) → 0'
min'(x, 0') → 0'
min'(s'(x), s'(y)) → s'(min'(x, y))
max'(0', y) → y
max'(x, 0') → x
max'(s'(x), s'(y)) → s'(max'(x, y))
+'(0', y) → y
+'(s'(x), y) → s'(+'(x, y))
-'(x, 0') → x
-'(s'(x), s'(y)) → -'(x, y)
*'(x, 0') → 0'
*'(x, s'(y)) → +'(x, *'(x, y))
f'(s'(x)) → f'(-'(max'(*'(s'(x), s'(x)), +'(s'(x), s'(s'(s'(0'))))), max'(s'(*'(s'(x), s'(x))), +'(s'(x), s'(s'(s'(s'(0'))))))))
Types:
min' :: 0':s' → 0':s' → 0':s'
0' :: 0':s'
s' :: 0':s' → 0':s'
max' :: 0':s' → 0':s' → 0':s'
+' :: 0':s' → 0':s' → 0':s'
-' :: 0':s' → 0':s' → 0':s'
*' :: 0':s' → 0':s' → 0':s'
f' :: 0':s' → f'
_hole_0':s'1 :: 0':s'
_hole_f'2 :: f'
_gen_0':s'3 :: Nat → 0':s'
Lemmas:
min'(_gen_0':s'3(_n5), _gen_0':s'3(_n5)) → _gen_0':s'3(_n5), rt ∈ Ω(1 + n5)
max'(_gen_0':s'3(_n736), _gen_0':s'3(_n736)) → _gen_0':s'3(_n736), rt ∈ Ω(1 + n736)
+'(_gen_0':s'3(_n1627), _gen_0':s'3(b)) → _gen_0':s'3(+(_n1627, b)), rt ∈ Ω(1 + n1627)
-'(_gen_0':s'3(_n2495), _gen_0':s'3(_n2495)) → _gen_0':s'3(0), rt ∈ Ω(1 + n2495)
*'(_gen_0':s'3(a), _gen_0':s'3(_n3336)) → _gen_0':s'3(*(_n3336, a)), rt ∈ Ω(1 + a3596·n3336 + n3336)
Generator Equations:
_gen_0':s'3(0) ⇔ 0'
_gen_0':s'3(+(x, 1)) ⇔ s'(_gen_0':s'3(x))
No more defined symbols left to analyse.
The lowerbound Ω(n2) was proven with the following lemma:
*'(_gen_0':s'3(a), _gen_0':s'3(_n3336)) → _gen_0':s'3(*(_n3336, a)), rt ∈ Ω(1 + a3596·n3336 + n3336)