details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	292.340452909 seconds
cpu usage	1140.57319053
max memory	1.068767232E10

stage attributes

key	value
output-size	10975
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), 319 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), 107 ms] (14) BEST (15) proven lower bound (16) LowerBoundPropagationProof [FINISHED, 0 ms] (17) BOUNDS(n^2, INF) (18) typed CpxTrs (19) RewriteLemmaProof [LOWER BOUND(ID), 75 ms] (20) typed CpxTrs (21) RewriteLemmaProof [LOWER BOUND(ID), 2744 ms] (22) BOUNDS(1, INF) ---------------------------------------- (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: plus(x, 0) -> x plus(x, s(y)) -> s(plus(x, y)) times(0, y) -> 0 times(x, 0) -> 0 times(s(x), y) -> plus(times(x, y), y) p(s(s(x))) -> s(p(s(x))) p(s(0)) -> 0 fac(s(x)) -> times(fac(p(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: plus(x, 0') -> x plus(x, s(y)) -> s(plus(x, y)) times(0', y) -> 0' times(x, 0') -> 0' times(s(x), y) -> plus(times(x, y), y) p(s(s(x))) -> s(p(s(x))) p(s(0')) -> 0' fac(s(x)) -> times(fac(p(s(x))), s(x)) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: Innermost TRS: Rules: plus(x, 0') -> x plus(x, s(y)) -> s(plus(x, y)) times(0', y) -> 0' times(x, 0') -> 0' times(s(x), y) -> plus(times(x, y), y) p(s(s(x))) -> s(p(s(x))) p(s(0')) -> 0' fac(s(x)) -> times(fac(p(s(x))), s(x)) popout

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

job log

popout

actions

all output return to Runti Compl Inner Rewri 22807