details

property	value
status	complete
benchmark	LengthOfFiniteLists_complete-noand_L.xml
ran by	Akihisa Yamada
cpu timeout	1200 seconds
wallclock timeout	300 seconds
memory limit	137438953472 bytes
execution host	n048.star.cs.uiowa.edu
space	Transformed_CSR_04

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.55226302147 seconds
cpu usage	3.218238887
max memory	1.77610752E8

stage attributes

key	value
output-size	2242
starexec-result	WORST_CASE(NON_POLY, ?)

output

/export/starexec/sandbox/solver/bin/starexec_run_complexity /export/starexec/sandbox/benchmark/theBenchmark.xml /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- WORST_CASE(NON_POLY, ?) proof of /export/starexec/sandbox/benchmark/theBenchmark.xml # AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty The Runtime Complexity of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF). (0) Name of obligation not specified (1) ExtraVarProof [FINISHED, 0 ms] (2) BOUNDS(INF, INF) ---------------------------------------- (0) Obligation: The Runtime Complexity of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF). The TRS R consists of the following rules: U94(tt) -> s(length(L)) zeros -> cons(0) U11(tt) -> U12(isNatIListKind) U12(tt) -> U13(isNatList) U13(tt) -> tt U21(tt) -> U22(isNatKind) U22(tt) -> U23(isNat) U23(tt) -> tt U31(tt) -> U32(isNatIListKind) U32(tt) -> U33(isNatList) U33(tt) -> tt U41(tt) -> U42(isNatKind) U42(tt) -> U43(isNatIListKind) U43(tt) -> U44(isNatIListKind) U44(tt) -> U45(isNat) U45(tt) -> U46(isNatIList) U46(tt) -> tt U51(tt) -> U52(isNatIListKind) U52(tt) -> tt U61(tt) -> tt U71(tt) -> tt U81(tt) -> U82(isNatKind) U82(tt) -> U83(isNatIListKind) U83(tt) -> U84(isNatIListKind) U84(tt) -> U85(isNat) U85(tt) -> U86(isNatList) U86(tt) -> tt U91(tt) -> U92(isNatIListKind) U92(tt) -> U93(isNat) U93(tt) -> U94(isNatKind) isNat -> tt isNat -> U11(isNatIListKind) isNat -> U21(isNatKind) isNatIList -> U31(isNatIListKind) isNatIList -> tt isNatIList -> U41(isNatKind) isNatIListKind -> tt isNatIListKind -> U51(isNatKind) isNatKind -> tt isNatKind -> U61(isNatIListKind) isNatKind -> U71(isNatKind) isNatList -> tt isNatList -> U81(isNatKind) length(nil) -> 0 length(cons(N)) -> U91(isNatList) ---------------------------------------- (1) ExtraVarProof (FINISHED) unbounded runtime complexity due to extra variable on rhs ---------------------------------------- (2) BOUNDS(INF, INF) popout

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

job log

popout

actions

all output return to Runti Compl Full Rewri 10127