Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime Complexity: TRS pair #487111504
details
property
value
status
complete
benchmark
2.17.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
SK90
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
7.30996 seconds
cpu usage
25.7121
user time
24.2206
system time
1.49151
max virtual memory
3.7901836E7
max residence set size
4079864.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^1))
output
WORST_CASE(Omega(n^1), O(n^1)) 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^1). (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) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] (14) CpxRNTS (15) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] (16) CpxRNTS (17) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (18) CpxRNTS (19) IntTrsBoundProof [UPPER BOUND(ID), 228 ms] (20) CpxRNTS (21) IntTrsBoundProof [UPPER BOUND(ID), 17 ms] (22) CpxRNTS (23) ResultPropagationProof [UPPER BOUND(ID), 0 ms] (24) CpxRNTS (25) IntTrsBoundProof [UPPER BOUND(ID), 151 ms] (26) CpxRNTS (27) IntTrsBoundProof [UPPER BOUND(ID), 75 ms] (28) CpxRNTS (29) FinalProof [FINISHED, 0 ms] (30) BOUNDS(1, n^1) (31) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (32) CpxTRS (33) SlicingProof [LOWER BOUND(ID), 0 ms] (34) CpxTRS (35) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (36) typed CpxTrs (37) OrderProof [LOWER BOUND(ID), 0 ms] (38) typed CpxTrs (39) RewriteLemmaProof [LOWER BOUND(ID), 1939 ms] (40) BEST (41) proven lower bound (42) LowerBoundPropagationProof [FINISHED, 0 ms] (43) BOUNDS(n^1, INF) (44) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: sum(0) -> 0 sum(s(x)) -> +(sum(x), s(x)) sum1(0) -> 0 sum1(s(x)) -> s(+(sum1(x), +(x, x))) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RcToIrcProof (BOTH BOUNDS(ID, ID)) Converted rc-obligation to irc-obligation. As the TRS does not nest defined symbols, we have rc = irc. ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, n^1). The TRS R consists of the following rules: sum(0) -> 0 sum(s(x)) -> +(sum(x), s(x)) sum1(0) -> 0 sum1(s(x)) -> s(+(sum1(x), +(x, x))) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) RelTrsToWeightedTrsProof (BOTH BOUNDS(ID, ID)) Transformed relative TRS to weighted TRS ---------------------------------------- (4) Obligation:
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runtime Complexity: TRS