2.97/1.50	WORST_CASE(NON_POLY, ?)
2.97/1.50	proof of /export/starexec/sandbox/benchmark/theBenchmark.xml
2.97/1.50	# AProVE Commit ID: 48fb2092695e11cc9f56e44b17a92a5f88ffb256 marcel 20180622 unpublished dirty
2.97/1.50	
2.97/1.50	
2.97/1.50	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.97/1.50	
2.97/1.50	(0) Name of obligation not specified
2.97/1.50	(1) ExtraVarProof [FINISHED, 0 ms]
2.97/1.50	(2) BOUNDS(INF, INF)
2.97/1.50	
2.97/1.50	
2.97/1.50	----------------------------------------
2.97/1.50	
2.97/1.50	(0)
2.97/1.50	Obligation:
2.97/1.50	The Runtime Complexity  of the given Name of obligation not specified could be proven to be BOUNDS(INF, INF).
2.97/1.50	
2.97/1.50	
2.97/1.50	The TRS R consists of the following rules:
2.97/1.50	
2.97/1.50	   and(tt) -> X
2.97/1.50	   __(__(X, Y), Z) -> __(X, __(Y, Z))
2.97/1.50	   __(X, nil) -> X
2.97/1.50	   __(nil, X) -> X
2.97/1.50	   isList -> isNeList
2.97/1.50	   isList -> tt
2.97/1.50	   isList -> and(isList)
2.97/1.50	   isNeList -> isQid
2.97/1.50	   isNeList -> and(isList)
2.97/1.50	   isNeList -> and(isNeList)
2.97/1.50	   isNePal -> isQid
2.97/1.50	   isNePal -> and(isQid)
2.97/1.50	   isPal -> isNePal
2.97/1.50	   isPal -> tt
2.97/1.50	   isQid -> tt
2.97/1.50	
2.97/1.50	
2.97/1.50	----------------------------------------
2.97/1.50	
2.97/1.50	(1) ExtraVarProof (FINISHED)
2.97/1.50	unbounded runtime complexity due to extra variable on rhs
2.97/1.50	----------------------------------------
2.97/1.50	
2.97/1.50	(2)
2.97/1.50	BOUNDS(INF, INF)
3.05/1.53	EOF