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