Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Derivational Complexity: TRS Innermost pair #487108056
details
property
value
status
complete
benchmark
divExp.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n142.star.cs.uiowa.edu
space
Secret_06_TRS
run statistics
property
value
solver
AProVE
configuration
rcdcRelativeAlsoLower
runtime (wallclock)
292.836 seconds
cpu usage
1111.01
user time
1097.36
system time
13.6485
max virtual memory
3.7850232E7
max residence set size
1.4871396E7
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^4))
output
WORST_CASE(Omega(n^1), O(n^4)) proof of /export/starexec/sandbox2/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^4). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 194 ms] (4) CpxRelTRS (5) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxWeightedTrs (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (8) CpxTypedWeightedTrs (9) CompletionProof [UPPER BOUND(ID), 0 ms] (10) CpxTypedWeightedCompleteTrs (11) NarrowingProof [BOTH BOUNDS(ID, ID), 344 ms] (12) CpxTypedWeightedCompleteTrs (13) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] (14) CpxRNTS (15) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] (16) CpxRNTS (17) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] (18) CpxRNTS (19) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (20) CpxRNTS (21) IntTrsBoundProof [UPPER BOUND(ID), 424 ms] (22) CpxRNTS (23) IntTrsBoundProof [UPPER BOUND(ID), 189 ms] (24) CpxRNTS (25) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (26) CpxRNTS (27) IntTrsBoundProof [UPPER BOUND(ID), 69 ms] (28) CpxRNTS (29) IntTrsBoundProof [UPPER BOUND(ID), 34 ms] (30) CpxRNTS (31) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (32) CpxRNTS (33) IntTrsBoundProof [UPPER BOUND(ID), 757 ms] (34) CpxRNTS (35) IntTrsBoundProof [UPPER BOUND(ID), 429 ms] (36) CpxRNTS (37) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (38) CpxRNTS (39) IntTrsBoundProof [UPPER BOUND(ID), 264 ms] (40) CpxRNTS (41) IntTrsBoundProof [UPPER BOUND(ID), 55 ms] (42) CpxRNTS (43) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (44) CpxRNTS (45) IntTrsBoundProof [UPPER BOUND(ID), 240 ms] (46) CpxRNTS (47) IntTrsBoundProof [UPPER BOUND(ID), 185 ms] (48) CpxRNTS (49) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (50) CpxRNTS (51) IntTrsBoundProof [UPPER BOUND(ID), 189 ms] (52) CpxRNTS (53) IntTrsBoundProof [UPPER BOUND(ID), 3 ms] (54) CpxRNTS (55) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (56) CpxRNTS (57) IntTrsBoundProof [UPPER BOUND(ID), 118 ms] (58) CpxRNTS (59) IntTrsBoundProof [UPPER BOUND(ID), 2 ms] (60) CpxRNTS (61) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (62) CpxRNTS (63) IntTrsBoundProof [UPPER BOUND(ID), 98 ms] (64) CpxRNTS (65) IntTrsBoundProof [UPPER BOUND(ID), 3 ms] (66) CpxRNTS (67) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (68) CpxRNTS (69) IntTrsBoundProof [UPPER BOUND(ID), 190 ms] (70) CpxRNTS (71) IntTrsBoundProof [UPPER BOUND(ID), 1 ms] (72) CpxRNTS (73) FinalProof [FINISHED, 0 ms] (74) BOUNDS(1, n^4) (75) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (76) CpxRelTRS (77) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (78) typed CpxTrs (79) OrderProof [LOWER BOUND(ID), 0 ms] (80) typed CpxTrs (81) RewriteLemmaProof [LOWER BOUND(ID), 292 ms] (82) BEST (83) proven lower bound (84) LowerBoundPropagationProof [FINISHED, 0 ms] (85) BOUNDS(n^1, INF) (86) typed CpxTrs (87) RewriteLemmaProof [LOWER BOUND(ID), 59 ms] (88) 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