details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	4.60641 seconds
cpu usage	14.7613
user time	13.7856
system time	0.975694
max virtual memory	1.881022E7
max residence set size	3086500.0

stage attributes

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

output

WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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), 11 ms] (2) CdtProblem (3) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms] (4) CdtProblem (5) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CdtProblem (7) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 44 ms] (8) CdtProblem (9) SIsEmptyProof [BOTH BOUNDS(ID, ID), 0 ms] (10) BOUNDS(1, 1) (11) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (12) TRS for Loop Detection (13) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (14) BEST (15) proven lower bound (16) LowerBoundPropagationProof [FINISHED, 0 ms] (17) BOUNDS(n^1, INF) (18) 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: D(t) -> 1 D(constant) -> 0 D(+(x, y)) -> +(D(x), D(y)) D(*(x, y)) -> +(*(y, D(x)), *(x, D(y))) D(-(x, y)) -> -(D(x), D(y)) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) CpxTrsToCdtProof (UPPER BOUND(ID)) Converted Cpx (relative) TRS to CDT ---------------------------------------- (2) Obligation: Complexity Dependency Tuples Problem Rules: D(t) -> 1 D(constant) -> 0 D(+(z0, z1)) -> +(D(z0), D(z1)) D(*(z0, z1)) -> +(*(z1, D(z0)), *(z0, D(z1))) D(-(z0, z1)) -> -(D(z0), D(z1)) Tuples: D'(t) -> c D'(constant) -> c1 D'(+(z0, z1)) -> c2(D'(z0), D'(z1)) D'(*(z0, z1)) -> c3(D'(z0), D'(z1)) D'(-(z0, z1)) -> c4(D'(z0), D'(z1)) S tuples: D'(t) -> c D'(constant) -> c1 D'(+(z0, z1)) -> c2(D'(z0), D'(z1)) D'(*(z0, z1)) -> c3(D'(z0), D'(z1)) D'(-(z0, z1)) -> c4(D'(z0), D'(z1)) K tuples:none Defined Rule Symbols: D_1 Defined Pair Symbols: D'_1 Compound Symbols: c, c1, c2_2, c3_2, c4_2 ---------------------------------------- (3) CdtLeafRemovalProof (BOTH BOUNDS(ID, ID)) Removed 2 trailing nodes: D'(t) -> c D'(constant) -> c1 ---------------------------------------- (4) Obligation: Complexity Dependency Tuples Problem Rules: D(t) -> 1 D(constant) -> 0 D(+(z0, z1)) -> +(D(z0), D(z1)) D(*(z0, z1)) -> +(*(z1, D(z0)), *(z0, D(z1))) D(-(z0, z1)) -> -(D(z0), D(z1)) popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS Innermost