details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	294.506 seconds
cpu usage	1148.69
user time	1137.11
system time	11.5833
max virtual memory	1.8813672E7
max residence set size	1.4921472E7

stage attributes

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

output

WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 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), 68.3 s] (8) BEST (9) proven lower bound (10) LowerBoundPropagationProof [FINISHED, 0 ms] (11) BOUNDS(n^1, INF) (12) typed CpxTrs (13) RewriteLemmaProof [LOWER BOUND(ID), 1180 ms] (14) 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: a__sel(s(X), cons(Y, Z)) -> a__sel(mark(X), mark(Z)) a__sel(0, cons(X, Z)) -> mark(X) a__first(0, Z) -> nil a__first(s(X), cons(Y, Z)) -> cons(mark(Y), first(X, Z)) a__from(X) -> cons(mark(X), from(s(X))) a__sel1(s(X), cons(Y, Z)) -> a__sel1(mark(X), mark(Z)) a__sel1(0, cons(X, Z)) -> a__quote(X) a__first1(0, Z) -> nil1 a__first1(s(X), cons(Y, Z)) -> cons1(a__quote(Y), a__first1(mark(X), mark(Z))) a__quote(0) -> 01 a__quote1(cons(X, Z)) -> cons1(a__quote(X), a__quote1(Z)) a__quote1(nil) -> nil1 a__quote(s(X)) -> s1(a__quote(X)) a__quote(sel(X, Z)) -> a__sel1(mark(X), mark(Z)) a__quote1(first(X, Z)) -> a__first1(mark(X), mark(Z)) a__unquote(01) -> 0 a__unquote(s1(X)) -> s(a__unquote(mark(X))) a__unquote1(nil1) -> nil a__unquote1(cons1(X, Z)) -> a__fcons(a__unquote(mark(X)), a__unquote1(mark(Z))) a__fcons(X, Z) -> cons(mark(X), Z) mark(sel(X1, X2)) -> a__sel(mark(X1), mark(X2)) mark(first(X1, X2)) -> a__first(mark(X1), mark(X2)) mark(from(X)) -> a__from(mark(X)) mark(sel1(X1, X2)) -> a__sel1(mark(X1), mark(X2)) mark(quote(X)) -> a__quote(X) mark(first1(X1, X2)) -> a__first1(mark(X1), mark(X2)) mark(quote1(X)) -> a__quote1(X) mark(unquote(X)) -> a__unquote(mark(X)) mark(unquote1(X)) -> a__unquote1(mark(X)) mark(fcons(X1, X2)) -> a__fcons(mark(X1), mark(X2)) mark(s(X)) -> s(mark(X)) mark(cons(X1, X2)) -> cons(mark(X1), X2) mark(0) -> 0 mark(nil) -> nil mark(nil1) -> nil1 mark(cons1(X1, X2)) -> cons1(mark(X1), mark(X2)) mark(01) -> 01 mark(s1(X)) -> s1(mark(X)) a__sel(X1, X2) -> sel(X1, X2) a__first(X1, X2) -> first(X1, X2) a__from(X) -> from(X) a__sel1(X1, X2) -> sel1(X1, X2) a__quote(X) -> quote(X) a__first1(X1, X2) -> first1(X1, X2) a__quote1(X) -> quote1(X) a__unquote(X) -> unquote(X) a__unquote1(X) -> unquote1(X) a__fcons(X1, X2) -> fcons(X1, X2) 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: a__sel(s(X), cons(Y, Z)) -> a__sel(mark(X), mark(Z)) a__sel(0', cons(X, Z)) -> mark(X) a__first(0', Z) -> nil popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS Innermost