details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.669 seconds
cpu usage	1109.25
user time	1096.12
system time	13.1316
max virtual memory	3.7774652E7
max residence set size	1.502496E7

stage attributes

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

output

WORST_CASE(Omega(n^2), O(n^3)) proof of /export/starexec/sandbox/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^3). (0) CpxTRS (1) NestedDefinedSymbolProof [UPPER BOUND(ID), 2 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), 365 ms] (22) CpxRNTS (23) IntTrsBoundProof [UPPER BOUND(ID), 129 ms] (24) CpxRNTS (25) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (26) CpxRNTS (27) IntTrsBoundProof [UPPER BOUND(ID), 839 ms] (28) CpxRNTS (29) IntTrsBoundProof [UPPER BOUND(ID), 383 ms] (30) CpxRNTS (31) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (32) CpxRNTS (33) IntTrsBoundProof [UPPER BOUND(ID), 301 ms] (34) CpxRNTS (35) IntTrsBoundProof [UPPER BOUND(ID), 134 ms] (36) CpxRNTS (37) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (38) CpxRNTS (39) IntTrsBoundProof [UPPER BOUND(ID), 715 ms] (40) CpxRNTS (41) IntTrsBoundProof [UPPER BOUND(ID), 164 ms] (42) CpxRNTS (43) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (44) CpxRNTS (45) IntTrsBoundProof [UPPER BOUND(ID), 472 ms] (46) CpxRNTS (47) IntTrsBoundProof [UPPER BOUND(ID), 44 ms] (48) CpxRNTS (49) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (50) CpxRNTS (51) IntTrsBoundProof [UPPER BOUND(ID), 40 ms] (52) CpxRNTS (53) IntTrsBoundProof [UPPER BOUND(ID), 0 ms] (54) CpxRNTS (55) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (56) CpxRNTS (57) IntTrsBoundProof [UPPER BOUND(ID), 56 ms] (58) CpxRNTS (59) IntTrsBoundProof [UPPER BOUND(ID), 2 ms] (60) CpxRNTS (61) FinalProof [FINISHED, 0 ms] (62) BOUNDS(1, n^3) (63) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (64) CpxTRS (65) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (66) typed CpxTrs (67) OrderProof [LOWER BOUND(ID), 0 ms] (68) typed CpxTrs (69) RewriteLemmaProof [LOWER BOUND(ID), 263 ms] (70) BEST (71) proven lower bound (72) LowerBoundPropagationProof [FINISHED, 0 ms] (73) BOUNDS(n^1, INF) (74) typed CpxTrs (75) RewriteLemmaProof [LOWER BOUND(ID), 67 ms] (76) BEST (77) proven lower bound (78) LowerBoundPropagationProof [FINISHED, 0 ms] (79) BOUNDS(n^2, INF) (80) typed CpxTrs (81) RewriteLemmaProof [LOWER BOUND(ID), 58 ms] (82) typed CpxTrs (83) RewriteLemmaProof [LOWER BOUND(ID), 70 ms] (84) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^2, n^3). popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS