details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	9.3825 seconds
cpu usage	25.9887
user time	24.3642
system time	1.62451
max virtual memory	1.8946044E7
max residence set size	4043864.0

stage attributes

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

output

WORST_CASE(Omega(n^2), O(n^2)) 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^2, n^2). (0) CpxTRS (1) NestedDefinedSymbolProof [UPPER BOUND(ID), 0 ms] (2) CpxTRS (3) RcToIrcProof [BOTH BOUNDS(ID, ID), 0 ms] (4) CpxTRS (5) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxWeightedTrs (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (8) CpxTypedWeightedTrs (9) CompletionProof [UPPER BOUND(ID), 0 ms] (10) CpxTypedWeightedCompleteTrs (11) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] (12) CpxTypedWeightedCompleteTrs (13) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] (14) CpxRNTS (15) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] (16) CpxRNTS (17) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] (18) CpxRNTS (19) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (20) CpxRNTS (21) IntTrsBoundProof [UPPER BOUND(ID), 958 ms] (22) CpxRNTS (23) IntTrsBoundProof [UPPER BOUND(ID), 456 ms] (24) CpxRNTS (25) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (26) CpxRNTS (27) IntTrsBoundProof [UPPER BOUND(ID), 361 ms] (28) CpxRNTS (29) IntTrsBoundProof [UPPER BOUND(ID), 103 ms] (30) CpxRNTS (31) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (32) CpxRNTS (33) IntTrsBoundProof [UPPER BOUND(ID), 696 ms] (34) CpxRNTS (35) IntTrsBoundProof [UPPER BOUND(ID), 238 ms] (36) CpxRNTS (37) FinalProof [FINISHED, 0 ms] (38) BOUNDS(1, n^2) (39) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (40) CpxTRS (41) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (42) typed CpxTrs (43) OrderProof [LOWER BOUND(ID), 0 ms] (44) typed CpxTrs (45) RewriteLemmaProof [LOWER BOUND(ID), 288 ms] (46) BEST (47) proven lower bound (48) LowerBoundPropagationProof [FINISHED, 0 ms] (49) BOUNDS(n^1, INF) (50) typed CpxTrs (51) RewriteLemmaProof [LOWER BOUND(ID), 39 ms] (52) BEST (53) proven lower bound (54) LowerBoundPropagationProof [FINISHED, 0 ms] (55) BOUNDS(n^2, INF) (56) typed CpxTrs (57) RewriteLemmaProof [LOWER BOUND(ID), 64 ms] (58) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, n^2). The TRS R consists of the following rules: plus(x, 0) -> x plus(0, y) -> y plus(s(x), y) -> s(plus(x, y)) times(0, y) -> 0 times(s(0), y) -> y times(s(x), y) -> plus(y, times(x, y)) 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))) div(div(x, y), z) -> div(x, times(y, z)) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) NestedDefinedSymbolProof (UPPER BOUND(ID)) The following defined symbols can occur below the 1th argument of plus: plus, times Hence, the left-hand sides of the following rules are not basic-reachable and can be removed: div(div(x, y), z) -> div(x, times(y, z)) popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS