details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	291.595842123 seconds
cpu usage	1115.74379681
max memory	1.7168338944E10

stage attributes

key	value
output-size	10287
starexec-result	WORST_CASE(Omega(n^2), ?)

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^2), ?) 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^2, 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), 274 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), 81 ms] (14) typed CpxTrs (15) RewriteLemmaProof [LOWER BOUND(ID), 62 ms] (16) BEST (17) proven lower bound (18) LowerBoundPropagationProof [FINISHED, 0 ms] (19) BOUNDS(n^2, INF) (20) typed CpxTrs ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(n^2, INF). The TRS R consists of the following rules: -(x, 0) -> x -(s(x), s(y)) -> -(x, y) +(0, y) -> y +(s(x), y) -> s(+(x, y)) *(x, 0) -> 0 *(x, s(y)) -> +(x, *(x, y)) p(s(x)) -> x f(s(x)) -> f(-(p(*(s(x), s(x))), *(s(x), s(x)))) 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^2, INF). The TRS R consists of the following rules: -(x, 0') -> x -(s(x), s(y)) -> -(x, y) +'(0', y) -> y +'(s(x), y) -> s(+'(x, y)) *'(x, 0') -> 0' *'(x, s(y)) -> +'(x, *'(x, y)) p(s(x)) -> x f(s(x)) -> f(-(p(*'(s(x), s(x))), *'(s(x), s(x)))) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: Innermost TRS: Rules: -(x, 0') -> x -(s(x), s(y)) -> -(x, y) +'(0', y) -> y +'(s(x), y) -> s(+'(x, y)) *'(x, 0') -> 0' *'(x, s(y)) -> +'(x, *'(x, y)) p(s(x)) -> x f(s(x)) -> f(-(p(*'(s(x), s(x))), *'(s(x), s(x)))) Types: popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807