details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	292.680043936 seconds
cpu usage	975.83314896
max memory	1.601742848E10

stage attributes

key	value
output-size	6420
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 (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), 441 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), 249 ms] (14) 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: plus(s(s(x)), y) -> s(plus(x, s(y))) plus(x, s(s(y))) -> s(plus(s(x), y)) plus(s(0), y) -> s(y) plus(0, y) -> y ack(0, y) -> s(y) ack(s(x), 0) -> ack(x, s(0)) ack(s(x), s(y)) -> ack(x, plus(y, ack(s(x), 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: plus(s(s(x)), y) -> s(plus(x, s(y))) plus(x, s(s(y))) -> s(plus(s(x), y)) plus(s(0'), y) -> s(y) plus(0', y) -> y ack(0', y) -> s(y) ack(s(x), 0') -> ack(x, s(0')) ack(s(x), s(y)) -> ack(x, plus(y, ack(s(x), y))) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: Innermost TRS: Rules: plus(s(s(x)), y) -> s(plus(x, s(y))) plus(x, s(s(y))) -> s(plus(s(x), y)) plus(s(0'), y) -> s(y) plus(0', y) -> y ack(0', y) -> s(y) ack(s(x), 0') -> ack(x, s(0')) ack(s(x), s(y)) -> ack(x, plus(y, ack(s(x), y))) Types: plus :: s:0' -> s:0' -> s:0' s :: s:0' -> s:0' 0' :: s:0' ack :: s:0' -> s:0' -> s:0' hole_s:0'1_0 :: s:0' gen_s:0'2_0 :: Nat -> s:0' ---------------------------------------- popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807