details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	8.39483 seconds
cpu usage	18.902
user time	17.6934
system time	1.20858
max virtual memory	1.9142992E7
max residence set size	3519044.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 (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). (0) CpxTRS (1) RcToIrcProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxTRS (3) CpxTrsToCdtProof [UPPER BOUND(ID), 7 ms] (4) CdtProblem (5) CdtLeafRemovalProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CdtProblem (7) CdtUsableRulesProof [BOTH BOUNDS(ID, ID), 0 ms] (8) CdtProblem (9) CdtRuleRemovalProof [UPPER BOUND(ADD(n^1)), 35 ms] (10) CdtProblem (11) CdtKnowledgeProof [FINISHED, 0 ms] (12) BOUNDS(1, 1) (13) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (14) CpxTRS (15) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (16) typed CpxTrs (17) OrderProof [LOWER BOUND(ID), 0 ms] (18) typed CpxTrs (19) RewriteLemmaProof [LOWER BOUND(ID), 388 ms] (20) BEST (21) proven lower bound (22) LowerBoundPropagationProof [FINISHED, 0 ms] (23) BOUNDS(n^1, INF) (24) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: div(0, y) -> 0 div(x, y) -> quot(x, y, y) quot(0, s(y), z) -> 0 quot(s(x), s(y), z) -> quot(x, y, z) quot(x, 0, s(z)) -> s(div(x, s(z))) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RcToIrcProof (BOTH BOUNDS(ID, ID)) Converted rc-obligation to irc-obligation. As the TRS does not nest defined symbols, we have rc = irc. ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^1). The TRS R consists of the following rules: div(0, y) -> 0 div(x, y) -> quot(x, y, y) quot(0, s(y), z) -> 0 quot(s(x), s(y), z) -> quot(x, y, z) quot(x, 0, s(z)) -> s(div(x, s(z))) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) CpxTrsToCdtProof (UPPER BOUND(ID)) Converted Cpx (relative) TRS to CDT ---------------------------------------- (4) Obligation: Complexity Dependency Tuples Problem Rules: div(0, z0) -> 0 div(z0, z1) -> quot(z0, z1, z1) quot(0, s(z0), z1) -> 0 quot(s(z0), s(z1), z2) -> quot(z0, z1, z2) quot(z0, 0, s(z1)) -> s(div(z0, s(z1))) Tuples: DIV(0, z0) -> c DIV(z0, z1) -> c1(QUOT(z0, z1, z1)) QUOT(0, s(z0), z1) -> c2 QUOT(s(z0), s(z1), z2) -> c3(QUOT(z0, z1, z2)) QUOT(z0, 0, s(z1)) -> c4(DIV(z0, s(z1))) S tuples: DIV(0, z0) -> c DIV(z0, z1) -> c1(QUOT(z0, z1, z1)) QUOT(0, s(z0), z1) -> c2 popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS