Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381903987
details
property
value
status
complete
benchmark
log.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n035.star.cs.uiowa.edu
space
AProVE_08
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.542281866 seconds
cpu usage
1121.90555823
max memory
1.67794688E10
stage attributes
key
value
output-size
6302
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 (innermost) 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), 282 ms] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: p(0) -> 0 p(s(x)) -> x minus(x, 0) -> x minus(s(x), s(y)) -> minus(x, y) minus(x, s(y)) -> p(minus(x, y)) div(0, s(y)) -> 0 div(s(x), s(y)) -> s(div(minus(s(x), s(y)), s(y))) log(s(0), s(s(y))) -> 0 log(s(s(x)), s(s(y))) -> s(log(div(minus(x, y), s(s(y))), s(s(y)))) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) RenamingProof (BOTH BOUNDS(ID, ID)) Renamed function symbols to avoid clashes with predefined symbol. ---------------------------------------- (2) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: p(0') -> 0' p(s(x)) -> x minus(x, 0') -> x minus(s(x), s(y)) -> minus(x, y) minus(x, s(y)) -> p(minus(x, y)) div(0', s(y)) -> 0' div(s(x), s(y)) -> s(div(minus(s(x), s(y)), s(y))) log(s(0'), s(s(y))) -> 0' log(s(s(x)), s(s(y))) -> s(log(div(minus(x, y), s(s(y))), s(s(y)))) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: Innermost TRS: Rules: p(0') -> 0' p(s(x)) -> x minus(x, 0') -> x minus(s(x), s(y)) -> minus(x, y) minus(x, s(y)) -> p(minus(x, y)) div(0', s(y)) -> 0' div(s(x), s(y)) -> s(div(minus(s(x), s(y)), s(y))) log(s(0'), s(s(y))) -> 0' log(s(s(x)), s(s(y))) -> s(log(div(minus(x, y), s(s(y))), s(s(y)))) Types: p :: 0':s -> 0':s 0' :: 0':s s :: 0':s -> 0':s minus :: 0':s -> 0':s -> 0':s div :: 0':s -> 0':s -> 0':s
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807