details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	291.538 seconds
cpu usage	1041.57
user time	1025.73
system time	15.8316
max virtual memory	3.7775108E7
max residence set size	1.502838E7

stage attributes

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

output

WORST_CASE(Omega(n^1), O(n^2)) proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Derivational Complexity (full) of the given DCpxTrs could be proven to be BOUNDS(n^1, n^2). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 62 ms] (4) CpxRelTRS (5) RcToIrcProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxRelTRS (7) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (8) CpxWeightedTrs (9) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (10) CpxTypedWeightedTrs (11) CompletionProof [UPPER BOUND(ID), 0 ms] (12) CpxTypedWeightedCompleteTrs (13) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] (14) CpxTypedWeightedCompleteTrs (15) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] (16) CpxRNTS (17) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] (18) CpxRNTS (19) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] (20) CpxRNTS (21) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (22) CpxRNTS (23) IntTrsBoundProof [UPPER BOUND(ID), 77 ms] (24) CpxRNTS (25) IntTrsBoundProof [UPPER BOUND(ID), 0 ms] (26) CpxRNTS (27) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (28) CpxRNTS (29) IntTrsBoundProof [UPPER BOUND(ID), 169 ms] (30) CpxRNTS (31) IntTrsBoundProof [UPPER BOUND(ID), 62 ms] (32) CpxRNTS (33) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (34) CpxRNTS (35) IntTrsBoundProof [UPPER BOUND(ID), 243 ms] (36) CpxRNTS (37) IntTrsBoundProof [UPPER BOUND(ID), 105 ms] (38) CpxRNTS (39) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (40) CpxRNTS (41) IntTrsBoundProof [UPPER BOUND(ID), 689 ms] (42) CpxRNTS (43) IntTrsBoundProof [UPPER BOUND(ID), 391 ms] (44) CpxRNTS (45) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (46) CpxRNTS (47) IntTrsBoundProof [UPPER BOUND(ID), 418 ms] (48) CpxRNTS (49) IntTrsBoundProof [UPPER BOUND(ID), 76 ms] (50) CpxRNTS (51) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (52) CpxRNTS (53) IntTrsBoundProof [UPPER BOUND(ID), 169 ms] (54) CpxRNTS (55) IntTrsBoundProof [UPPER BOUND(ID), 0 ms] (56) CpxRNTS (57) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (58) CpxRNTS (59) IntTrsBoundProof [UPPER BOUND(ID), 88 ms] (60) CpxRNTS (61) IntTrsBoundProof [UPPER BOUND(ID), 0 ms] (62) CpxRNTS (63) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (64) CpxRNTS (65) IntTrsBoundProof [UPPER BOUND(ID), 414 ms] (66) CpxRNTS (67) IntTrsBoundProof [UPPER BOUND(ID), 15 ms] (68) CpxRNTS (69) FinalProof [FINISHED, 0 ms] (70) BOUNDS(1, n^2) (71) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (72) TRS for Loop Detection (73) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (74) BEST (75) proven lower bound (76) LowerBoundPropagationProof [FINISHED, 0 ms] (77) BOUNDS(n^1, INF) (78) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Derivational Complexity (full) of the given DCpxTrs could be proven to be BOUNDS(n^1, n^2). The TRS R consists of the following rules: a__f(f(a)) -> a__f(g(f(a))) mark(f(X)) -> a__f(X) mark(a) -> a popout

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

job log

popout

actions

all output return to Derivational Complexity: TRS