Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313370

details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.698 seconds
cpu usage	368.333
user time	362.452
system time	5.88127
max virtual memory	3.8312496E7
max residence set size	6969176.0

stage attributes

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

output

368.14/291.61	WORST_CASE(Omega(n^1), O(n^2))
368.14/291.62	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
368.14/291.62	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
368.14/291.62	
368.14/291.62	
368.14/291.62	The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, n^2).
368.14/291.62	
368.14/291.62	(0) CpxRelTRS
368.14/291.62	(1) STerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 195 ms]
368.14/291.62	(2) CpxRelTRS
368.14/291.62	(3) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms]
368.14/291.62	(4) CpxWeightedTrs
368.14/291.62	    (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms]
368.14/291.62	    (6) CpxTypedWeightedTrs
368.14/291.62	    (7) CompletionProof [UPPER BOUND(ID), 0 ms]
368.14/291.62	    (8) CpxTypedWeightedCompleteTrs
368.14/291.62	    (9) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms]
368.14/291.62	    (10) CpxTypedWeightedCompleteTrs
368.14/291.62	    (11) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms]
368.14/291.62	    (12) CpxRNTS
368.14/291.62	    (13) InliningProof [UPPER BOUND(ID), 723 ms]
368.14/291.62	    (14) CpxRNTS
368.14/291.62	    (15) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms]
368.14/291.62	    (16) CpxRNTS
368.14/291.62	    (17) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 1 ms]
368.14/291.62	    (18) CpxRNTS
368.14/291.62	    (19) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
368.14/291.62	    (20) CpxRNTS
368.14/291.62	    (21) IntTrsBoundProof [UPPER BOUND(ID), 979 ms]
368.14/291.62	    (22) CpxRNTS
368.14/291.62	    (23) IntTrsBoundProof [UPPER BOUND(ID), 269 ms]
368.14/291.62	    (24) CpxRNTS
368.14/291.62	    (25) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
368.14/291.62	    (26) CpxRNTS
368.14/291.62	    (27) IntTrsBoundProof [UPPER BOUND(ID), 604 ms]
368.14/291.62	    (28) CpxRNTS
368.14/291.62	    (29) IntTrsBoundProof [UPPER BOUND(ID), 150 ms]
368.14/291.62	    (30) CpxRNTS
368.14/291.62	    (31) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
368.14/291.62	    (32) CpxRNTS
368.14/291.62	    (33) IntTrsBoundProof [UPPER BOUND(ID), 189 ms]
368.14/291.62	    (34) CpxRNTS
368.14/291.62	    (35) IntTrsBoundProof [UPPER BOUND(ID), 13 ms]
368.14/291.62	    (36) CpxRNTS
368.14/291.62	    (37) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
368.14/291.62	    (38) CpxRNTS
368.14/291.62	    (39) IntTrsBoundProof [UPPER BOUND(ID), 699 ms]
368.14/291.62	    (40) CpxRNTS
368.14/291.62	    (41) IntTrsBoundProof [UPPER BOUND(ID), 93 ms]
368.14/291.62	    (42) CpxRNTS
368.14/291.62	    (43) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
368.14/291.62	    (44) CpxRNTS
368.14/291.62	    (45) IntTrsBoundProof [UPPER BOUND(ID), 1674 ms]
368.14/291.62	    (46) CpxRNTS
368.14/291.62	    (47) IntTrsBoundProof [UPPER BOUND(ID), 517 ms]
368.14/291.62	    (48) CpxRNTS
368.14/291.62	    (49) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
368.14/291.62	    (50) CpxRNTS
368.14/291.62	    (51) IntTrsBoundProof [UPPER BOUND(ID), 259 ms]
368.14/291.62	    (52) CpxRNTS
368.14/291.62	    (53) IntTrsBoundProof [UPPER BOUND(ID), 125 ms]
368.14/291.62	    (54) CpxRNTS
368.14/291.62	    (55) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
368.14/291.62	    (56) CpxRNTS
368.14/291.62	    (57) IntTrsBoundProof [UPPER BOUND(ID), 268 ms]
368.14/291.62	    (58) CpxRNTS
368.14/291.62	    (59) IntTrsBoundProof [UPPER BOUND(ID), 124 ms]
368.14/291.62	    (60) CpxRNTS
368.14/291.62	    (61) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
368.14/291.62	    (62) CpxRNTS
368.14/291.62	    (63) IntTrsBoundProof [UPPER BOUND(ID), 135 ms]
368.14/291.62	    (64) CpxRNTS
368.14/291.62	    (65) IntTrsBoundProof [UPPER BOUND(ID), 0 ms]
368.14/291.62	    (66) CpxRNTS
368.14/291.62	    (67) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
368.14/291.62	    (68) CpxRNTS
368.14/291.62	    (69) IntTrsBoundProof [UPPER BOUND(ID), 135 ms]
368.14/291.62	    (70) CpxRNTS
368.14/291.62	    (71) IntTrsBoundProof [UPPER BOUND(ID), 0 ms]
368.14/291.62	    (72) CpxRNTS
368.14/291.62	    (73) ResultPropagationProof [UPPER BOUND(ID), 0 ms]
368.14/291.62	    (74) CpxRNTS
368.14/291.62	    (75) IntTrsBoundProof [UPPER BOUND(ID), 168 ms]
368.14/291.62	    (76) CpxRNTS
368.14/291.62	    (77) IntTrsBoundProof [UPPER BOUND(ID), 0 ms]
368.14/291.62	    (78) CpxRNTS
368.14/291.63	    (79) FinalProof [FINISHED, 0 ms]
368.14/291.63	    (80) BOUNDS(1, n^2)
368.14/291.63	(81) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms]
368.14/291.63	(82) TRS for Loop Detection
368.14/291.63	    (83) DecreasingLoopProof [LOWER BOUND(ID), 22 ms]
368.14/291.63	    (84) BEST
368.14/291.63	        (85) proven lower bound
368.14/291.63	            (86) LowerBoundPropagationProof [FINISHED, 0 ms]
368.14/291.63	            (87) BOUNDS(n^1, INF)
368.14/291.63	        (88) TRS for Loop Detection
368.14/291.63	
368.14/291.63	
368.14/291.63	----------------------------------------
368.14/291.63

popout

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

job log

popout

actions all output return to Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40