details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.53295 seconds
cpu usage	3.35873
user time	3.20094
system time	0.15779
max virtual memory	1.827736E7
max residence set size	221008.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) DependencyGraphProof [UPPER BOUND(ID), 0 ms] (2) CpxTRS (3) NarrowingOnBasicTermsTerminatesProof [FINISHED, 0 ms] (4) 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: h(c(x, y), c(s(z), z), t(w)) -> h(z, c(y, x), t(t(c(x, c(y, t(w)))))) h(x, c(y, z), t(w)) -> h(c(s(y), x), z, t(c(t(w), w))) h(c(s(x), c(s(0), y)), z, t(x)) -> h(y, c(s(0), c(x, z)), t(t(c(x, s(x))))) t(t(x)) -> t(c(t(x), x)) t(x) -> x t(x) -> c(0, c(0, c(0, c(0, c(0, x))))) S is empty. Rewrite Strategy: FULL ---------------------------------------- (1) DependencyGraphProof (UPPER BOUND(ID)) The following rules are not reachable from basic terms in the dependency graph and can be removed: h(c(x, y), c(s(z), z), t(w)) -> h(z, c(y, x), t(t(c(x, c(y, t(w)))))) h(x, c(y, z), t(w)) -> h(c(s(y), x), z, t(c(t(w), w))) h(c(s(x), c(s(0), y)), z, t(x)) -> h(y, c(s(0), c(x, z)), t(t(c(x, s(x))))) t(t(x)) -> t(c(t(x), x)) ---------------------------------------- (2) 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: t(x) -> x t(x) -> c(0, c(0, c(0, c(0, c(0, x))))) S is empty. Rewrite Strategy: FULL ---------------------------------------- (3) 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: t(x0) ->^* c(0, c(0, c(0, c(0, c(0, x0))))) ---------------------------------------- (4) BOUNDS(1, 1) popout

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

job log

popout

actions

all output return to Runtime Complexity: TRS