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

(0) Obligation:

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

plus(0, x) → x
plus(s(x), y) → s(plus(p(s(x)), y))
times(0, y) → 0
times(s(x), y) → plus(y, times(p(s(x)), y))
p(s(0)) → 0
p(s(s(x))) → s(p(s(x)))
fac(0, x) → x
fac(s(x), y) → fac(p(s(x)), times(s(x), y))
factorial(x) → fac(x, s(0))

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:

plus(0', x) → x
plus(s(x), y) → s(plus(p(s(x)), y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(p(s(x)), y))
p(s(0')) → 0'
p(s(s(x))) → s(p(s(x)))
fac(0', x) → x
fac(s(x), y) → fac(p(s(x)), times(s(x), y))
factorial(x) → fac(x, s(0'))

S is empty.
Rewrite Strategy: INNERMOST

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

Infered types.

(4) Obligation:

Innermost TRS:
Rules:
plus(0', x) → x
plus(s(x), y) → s(plus(p(s(x)), y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(p(s(x)), y))
p(s(0')) → 0'
p(s(s(x))) → s(p(s(x)))
fac(0', x) → x
fac(s(x), y) → fac(p(s(x)), times(s(x), y))
factorial(x) → fac(x, s(0'))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
p :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
fac :: 0':s → 0':s → 0':s
factorial :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

(5) OrderProof (LOWER BOUND(ID) transformation)

Heuristically decided to analyse the following defined symbols:
plus, p, times, fac

They will be analysed ascendingly in the following order:
p < plus
plus < times
p < times
p < fac
times < fac

(6) Obligation:

Innermost TRS:
Rules:
plus(0', x) → x
plus(s(x), y) → s(plus(p(s(x)), y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(p(s(x)), y))
p(s(0')) → 0'
p(s(s(x))) → s(p(s(x)))
fac(0', x) → x
fac(s(x), y) → fac(p(s(x)), times(s(x), y))
factorial(x) → fac(x, s(0'))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
p :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
fac :: 0':s → 0':s → 0':s
factorial :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
p, plus, times, fac

They will be analysed ascendingly in the following order:
p < plus
plus < times
p < times
p < fac
times < fac

(7) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
p(gen_0':s2_0(+(1, n4_0))) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)

Induction Base:
p(gen_0':s2_0(+(1, 0))) →_R^Ω(1)
0'

Induction Step:
p(gen_0':s2_0(+(1, +(n4_0, 1)))) →_R^Ω(1)
s(p(s(gen_0':s2_0(n4_0)))) →_IH
s(gen_0':s2_0(c5_0))

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

(8) Complex Obligation (BEST)

(9) Obligation:

Innermost TRS:
Rules:
plus(0', x) → x
plus(s(x), y) → s(plus(p(s(x)), y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(p(s(x)), y))
p(s(0')) → 0'
p(s(s(x))) → s(p(s(x)))
fac(0', x) → x
fac(s(x), y) → fac(p(s(x)), times(s(x), y))
factorial(x) → fac(x, s(0'))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
p :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
fac :: 0':s → 0':s → 0':s
factorial :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
p(gen_0':s2_0(+(1, n4_0))) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
plus, times, fac

They will be analysed ascendingly in the following order:
plus < times
times < fac

(10) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
plus(gen_0':s2_0(n229_0), gen_0':s2_0(b)) → gen_0':s2_0(+(n229_0, b)), rt ∈ Ω(1 + n229₀ + n229₀²)

Induction Base:
plus(gen_0':s2_0(0), gen_0':s2_0(b)) →_R^Ω(1)
gen_0':s2_0(b)

Induction Step:
plus(gen_0':s2_0(+(n229_0, 1)), gen_0':s2_0(b)) →_R^Ω(1)
s(plus(p(s(gen_0':s2_0(n229_0))), gen_0':s2_0(b))) →_L^{Ω(1 + n229₀)}
s(plus(gen_0':s2_0(n229_0), gen_0':s2_0(b))) →_IH
s(gen_0':s2_0(+(b, c230_0)))

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

(11) Complex Obligation (BEST)

(12) Obligation:

Innermost TRS:
Rules:
plus(0', x) → x
plus(s(x), y) → s(plus(p(s(x)), y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(p(s(x)), y))
p(s(0')) → 0'
p(s(s(x))) → s(p(s(x)))
fac(0', x) → x
fac(s(x), y) → fac(p(s(x)), times(s(x), y))
factorial(x) → fac(x, s(0'))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
p :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
fac :: 0':s → 0':s → 0':s
factorial :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
p(gen_0':s2_0(+(1, n4_0))) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)
plus(gen_0':s2_0(n229_0), gen_0':s2_0(b)) → gen_0':s2_0(+(n229_0, b)), rt ∈ Ω(1 + n229₀ + n229₀²)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
times, fac

They will be analysed ascendingly in the following order:
times < fac

(13) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
times(gen_0':s2_0(n714_0), gen_0':s2_0(b)) → gen_0':s2_0(*(n714_0, b)), rt ∈ Ω(1 + b·n714₀ + b²·n714₀ + n714₀ + n714₀²)

Induction Base:
times(gen_0':s2_0(0), gen_0':s2_0(b)) →_R^Ω(1)
0'

Induction Step:
times(gen_0':s2_0(+(n714_0, 1)), gen_0':s2_0(b)) →_R^Ω(1)
plus(gen_0':s2_0(b), times(p(s(gen_0':s2_0(n714_0))), gen_0':s2_0(b))) →_L^{Ω(1 + n714₀)}
plus(gen_0':s2_0(b), times(gen_0':s2_0(n714_0), gen_0':s2_0(b))) →_IH
plus(gen_0':s2_0(b), gen_0':s2_0(*(c715_0, b))) →_L^{Ω(1 + b + b2)}
gen_0':s2_0(+(b, *(n714_0, b)))

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

(14) Complex Obligation (BEST)

(15) Obligation:

Innermost TRS:
Rules:
plus(0', x) → x
plus(s(x), y) → s(plus(p(s(x)), y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(p(s(x)), y))
p(s(0')) → 0'
p(s(s(x))) → s(p(s(x)))
fac(0', x) → x
fac(s(x), y) → fac(p(s(x)), times(s(x), y))
factorial(x) → fac(x, s(0'))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
p :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
fac :: 0':s → 0':s → 0':s
factorial :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
p(gen_0':s2_0(+(1, n4_0))) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)
plus(gen_0':s2_0(n229_0), gen_0':s2_0(b)) → gen_0':s2_0(+(n229_0, b)), rt ∈ Ω(1 + n229₀ + n229₀²)
times(gen_0':s2_0(n714_0), gen_0':s2_0(b)) → gen_0':s2_0(*(n714_0, b)), rt ∈ Ω(1 + b·n714₀ + b²·n714₀ + n714₀ + n714₀²)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

The following defined symbols remain to be analysed:
fac

(16) RewriteLemmaProof (LOWER BOUND(ID) transformation)

Proved the following rewrite lemma:
fac(gen_0':s2_0(n1403_0), gen_0':s2_0(b)) → *3_0, rt ∈ Ω(b·n1403₀ + b·n1403₀² + b²·n1403₀ + b²·n1403₀² + n1403₀ + n1403₀² + n1403₀³)

Induction Base:
fac(gen_0':s2_0(0), gen_0':s2_0(b))

Induction Step:
fac(gen_0':s2_0(+(n1403_0, 1)), gen_0':s2_0(b)) →_R^Ω(1)
fac(p(s(gen_0':s2_0(n1403_0))), times(s(gen_0':s2_0(n1403_0)), gen_0':s2_0(b))) →_L^{Ω(1 + n1403₀)}
fac(gen_0':s2_0(n1403_0), times(s(gen_0':s2_0(n1403_0)), gen_0':s2_0(b))) →_L^{Ω(3 + b + b·n1403₀ + b2 + b2·n1403₀ + 3·n1403₀ + n1403₀2)}
fac(gen_0':s2_0(n1403_0), gen_0':s2_0(*(+(n1403_0, 1), b))) →_IH
*3_0

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

(17) Complex Obligation (BEST)

(18) Obligation:

Innermost TRS:
Rules:
plus(0', x) → x
plus(s(x), y) → s(plus(p(s(x)), y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(p(s(x)), y))
p(s(0')) → 0'
p(s(s(x))) → s(p(s(x)))
fac(0', x) → x
fac(s(x), y) → fac(p(s(x)), times(s(x), y))
factorial(x) → fac(x, s(0'))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
p :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
fac :: 0':s → 0':s → 0':s
factorial :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
p(gen_0':s2_0(+(1, n4_0))) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)
plus(gen_0':s2_0(n229_0), gen_0':s2_0(b)) → gen_0':s2_0(+(n229_0, b)), rt ∈ Ω(1 + n229₀ + n229₀²)
times(gen_0':s2_0(n714_0), gen_0':s2_0(b)) → gen_0':s2_0(*(n714_0, b)), rt ∈ Ω(1 + b·n714₀ + b²·n714₀ + n714₀ + n714₀²)
fac(gen_0':s2_0(n1403_0), gen_0':s2_0(b)) → *3_0, rt ∈ Ω(b·n1403₀ + b·n1403₀² + b²·n1403₀ + b²·n1403₀² + n1403₀ + n1403₀² + n1403₀³)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(19) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n⁴) was proven with the following lemma:
fac(gen_0':s2_0(n1403_0), gen_0':s2_0(b)) → *3_0, rt ∈ Ω(b·n1403₀ + b·n1403₀² + b²·n1403₀ + b²·n1403₀² + n1403₀ + n1403₀² + n1403₀³)

(20) BOUNDS(n^4, INF)

(21) Obligation:

Innermost TRS:
Rules:
plus(0', x) → x
plus(s(x), y) → s(plus(p(s(x)), y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(p(s(x)), y))
p(s(0')) → 0'
p(s(s(x))) → s(p(s(x)))
fac(0', x) → x
fac(s(x), y) → fac(p(s(x)), times(s(x), y))
factorial(x) → fac(x, s(0'))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
p :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
fac :: 0':s → 0':s → 0':s
factorial :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
p(gen_0':s2_0(+(1, n4_0))) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)
plus(gen_0':s2_0(n229_0), gen_0':s2_0(b)) → gen_0':s2_0(+(n229_0, b)), rt ∈ Ω(1 + n229₀ + n229₀²)
times(gen_0':s2_0(n714_0), gen_0':s2_0(b)) → gen_0':s2_0(*(n714_0, b)), rt ∈ Ω(1 + b·n714₀ + b²·n714₀ + n714₀ + n714₀²)
fac(gen_0':s2_0(n1403_0), gen_0':s2_0(b)) → *3_0, rt ∈ Ω(b·n1403₀ + b·n1403₀² + b²·n1403₀ + b²·n1403₀² + n1403₀ + n1403₀² + n1403₀³)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(22) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n⁴) was proven with the following lemma:
fac(gen_0':s2_0(n1403_0), gen_0':s2_0(b)) → *3_0, rt ∈ Ω(b·n1403₀ + b·n1403₀² + b²·n1403₀ + b²·n1403₀² + n1403₀ + n1403₀² + n1403₀³)

(23) BOUNDS(n^4, INF)

(24) Obligation:

Innermost TRS:
Rules:
plus(0', x) → x
plus(s(x), y) → s(plus(p(s(x)), y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(p(s(x)), y))
p(s(0')) → 0'
p(s(s(x))) → s(p(s(x)))
fac(0', x) → x
fac(s(x), y) → fac(p(s(x)), times(s(x), y))
factorial(x) → fac(x, s(0'))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
p :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
fac :: 0':s → 0':s → 0':s
factorial :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
p(gen_0':s2_0(+(1, n4_0))) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)
plus(gen_0':s2_0(n229_0), gen_0':s2_0(b)) → gen_0':s2_0(+(n229_0, b)), rt ∈ Ω(1 + n229₀ + n229₀²)
times(gen_0':s2_0(n714_0), gen_0':s2_0(b)) → gen_0':s2_0(*(n714_0, b)), rt ∈ Ω(1 + b·n714₀ + b²·n714₀ + n714₀ + n714₀²)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(25) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n³) was proven with the following lemma:
times(gen_0':s2_0(n714_0), gen_0':s2_0(b)) → gen_0':s2_0(*(n714_0, b)), rt ∈ Ω(1 + b·n714₀ + b²·n714₀ + n714₀ + n714₀²)

(26) BOUNDS(n^3, INF)

(27) Obligation:

Innermost TRS:
Rules:
plus(0', x) → x
plus(s(x), y) → s(plus(p(s(x)), y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(p(s(x)), y))
p(s(0')) → 0'
p(s(s(x))) → s(p(s(x)))
fac(0', x) → x
fac(s(x), y) → fac(p(s(x)), times(s(x), y))
factorial(x) → fac(x, s(0'))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
p :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
fac :: 0':s → 0':s → 0':s
factorial :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
p(gen_0':s2_0(+(1, n4_0))) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)
plus(gen_0':s2_0(n229_0), gen_0':s2_0(b)) → gen_0':s2_0(+(n229_0, b)), rt ∈ Ω(1 + n229₀ + n229₀²)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(28) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n²) was proven with the following lemma:
plus(gen_0':s2_0(n229_0), gen_0':s2_0(b)) → gen_0':s2_0(+(n229_0, b)), rt ∈ Ω(1 + n229₀ + n229₀²)

(29) BOUNDS(n^2, INF)

(30) Obligation:

Innermost TRS:
Rules:
plus(0', x) → x
plus(s(x), y) → s(plus(p(s(x)), y))
times(0', y) → 0'
times(s(x), y) → plus(y, times(p(s(x)), y))
p(s(0')) → 0'
p(s(s(x))) → s(p(s(x)))
fac(0', x) → x
fac(s(x), y) → fac(p(s(x)), times(s(x), y))
factorial(x) → fac(x, s(0'))

Types:
plus :: 0':s → 0':s → 0':s
0' :: 0':s
s :: 0':s → 0':s
p :: 0':s → 0':s
times :: 0':s → 0':s → 0':s
fac :: 0':s → 0':s → 0':s
factorial :: 0':s → 0':s
hole_0':s1_0 :: 0':s
gen_0':s2_0 :: Nat → 0':s

Lemmas:
p(gen_0':s2_0(+(1, n4_0))) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)

Generator Equations:
gen_0':s2_0(0) ⇔ 0'
gen_0':s2_0(+(x, 1)) ⇔ s(gen_0':s2_0(x))

No more defined symbols left to analyse.

(31) LowerBoundsProof (EQUIVALENT transformation)

The lowerbound Ω(n¹) was proven with the following lemma:
p(gen_0':s2_0(+(1, n4_0))) → gen_0':s2_0(n4_0), rt ∈ Ω(1 + n4₀)

(32) BOUNDS(n^1, INF)