details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	292.167087078 seconds
cpu usage	312.212145906
max memory	5.205241856E9

stage attributes

key	value
output-size	8397
starexec-result	WORST_CASE(Omega(n^1), ?)

output

/export/starexec/sandbox2/solver/bin/starexec_run_complexity /export/starexec/sandbox2/benchmark/theBenchmark.xml /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox2/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), 311 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), 1253 ms] (14) typed CpxTrs (15) RewriteLemmaProof [LOWER BOUND(ID), 1992 ms] (16) typed CpxTrs (17) RewriteLemmaProof [LOWER BOUND(ID), 2498 ms] (18) BOUNDS(1, INF) ---------------------------------------- (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: -(x, 0) -> x -(0, s(y)) -> 0 -(s(x), s(y)) -> -(x, y) f(0) -> 0 f(s(x)) -> -(s(x), g(f(x))) g(0) -> s(0) g(s(x)) -> -(s(x), f(g(x))) 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: -(x, 0') -> x -(0', s(y)) -> 0' -(s(x), s(y)) -> -(x, y) f(0') -> 0' f(s(x)) -> -(s(x), g(f(x))) g(0') -> s(0') g(s(x)) -> -(s(x), f(g(x))) S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) TypeInferenceProof (BOTH BOUNDS(ID, ID)) Infered types. ---------------------------------------- (4) Obligation: TRS: Rules: -(x, 0') -> x -(0', s(y)) -> 0' -(s(x), s(y)) -> -(x, y) f(0') -> 0' f(s(x)) -> -(s(x), g(f(x))) g(0') -> s(0') g(s(x)) -> -(s(x), f(g(x))) Types: - :: 0':s -> 0':s -> 0':s 0' :: 0':s s :: 0':s -> 0':s f :: 0':s -> 0':s g :: 0':s -> 0':s popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127