2.92/1.46	WORST_CASE(NON_POLY, ?)
2.92/1.47	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
2.92/1.47	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.92/1.47	
2.92/1.47	
2.92/1.47	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.92/1.47	
2.92/1.47	(0) Name of obligation not specified
2.92/1.47	(1) ExtraVarProof [FINISHED, 0 ms]
2.92/1.47	(2) BOUNDS(INF, INF)
2.92/1.47	
2.92/1.47	
2.92/1.47	----------------------------------------
2.92/1.47	
2.92/1.47	(0)
2.92/1.47	Obligation:
2.92/1.47	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.92/1.47	
2.92/1.47	
2.92/1.47	The TRS R consists of the following rules:
2.92/1.47	
2.92/1.47	   U31(tt) -> N
2.92/1.47	   U41(tt) -> s(plus(N, M))
2.92/1.47	   and(tt) -> X
2.92/1.47	   U11(tt) -> U12(isNat)
2.92/1.47	   U12(tt) -> U13(isNat)
2.92/1.47	   U13(tt) -> tt
2.92/1.47	   U21(tt) -> U22(isNat)
2.92/1.47	   U22(tt) -> tt
2.92/1.47	   isNat -> tt
2.92/1.47	   isNat -> U11(and(isNatKind))
2.92/1.47	   isNat -> U21(isNatKind)
2.92/1.47	   isNatKind -> tt
2.92/1.47	   isNatKind -> and(isNatKind)
2.92/1.47	   isNatKind -> isNatKind
2.92/1.47	   plus(N, 0) -> U31(and(isNat))
2.92/1.47	   plus(N, s(M)) -> U41(and(and(isNat)))
2.92/1.47	
2.92/1.47	
2.92/1.47	----------------------------------------
2.92/1.47	
2.92/1.47	(1) ExtraVarProof (FINISHED)
2.92/1.47	unbounded runtime complexity due to extra variable on rhs
2.92/1.47	----------------------------------------
2.92/1.47	
2.92/1.47	(2)
2.92/1.47	BOUNDS(INF, INF)
3.11/1.51	EOF