details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.525 seconds
cpu usage	982.2
user time	976.745
system time	5.45538
max virtual memory	1.9092668E7
max residence set size	6777620.0

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) 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), 261 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), 92 ms] (16) BOUNDS(1, INF) ---------------------------------------- (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: int(0, 0) -> .(0, nil) int(0, s(y)) -> .(0, int(s(0), s(y))) int(s(x), 0) -> nil int(s(x), s(y)) -> int_list(int(x, y)) int_list(nil) -> nil int_list(.(x, y)) -> .(s(x), int_list(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^1, INF). The TRS R consists of the following rules: int(0', 0') -> .(0', nil) int(0', s(y)) -> .(0', int(s(0'), s(y))) int(s(x), 0') -> nil int(s(x), s(y)) -> int_list(int(x, y)) int_list(nil) -> nil int_list(.(x, y)) -> .(s(x), int_list(y)) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) SlicingProof (LOWER BOUND(ID)) Sliced the following arguments: ./0 ---------------------------------------- (4) 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: int(0', 0') -> .(nil) int(0', s(y)) -> .(int(s(0'), s(y))) int(s(x), 0') -> nil int(s(x), s(y)) -> int_list(int(x, y)) int_list(nil) -> nil int_list(.(y)) -> .(int_list(y)) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (5) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (6) Obligation: Innermost TRS: Rules: popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS Innermost