Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904564
details
property
value
status
complete
benchmark
power.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n034.star.cs.uiowa.edu
space
Frederiksen_Glenstrup
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.615711927 seconds
cpu usage
769.09569262
max memory
6.351609856E9
stage attributes
key
value
output-size
11079
starexec-result
WORST_CASE(Omega(n^3), ?)
output
/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^3), ?) proof of /export/starexec/sandbox/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^3, INF). (0) CpxTRS (1) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxTRS (3) SlicingProof [LOWER BOUND(ID), 0 ms] (4) CpxTRS (5) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (6) typed CpxTrs (7) OrderProof [LOWER BOUND(ID), 0 ms] (8) typed CpxTrs (9) RewriteLemmaProof [LOWER BOUND(ID), 301 ms] (10) BEST (11) proven lower bound (12) LowerBoundPropagationProof [FINISHED, 0 ms] (13) BOUNDS(n^1, INF) (14) typed CpxTrs (15) RewriteLemmaProof [LOWER BOUND(ID), 86 ms] (16) BEST (17) proven lower bound (18) LowerBoundPropagationProof [FINISHED, 0 ms] (19) BOUNDS(n^3, INF) (20) typed CpxTrs (21) RewriteLemmaProof [LOWER BOUND(ID), 565 ms] (22) BOUNDS(1, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^3, INF). The TRS R consists of the following rules: power(x', Cons(x, xs)) -> mult(x', power(x', xs)) mult(x', Cons(x, xs)) -> add0(x', mult(x', xs)) add0(x', Cons(x, xs)) -> Cons(Cons(Nil, Nil), add0(x', xs)) power(x, Nil) -> Cons(Nil, Nil) mult(x, Nil) -> Nil add0(x, Nil) -> x goal(x, y) -> power(x, 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^3, INF). The TRS R consists of the following rules: power(x', Cons(x, xs)) -> mult(x', power(x', xs)) mult(x', Cons(x, xs)) -> add0(x', mult(x', xs)) add0(x', Cons(x, xs)) -> Cons(Cons(Nil, Nil), add0(x', xs)) power(x, Nil) -> Cons(Nil, Nil) mult(x, Nil) -> Nil add0(x, Nil) -> x goal(x, y) -> power(x, y) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) SlicingProof (LOWER BOUND(ID)) Sliced the following arguments: Cons/0 ---------------------------------------- (4) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^3, INF). The TRS R consists of the following rules: power(x', Cons(xs)) -> mult(x', power(x', xs)) mult(x', Cons(xs)) -> add0(x', mult(x', xs)) add0(x', Cons(xs)) -> Cons(add0(x', xs)) power(x, Nil) -> Cons(Nil) mult(x, Nil) -> Nil
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807