details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	292.70532012 seconds
cpu usage	1124.43606709
max memory	1.5275864064E10

stage attributes

key	value
output-size	12213
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), 318 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), 63 ms] (14) typed CpxTrs (15) RewriteLemmaProof [LOWER BOUND(ID), 384 ms] (16) typed CpxTrs ---------------------------------------- (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: minus(minus(x, y), z) -> minus(x, plus(y, z)) minus(0, y) -> 0 minus(x, 0) -> x minus(s(x), s(y)) -> minus(x, y) plus(0, y) -> y plus(s(x), y) -> plus(x, s(y)) plus(s(x), y) -> s(plus(y, x)) zero(s(x)) -> false zero(0) -> true p(s(x)) -> x p(0) -> 0 div(x, y) -> quot(x, y, 0) quot(s(x), s(y), z) -> quot(minus(p(ack(0, x)), y), s(y), s(z)) quot(0, s(y), z) -> z ack(0, x) -> s(x) ack(0, x) -> plus(x, s(0)) ack(s(x), 0) -> ack(x, s(0)) ack(s(x), s(y)) -> ack(x, ack(s(x), y)) 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: minus(minus(x, y), z) -> minus(x, plus(y, z)) minus(0', y) -> 0' minus(x, 0') -> x minus(s(x), s(y)) -> minus(x, y) plus(0', y) -> y plus(s(x), y) -> plus(x, s(y)) plus(s(x), y) -> s(plus(y, x)) zero(s(x)) -> false zero(0') -> true p(s(x)) -> x p(0') -> 0' div(x, y) -> quot(x, y, 0') quot(s(x), s(y), z) -> quot(minus(p(ack(0', x)), y), s(y), s(z)) quot(0', s(y), z) -> z ack(0', x) -> s(x) ack(0', x) -> plus(x, s(0')) ack(s(x), 0') -> ack(x, s(0')) ack(s(x), s(y)) -> ack(x, ack(s(x), y)) S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127