details

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

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	2.83981 seconds
cpu usage	7.50384
user time	7.13889
system time	0.364949
max virtual memory	1.8411516E7
max residence set size	1053940.0

stage attributes

key	value
starexec-result	WORST_CASE(Omega(n^1), O(n^1))

output

WORST_CASE(Omega(n^1), O(n^1)) proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(n^1, n^1). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 45 ms] (4) CpxRelTRS (5) RelTrsToTrsProof [UPPER BOUND(ID), 0 ms] (6) CpxTRS (7) CpxTrsMatchBoundsProof [FINISHED, 259 ms] (8) BOUNDS(1, n^1) (9) RelTrsToDecreasingLoopProblemProof [LOWER BOUND(ID), 0 ms] (10) TRS for Loop Detection (11) DecreasingLoopProof [LOWER BOUND(ID), 4 ms] (12) BEST (13) proven lower bound (14) LowerBoundPropagationProof [FINISHED, 0 ms] (15) BOUNDS(n^1, INF) (16) TRS for Loop Detection ---------------------------------------- (0) Obligation: The Derivational Complexity (innermost) of the given DCpxTrs could be proven to be BOUNDS(n^1, n^1). The TRS R consists of the following rules: 0(0(1(x1))) -> 0(1(2(0(x1)))) 0(0(1(x1))) -> 0(3(1(0(x1)))) 0(0(1(x1))) -> 1(0(4(0(x1)))) 0(0(1(x1))) -> 0(1(3(0(2(x1))))) 0(0(1(x1))) -> 0(1(3(0(4(x1))))) 0(0(1(x1))) -> 0(2(0(1(2(x1))))) 0(0(1(x1))) -> 0(3(0(1(2(x1))))) 0(0(1(x1))) -> 0(3(0(3(1(x1))))) 0(0(1(x1))) -> 0(4(0(4(1(x1))))) 0(0(1(x1))) -> 1(2(0(2(0(x1))))) 0(0(1(x1))) -> 1(2(2(0(0(x1))))) 0(0(1(x1))) -> 0(0(2(2(1(2(x1)))))) 0(0(1(x1))) -> 0(1(2(4(2(0(x1)))))) 0(0(1(x1))) -> 1(2(0(3(0(4(x1)))))) 0(1(1(x1))) -> 0(2(1(1(x1)))) 0(1(1(x1))) -> 0(3(1(1(x1)))) 0(1(1(x1))) -> 1(1(3(0(4(x1))))) 0(1(1(x1))) -> 1(2(0(2(1(x1))))) 0(1(1(x1))) -> 1(0(3(1(2(4(x1)))))) 0(1(1(x1))) -> 1(0(4(2(1(2(x1)))))) 0(1(1(x1))) -> 1(1(2(4(3(0(x1)))))) 0(1(1(x1))) -> 1(2(1(0(4(4(x1)))))) 0(1(1(x1))) -> 1(2(2(1(3(0(x1)))))) 0(5(1(x1))) -> 0(3(1(5(x1)))) 0(5(1(x1))) -> 0(4(5(1(x1)))) 0(5(1(x1))) -> 0(2(3(1(5(x1))))) 0(5(1(x1))) -> 0(3(1(5(2(x1))))) 0(5(1(x1))) -> 0(3(1(2(5(2(x1)))))) 5(0(1(x1))) -> 5(1(2(4(0(x1))))) 5(0(1(x1))) -> 5(0(2(1(2(4(x1)))))) 5(0(1(x1))) -> 5(1(2(3(0(4(x1)))))) 0(0(1(5(x1)))) -> 0(4(1(0(5(x1))))) 0(0(2(1(x1)))) -> 2(0(3(0(2(1(x1)))))) 0(0(2(1(x1)))) -> 2(3(0(2(0(1(x1)))))) 0(1(0(1(x1)))) -> 1(0(2(0(1(x1))))) 0(1(1(1(x1)))) -> 1(1(3(1(0(x1))))) 5(0(1(1(x1)))) -> 1(5(1(2(0(x1))))) 5(3(0(1(x1)))) -> 5(1(2(3(0(x1))))) 5(3(1(5(x1)))) -> 5(3(1(2(5(x1))))) 5(3(2(1(x1)))) -> 1(2(3(5(2(x1))))) 5(4(0(1(x1)))) -> 1(2(5(0(4(x1))))) 0(0(5(1(5(x1))))) -> 1(2(5(5(0(0(x1)))))) 0(5(3(0(1(x1))))) -> 1(0(5(3(0(4(x1)))))) 0(5(3(4(1(x1))))) -> 1(0(3(5(4(5(x1)))))) 0(5(4(0(1(x1))))) -> 0(1(3(0(4(5(x1)))))) 5(4(2(1(1(x1))))) -> 5(4(1(2(1(2(x1)))))) S is empty. Rewrite Strategy: INNERMOST ---------------------------------------- (1) DerivationalComplexityToRuntimeComplexityProof (BOTH BOUNDS(ID, ID)) The following rules have been added to S to convert the given derivational complexity problem to a runtime complexity problem: encArg(1(x_1)) -> 1(encArg(x_1)) encArg(2(x_1)) -> 2(encArg(x_1)) encArg(3(x_1)) -> 3(encArg(x_1)) encArg(4(x_1)) -> 4(encArg(x_1)) encArg(cons_0(x_1)) -> 0(encArg(x_1)) encArg(cons_5(x_1)) -> 5(encArg(x_1)) encode_0(x_1) -> 0(encArg(x_1)) encode_1(x_1) -> 1(encArg(x_1)) encode_2(x_1) -> 2(encArg(x_1)) encode_3(x_1) -> 3(encArg(x_1)) encode_4(x_1) -> 4(encArg(x_1)) popout

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

job log

popout

actions

all output return to Derivational Complexity: TRS Innermost