details

property	value
status	complete
benchmark	gen-17.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n055.star.cs.uiowa.edu
space	Secret_06_TRS

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.52654910088 seconds
cpu usage	3.402021334
max memory	2.07118336E8

stage attributes

key	value
output-size	1978
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: f(c(c(a, y, a), b(x, z), a)) -> b(y, f(c(f(a), z, z))) f(b(b(x, f(y)), z)) -> c(z, x, f(b(b(f(a), y), y))) c(b(a, a), b(y, z), x) -> b(a, b(z, z)) 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: f(c(c(a, y, a), b(x, z), a)) -> b(y, f(c(f(a), z, z))) f(b(b(x, f(y)), z)) -> c(z, x, f(b(b(f(a), y), y))) ---------------------------------------- (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: c(b(a, a), b(y, z), x) -> b(a, b(z, z)) 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: c(b(a, a), b(x0, x1), x2) ->^* b(a, b(x1, x1)) ---------------------------------------- (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