2.97/1.58	WORST_CASE(NON_POLY, ?)
2.97/1.59	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
2.97/1.59	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.97/1.59	
2.97/1.59	
2.97/1.59	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.97/1.59	
2.97/1.59	(0) Name of obligation not specified
2.97/1.59	(1) ExtraVarProof [FINISHED, 0 ms]
2.97/1.59	(2) BOUNDS(INF, INF)
2.97/1.59	
2.97/1.59	
2.97/1.59	----------------------------------------
2.97/1.59	
2.97/1.59	(0)
2.97/1.59	Obligation:
2.97/1.59	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.97/1.59	
2.97/1.59	
2.97/1.59	The TRS R consists of the following rules:
2.97/1.59	
2.97/1.59	   U104(tt) -> plus(x(N, M), N)
2.97/1.59	   U72(tt) -> N
2.97/1.59	   U84(tt) -> s(plus(N, M))
2.97/1.59	   U101(tt) -> U102(isNatKind)
2.97/1.59	   U102(tt) -> U103(isNat)
2.97/1.59	   U103(tt) -> U104(isNatKind)
2.97/1.59	   U11(tt) -> U12(isNatKind)
2.97/1.59	   U12(tt) -> U13(isNatKind)
2.97/1.59	   U13(tt) -> U14(isNatKind)
2.97/1.59	   U14(tt) -> U15(isNat)
2.97/1.59	   U15(tt) -> U16(isNat)
2.97/1.59	   U16(tt) -> tt
2.97/1.59	   U21(tt) -> U22(isNatKind)
2.97/1.59	   U22(tt) -> U23(isNat)
2.97/1.59	   U23(tt) -> tt
2.97/1.59	   U31(tt) -> U32(isNatKind)
2.97/1.59	   U32(tt) -> U33(isNatKind)
2.97/1.59	   U33(tt) -> U34(isNatKind)
2.97/1.59	   U34(tt) -> U35(isNat)
2.97/1.59	   U35(tt) -> U36(isNat)
2.97/1.59	   U36(tt) -> tt
2.97/1.59	   U41(tt) -> U42(isNatKind)
2.97/1.59	   U42(tt) -> tt
2.97/1.59	   U51(tt) -> tt
2.97/1.59	   U61(tt) -> U62(isNatKind)
2.97/1.59	   U62(tt) -> tt
2.97/1.59	   U71(tt) -> U72(isNatKind)
2.97/1.59	   U81(tt) -> U82(isNatKind)
2.97/1.59	   U82(tt) -> U83(isNat)
2.97/1.59	   U83(tt) -> U84(isNatKind)
2.97/1.59	   U91(tt) -> U92(isNatKind)
2.97/1.59	   U92(tt) -> 0
2.97/1.59	   isNat -> tt
2.97/1.59	   isNat -> U11(isNatKind)
2.97/1.59	   isNat -> U21(isNatKind)
2.97/1.59	   isNat -> U31(isNatKind)
2.97/1.59	   isNatKind -> tt
2.97/1.59	   isNatKind -> U41(isNatKind)
2.97/1.59	   isNatKind -> U51(isNatKind)
2.97/1.59	   isNatKind -> U61(isNatKind)
2.97/1.59	   plus(N, 0) -> U71(isNat)
2.97/1.59	   plus(N, s(M)) -> U81(isNat)
2.97/1.59	   x(N, 0) -> U91(isNat)
2.97/1.59	   x(N, s(M)) -> U101(isNat)
2.97/1.59	
2.97/1.59	
2.97/1.59	----------------------------------------
2.97/1.59	
2.97/1.59	(1) ExtraVarProof (FINISHED)
2.97/1.59	unbounded runtime complexity due to extra variable on rhs
2.97/1.59	----------------------------------------
2.97/1.59	
2.97/1.59	(2)
2.97/1.59	BOUNDS(INF, INF)
3.18/2.41	EOF