Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313538
details
property
value
status
complete
benchmark
recursion-5.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n019.star.cs.uiowa.edu
space
TCT_12
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.588 seconds
cpu usage
398.717
user time
394.275
system time
4.44204
max virtual memory
3.7964048E7
max residence set size
5872412.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^5))
output
398.55/291.51 WORST_CASE(Omega(n^1), O(n^5)) 398.55/291.53 proof of /export/starexec/sandbox/benchmark/theBenchmark.xml 398.55/291.53 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 398.55/291.53 398.55/291.53 398.55/291.53 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^5). 398.55/291.53 398.55/291.53 (0) CpxTRS 398.55/291.53 (1) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] 398.55/291.53 (2) CpxWeightedTrs 398.55/291.53 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 398.55/291.53 (4) CpxTypedWeightedTrs 398.55/291.53 (5) CompletionProof [UPPER BOUND(ID), 0 ms] 398.55/291.53 (6) CpxTypedWeightedCompleteTrs 398.55/291.53 (7) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 398.55/291.53 (8) CpxTypedWeightedCompleteTrs 398.55/291.53 (9) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] 398.55/291.53 (10) CpxRNTS 398.55/291.53 (11) InliningProof [UPPER BOUND(ID), 32 ms] 398.55/291.53 (12) CpxRNTS 398.55/291.53 (13) SimplificationProof [BOTH BOUNDS(ID, ID), 4 ms] 398.55/291.53 (14) CpxRNTS 398.55/291.53 (15) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] 398.55/291.53 (16) CpxRNTS 398.55/291.53 (17) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 398.55/291.53 (18) CpxRNTS 398.55/291.53 (19) IntTrsBoundProof [UPPER BOUND(ID), 82 ms] 398.55/291.53 (20) CpxRNTS 398.55/291.53 (21) IntTrsBoundProof [UPPER BOUND(ID), 7 ms] 398.55/291.53 (22) CpxRNTS 398.55/291.53 (23) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 398.55/291.53 (24) CpxRNTS 398.55/291.53 (25) IntTrsBoundProof [UPPER BOUND(ID), 170 ms] 398.55/291.53 (26) CpxRNTS 398.55/291.53 (27) IntTrsBoundProof [UPPER BOUND(ID), 73 ms] 398.55/291.53 (28) CpxRNTS 398.55/291.53 (29) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 398.55/291.53 (30) CpxRNTS 398.55/291.53 (31) IntTrsBoundProof [UPPER BOUND(ID), 36 ms] 398.55/291.53 (32) CpxRNTS 398.55/291.53 (33) IntTrsBoundProof [UPPER BOUND(ID), 5 ms] 398.55/291.53 (34) CpxRNTS 398.55/291.53 (35) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 398.55/291.53 (36) CpxRNTS 398.55/291.53 (37) IntTrsBoundProof [UPPER BOUND(ID), 160 ms] 398.55/291.53 (38) CpxRNTS 398.55/291.53 (39) IntTrsBoundProof [UPPER BOUND(ID), 95 ms] 398.55/291.53 (40) CpxRNTS 398.55/291.53 (41) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 398.55/291.53 (42) CpxRNTS 398.55/291.53 (43) IntTrsBoundProof [UPPER BOUND(ID), 107 ms] 398.55/291.53 (44) CpxRNTS 398.55/291.53 (45) IntTrsBoundProof [UPPER BOUND(ID), 0 ms] 398.55/291.53 (46) CpxRNTS 398.55/291.53 (47) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 398.55/291.53 (48) CpxRNTS 398.55/291.53 (49) IntTrsBoundProof [UPPER BOUND(ID), 188 ms] 398.55/291.53 (50) CpxRNTS 398.55/291.53 (51) IntTrsBoundProof [UPPER BOUND(ID), 22 ms] 398.55/291.53 (52) CpxRNTS 398.55/291.53 (53) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 398.55/291.53 (54) CpxRNTS 398.55/291.53 (55) IntTrsBoundProof [UPPER BOUND(ID), 86 ms] 398.55/291.53 (56) CpxRNTS 398.55/291.53 (57) IntTrsBoundProof [UPPER BOUND(ID), 0 ms] 398.55/291.53 (58) CpxRNTS 398.55/291.53 (59) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 398.55/291.53 (60) CpxRNTS 398.55/291.53 (61) IntTrsBoundProof [UPPER BOUND(ID), 208 ms] 398.55/291.53 (62) CpxRNTS 398.55/291.53 (63) IntTrsBoundProof [UPPER BOUND(ID), 12 ms] 398.55/291.53 (64) CpxRNTS 398.55/291.53 (65) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 398.55/291.53 (66) CpxRNTS 398.55/291.53 (67) IntTrsBoundProof [UPPER BOUND(ID), 147 ms] 398.55/291.53 (68) CpxRNTS 398.55/291.53 (69) IntTrsBoundProof [UPPER BOUND(ID), 0 ms] 398.55/291.53 (70) CpxRNTS 398.55/291.53 (71) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 398.55/291.53 (72) CpxRNTS 398.55/291.53 (73) IntTrsBoundProof [UPPER BOUND(ID), 168 ms] 398.55/291.53 (74) CpxRNTS 398.55/291.53 (75) IntTrsBoundProof [UPPER BOUND(ID), 0 ms] 398.55/291.53 (76) CpxRNTS 398.55/291.53 (77) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 398.55/291.53 (78) CpxRNTS 398.55/291.53 (79) IntTrsBoundProof [UPPER BOUND(ID), 95 ms] 398.55/291.53 (80) CpxRNTS 398.55/291.53 (81) IntTrsBoundProof [UPPER BOUND(ID), 0 ms] 398.55/291.53 (82) CpxRNTS 398.55/291.53 (83) FinalProof [FINISHED, 0 ms] 398.55/291.53 (84) BOUNDS(1, n^5) 398.55/291.53 (85) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 398.55/291.53 (86) TRS for Loop Detection 398.55/291.53 (87) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] 398.55/291.53 (88) BEST 398.55/291.53 (89) proven lower bound 398.55/291.53 (90) LowerBoundPropagationProof [FINISHED, 0 ms] 398.55/291.53 (91) BOUNDS(n^1, INF) 398.55/291.53 (92) TRS for Loop Detection
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