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	n053.star.cs.uiowa.edu
space	AProVE_07

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.4956381321 seconds
cpu usage	3.240586395
max memory	2.06020608E8

stage attributes

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

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(?, O(1)) proof of /export/starexec/sandbox/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(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 Runti Compl Full Rewri 10127