Spaces
Explore
Communities
Statistics
Reports
Cluster
Status
Help
Runti Compl Full Rewri 10127 pair #381903254
details
property
value
status
complete
benchmark
Ex8_BLR02_GM.xml
ran by
Akihisa Yamada
cpu timeout
1200 seconds
wallclock timeout
300 seconds
memory limit
137438953472 bytes
execution host
n074.star.cs.uiowa.edu
space
Transformed_CSR_04
run statistics
property
value
solver
AProVE
configuration
complexity
runtime (wallclock)
1.62712311745 seconds
cpu usage
3.743755559
max memory
2.4098816E8
stage attributes
key
value
output-size
6299
starexec-result
WORST_CASE(NON_POLY, ?)
output
/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) 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(EXP, INF). (0) CpxTRS (1) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (2) TRS for Loop Detection (3) DecreasingLoopProof [LOWER BOUND(ID), 0 ms] (4) BEST (5) proven lower bound (6) LowerBoundPropagationProof [FINISHED, 0 ms] (7) BOUNDS(n^1, INF) (8) TRS for Loop Detection (9) DecreasingLoopProof [FINISHED, 47 ms] (10) BOUNDS(EXP, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). The TRS R consists of the following rules: a__fib(N) -> a__sel(mark(N), a__fib1(s(0), s(0))) a__fib1(X, Y) -> cons(mark(X), fib1(Y, add(X, Y))) a__add(0, X) -> mark(X) a__add(s(X), Y) -> s(a__add(mark(X), mark(Y))) a__sel(0, cons(X, XS)) -> mark(X) a__sel(s(N), cons(X, XS)) -> a__sel(mark(N), mark(XS)) mark(fib(X)) -> a__fib(mark(X)) mark(sel(X1, X2)) -> a__sel(mark(X1), mark(X2)) mark(fib1(X1, X2)) -> a__fib1(mark(X1), mark(X2)) mark(add(X1, X2)) -> a__add(mark(X1), mark(X2)) mark(s(X)) -> s(mark(X)) mark(0) -> 0 mark(cons(X1, X2)) -> cons(mark(X1), X2) a__fib(X) -> fib(X) a__sel(X1, X2) -> sel(X1, X2) a__fib1(X1, X2) -> fib1(X1, X2) a__add(X1, X2) -> add(X1, X2) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) RelTrsToDecreasingLoopProblemProof (LOWER BOUND(ID)) Transformed a relative TRS into a decreasing-loop problem. ---------------------------------------- (2) Obligation: Analyzing the following TRS for decreasing loops: The Runtime Complexity (full) of the given CpxTRS could be proven to be BOUNDS(EXP, INF). The TRS R consists of the following rules: a__fib(N) -> a__sel(mark(N), a__fib1(s(0), s(0))) a__fib1(X, Y) -> cons(mark(X), fib1(Y, add(X, Y))) a__add(0, X) -> mark(X) a__add(s(X), Y) -> s(a__add(mark(X), mark(Y))) a__sel(0, cons(X, XS)) -> mark(X) a__sel(s(N), cons(X, XS)) -> a__sel(mark(N), mark(XS)) mark(fib(X)) -> a__fib(mark(X)) mark(sel(X1, X2)) -> a__sel(mark(X1), mark(X2)) mark(fib1(X1, X2)) -> a__fib1(mark(X1), mark(X2)) mark(add(X1, X2)) -> a__add(mark(X1), mark(X2)) mark(s(X)) -> s(mark(X)) mark(0) -> 0 mark(cons(X1, X2)) -> cons(mark(X1), X2) a__fib(X) -> fib(X) a__sel(X1, X2) -> sel(X1, X2) a__fib1(X1, X2) -> fib1(X1, X2) a__add(X1, X2) -> add(X1, X2) S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) DecreasingLoopProof (LOWER BOUND(ID)) The following loop(s) give(s) rise to the lower bound Omega(n^1): The rewrite sequence mark(fib1(X1, X2)) ->^+ a__fib1(mark(X1), mark(X2)) gives rise to a decreasing loop by considering the right hand sides subterm at position [0].
popout
output may be truncated. 'popout' for the full output.
job log
popout
actions
all output
return to Runti Compl Full Rewri 10127