details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.5218 seconds
cpu usage	3.2652
user time	3.12388
system time	0.141315
max virtual memory	1.827736E7
max residence set size	214148.0

stage attributes

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

output

WORST_CASE(?, O(1)) proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Runtime Complexity (full) 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 (full) of the given CpxTRS could be proven to be BOUNDS(1, 1). The TRS R consists of the following rules: g(X) -> u(h(X), h(X), X) u(d, c(Y), X) -> k(Y) h(d) -> c(a) h(d) -> c(b) f(k(a), k(b), X) -> f(X, X, X) S is empty. Rewrite Strategy: FULL ---------------------------------------- (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: f(k(a), k(b), x0) ->^* f(x0, x0, x0) h(d) ->^* c(b) h(d) ->^* c(a) u(d, c(x0), x1) ->^* k(x0) g(d) ->^* u(c(b), c(b), d) g(d) ->^* u(c(a), c(b), d) g(d) ->^* u(c(b), c(a), d) g(d) ->^* u(c(a), c(a), d) ---------------------------------------- (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