Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime Complexity: TRS pair #487111150
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
n151.star.cs.uiowa.edu
space
TCT_12
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.556 seconds
cpu usage
387.656
user time
383.6
system time
4.05566
max virtual memory
5.5711828E7
max residence set size
5761640.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^5))
output
WORST_CASE(Omega(n^1), O(n^5)) 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^1, n^5). (0) CpxTRS (1) RcToIrcProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxTRS (3) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (4) CpxWeightedTrs (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxTypedWeightedTrs (7) CompletionProof [UPPER BOUND(ID), 0 ms] (8) CpxTypedWeightedCompleteTrs (9) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] (10) CpxTypedWeightedCompleteTrs (11) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] (12) CpxRNTS (13) InliningProof [UPPER BOUND(ID), 41 ms] (14) CpxRNTS (15) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] (16) CpxRNTS (17) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 2 ms] (18) CpxRNTS (19) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (20) CpxRNTS (21) IntTrsBoundProof [UPPER BOUND(ID), 98 ms] (22) CpxRNTS (23) IntTrsBoundProof [UPPER BOUND(ID), 54 ms] (24) CpxRNTS (25) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (26) CpxRNTS (27) IntTrsBoundProof [UPPER BOUND(ID), 157 ms] (28) CpxRNTS (29) IntTrsBoundProof [UPPER BOUND(ID), 74 ms] (30) CpxRNTS (31) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (32) CpxRNTS (33) IntTrsBoundProof [UPPER BOUND(ID), 86 ms] (34) CpxRNTS (35) IntTrsBoundProof [UPPER BOUND(ID), 32 ms] (36) CpxRNTS (37) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (38) CpxRNTS (39) IntTrsBoundProof [UPPER BOUND(ID), 177 ms] (40) CpxRNTS (41) IntTrsBoundProof [UPPER BOUND(ID), 92 ms] (42) CpxRNTS (43) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (44) CpxRNTS (45) IntTrsBoundProof [UPPER BOUND(ID), 95 ms] (46) CpxRNTS (47) IntTrsBoundProof [UPPER BOUND(ID), 0 ms] (48) CpxRNTS (49) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (50) CpxRNTS (51) IntTrsBoundProof [UPPER BOUND(ID), 176 ms] (52) CpxRNTS (53) IntTrsBoundProof [UPPER BOUND(ID), 2 ms] (54) CpxRNTS (55) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (56) CpxRNTS (57) IntTrsBoundProof [UPPER BOUND(ID), 27 ms] (58) CpxRNTS (59) IntTrsBoundProof [UPPER BOUND(ID), 0 ms] (60) CpxRNTS (61) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (62) CpxRNTS (63) IntTrsBoundProof [UPPER BOUND(ID), 178 ms] (64) CpxRNTS (65) IntTrsBoundProof [UPPER BOUND(ID), 2 ms] (66) CpxRNTS (67) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (68) CpxRNTS (69) IntTrsBoundProof [UPPER BOUND(ID), 126 ms] (70) CpxRNTS (71) IntTrsBoundProof [UPPER BOUND(ID), 0 ms] (72) CpxRNTS (73) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (74) CpxRNTS (75) IntTrsBoundProof [UPPER BOUND(ID), 198 ms] (76) CpxRNTS (77) IntTrsBoundProof [UPPER BOUND(ID), 2 ms] (78) CpxRNTS (79) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (80) CpxRNTS (81) IntTrsBoundProof [UPPER BOUND(ID), 85 ms] (82) CpxRNTS (83) IntTrsBoundProof [UPPER BOUND(ID), 2 ms] (84) CpxRNTS (85) FinalProof [FINISHED, 0 ms] (86) BOUNDS(1, n^5) (87) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (88) TRS for Loop Detection (89) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (90) BEST (91) proven lower bound (92) LowerBoundPropagationProof [FINISHED, 0 ms]
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime Complexity: TRS