Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Inner Rewri 22807 pair #381904267
details
property
value
status
complete
benchmark
factorial2.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
AProVE_06
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
291.521960974 seconds
cpu usage
1131.33750707
max memory
1.4703755264E10
stage attributes
key
value
output-size
16747
starexec-result
WORST_CASE(Omega(n^3), ?)
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^3), ?) 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^3, 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), 317 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), 73 ms] (14) BEST (15) proven lower bound (16) LowerBoundPropagationProof [FINISHED, 0 ms] (17) BOUNDS(n^2, INF) (18) typed CpxTrs (19) RewriteLemmaProof [LOWER BOUND(ID), 595 ms] (20) typed CpxTrs (21) RewriteLemmaProof [LOWER BOUND(ID), 299 ms] (22) proven lower bound (23) LowerBoundPropagationProof [FINISHED, 0 ms] (24) BOUNDS(n^3, 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: plus(0, x) -> x plus(s(x), y) -> s(plus(x, y)) times(0, y) -> 0 times(s(x), y) -> plus(y, times(x, y)) p(s(x)) -> x p(0) -> 0 minus(x, 0) -> x minus(0, x) -> 0 minus(x, s(y)) -> p(minus(x, y)) isZero(0) -> true isZero(s(x)) -> false facIter(x, y) -> if(isZero(x), minus(x, s(0)), y, times(y, x)) if(true, x, y, z) -> y if(false, x, y, z) -> facIter(x, z) factorial(x) -> facIter(x, s(0)) 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: plus(0', x) -> x plus(s(x), y) -> s(plus(x, y)) times(0', y) -> 0' times(s(x), y) -> plus(y, times(x, y)) p(s(x)) -> x p(0') -> 0' minus(x, 0') -> x minus(0', x) -> 0' minus(x, s(y)) -> p(minus(x, y)) isZero(0') -> true isZero(s(x)) -> false facIter(x, y) -> if(isZero(x), minus(x, s(0')), y, times(y, x)) if(true, x, y, z) -> y if(false, x, y, z) -> facIter(x, z) factorial(x) -> facIter(x, s(0')) S is empty. Rewrite Strategy: INNERMOST ----------------------------------------
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Inner Rewri 22807