Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Derivational Complexity: TRS Innermost pair #487105884
details
property
value
status
complete
benchmark
tpa2.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n138.star.cs.uiowa.edu
space
Secret_05_TRS
run statistics
property
value
solver
AProVE
configuration
rcdcRelativeAlsoLower
runtime (wallclock)
292.175 seconds
cpu usage
1114.58
user time
1100.07
system time
14.5132
max virtual memory
3.7840996E7
max residence set size
1.498966E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^3))
output
WORST_CASE(Omega(n^1), O(n^3)) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(n^1, n^3). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 219 ms] (4) CpxRelTRS (5) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxWeightedTrs (7) CpxWeightedTrsRenamingProof [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), 23 ms] (14) CpxTypedWeightedCompleteTrs (15) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] (16) CpxRNTS (17) InliningProof [UPPER BOUND(ID), 576 ms] (18) CpxRNTS (19) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] (20) CpxRNTS (21) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] (22) CpxRNTS (23) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (24) CpxRNTS (25) IntTrsBoundProof [UPPER BOUND(ID), 246 ms] (26) CpxRNTS (27) IntTrsBoundProof [UPPER BOUND(ID), 96 ms] (28) CpxRNTS (29) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (30) CpxRNTS (31) IntTrsBoundProof [UPPER BOUND(ID), 56 ms] (32) CpxRNTS (33) IntTrsBoundProof [UPPER BOUND(ID), 1 ms] (34) CpxRNTS (35) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (36) CpxRNTS (37) IntTrsBoundProof [UPPER BOUND(ID), 39 ms] (38) CpxRNTS (39) IntTrsBoundProof [UPPER BOUND(ID), 3 ms] (40) CpxRNTS (41) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (42) CpxRNTS (43) IntTrsBoundProof [UPPER BOUND(ID), 994 ms] (44) CpxRNTS (45) IntTrsBoundProof [UPPER BOUND(ID), 1087 ms] (46) CpxRNTS (47) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (48) CpxRNTS (49) IntTrsBoundProof [UPPER BOUND(ID), 438 ms] (50) CpxRNTS (51) IntTrsBoundProof [UPPER BOUND(ID), 207 ms] (52) CpxRNTS (53) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (54) CpxRNTS (55) IntTrsBoundProof [UPPER BOUND(ID), 255 ms] (56) CpxRNTS (57) IntTrsBoundProof [UPPER BOUND(ID), 46 ms] (58) CpxRNTS (59) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (60) CpxRNTS (61) IntTrsBoundProof [UPPER BOUND(ID), 77 ms] (62) CpxRNTS (63) IntTrsBoundProof [UPPER BOUND(ID), 0 ms] (64) CpxRNTS (65) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (66) CpxRNTS (67) IntTrsBoundProof [UPPER BOUND(ID), 77 ms] (68) CpxRNTS (69) IntTrsBoundProof [UPPER BOUND(ID), 3 ms] (70) CpxRNTS (71) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (72) CpxRNTS (73) IntTrsBoundProof [UPPER BOUND(ID), 86 ms] (74) CpxRNTS (75) IntTrsBoundProof [UPPER BOUND(ID), 3 ms] (76) CpxRNTS (77) FinalProof [FINISHED, 0 ms] (78) BOUNDS(1, n^3) (79) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (80) CpxRelTRS (81) TypeInferenceProof [BOTH BOUNDS(ID, ID), 7 ms] (82) typed CpxTrs (83) OrderProof [LOWER BOUND(ID), 0 ms] (84) typed CpxTrs (85) RewriteLemmaProof [LOWER BOUND(ID), 265 ms] (86) BEST (87) proven lower bound (88) LowerBoundPropagationProof [FINISHED, 0 ms] (89) BOUNDS(n^1, INF) (90) typed CpxTrs (91) RewriteLemmaProof [LOWER BOUND(ID), 71 ms] (92) BOUNDS(1, INF)
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Derivational Complexity: TRS Innermost