details

property	value
status	complete
benchmark	Ex8_BLR02_Z.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n069.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	292.041484118 seconds
cpu usage	315.134600758
max memory	6.285344768E9

stage attributes

key	value
output-size	8052
starexec-result	WORST_CASE(Omega(n^1), ?)

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^1), ?) proof of /export/starexec/sandbox/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), 210 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), 52 ms] (14) BOUNDS(1, INF) ---------------------------------------- (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: fib(N) -> sel(N, fib1(s(0), s(0))) fib1(X, Y) -> cons(X, n__fib1(Y, add(X, Y))) add(0, X) -> X add(s(X), Y) -> s(add(X, Y)) sel(0, cons(X, XS)) -> X sel(s(N), cons(X, XS)) -> sel(N, activate(XS)) fib1(X1, X2) -> n__fib1(X1, X2) activate(n__fib1(X1, X2)) -> fib1(X1, X2) activate(X) -> X 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: fib(N) -> sel(N, fib1(s(0'), s(0'))) fib1(X, Y) -> cons(X, n__fib1(Y, add(X, Y))) add(0', X) -> X add(s(X), Y) -> s(add(X, Y)) sel(0', cons(X, XS)) -> X sel(s(N), cons(X, XS)) -> sel(N, activate(XS)) fib1(X1, X2) -> n__fib1(X1, X2) activate(n__fib1(X1, X2)) -> fib1(X1, X2) activate(X) -> X S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: TRS: Rules: fib(N) -> sel(N, fib1(s(0'), s(0'))) fib1(X, Y) -> cons(X, n__fib1(Y, add(X, Y))) add(0', X) -> X add(s(X), Y) -> s(add(X, Y)) sel(0', cons(X, XS)) -> X sel(s(N), cons(X, XS)) -> sel(N, activate(XS)) fib1(X1, X2) -> n__fib1(X1, X2) activate(n__fib1(X1, X2)) -> fib1(X1, X2) activate(X) -> X Types: fib :: 0':s -> 0':s sel :: 0':s -> n__fib1:cons -> 0':s fib1 :: 0':s -> 0':s -> n__fib1:cons popout

output may be truncated. 'popout' for the full output.

job log

popout

actions

all output return to Runti Compl Full Rewri 10127