details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.51936 seconds
cpu usage	3.32019
user time	3.17088
system time	0.149306
max virtual memory	1.8275312E7
max residence set size	225624.0

stage attributes

key	value
starexec-result	WORST_CASE(?, O(1))

output

WORST_CASE(?, O(1)) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, 1). (0) CpxTRS (1) NarrowingOnBasicTermsTerminatesProof [FINISHED, 0 ms] (2) BOUNDS(1, 1) ---------------------------------------- (0) Obligation: The Runtime Complexity (innermost) of the given CpxTRS could be proven to be BOUNDS(1, 1). The TRS R consists of the following rules: p(f(f(x))) -> q(f(g(x))) p(g(g(x))) -> q(g(f(x))) q(f(f(x))) -> p(f(g(x))) q(g(g(x))) -> p(g(f(x))) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) NarrowingOnBasicTermsTerminatesProof (FINISHED) Constant runtime complexity proven by termination of constructor-based narrowing. The maximal most general narrowing sequences give rise to the following rewrite sequences: q(g(g(x0))) ->^* p(g(f(x0))) q(f(f(x0))) ->^* p(f(g(x0))) p(g(g(x0))) ->^* q(g(f(x0))) p(f(f(x0))) ->^* q(f(g(x0))) ---------------------------------------- (2) BOUNDS(1, 1) popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS Innermost