Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runtime_Complexity_Innermost_Rewriting 2019-04-01 06.40 pair #433313732
details
property
value
status
complete
benchmark
thiemann15.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n150.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.585 seconds
cpu usage
982.844
user time
977.864
system time
4.98088
max virtual memory
3.8363432E7
max residence set size
5760688.0
stage attributes
key
value
starexec-result
WORST_CASE(Omega(n^1), O(n^2))
output
982.41/291.50 WORST_CASE(Omega(n^1), O(n^2)) 982.69/291.53 proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml 982.69/291.53 # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty 982.69/291.53 982.69/291.53 982.69/291.53 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^2). 982.69/291.53 982.69/291.53 (0) CpxTRS 982.69/291.53 (1) RelTrsToWeightedTrsProof [BOTH BOUNDS(ID, ID), 0 ms] 982.69/291.53 (2) CpxWeightedTrs 982.69/291.53 (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] 982.69/291.53 (4) CpxTypedWeightedTrs 982.69/291.53 (5) CompletionProof [UPPER BOUND(ID), 0 ms] 982.69/291.53 (6) CpxTypedWeightedCompleteTrs 982.69/291.53 (7) NarrowingProof [BOTH BOUNDS(ID, ID), 0 ms] 982.69/291.53 (8) CpxTypedWeightedCompleteTrs 982.69/291.53 (9) CpxTypedWeightedTrsToRntsProof [UPPER BOUND(ID), 0 ms] 982.69/291.53 (10) CpxRNTS 982.69/291.53 (11) InliningProof [UPPER BOUND(ID), 75 ms] 982.69/291.53 (12) CpxRNTS 982.69/291.53 (13) SimplificationProof [BOTH BOUNDS(ID, ID), 0 ms] 982.69/291.53 (14) CpxRNTS 982.69/291.53 (15) CpxRntsAnalysisOrderProof [BOTH BOUNDS(ID, ID), 0 ms] 982.69/291.53 (16) CpxRNTS 982.69/291.53 (17) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 982.69/291.53 (18) CpxRNTS 982.69/291.53 (19) IntTrsBoundProof [UPPER BOUND(ID), 177 ms] 982.69/291.53 (20) CpxRNTS 982.69/291.53 (21) IntTrsBoundProof [UPPER BOUND(ID), 88 ms] 982.69/291.53 (22) CpxRNTS 982.69/291.53 (23) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 982.69/291.53 (24) CpxRNTS 982.69/291.53 (25) IntTrsBoundProof [UPPER BOUND(ID), 177 ms] 982.69/291.53 (26) CpxRNTS 982.69/291.53 (27) IntTrsBoundProof [UPPER BOUND(ID), 75 ms] 982.69/291.53 (28) CpxRNTS 982.69/291.53 (29) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 982.69/291.53 (30) CpxRNTS 982.69/291.53 (31) IntTrsBoundProof [UPPER BOUND(ID), 127 ms] 982.69/291.53 (32) CpxRNTS 982.69/291.53 (33) IntTrsBoundProof [UPPER BOUND(ID), 0 ms] 982.69/291.53 (34) CpxRNTS 982.69/291.53 (35) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 982.69/291.53 (36) CpxRNTS 982.69/291.53 (37) IntTrsBoundProof [UPPER BOUND(ID), 157 ms] 982.69/291.53 (38) CpxRNTS 982.69/291.53 (39) IntTrsBoundProof [UPPER BOUND(ID), 52 ms] 982.69/291.53 (40) CpxRNTS 982.69/291.53 (41) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 982.69/291.53 (42) CpxRNTS 982.69/291.53 (43) IntTrsBoundProof [UPPER BOUND(ID), 1703 ms] 982.69/291.53 (44) CpxRNTS 982.69/291.53 (45) IntTrsBoundProof [UPPER BOUND(ID), 684 ms] 982.69/291.53 (46) CpxRNTS 982.69/291.53 (47) ResultPropagationProof [UPPER BOUND(ID), 0 ms] 982.69/291.53 (48) CpxRNTS 982.69/291.53 (49) IntTrsBoundProof [UPPER BOUND(ID), 87 ms] 982.69/291.53 (50) CpxRNTS 982.69/291.53 (51) IntTrsBoundProof [UPPER BOUND(ID), 0 ms] 982.69/291.53 (52) CpxRNTS 982.69/291.53 (53) FinalProof [FINISHED, 0 ms] 982.69/291.53 (54) BOUNDS(1, n^2) 982.69/291.53 (55) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] 982.69/291.53 (56) TRS for Loop Detection 982.69/291.53 (57) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] 982.69/291.53 (58) BEST 982.69/291.53 (59) proven lower bound 982.69/291.53 (60) LowerBoundPropagationProof [FINISHED, 0 ms] 982.69/291.53 (61) BOUNDS(n^1, INF) 982.69/291.53 (62) TRS for Loop Detection 982.69/291.53 982.69/291.53 982.69/291.53 ---------------------------------------- 982.69/291.53 982.69/291.53 (0) 982.69/291.53 Obligation: 982.69/291.53 The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, n^2). 982.69/291.53 982.69/291.53 982.69/291.53 The TRS R consists of the following rules: 982.69/291.53 982.69/291.53 half(0) -> 0 982.69/291.53 half(s(0)) -> 0 982.69/291.53 half(s(s(x))) -> s(half(x)) 982.69/291.53 inc(0) -> 0 982.69/291.53 inc(s(x)) -> s(inc(x)) 982.69/291.53 zero(0) -> true 982.69/291.53 zero(s(x)) -> false 982.69/291.53 p(0) -> 0 982.69/291.53 p(s(x)) -> x 982.69/291.53 bits(x) -> bitIter(x, 0) 982.69/291.53 bitIter(x, y) -> if(zero(x), x, inc(y)) 982.69/291.53 if(true, x, y) -> p(y) 982.69/291.53 if(false, x, y) -> bitIter(half(x), y) 982.69/291.53 982.69/291.53 S is empty. 982.69/291.53 Rewrite Strategy: INNERMOST 982.69/291.53 ---------------------------------------- 982.69/291.53 982.69/291.53 (1) RelTrsToWeightedTrsProof (BOTH BOUNDS(ID, ID))
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