details

property	value
status	complete
benchmark	PALINDROME_nokinds-noand_FR.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	Transformed_CSR_04

run statistics

property	value
solver	AProVE
configuration	rcdcRelativeAlsoLower
runtime (wallclock)	296.617 seconds
cpu usage	1166.21
user time	1155.44
system time	10.771
max virtual memory	1.981312E7
max residence set size	1.493908E7

stage attributes

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

output

WORST_CASE(Omega(n^1), ?) proof of /export/starexec/sandbox2/benchmark/theBenchmark.xml # AProVE Commit ID: 794c25de1cacf0d048858bcd21c9a779e1221865 marcel 20200619 unpublished dirty The Derivational Complexity (full) of the given DCpxTrs could be proven to be BOUNDS(n^1, INF). (0) DCpxTrs (1) DerivationalComplexityToRuntimeComplexityProof [BOTH BOUNDS(ID, ID), 0 ms] (2) CpxRelTRS (3) SInnermostTerminationProof [BOTH CONCRETE BOUNDS(ID, ID), 657 ms] (4) CpxRelTRS (5) RenamingProof [BOTH BOUNDS(ID, ID), 0 ms] (6) CpxRelTRS (7) TypeInferenceProof [BOTH BOUNDS(ID, ID), 0 ms] (8) typed CpxTrs (9) OrderProof [LOWER BOUND(ID), 6 ms] (10) typed CpxTrs (11) RewriteLemmaProof [LOWER BOUND(ID), 679 ms] (12) BEST (13) proven lower bound (14) LowerBoundPropagationProof [FINISHED, 0 ms] (15) BOUNDS(n^1, INF) (16) typed CpxTrs ---------------------------------------- (0) Obligation: The Derivational Complexity (full) of the given DCpxTrs could be proven to be BOUNDS(n^1, INF). The TRS R consists of the following rules: __(__(X, Y), Z) -> __(X, __(Y, Z)) __(X, nil) -> X __(nil, X) -> X U11(tt) -> tt U21(tt, V2) -> U22(isList(activate(V2))) U22(tt) -> tt U31(tt) -> tt U41(tt, V2) -> U42(isNeList(activate(V2))) U42(tt) -> tt U51(tt, V2) -> U52(isList(activate(V2))) U52(tt) -> tt U61(tt) -> tt U71(tt, P) -> U72(isPal(activate(P))) U72(tt) -> tt U81(tt) -> tt isList(V) -> U11(isNeList(activate(V))) isList(n__nil) -> tt isList(n____(V1, V2)) -> U21(isList(activate(V1)), activate(V2)) isNeList(V) -> U31(isQid(activate(V))) isNeList(n____(V1, V2)) -> U41(isList(activate(V1)), activate(V2)) isNeList(n____(V1, V2)) -> U51(isNeList(activate(V1)), activate(V2)) isNePal(V) -> U61(isQid(activate(V))) isNePal(n____(I, n____(P, I))) -> U71(isQid(activate(I)), activate(P)) isPal(V) -> U81(isNePal(activate(V))) isPal(n__nil) -> tt isQid(n__a) -> tt isQid(n__e) -> tt isQid(n__i) -> tt isQid(n__o) -> tt isQid(n__u) -> tt nil -> n__nil __(X1, X2) -> n____(X1, X2) a -> n__a e -> n__e i -> n__i o -> n__o u -> n__u activate(n__nil) -> nil activate(n____(X1, X2)) -> __(activate(X1), activate(X2)) activate(n__a) -> a activate(n__e) -> e activate(n__i) -> i activate(n__o) -> o activate(n__u) -> u activate(X) -> X S is empty. Rewrite Strategy: FULL ---------------------------------------- (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(tt) -> tt encArg(n__nil) -> n__nil encArg(n____(x_1, x_2)) -> n____(encArg(x_1), encArg(x_2)) encArg(n__a) -> n__a encArg(n__e) -> n__e encArg(n__i) -> n__i encArg(n__o) -> n__o encArg(n__u) -> n__u encArg(cons___(x_1, x_2)) -> __(encArg(x_1), encArg(x_2)) encArg(cons_U11(x_1)) -> U11(encArg(x_1)) encArg(cons_U21(x_1, x_2)) -> U21(encArg(x_1), encArg(x_2)) encArg(cons_U22(x_1)) -> U22(encArg(x_1)) popout

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

job log

popout

actions

all output return to Derivational Complexity: TRS