Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313367
details
property
value
status
complete
benchmark
dyade.raml.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n159.star.cs.uiowa.edu
space
raML
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.612 seconds
cpu usage
367.958
user time
363.663
system time
4.2954
max virtual memory
1.9472648E7
max residence set size
5599940.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^2))
output
367.72/291.51 WORST_CASE(Omega(n^1), O(n^2)) 367.72/291.52 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 367.72/291.52 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 367.72/291.52 367.72/291.52 367.72/291.52 The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, n^2). 367.72/291.52 367.72/291.52 (0) CpxRelTRS 367.72/291.52 (1) STerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 329 ms] 367.72/291.52 (2) CpxRelTRS 367.72/291.52 (3) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] 367.72/291.52 (4) CpxWeightedTrs 367.72/291.52 (5) CpxWeightedTrsRenamingProof [BOTH BOUNDS(ID, ID), 0 ms] 367.72/291.52 (6) CpxWeightedTrs 367.72/291.52 (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 367.72/291.52 (8) CpxTypedWeightedTrs 367.72/291.52 (9) CompletionProof [UPPER BOUND(ID), 0 ms] 367.72/291.52 (10) CpxTypedWeightedCompleteTrs 367.72/291.52 (11) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 367.72/291.52 (12) CpxTypedWeightedCompleteTrs 367.72/291.52 (13) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] 367.72/291.52 (14) CpxRNTS 367.72/291.52 (15) InliningProof [UPPER BOUND(ID), 1033 ms] 367.72/291.52 (16) CpxRNTS 367.72/291.52 (17) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] 367.72/291.52 (18) CpxRNTS 367.72/291.52 (19) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] 367.72/291.52 (20) CpxRNTS 367.72/291.52 (21) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 367.72/291.52 (22) CpxRNTS 367.72/291.52 (23) IntTrsBoundProof [UPPER BOUND(ID), 228 ms] 367.72/291.52 (24) CpxRNTS 367.72/291.52 (25) IntTrsBoundProof [UPPER BOUND(ID), 54 ms] 367.72/291.52 (26) CpxRNTS 367.72/291.52 (27) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 367.72/291.52 (28) CpxRNTS 367.72/291.52 (29) IntTrsBoundProof [UPPER BOUND(ID), 220 ms] 367.72/291.52 (30) CpxRNTS 367.72/291.52 (31) IntTrsBoundProof [UPPER BOUND(ID), 4 ms] 367.72/291.52 (32) CpxRNTS 367.72/291.52 (33) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 367.72/291.52 (34) CpxRNTS 367.72/291.52 (35) IntTrsBoundProof [UPPER BOUND(ID), 2471 ms] 367.72/291.52 (36) CpxRNTS 367.72/291.52 (37) IntTrsBoundProof [UPPER BOUND(ID), 417 ms] 367.72/291.52 (38) CpxRNTS 367.72/291.52 (39) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 367.72/291.52 (40) CpxRNTS 367.72/291.52 (41) IntTrsBoundProof [UPPER BOUND(ID), 754 ms] 367.72/291.52 (42) CpxRNTS 367.72/291.52 (43) IntTrsBoundProof [UPPER BOUND(ID), 125 ms] 367.72/291.52 (44) CpxRNTS 367.72/291.52 (45) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 367.72/291.52 (46) CpxRNTS 367.72/291.52 (47) IntTrsBoundProof [UPPER BOUND(ID), 1162 ms] 367.72/291.52 (48) CpxRNTS 367.72/291.52 (49) IntTrsBoundProof [UPPER BOUND(ID), 63 ms] 367.72/291.52 (50) CpxRNTS 367.72/291.52 (51) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 367.72/291.52 (52) CpxRNTS 367.72/291.52 (53) IntTrsBoundProof [UPPER BOUND(ID), 847 ms] 367.72/291.52 (54) CpxRNTS 367.72/291.52 (55) IntTrsBoundProof [UPPER BOUND(ID), 42 ms] 367.72/291.52 (56) CpxRNTS 367.72/291.52 (57) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 367.72/291.52 (58) CpxRNTS 367.72/291.52 (59) IntTrsBoundProof [UPPER BOUND(ID), 1840 ms] 367.72/291.52 (60) CpxRNTS 367.72/291.52 (61) IntTrsBoundProof [UPPER BOUND(ID), 177 ms] 367.72/291.52 (62) CpxRNTS 367.72/291.52 (63) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 367.72/291.52 (64) CpxRNTS 367.72/291.52 (65) IntTrsBoundProof [UPPER BOUND(ID), 1897 ms] 367.72/291.52 (66) CpxRNTS 367.72/291.52 (67) IntTrsBoundProof [UPPER BOUND(ID), 174 ms] 367.72/291.52 (68) CpxRNTS 367.72/291.52 (69) FinalProof [FINISHED, 0 ms] 367.72/291.52 (70) BOUNDS(1, n^2) 367.72/291.52 (71) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 367.72/291.52 (72) TRS for Loop Detection 367.72/291.52 (73) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] 367.72/291.52 (74) BEST 367.72/291.52 (75) proven lower bound 367.72/291.52 (76) LowerBoundPropagationProof [FINISHED, 0 ms] 367.72/291.52 (77) BOUNDS(n^1, INF) 367.72/291.52 (78) TRS for Loop Detection 367.72/291.52 367.72/291.52 367.72/291.52 ---------------------------------------- 367.72/291.52 367.72/291.52 (0) 367.72/291.52 Obligation: 367.72/291.52 The Runtime Complexity (innermost) of the given CpxRelTRS could be proven to be BOUNDS(n^1, n^2). 367.72/291.52 367.72/291.52 367.72/291.52 The TRS R consists of the following rules: 367.72/291.52 367.72/291.52 *(@x, @y) -> #mult(@x, @y) 367.72/291.52 dyade(@l1, @l2) -> dyade#1(@l1, @l2) 367.72/291.52 dyade#1(::(@x, @xs), @l2) -> ::(mult(@x, @l2), dyade(@xs, @l2))
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