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

0 CpxTRS
↳1 CpxTrsToCdtProof (BOTH BOUNDS(ID, ID), 0 ms)
↳2 CdtProblem
↳3 CdtLeafRemovalProof (BOTH BOUNDS(ID, ID), 0 ms)
↳4 CdtProblem
↳5 CdtRhsSimplificationProcessorProof (BOTH BOUNDS(ID, ID), 0 ms)
↳6 CdtProblem
↳7 CdtUsableRulesProof (⇔, 0 ms)
↳8 CdtProblem
↳9 CdtNarrowingProof (BOTH BOUNDS(ID, ID), 1 ms)
↳10 CdtProblem
↳11 CdtUsableRulesProof (⇔, 0 ms)
↳12 CdtProblem
↳13 CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)), 0 ms)
↳14 CdtProblem
↳15 SIsEmptyProof (BOTH BOUNDS(ID, ID), 0 ms)
↳16 BOUNDS(1, 1)

(0) Obligation:

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

p(s(x)) → x
fac(0) → s(0)
fac(s(x)) → times(s(x), fac(p(s(x))))

Rewrite Strategy: INNERMOST

(1) CpxTrsToCdtProof (BOTH BOUNDS(ID, ID) transformation)

Converted Cpx (relative) TRS to CDT

(2) Obligation:

Complexity Dependency Tuples Problem
Rules:

p(s(z0)) → z0
fac(0) → s(0)
fac(s(z0)) → times(s(z0), fac(p(s(z0))))
Tuples:

P(s(z0)) → c
FAC(0) → c1
FAC(s(z0)) → c2(FAC(p(s(z0))), P(s(z0)))
S tuples:

P(s(z0)) → c
FAC(0) → c1
FAC(s(z0)) → c2(FAC(p(s(z0))), P(s(z0)))
K tuples:none
Defined Rule Symbols:

p, fac

Defined Pair Symbols:

P, FAC

Compound Symbols:

c, c1, c2

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

Removed 2 trailing nodes:

FAC(0) → c1
P(s(z0)) → c

(4) Obligation:

Complexity Dependency Tuples Problem
Rules:

p(s(z0)) → z0
fac(0) → s(0)
fac(s(z0)) → times(s(z0), fac(p(s(z0))))
Tuples:

FAC(s(z0)) → c2(FAC(p(s(z0))), P(s(z0)))
S tuples:

FAC(s(z0)) → c2(FAC(p(s(z0))), P(s(z0)))
K tuples:none
Defined Rule Symbols:

p, fac

Defined Pair Symbols:

FAC

Compound Symbols:

c2

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

Removed 1 trailing tuple parts

(6) Obligation:

Complexity Dependency Tuples Problem
Rules:

p(s(z0)) → z0
fac(0) → s(0)
fac(s(z0)) → times(s(z0), fac(p(s(z0))))
Tuples:

FAC(s(z0)) → c2(FAC(p(s(z0))))
S tuples:

FAC(s(z0)) → c2(FAC(p(s(z0))))
K tuples:none
Defined Rule Symbols:

p, fac

Defined Pair Symbols:

FAC

Compound Symbols:

c2

(7) CdtUsableRulesProof (EQUIVALENT transformation)

The following rules are not usable and were removed:

fac(0) → s(0)
fac(s(z0)) → times(s(z0), fac(p(s(z0))))

(8) Obligation:

Complexity Dependency Tuples Problem
Rules:

p(s(z0)) → z0
Tuples:

FAC(s(z0)) → c2(FAC(p(s(z0))))
S tuples:

FAC(s(z0)) → c2(FAC(p(s(z0))))
K tuples:none
Defined Rule Symbols:

p

Defined Pair Symbols:

FAC

Compound Symbols:

c2

(9) CdtNarrowingProof (BOTH BOUNDS(ID, ID) transformation)

Use narrowing to replace FAC(s(z0)) → c2(FAC(p(s(z0)))) by

FAC(s(z0)) → c2(FAC(z0))

(10) Obligation:

Complexity Dependency Tuples Problem
Rules:

p(s(z0)) → z0
Tuples:

FAC(s(z0)) → c2(FAC(z0))
S tuples:

FAC(s(z0)) → c2(FAC(z0))
K tuples:none
Defined Rule Symbols:

p

Defined Pair Symbols:

FAC

Compound Symbols:

c2

(11) CdtUsableRulesProof (EQUIVALENT transformation)

The following rules are not usable and were removed:

p(s(z0)) → z0

(12) Obligation:

Complexity Dependency Tuples Problem
Rules:none
Tuples:

FAC(s(z0)) → c2(FAC(z0))
S tuples:

FAC(s(z0)) → c2(FAC(z0))
K tuples:none
Defined Rule Symbols:none

Defined Pair Symbols:

FAC

Compound Symbols:

c2

(13) CdtRuleRemovalProof (UPPER BOUND(ADD(n^1)) transformation)

Found a reduction pair which oriented the following tuples strictly. Hence they can be removed from S.

FAC(s(z0)) → c2(FAC(z0))
We considered the (Usable) Rules:none
And the Tuples:

FAC(s(z0)) → c2(FAC(z0))
The order we found is given by the following interpretation:
Polynomial interpretation :

POL(FAC(x1)) = [5]x1   
POL(c2(x1)) = x1   
POL(s(x1)) = [1] + x1   

(14) Obligation:

Complexity Dependency Tuples Problem
Rules:none
Tuples:

FAC(s(z0)) → c2(FAC(z0))
S tuples:none
K tuples:

FAC(s(z0)) → c2(FAC(z0))
Defined Rule Symbols:none

Defined Pair Symbols:

FAC

Compound Symbols:

c2

(15) SIsEmptyProof (BOTH BOUNDS(ID, ID) transformation)

The set S is empty

(16) BOUNDS(1, 1)