details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.63123703003 seconds
cpu usage	3.615737236
max memory	1.9697664E8

stage attributes

key	value
output-size	1310
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) 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: c(c(c(y))) -> c(c(a(y, 0))) c(a(a(0, x), y)) -> a(c(c(c(0))), y) c(y) -> y 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: c(a(a(0, x0), x1)) ->^* a(0, x1) c(a(a(0, x0), x1)) ->^* a(a(0, 0), x1) ---------------------------------------- (2) 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