Runtime_Complexity_Full_Rewriting 2019-04-01 06.11 pair #433307970

details

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

run statistics

property	value
solver	AProVE
configuration	complexity
runtime (wallclock)	1.56579 seconds
cpu usage	3.19277
user time	3.05506
system time	0.137712
max virtual memory	1.8273204E7
max residence set size	210580.0

stage attributes

key	value
starexec-result	WORST_CASE(NON_POLY, ?)

output

3.05/1.52	WORST_CASE(NON_POLY, ?)
3.05/1.53	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
3.05/1.53	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
3.05/1.53	
3.05/1.53	
3.05/1.53	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
3.05/1.53	
3.05/1.53	(0) Name of obligation not specified
3.05/1.53	(1) ExtraVarProof [FINISHED, 0 ms]
3.05/1.53	(2) BOUNDS(INF, INF)
3.05/1.53	
3.05/1.53	
3.05/1.53	----------------------------------------
3.05/1.53	
3.05/1.53	(0)
3.05/1.53	Obligation:
3.05/1.53	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
3.05/1.53	
3.05/1.53	
3.05/1.53	The TRS R consists of the following rules:
3.05/1.53	
3.05/1.53	   U71(tt) -> s(length(L))
3.05/1.53	   U91(tt) -> cons(N)
3.05/1.53	   and(tt) -> X
3.05/1.53	   zeros -> cons(0)
3.05/1.53	   U11(tt) -> U12(isNatList)
3.05/1.53	   U12(tt) -> tt
3.05/1.53	   U21(tt) -> U22(isNat)
3.05/1.53	   U22(tt) -> tt
3.05/1.53	   U31(tt) -> U32(isNatList)
3.05/1.53	   U32(tt) -> tt
3.05/1.53	   U41(tt) -> U42(isNat)
3.05/1.53	   U42(tt) -> U43(isNatIList)
3.05/1.53	   U43(tt) -> tt
3.05/1.53	   U51(tt) -> U52(isNat)
3.05/1.53	   U52(tt) -> U53(isNatList)
3.05/1.53	   U53(tt) -> tt
3.05/1.53	   U61(tt) -> U62(isNat)
3.05/1.53	   U62(tt) -> U63(isNatIList)
3.05/1.53	   U63(tt) -> tt
3.05/1.53	   U81(tt) -> nil
3.05/1.53	   isNat -> tt
3.05/1.53	   isNat -> U11(isNatIListKind)
3.05/1.53	   isNat -> U21(isNatKind)
3.05/1.53	   isNatIList -> U31(isNatIListKind)
3.05/1.53	   isNatIList -> tt
3.05/1.53	   isNatIList -> U41(and(isNatKind))
3.05/1.53	   isNatIListKind -> tt
3.05/1.53	   isNatIListKind -> and(isNatKind)
3.05/1.53	   isNatKind -> tt
3.05/1.53	   isNatKind -> isNatIListKind
3.05/1.53	   isNatKind -> isNatKind
3.05/1.53	   isNatList -> tt
3.05/1.53	   isNatList -> U51(and(isNatKind))
3.05/1.53	   isNatList -> U61(and(isNatKind))
3.05/1.53	   length(nil) -> 0
3.05/1.53	   length(cons(N)) -> U71(and(and(isNatList)))
3.05/1.53	   take(0, IL) -> U81(and(isNatIList))
3.05/1.53	   take(s(M), cons(N)) -> U91(and(and(isNatIList)))
3.05/1.53	
3.05/1.53	
3.05/1.53	----------------------------------------
3.05/1.53	
3.05/1.53	(1) ExtraVarProof (FINISHED)
3.05/1.53	unbounded runtime complexity due to extra variable on rhs
3.05/1.53	----------------------------------------
3.05/1.53	
3.05/1.53	(2)
3.05/1.53	BOUNDS(INF, INF)
3.05/1.56	EOF

popout

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

job log

popout

actions all output return to Runtime_Complexity_Full_Rewriting 2019-04-01 06.11