Runti Compl Inner Rewri 22807 pair #381904681

details

property	value
status	complete
benchmark	#3.41.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n042.star.cs.uiowa.edu
space	AG01

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	5.02072191238 seconds
cpu usage	16.534571363
max memory	4.219920384E9

stage attributes

key	value
output-size	7691
starexec-result	WORST_CASE(Omega(n^1), O(n^1))

output

/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


WORST_CASE(Omega(n^1), O(n^1))
proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml
# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty


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

(0) CpxTRS
(1) CpxTrsToCdtProof [UPPER BOUND(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 [BOTH BOUNDS(ID, ID), 0 ms]
    (8) CdtProblem
    (9) CdtNarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
    (10) CdtProblem
    (11) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 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)
(17) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
(18) TRS for Loop Detection
    (19) DecreasingLoopProof [LOWER BOUND(ID), 0 ms]
    (20) BEST
        (21) proven lower bound
            (22) LowerBoundPropagationProof [FINISHED, 0 ms]
            (23) BOUNDS(n^1, INF)
        (24) TRS for Loop Detection


----------------------------------------

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


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))))

S is empty.
Rewrite Strategy: INNERMOST
----------------------------------------

(1) CpxTrsToCdtProof (UPPER BOUND(ID))
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_1, fac_1

Defined Pair Symbols:   P_1, FAC_1

Compound Symbols:   c, c1, c2_2


----------------------------------------

(3) CdtLeafRemovalProof (BOTH BOUNDS(ID, ID))
Removed 2 trailing nodes:
   FAC(0) -> c1
   P(s(z0)) -> c

----------------------------------------

(4)
Obligation:
Complexity Dependency Tuples Problem

Rules:
   p(s(z0)) -> z0

popout

output may be truncated. 'popout' for the full output.

job log

popout

actions all output return to Runti Compl Inner Rewri 22807