Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903151
details
property
value
status
complete
benchmark
thiemann20.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n051.star.cs.uiowa.edu
space
AProVE_07
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.419360161 seconds
cpu usage
310.18814979
max memory
5.348192256E9
stage attributes
key
value
output-size
10458
starexec-result
WORST_CASE(Omega(n^1), ?)
output
/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). (0) CpxTRS (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxTRS (3) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (4) typed CpxTrs (5) OrderProof [LOWER BOUND(ID), 0 ms] (6) typed CpxTrs (7) RewriteLemmaProof [LOWER BOUND(ID), 251 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) typed CpxTrs (13) RewriteLemmaProof [LOWER BOUND(ID), 86 ms] (14) typed CpxTrs (15) RewriteLemmaProof [LOWER BOUND(ID), 98 ms] (16) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: gt(0, y) -> false gt(s(x), 0) -> true gt(s(x), s(y)) -> gt(x, y) plus(0, y) -> y plus(s(x), y) -> s(plus(x, y)) double(0) -> 0 double(s(x)) -> s(s(double(x))) average(x, y) -> aver(plus(x, y), 0) aver(sum, z) -> if(gt(sum, double(z)), sum, z) if(true, sum, z) -> aver(sum, s(z)) if(false, sum, z) -> z S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RenamingProof (BOTH BOUNDS(ID, ID)) Renamed function symbols to avoid clashes with predefined symbol. ---------------------------------------- (2) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: gt(0', y) -> false gt(s(x), 0') -> true gt(s(x), s(y)) -> gt(x, y) plus(0', y) -> y plus(s(x), y) -> s(plus(x, y)) double(0') -> 0' double(s(x)) -> s(s(double(x))) average(x, y) -> aver(plus(x, y), 0') aver(sum, z) -> if(gt(sum, double(z)), sum, z) if(true, sum, z) -> aver(sum, s(z)) if(false, sum, z) -> z S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: TRS: Rules: gt(0', y) -> false gt(s(x), 0') -> true gt(s(x), s(y)) -> gt(x, y) plus(0', y) -> y plus(s(x), y) -> s(plus(x, y)) double(0') -> 0' double(s(x)) -> s(s(double(x))) average(x, y) -> aver(plus(x, y), 0')
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127